{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s347881762", "group_id": "codeNet:p02572", "input_text": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defparameter *mod* (+ (expt 10 9) 7))\n\n(defun calc-squared-sum (xs)\n  (reduce #'+\n          (mapcar (lambda (x)\n                    (* x x))\n                  xs)))\n\n(defun sum (xs)\n  (reduce #'+ xs))\n\n(defun solve (n xs)\n  (mod (floor (- (* (sum xs)\n                    (sum xs))\n                 (calc-squared-sum xs))\n              2)\n       *mod*))\n\n(defun main ()\n  (let ((n (read))\n        (xs (read-numbers-to-list)))\n    (format t \"~a~%\" (solve n xs))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1599551743, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s347881762.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s347881762", "user_id": "u425762225"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defparameter *mod* (+ (expt 10 9) 7))\n\n(defun calc-squared-sum (xs)\n  (reduce #'+\n          (mapcar (lambda (x)\n                    (* x x))\n                  xs)))\n\n(defun sum (xs)\n  (reduce #'+ xs))\n\n(defun solve (n xs)\n  (mod (floor (- (* (sum xs)\n                    (sum xs))\n                 (calc-squared-sum xs))\n              2)\n       *mod*))\n\n(defun main ()\n  (let ((n (read))\n        (xs (read-numbers-to-list)))\n    (format t \"~a~%\" (solve n xs))))\n\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1680, "cpu_time_ms": 228, "memory_kb": 69844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s247509446", "group_id": "codeNet:p02572", "input_text": "(defparameter den (+ (expt 10 9) 7))\n\n(defun solve (lst)\n  (/ (- (expt (apply #'+ lst) 2)\n        (apply #'+ (mapcar #'* lst lst)))\n     2))\n\n(princ (mod (solve (loop repeat (read) collect (read)))\n            den))", "language": "Lisp", "metadata": {"date": 1598787706, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s247509446.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s247509446", "user_id": "u289580381"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "(defparameter den (+ (expt 10 9) 7))\n\n(defun solve (lst)\n  (/ (- (expt (apply #'+ lst) 2)\n        (apply #'+ (mapcar #'* lst lst)))\n     2))\n\n(princ (mod (solve (loop repeat (read) collect (read)))\n            den))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 215, "cpu_time_ms": 270, "memory_kb": 81724}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s715634493", "group_id": "codeNet:p02572", "input_text": "(defun f (list)\n  (if (rest list)\n      (multiple-value-bind (result sum)\n          (f (rest list))\n        (let ((val (first list)))\n          (values (mod (+ result (* val sum)) 1000000007)\n                  (let ((sum (+ val sum)))\n                    (when (>= sum 1000000007)\n                      (decf sum 1000000007))\n                    sum))))\n      (values 0 (first list))))\n\n(format t \"~A~%\" (f (loop repeat (read) collect (read)))\n        #+nil(loop with a = (loop repeat (read) collect (read))\n              with result = 0\n              for i2 on a\n              for i = (first i2)\n              while (cdr i2)\n              do (incf result (* i (loop with result = 0\n                                         for j in (rest i2)\n                                         do (incf result j)\n                                         finally (return result))))\n              do (when (>= result 1000000007)\n                   (setf result (mod result 1000000007)))\n              finally (return result)))", "language": "Lisp", "metadata": {"date": 1598732439, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s715634493.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s715634493", "user_id": "u607637432"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "(defun f (list)\n  (if (rest list)\n      (multiple-value-bind (result sum)\n          (f (rest list))\n        (let ((val (first list)))\n          (values (mod (+ result (* val sum)) 1000000007)\n                  (let ((sum (+ val sum)))\n                    (when (>= sum 1000000007)\n                      (decf sum 1000000007))\n                    sum))))\n      (values 0 (first list))))\n\n(format t \"~A~%\" (f (loop repeat (read) collect (read)))\n        #+nil(loop with a = (loop repeat (read) collect (read))\n              with result = 0\n              for i2 on a\n              for i = (first i2)\n              while (cdr i2)\n              do (incf result (* i (loop with result = 0\n                                         for j in (rest i2)\n                                         do (incf result j)\n                                         finally (return result))))\n              do (when (>= result 1000000007)\n                   (setf result (mod result 1000000007)))\n              finally (return result)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1014, "cpu_time_ms": 275, "memory_kb": 81140}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s551434482", "group_id": "codeNet:p02572", "input_text": "(let* ((n (read))\n    (a (make-array n :initial-element 1))\n    (ans 0))\n    \n    (loop for i below n do\n        (setf (aref a i) (rem (read) 1000000007))\n    )\n    (loop for i below (expt 2 n) do\n        (let ((flg 0)\n            (tmp 1))\n            (loop for j below n  do\n                (if (= (logand (ash i (- j)) #b1) 1)\n                ;;bitが1だった場合の処理\n                    (progn\n                        (incf flg)\n                        (if (<= flg 2)\n                            (progn\n                                (setq tmp (* tmp (aref a j)))\n                                (if (>= tmp 1000000007)\n                                    (setq tmp (rem tmp 1000000007))\n                                )\n                            )\n                            (return)\n                        )\n                    )\n                )\n            )\n            ;;i番目のパターンの処理\n            (if (= flg 2)\n                (incf ans tmp)\n            )\n        )\n    )\n    (format t \"~D~%\" (rem ans 1000000007))\n)", "language": "Lisp", "metadata": {"date": 1598731128, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s551434482.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s551434482", "user_id": "u136500538"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "(let* ((n (read))\n    (a (make-array n :initial-element 1))\n    (ans 0))\n    \n    (loop for i below n do\n        (setf (aref a i) (rem (read) 1000000007))\n    )\n    (loop for i below (expt 2 n) do\n        (let ((flg 0)\n            (tmp 1))\n            (loop for j below n  do\n                (if (= (logand (ash i (- j)) #b1) 1)\n                ;;bitが1だった場合の処理\n                    (progn\n                        (incf flg)\n                        (if (<= flg 2)\n                            (progn\n                                (setq tmp (* tmp (aref a j)))\n                                (if (>= tmp 1000000007)\n                                    (setq tmp (rem tmp 1000000007))\n                                )\n                            )\n                            (return)\n                        )\n                    )\n                )\n            )\n            ;;i番目のパターンの処理\n            (if (= flg 2)\n                (incf ans tmp)\n            )\n        )\n    )\n    (format t \"~D~%\" (rem ans 1000000007))\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1059, "cpu_time_ms": 2208, "memory_kb": 77764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s351112579", "group_id": "codeNet:p02572", "input_text": "(let* ((n (read))\n    (a (make-array n :initial-element 1))\n    (ans 0))\n    \n    (loop for i below n do\n        (setf (aref a i) (rem (read) 1000000007))\n    )\n    (loop for i below (expt 2 n) do\n        (let ((flg 0)\n            (tmp 1))\n            (loop for j below n unless (= flg 3) do\n                (if (= (logand (ash i (- j)) #b1) 1)\n                ;;bitが1だった場合の処理\n                    (progn\n                        (incf flg)\n                        (if (<= flg 2)\n                            (progn\n                                (setq tmp (* tmp (aref a j)))\n                                (if (>= tmp 1000000007)\n                                    (setq tmp (rem tmp 1000000007))\n                                )\n                            )\n                        )\n                    )\n                )\n            )\n            ;;i番目のパターンの処理\n            (if (= flg 2)\n                (incf ans tmp)\n            )\n        )\n    )\n    (format t \"~D~%\" (rem ans 1000000007))\n)", "language": "Lisp", "metadata": {"date": 1598730941, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s351112579.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s351112579", "user_id": "u136500538"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "(let* ((n (read))\n    (a (make-array n :initial-element 1))\n    (ans 0))\n    \n    (loop for i below n do\n        (setf (aref a i) (rem (read) 1000000007))\n    )\n    (loop for i below (expt 2 n) do\n        (let ((flg 0)\n            (tmp 1))\n            (loop for j below n unless (= flg 3) do\n                (if (= (logand (ash i (- j)) #b1) 1)\n                ;;bitが1だった場合の処理\n                    (progn\n                        (incf flg)\n                        (if (<= flg 2)\n                            (progn\n                                (setq tmp (* tmp (aref a j)))\n                                (if (>= tmp 1000000007)\n                                    (setq tmp (rem tmp 1000000007))\n                                )\n                            )\n                        )\n                    )\n                )\n            )\n            ;;i番目のパターンの処理\n            (if (= flg 2)\n                (incf ans tmp)\n            )\n        )\n    )\n    (format t \"~D~%\" (rem ans 1000000007))\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1038, "cpu_time_ms": 2208, "memory_kb": 77784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s290026533", "group_id": "codeNet:p02572", "input_text": "(format t \"~A~%\"\n        (loop with a = (loop repeat (read) collect (read))\n              with result = 0\n              for i2 on a\n              for i = (first i2)\n              while (cdr i2)\n              do (incf result (* i (loop with result = 0\n                                         for j in (rest i2)\n                                         do (incf result j)\n                                            (when (>= result 1000000007)\n                                              (decf result 1000000007))\n                                         finally (return result))))\n              do (when (>= result 1000000007)\n                   (setf result (mod result 1000000007)))\n              finally (return result)))", "language": "Lisp", "metadata": {"date": 1598730640, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s290026533.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s290026533", "user_id": "u607637432"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "(format t \"~A~%\"\n        (loop with a = (loop repeat (read) collect (read))\n              with result = 0\n              for i2 on a\n              for i = (first i2)\n              while (cdr i2)\n              do (incf result (* i (loop with result = 0\n                                         for j in (rest i2)\n                                         do (incf result j)\n                                            (when (>= result 1000000007)\n                                              (decf result 1000000007))\n                                         finally (return result))))\n              do (when (>= result 1000000007)\n                   (setf result (mod result 1000000007)))\n              finally (return result)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 727, "cpu_time_ms": 2208, "memory_kb": 79208}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s518676190", "group_id": "codeNet:p02572", "input_text": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defparameter *mod* (+ (expt 10 9) 7))\n\n(defun solve (n xs &optional (ans 0))\n  (let ((xs-cum (rest (make-cumlative-sum xs))))\n    (loop repeat (1- n)\n       do (progn (setf ans (mod (+ ans\n                                   (* (first xs-cum)\n                                      (second xs)))\n                                *mod*))\n                 (pop xs-cum)\n                 (pop xs)))\n    ans))\n\n\n(defun main ()\n  (let ((n (read))\n        (xs (read-numbers-to-list)))\n    (format t \"~a~%\" (solve n xs))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1598730200, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s518676190.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s518676190", "user_id": "u425762225"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defparameter *mod* (+ (expt 10 9) 7))\n\n(defun solve (n xs &optional (ans 0))\n  (let ((xs-cum (rest (make-cumlative-sum xs))))\n    (loop repeat (1- n)\n       do (progn (setf ans (mod (+ ans\n                                   (* (first xs-cum)\n                                      (second xs)))\n                                *mod*))\n                 (pop xs-cum)\n                 (pop xs)))\n    ans))\n\n\n(defun main ()\n  (let ((n (read))\n        (xs (read-numbers-to-list)))\n    (format t \"~a~%\" (solve n xs))))\n\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1730, "cpu_time_ms": 253, "memory_kb": 84116}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s559766115", "group_id": "codeNet:p02572", "input_text": "(format t \"~A~%\"\n        (loop with a = (loop repeat (read) collect (read))\n              with result = 0\n              for i2 on a\n              for i = (first i2)\n              while (cdr i2)\n              do (incf result (* i (loop for j2 on (rest i2)\n                                         for j = (first j2)\n                                         sum j)))\n              do (when (>= result 1000000007)\n                   (setf result (mod result 1000000007)))\n              finally (return result)))\n", "language": "Lisp", "metadata": {"date": 1598730166, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s559766115.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s559766115", "user_id": "u607637432"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "(format t \"~A~%\"\n        (loop with a = (loop repeat (read) collect (read))\n              with result = 0\n              for i2 on a\n              for i = (first i2)\n              while (cdr i2)\n              do (incf result (* i (loop for j2 on (rest i2)\n                                         for j = (first j2)\n                                         sum j)))\n              do (when (>= result 1000000007)\n                   (setf result (mod result 1000000007)))\n              finally (return result)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 509, "cpu_time_ms": 2208, "memory_kb": 79212}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s223350761", "group_id": "codeNet:p02572", "input_text": "(format t \"~A~%\"\n        (loop with a = (loop repeat (read) collect (read))\n              with result = 0\n              for i2 on a\n              for i = (first i2)\n              while (cdr i2)\n              do (loop for j2 on (rest i2)\n                            for j = (first j2)\n                            do (incf result (* i j))\n                               (when (>= result 1000000007)\n                                 (setf result (mod result 1000000007))))\n              finally (return result)))\n", "language": "Lisp", "metadata": {"date": 1598729985, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s223350761.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s223350761", "user_id": "u607637432"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "(format t \"~A~%\"\n        (loop with a = (loop repeat (read) collect (read))\n              with result = 0\n              for i2 on a\n              for i = (first i2)\n              while (cdr i2)\n              do (loop for j2 on (rest i2)\n                            for j = (first j2)\n                            do (incf result (* i j))\n                               (when (>= result 1000000007)\n                                 (setf result (mod result 1000000007))))\n              finally (return result)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 510, "cpu_time_ms": 2208, "memory_kb": 79156}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s537645993", "group_id": "codeNet:p02572", "input_text": "(format t \"~A~%\"\n        (loop with a = (loop repeat (read) collect (read))\n              with result = 0\n              for i2 on a\n              for i = (first i2)\n              while (cdr i2)\n              do (loop for j2 on (rest i2)\n                            for j = (first j2)\n                            do (incf result (+ result (* i j)))\n                               (when (>= result 1000000007)\n                                 (setf result (mod result 1000000007))))\n              finally (return result)))", "language": "Lisp", "metadata": {"date": 1598729764, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s537645993.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s537645993", "user_id": "u607637432"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "(format t \"~A~%\"\n        (loop with a = (loop repeat (read) collect (read))\n              with result = 0\n              for i2 on a\n              for i = (first i2)\n              while (cdr i2)\n              do (loop for j2 on (rest i2)\n                            for j = (first j2)\n                            do (incf result (+ result (* i j)))\n                               (when (>= result 1000000007)\n                                 (setf result (mod result 1000000007))))\n              finally (return result)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 520, "cpu_time_ms": 2208, "memory_kb": 79144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s319468360", "group_id": "codeNet:p02572", "input_text": "(let* ((n (read))\n    (a (make-array n :initial-element 1))\n    (ans 0))\n    \n    (loop for i below n do\n        (setf (aref a i) (rem (read) 1000000007))\n    )\n    (loop for i below (expt 2 n) do\n        (let ((flg 0)\n            (tmp 1))\n            (loop for j below n do\n                (if (= (logand (ash i (- j)) #b1) 1)\n                ;;bitが1だった場合の処理\n                    (progn\n                        (incf flg)\n                        (if (<= flg 2)\n                            (progn\n                                (setq tmp (* tmp (aref a j)))\n                                (if (>= tmp 1000000007)\n                                    (setq tmp (rem tmp 1000000007))\n                                )\n                            )\n                        )\n                    )\n                )\n            )\n            ;;i番目のパターンの処理\n            (if (= flg 2)\n                (incf ans tmp)\n            )\n        )\n    )\n    (format t \"~D~%\" (rem ans 1000000007))\n)", "language": "Lisp", "metadata": {"date": 1598729217, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s319468360.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s319468360", "user_id": "u136500538"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "(let* ((n (read))\n    (a (make-array n :initial-element 1))\n    (ans 0))\n    \n    (loop for i below n do\n        (setf (aref a i) (rem (read) 1000000007))\n    )\n    (loop for i below (expt 2 n) do\n        (let ((flg 0)\n            (tmp 1))\n            (loop for j below n do\n                (if (= (logand (ash i (- j)) #b1) 1)\n                ;;bitが1だった場合の処理\n                    (progn\n                        (incf flg)\n                        (if (<= flg 2)\n                            (progn\n                                (setq tmp (* tmp (aref a j)))\n                                (if (>= tmp 1000000007)\n                                    (setq tmp (rem tmp 1000000007))\n                                )\n                            )\n                        )\n                    )\n                )\n            )\n            ;;i番目のパターンの処理\n            (if (= flg 2)\n                (incf ans tmp)\n            )\n        )\n    )\n    (format t \"~D~%\" (rem ans 1000000007))\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1021, "cpu_time_ms": 2208, "memory_kb": 77748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s114575329", "group_id": "codeNet:p02572", "input_text": "(let* ((n (read))\n    (a (make-array n :initial-element 1))\n    (ans 0))\n    \n    (loop for i below n do\n        (setf (aref a i) (read))\n    )\n    (loop for i below (expt 2 n) do\n        (let ((flg 0)\n            (tmp 1))\n            (loop for j below n do\n                (if (= (logand (ash i (- j)) #b1) 1)\n                ;;bitが1だった場合の処理\n                    (progn\n                        (incf flg)\n                        (if (<= flg 2)\n                            (progn\n                                (setq tmp (* tmp (aref a j)))\n                                (if (>= tmp 1000000007)\n                                    (setq tmp (rem tmp 1000000007))\n                                )\n                            )\n                        )\n                    )\n                )\n            )\n            ;;i番目のパターンの処理\n            (if (= flg 2)\n                (incf ans tmp)\n            )\n            (if (>= ans 1000000007)\n                (setq ans (rem ans 1000000007))\n            )\n        )\n    )\n    (format t \"~D~%\" ans)\n)", "language": "Lisp", "metadata": {"date": 1598728831, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Lisp/s114575329.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s114575329", "user_id": "u136500538"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "(let* ((n (read))\n    (a (make-array n :initial-element 1))\n    (ans 0))\n    \n    (loop for i below n do\n        (setf (aref a i) (read))\n    )\n    (loop for i below (expt 2 n) do\n        (let ((flg 0)\n            (tmp 1))\n            (loop for j below n do\n                (if (= (logand (ash i (- j)) #b1) 1)\n                ;;bitが1だった場合の処理\n                    (progn\n                        (incf flg)\n                        (if (<= flg 2)\n                            (progn\n                                (setq tmp (* tmp (aref a j)))\n                                (if (>= tmp 1000000007)\n                                    (setq tmp (rem tmp 1000000007))\n                                )\n                            )\n                        )\n                    )\n                )\n            )\n            ;;i番目のパターンの処理\n            (if (= flg 2)\n                (incf ans tmp)\n            )\n            (if (>= ans 1000000007)\n                (setq ans (rem ans 1000000007))\n            )\n        )\n    )\n    (format t \"~D~%\" ans)\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1085, "cpu_time_ms": 2208, "memory_kb": 77808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s439727242", "group_id": "codeNet:p02574", "input_text": ";エラトステネスの篩\n(defun sieve (N)\n  (if (<= N 1) nil\n      (loop with lst = (cons 2 (loop for x from 3 to N by 2 collect x))\n            and max = (isqrt N) and p1\n            initially (setf p1 lst) \n            if (or (null (cdr p1)) (< max (car p1))) return lst\n            do (loop with p2 = p1 while (cdr p2) \n                     if (zerop (mod (cadr p2) (car p1))) do (rplacd p2 (cddr p2))\n                     do (setf p2 (cdr p2)))\n            do (setf p1 (cdr p1)))))\n\n(defun solve (N)\n  (loop for x in (sieve N)\n        with lst = (loop repeat N collect (read))\n        if (< 1 (loop for y in lst count (zerop (mod y x))))\n        return (if (= 1 (apply #'gcd lst)) \"setwise coprime\" \"not coprime\")\n        finally (return \"pairwise coprime\")))\n\n(princ (solve (read)))", "language": "Lisp", "metadata": {"date": 1599347495, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lisp/s439727242.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s439727242", "user_id": "u334552723"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": ";エラトステネスの篩\n(defun sieve (N)\n  (if (<= N 1) nil\n      (loop with lst = (cons 2 (loop for x from 3 to N by 2 collect x))\n            and max = (isqrt N) and p1\n            initially (setf p1 lst) \n            if (or (null (cdr p1)) (< max (car p1))) return lst\n            do (loop with p2 = p1 while (cdr p2) \n                     if (zerop (mod (cadr p2) (car p1))) do (rplacd p2 (cddr p2))\n                     do (setf p2 (cdr p2)))\n            do (setf p1 (cdr p1)))))\n\n(defun solve (N)\n  (loop for x in (sieve N)\n        with lst = (loop repeat N collect (read))\n        if (< 1 (loop for y in lst count (zerop (mod y x))))\n        return (if (= 1 (apply #'gcd lst)) \"setwise coprime\" \"not coprime\")\n        finally (return \"pairwise coprime\")))\n\n(princ (solve (read)))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 791, "cpu_time_ms": 2208, "memory_kb": 95960}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s861737251", "group_id": "codeNet:p02574", "input_text": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Extended Eratosthenes' sieve\n;;;\n;;; build: O(nloglogn)\n;;; query: O(log(n))\n;;; Reference:\n;;; http://www.osak.jp/diary/diary_201310.html#20131017 (Japanese)\n;;; https://cp-algorithms.com/algebra/prime-sieve-linear.html\n;;;\n\n(defpackage :cp/ext-eratosthenes\n  (:use :cl)\n  (:export #:make-minfactor-table #:factorize #:euler-phi))\n(in-package :cp/ext-eratosthenes)\n\n(declaim (ftype (function * (values (simple-array (unsigned-byte 31) (*)) &optional))\n                make-minfactor-table))\n(defun make-minfactor-table (sup)\n  \"Returns a vector of length SUP, whose (0-based) i-th value is the minimal\nprime factor of i. (Corner case: 0th value is 0 and 1st value is 1.)\"\n  (declare (optimize (speed 3) (safety 0)))\n  (check-type sup (integer 2 (#.array-total-size-limit)))\n  (let ((table (make-array sup :element-type '(unsigned-byte 31))))\n    ;; initialize\n    (dotimes (i sup)\n      (setf (aref table i) i))\n    ;; p = 2\n    (loop for even-num from 4 below sup by 2\n          do (setf (aref table even-num) 2))\n    ;; p >= 3\n    (loop for p from 3 to (+ 1 (isqrt (- sup 1))) by 2\n          when (= p (aref table p))\n          do (loop for composite from (* p p) below sup by p\n                   when (= (aref table composite) composite)\n                   do (setf (aref table composite) p)))\n    table))\n\n(declaim (inline factorize))\n(defun factorize (x minfactor-table)\n  \"Returns the associative list of prime factors of X, which is composed\nof (<prime> . <exponent>). E.g. (factorize 100 <minfactor-table>) => '((2\n. 2) (5 . 5)). The returned list is in ascending order\nw.r.t. prime. Corner case: (factorize 0 table) => NIL.\n\nMINFACTOR-TABLE := vector (MINFACTOR-TABLE[k] is the minimal prime factor of k)\"\n  (declare (fixnum x)\n           (vector minfactor-table))\n  (setq x (abs x))\n  (when (<= x 1)\n    (return-from factorize nil))\n  (assert (< x (length minfactor-table)))\n  (loop until (= x 1)\n        for prime of-type (unsigned-byte 31) = (aref minfactor-table x)\n        collect (loop for exponent of-type (unsigned-byte 31) from 0\n                      do (multiple-value-bind (quot rem) (floor x prime)\n                           (if (zerop rem)\n                               (setf x quot)\n                               (loop-finish)))\n                      finally (return (cons prime exponent)))))\n\n(defpackage :cp/read-fixnum\n  (:use :cl)\n  (:export #:read-fixnum))\n(in-package :cp/read-fixnum)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.cl-user::opt)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n;;;\n;;; GCD and LCM\n;;; Reference:\n;;; https://lemire.me/blog/2013/12/26/fastest-way-to-compute-the-greatest-common-divisor/\n;;;\n\n(defpackage :cp/fast-gcd\n  (:use :cl)\n  (:export #:fast-gcd #:fast-lcm #:%fast-gcd))\n(in-package :cp/fast-gcd)\n\n(declaim (inline %fast-gcd fast-gcd fast-lcm)\n         (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional))\n                %fast-gcd fast-gcd fast-lcm))\n(defun %fast-gcd (u v)\n  (declare ((integer 0 #.most-positive-fixnum) u v))\n  (let ((shift (let ((x (logior u v)))\n                 (- (integer-length (logand x (- x))) 1))))\n    (declare (optimize (safety 0)))\n    (setq u (ash u (- 1 (integer-length (logand u (- u))))))\n    (loop (setq v (ash v (- 1 (integer-length (logand v (- v))))))\n          (when (> u v)\n            (rotatef u v))\n          (decf v u)\n          (when (zerop v)\n            (return (the (integer 1 #.most-positive-fixnum)\n                         (ash u shift)))))))\n\n(defun fast-gcd (u v)\n  (declare (optimize (speed 3))\n           ((integer 0 #.most-positive-fixnum) u v))\n  (cond ((zerop u) v)\n        ((zerop v) u)\n        (t (%fast-gcd u v))))\n\n(defun fast-lcm (u v)\n  (declare (optimize (speed 3))\n           ((integer 0 #.most-positive-fixnum) u v))\n  (if (or (zerop u) (zerop v))\n      0\n      (multiple-value-bind (max min)\n          (if (> u v)\n              (values u v)\n              (values v u))\n        (* (truncate max (%fast-gcd u v)) min))))\n\n;; BEGIN_USE_PACKAGE\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/fast-gcd :cl-user))\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/read-fixnum :cl-user))\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/ext-eratosthenes :cl-user))\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.cl-user::opt)\n  (let* ((n (read))\n         (as (loop repeat n collect (read-fixnum)))\n         (table (make-minfactor-table 1000001))\n         (marked (make-array 1000001 :element-type 'bit :initial-element 0))\n         (pairwise-p t)\n         (setwise-p (= 1 (reduce #'%fast-gcd as))))\n    (declare (uint31 n))\n    (block outer\n      (dolist (a as)\n        (let ((primes (factorize a table)))\n          (loop for (p . exp) in primes\n                when (= 1 (aref marked p))\n                do (setq pairwise-p nil)\n                   (return-from outer)\n                do (setf (aref marked p) 1)))))\n    (write-line (cond (pairwise-p \"pairwise coprime\")\n                      (setwise-p \"setwise coprime\")\n                      (t \"not coprime\")))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (equal \"pairwise coprime\n\"\n          (run \"3\n3 4 5\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"setwise coprime\n\"\n          (run \"3\n6 10 15\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"not coprime\n\"\n          (run \"3\n6 10 16\n\" nil))))\n", "language": "Lisp", "metadata": {"date": 1598784165, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lisp/s861737251.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s861737251", "user_id": "u352600849"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Extended Eratosthenes' sieve\n;;;\n;;; build: O(nloglogn)\n;;; query: O(log(n))\n;;; Reference:\n;;; http://www.osak.jp/diary/diary_201310.html#20131017 (Japanese)\n;;; https://cp-algorithms.com/algebra/prime-sieve-linear.html\n;;;\n\n(defpackage :cp/ext-eratosthenes\n  (:use :cl)\n  (:export #:make-minfactor-table #:factorize #:euler-phi))\n(in-package :cp/ext-eratosthenes)\n\n(declaim (ftype (function * (values (simple-array (unsigned-byte 31) (*)) &optional))\n                make-minfactor-table))\n(defun make-minfactor-table (sup)\n  \"Returns a vector of length SUP, whose (0-based) i-th value is the minimal\nprime factor of i. (Corner case: 0th value is 0 and 1st value is 1.)\"\n  (declare (optimize (speed 3) (safety 0)))\n  (check-type sup (integer 2 (#.array-total-size-limit)))\n  (let ((table (make-array sup :element-type '(unsigned-byte 31))))\n    ;; initialize\n    (dotimes (i sup)\n      (setf (aref table i) i))\n    ;; p = 2\n    (loop for even-num from 4 below sup by 2\n          do (setf (aref table even-num) 2))\n    ;; p >= 3\n    (loop for p from 3 to (+ 1 (isqrt (- sup 1))) by 2\n          when (= p (aref table p))\n          do (loop for composite from (* p p) below sup by p\n                   when (= (aref table composite) composite)\n                   do (setf (aref table composite) p)))\n    table))\n\n(declaim (inline factorize))\n(defun factorize (x minfactor-table)\n  \"Returns the associative list of prime factors of X, which is composed\nof (<prime> . <exponent>). E.g. (factorize 100 <minfactor-table>) => '((2\n. 2) (5 . 5)). The returned list is in ascending order\nw.r.t. prime. Corner case: (factorize 0 table) => NIL.\n\nMINFACTOR-TABLE := vector (MINFACTOR-TABLE[k] is the minimal prime factor of k)\"\n  (declare (fixnum x)\n           (vector minfactor-table))\n  (setq x (abs x))\n  (when (<= x 1)\n    (return-from factorize nil))\n  (assert (< x (length minfactor-table)))\n  (loop until (= x 1)\n        for prime of-type (unsigned-byte 31) = (aref minfactor-table x)\n        collect (loop for exponent of-type (unsigned-byte 31) from 0\n                      do (multiple-value-bind (quot rem) (floor x prime)\n                           (if (zerop rem)\n                               (setf x quot)\n                               (loop-finish)))\n                      finally (return (cons prime exponent)))))\n\n(defpackage :cp/read-fixnum\n  (:use :cl)\n  (:export #:read-fixnum))\n(in-package :cp/read-fixnum)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.cl-user::opt)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n;;;\n;;; GCD and LCM\n;;; Reference:\n;;; https://lemire.me/blog/2013/12/26/fastest-way-to-compute-the-greatest-common-divisor/\n;;;\n\n(defpackage :cp/fast-gcd\n  (:use :cl)\n  (:export #:fast-gcd #:fast-lcm #:%fast-gcd))\n(in-package :cp/fast-gcd)\n\n(declaim (inline %fast-gcd fast-gcd fast-lcm)\n         (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional))\n                %fast-gcd fast-gcd fast-lcm))\n(defun %fast-gcd (u v)\n  (declare ((integer 0 #.most-positive-fixnum) u v))\n  (let ((shift (let ((x (logior u v)))\n                 (- (integer-length (logand x (- x))) 1))))\n    (declare (optimize (safety 0)))\n    (setq u (ash u (- 1 (integer-length (logand u (- u))))))\n    (loop (setq v (ash v (- 1 (integer-length (logand v (- v))))))\n          (when (> u v)\n            (rotatef u v))\n          (decf v u)\n          (when (zerop v)\n            (return (the (integer 1 #.most-positive-fixnum)\n                         (ash u shift)))))))\n\n(defun fast-gcd (u v)\n  (declare (optimize (speed 3))\n           ((integer 0 #.most-positive-fixnum) u v))\n  (cond ((zerop u) v)\n        ((zerop v) u)\n        (t (%fast-gcd u v))))\n\n(defun fast-lcm (u v)\n  (declare (optimize (speed 3))\n           ((integer 0 #.most-positive-fixnum) u v))\n  (if (or (zerop u) (zerop v))\n      0\n      (multiple-value-bind (max min)\n          (if (> u v)\n              (values u v)\n              (values v u))\n        (* (truncate max (%fast-gcd u v)) min))))\n\n;; BEGIN_USE_PACKAGE\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/fast-gcd :cl-user))\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/read-fixnum :cl-user))\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/ext-eratosthenes :cl-user))\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.cl-user::opt)\n  (let* ((n (read))\n         (as (loop repeat n collect (read-fixnum)))\n         (table (make-minfactor-table 1000001))\n         (marked (make-array 1000001 :element-type 'bit :initial-element 0))\n         (pairwise-p t)\n         (setwise-p (= 1 (reduce #'%fast-gcd as))))\n    (declare (uint31 n))\n    (block outer\n      (dolist (a as)\n        (let ((primes (factorize a table)))\n          (loop for (p . exp) in primes\n                when (= 1 (aref marked p))\n                do (setq pairwise-p nil)\n                   (return-from outer)\n                do (setf (aref marked p) 1)))))\n    (write-line (cond (pairwise-p \"pairwise coprime\")\n                      (setwise-p \"setwise coprime\")\n                      (t \"not coprime\")))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (equal \"pairwise coprime\n\"\n          (run \"3\n3 4 5\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"setwise coprime\n\"\n          (run \"3\n6 10 15\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"not coprime\n\"\n          (run \"3\n6 10 16\n\" nil))))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9368, "cpu_time_ms": 157, "memory_kb": 43736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s174962302", "group_id": "codeNet:p02574", "input_text": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Extended Eratosthenes' sieve\n;;;\n;;; build: O(nloglogn)\n;;; query: O(log(n))\n;;; Reference:\n;;; http://www.osak.jp/diary/diary_201310.html#20131017 (Japanese)\n;;; https://cp-algorithms.com/algebra/prime-sieve-linear.html\n;;;\n\n(defpackage :cp/ext-eratosthenes\n  (:use :cl)\n  (:export #:make-minfactor-table #:factorize #:euler-phi))\n(in-package :cp/ext-eratosthenes)\n\n(declaim (ftype (function * (values (simple-array (integer 0 #.most-positive-fixnum) (*)) &optional))\n                make-minfactor-table))\n(defun make-minfactor-table (sup)\n  \"Returns a vector of length SUP, whose (0-based) i-th value is the minimal\nprime factor of i. (Corner case: 0th value is 0 and 1st value is 1.)\"\n  (declare (optimize (speed 3) (safety 0)))\n  (check-type sup (integer 2 (#.array-total-size-limit)))\n  (let ((table (make-array sup :element-type '(integer 0 #.most-positive-fixnum))))\n    ;; initialize\n    (dotimes (i sup)\n      (setf (aref table i) i))\n    ;; p = 2\n    (loop for even-num from 4 below sup by 2\n          do (setf (aref table even-num) 2))\n    ;; p >= 3\n    (loop for p from 3 to (+ 1 (isqrt (- sup 1))) by 2\n          when (= p (aref table p))\n          do (loop for composite from (* p p) below sup by p\n                   when (= (aref table composite) composite)\n                   do (setf (aref table composite) p)))\n    table))\n\n(declaim (inline factorize))\n(defun factorize (x minfactor-table)\n  \"Returns the associative list of prime factors of X, which is composed\nof (<prime> . <exponent>). E.g. (factorize 100 <minfactor-table>) => '((2\n. 2) (5 . 5)). The returned list is in ascending order\nw.r.t. prime. Corner case: (factorize 0 table) => NIL.\n\nMINFACTOR-TABLE := vector (MINFACTOR-TABLE[k] is the minimal prime factor of k)\"\n  (declare (fixnum x)\n           (vector minfactor-table))\n  (setq x (abs x))\n  (when (<= x 1)\n    (return-from factorize nil))\n  (assert (< x (length minfactor-table)))\n  (loop until (= x 1)\n        for prime of-type (integer 0 #.most-positive-fixnum) = (aref minfactor-table x)\n        collect (loop for exponent of-type (integer 0 #.most-positive-fixnum) from 0\n                      do (multiple-value-bind (quot rem) (floor x prime)\n                           (if (zerop rem)\n                               (setf x quot)\n                               (loop-finish)))\n                      finally (return (cons prime exponent)))))\n\n\n(declaim (inline euler-phi))\n(defun euler-phi (x minfactor-table)\n  (declare (fixnum x)\n           (vector minfactor-table))\n  (setq x (abs x))\n  (assert (< x (length minfactor-table)))\n  (let ((res x))\n    (declare ((integer 0 #.most-positive-fixnum) res))\n    (loop until (= x 1)\n          for prime of-type (integer 0 #.most-positive-fixnum) = (aref minfactor-table x)\n          do (decf res (floor res prime))\n             (loop (multiple-value-bind (quot rem) (floor x prime)\n                     (if (zerop rem)\n                         (setq x quot)\n                         (return)))))\n    res))\n\n(defpackage :cp/read-fixnum\n  (:use :cl)\n  (:export #:read-fixnum))\n(in-package :cp/read-fixnum)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n;; BEGIN_USE_PACKAGE\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/read-fixnum :cl-user))\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/ext-eratosthenes :cl-user))\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.cl-user::opt)\n  (let* ((n (read))\n         (table (make-minfactor-table 1000001))\n         (as (loop repeat n collect (read-fixnum)))\n         (marked (make-array 1000001 :element-type 'bit :initial-element 0))\n         (pairwise-p t)\n         (setwise-p (= 1 (reduce #'gcd as))))\n    (declare (uint31 n))\n    (block outer\n      (dolist (a as)\n        (let ((primes (factorize a table)))\n          (loop for (p . exp) in primes\n                when (= 1 (aref marked p))\n                do (setq pairwise-p nil)\n                   (return-from outer)\n                do (setf (aref marked p) 1)))))\n    (write-line\n     (cond (pairwise-p \"pairwise coprime\")\n           (setwise-p \"setwise coprime\")\n           (t \"not coprime\")))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (equal \"pairwise coprime\n\"\n          (run \"3\n3 4 5\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"setwise coprime\n\"\n          (run \"3\n6 10 15\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"not coprime\n\"\n          (run \"3\n6 10 16\n\" nil))))\n", "language": "Lisp", "metadata": {"date": 1598774656, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lisp/s174962302.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s174962302", "user_id": "u352600849"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Extended Eratosthenes' sieve\n;;;\n;;; build: O(nloglogn)\n;;; query: O(log(n))\n;;; Reference:\n;;; http://www.osak.jp/diary/diary_201310.html#20131017 (Japanese)\n;;; https://cp-algorithms.com/algebra/prime-sieve-linear.html\n;;;\n\n(defpackage :cp/ext-eratosthenes\n  (:use :cl)\n  (:export #:make-minfactor-table #:factorize #:euler-phi))\n(in-package :cp/ext-eratosthenes)\n\n(declaim (ftype (function * (values (simple-array (integer 0 #.most-positive-fixnum) (*)) &optional))\n                make-minfactor-table))\n(defun make-minfactor-table (sup)\n  \"Returns a vector of length SUP, whose (0-based) i-th value is the minimal\nprime factor of i. (Corner case: 0th value is 0 and 1st value is 1.)\"\n  (declare (optimize (speed 3) (safety 0)))\n  (check-type sup (integer 2 (#.array-total-size-limit)))\n  (let ((table (make-array sup :element-type '(integer 0 #.most-positive-fixnum))))\n    ;; initialize\n    (dotimes (i sup)\n      (setf (aref table i) i))\n    ;; p = 2\n    (loop for even-num from 4 below sup by 2\n          do (setf (aref table even-num) 2))\n    ;; p >= 3\n    (loop for p from 3 to (+ 1 (isqrt (- sup 1))) by 2\n          when (= p (aref table p))\n          do (loop for composite from (* p p) below sup by p\n                   when (= (aref table composite) composite)\n                   do (setf (aref table composite) p)))\n    table))\n\n(declaim (inline factorize))\n(defun factorize (x minfactor-table)\n  \"Returns the associative list of prime factors of X, which is composed\nof (<prime> . <exponent>). E.g. (factorize 100 <minfactor-table>) => '((2\n. 2) (5 . 5)). The returned list is in ascending order\nw.r.t. prime. Corner case: (factorize 0 table) => NIL.\n\nMINFACTOR-TABLE := vector (MINFACTOR-TABLE[k] is the minimal prime factor of k)\"\n  (declare (fixnum x)\n           (vector minfactor-table))\n  (setq x (abs x))\n  (when (<= x 1)\n    (return-from factorize nil))\n  (assert (< x (length minfactor-table)))\n  (loop until (= x 1)\n        for prime of-type (integer 0 #.most-positive-fixnum) = (aref minfactor-table x)\n        collect (loop for exponent of-type (integer 0 #.most-positive-fixnum) from 0\n                      do (multiple-value-bind (quot rem) (floor x prime)\n                           (if (zerop rem)\n                               (setf x quot)\n                               (loop-finish)))\n                      finally (return (cons prime exponent)))))\n\n\n(declaim (inline euler-phi))\n(defun euler-phi (x minfactor-table)\n  (declare (fixnum x)\n           (vector minfactor-table))\n  (setq x (abs x))\n  (assert (< x (length minfactor-table)))\n  (let ((res x))\n    (declare ((integer 0 #.most-positive-fixnum) res))\n    (loop until (= x 1)\n          for prime of-type (integer 0 #.most-positive-fixnum) = (aref minfactor-table x)\n          do (decf res (floor res prime))\n             (loop (multiple-value-bind (quot rem) (floor x prime)\n                     (if (zerop rem)\n                         (setq x quot)\n                         (return)))))\n    res))\n\n(defpackage :cp/read-fixnum\n  (:use :cl)\n  (:export #:read-fixnum))\n(in-package :cp/read-fixnum)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n;; BEGIN_USE_PACKAGE\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/read-fixnum :cl-user))\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/ext-eratosthenes :cl-user))\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.cl-user::opt)\n  (let* ((n (read))\n         (table (make-minfactor-table 1000001))\n         (as (loop repeat n collect (read-fixnum)))\n         (marked (make-array 1000001 :element-type 'bit :initial-element 0))\n         (pairwise-p t)\n         (setwise-p (= 1 (reduce #'gcd as))))\n    (declare (uint31 n))\n    (block outer\n      (dolist (a as)\n        (let ((primes (factorize a table)))\n          (loop for (p . exp) in primes\n                when (= 1 (aref marked p))\n                do (setq pairwise-p nil)\n                   (return-from outer)\n                do (setf (aref marked p) 1)))))\n    (write-line\n     (cond (pairwise-p \"pairwise coprime\")\n           (setwise-p \"setwise coprime\")\n           (t \"not coprime\")))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (equal \"pairwise coprime\n\"\n          (run \"3\n3 4 5\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"setwise coprime\n\"\n          (run \"3\n6 10 15\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"not coprime\n\"\n          (run \"3\n6 10 16\n\" nil))))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8442, "cpu_time_ms": 204, "memory_kb": 47808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s291611087", "group_id": "codeNet:p02574", "input_text": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defun factorize-number-to-lst (x)\n  (assert (and (numberp x)\n               (plusp x)))\n  (labels\n      ((inner (x)\n         (if (= x 1)\n             1)\n         (let ((res nil)\n               (f 2))\n           (loop while (<= (* f f) x) do\n                (if (zerop (mod x f))\n                    (progn\n                      (setf x (truncate x f))\n                      (push f res))\n                    (incf f))\n              finally\n                (progn\n                  (when (/= x 1)\n                    (push x res))\n                  (return (reverse res)))))))\n    (inner x)))\n\n\n(defun setwise-p (xs)\n  (=\n   (reduce #'gcd xs)\n   1))\n\n\n(defun step-sum (sequence start end step)\n  (assert (arrayp sequence))\n  (labels ((inner (start end step &optional (acc 0))\n             (if (< start end)\n                 (inner (+ start step) end step (+ acc\n                                                   (aref sequence start)))\n                 acc)))\n    (inner start end step)))\n\n(defun pairwise-p (n xs)\n  (assert (and (plusp n)\n               (every #'numberp xs)))\n  (let ((memo (make-array (1+ (expt 10 6))::initial-element 0))\n        (flag t))\n    (dotimes (i n)\n      (incf (aref memo (first xs)))\n      (pop xs))\n    (let ((f 2))\n      (loop while (<= f (expt 10 6)) do\n           (when (> (step-sum memo f (1+ (expt 10 6)) f) 1)\n             (setf flag nil))\n           (incf f)\n         finally\n           (return flag)))))\n\n\n\n(defun solve (n a)\n  (cond\n    ((pairwise-p n a) \"pairwise coprime\")\n    ((setwise-p a)  \"setwise coprime\")\n    (t \"not coprime\")))\n\n\n(defun main ()\n  (let ((n (read))\n        (a (sort (read-numbers-to-list) #'<)))\n    (format t \"~a~%\" (solve n a))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1598768051, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lisp/s291611087.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s291611087", "user_id": "u425762225"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defun factorize-number-to-lst (x)\n  (assert (and (numberp x)\n               (plusp x)))\n  (labels\n      ((inner (x)\n         (if (= x 1)\n             1)\n         (let ((res nil)\n               (f 2))\n           (loop while (<= (* f f) x) do\n                (if (zerop (mod x f))\n                    (progn\n                      (setf x (truncate x f))\n                      (push f res))\n                    (incf f))\n              finally\n                (progn\n                  (when (/= x 1)\n                    (push x res))\n                  (return (reverse res)))))))\n    (inner x)))\n\n\n(defun setwise-p (xs)\n  (=\n   (reduce #'gcd xs)\n   1))\n\n\n(defun step-sum (sequence start end step)\n  (assert (arrayp sequence))\n  (labels ((inner (start end step &optional (acc 0))\n             (if (< start end)\n                 (inner (+ start step) end step (+ acc\n                                                   (aref sequence start)))\n                 acc)))\n    (inner start end step)))\n\n(defun pairwise-p (n xs)\n  (assert (and (plusp n)\n               (every #'numberp xs)))\n  (let ((memo (make-array (1+ (expt 10 6))::initial-element 0))\n        (flag t))\n    (dotimes (i n)\n      (incf (aref memo (first xs)))\n      (pop xs))\n    (let ((f 2))\n      (loop while (<= f (expt 10 6)) do\n           (when (> (step-sum memo f (1+ (expt 10 6)) f) 1)\n             (setf flag nil))\n           (incf f)\n         finally\n           (return flag)))))\n\n\n\n(defun solve (n a)\n  (cond\n    ((pairwise-p n a) \"pairwise coprime\")\n    ((setwise-p a)  \"setwise coprime\")\n    (t \"not coprime\")))\n\n\n(defun main ()\n  (let ((n (read))\n        (a (sort (read-numbers-to-list) #'<)))\n    (format t \"~a~%\" (solve n a))))\n\n(main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2916, "cpu_time_ms": 1343, "memory_kb": 137816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s650414720", "group_id": "codeNet:p02574", "input_text": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defun factorize-number-to-lst (x)\n  (assert (and (numberp x)\n               (plusp x)))\n  (labels\n      ((inner (x)\n         (if (= x 1)\n             1)\n         (let ((res nil)\n               (f 2))\n           (loop while (<= (* f f) x) do\n                (if (zerop (mod x f))\n                    (progn\n                      (setf x (truncate x f))\n                      (push f res))\n                    (incf f))\n              finally\n                (progn\n                  (when (/= x 1)\n                    (push x res))\n                  (return (reverse res)))))))\n    (inner x)))\n\n\n(defun setwise-p (xs)\n  (=\n   (reduce #'gcd xs)\n   1))\n\n\n(defun step-sum (sequence start end step)\n  (assert (arrayp sequence))\n  (labels ((inner (start end step &optional (acc 0))\n             (if (< start end)\n                 (inner (+ start step) end step (+ acc\n                                                   (aref sequence start)))\n                 acc)))\n    (inner start end step)))\n\n(defun pairwise-p (n xs)\n  (assert (and (plusp n)\n               (every #'numberp xs)))\n  (let ((memo (make-array (1+ (expt 10 6))::initial-element 0))\n        (flag t))\n    (dotimes (i n)\n      (setf (aref memo (first xs)) 1)\n      (pop xs))\n    (let ((f 2))\n      (loop while (<= f (expt 10 6)) do\n           (when (> (step-sum memo f (1+ (expt 10 6)) f) 1)\n             (setf flag nil))\n           (incf f)\n         finally\n           (return flag)))))\n\n\n\n(defun solve (n a)\n  (cond\n    ((pairwise-p n a) \"pairwise coprime\")\n    ((setwise-p a)  \"setwise coprime\")\n    (t \"not coprime\")))\n\n\n(defun main ()\n  (let ((n (read))\n        (a (sort (read-numbers-to-list) #'<)))\n    (format t \"~a~%\" (solve n a))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1598767745, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lisp/s650414720.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s650414720", "user_id": "u425762225"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defun factorize-number-to-lst (x)\n  (assert (and (numberp x)\n               (plusp x)))\n  (labels\n      ((inner (x)\n         (if (= x 1)\n             1)\n         (let ((res nil)\n               (f 2))\n           (loop while (<= (* f f) x) do\n                (if (zerop (mod x f))\n                    (progn\n                      (setf x (truncate x f))\n                      (push f res))\n                    (incf f))\n              finally\n                (progn\n                  (when (/= x 1)\n                    (push x res))\n                  (return (reverse res)))))))\n    (inner x)))\n\n\n(defun setwise-p (xs)\n  (=\n   (reduce #'gcd xs)\n   1))\n\n\n(defun step-sum (sequence start end step)\n  (assert (arrayp sequence))\n  (labels ((inner (start end step &optional (acc 0))\n             (if (< start end)\n                 (inner (+ start step) end step (+ acc\n                                                   (aref sequence start)))\n                 acc)))\n    (inner start end step)))\n\n(defun pairwise-p (n xs)\n  (assert (and (plusp n)\n               (every #'numberp xs)))\n  (let ((memo (make-array (1+ (expt 10 6))::initial-element 0))\n        (flag t))\n    (dotimes (i n)\n      (setf (aref memo (first xs)) 1)\n      (pop xs))\n    (let ((f 2))\n      (loop while (<= f (expt 10 6)) do\n           (when (> (step-sum memo f (1+ (expt 10 6)) f) 1)\n             (setf flag nil))\n           (incf f)\n         finally\n           (return flag)))))\n\n\n\n(defun solve (n a)\n  (cond\n    ((pairwise-p n a) \"pairwise coprime\")\n    ((setwise-p a)  \"setwise coprime\")\n    (t \"not coprime\")))\n\n\n(defun main ()\n  (let ((n (read))\n        (a (sort (read-numbers-to-list) #'<)))\n    (format t \"~a~%\" (solve n a))))\n\n(main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2918, "cpu_time_ms": 1355, "memory_kb": 137792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s847296583", "group_id": "codeNet:p02574", "input_text": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defun factorize-number-to-lst (x)\n  (assert (and (numberp x)\n               (plusp x)))\n  (labels\n      ((inner (x)\n         (if (= x 1)\n             1)\n         (let ((res nil)\n               (f 2))\n           (loop while (<= (* f f) x) do\n                (if (zerop (mod x f))\n                    (progn\n                      (setf x (truncate x f))\n                      (push f res))\n                    (incf f))\n              finally\n                (progn\n                  (when (/= x 1)\n                    (push x res))\n                  (return (reverse res)))))))\n    (inner x)))\n\n\n(defun setwise-p (xs)\n  (=\n   (reduce #'gcd xs)\n   1))\n\n\n(defun step-sum (sequence start end step)\n  (assert (arrayp sequence))\n  (labels ((inner (start end step &optional (acc 0))\n             (if (< start end)\n                 (inner (+ start step) end step (+ acc\n                                                   (aref sequence start)))\n                 acc)))\n    (inner start end step)))\n\n(defun pairwise-p (n xs)\n  (assert (and (plusp n)\n               (every #'numberp xs)))\n  (let ((memo (make-array (1+ (expt 10 6))::initial-element 0))\n        (flag t))\n    (dotimes (i n)\n      (setf (aref memo (first xs)) 1)\n      (pop xs))\n    (let ((f 2))\n      (loop while (<= f (expt 10 6)) do\n           (when (> (step-sum memo f (expt 10 6) f) 1)\n             (setf flag nil))\n           (incf f)\n         finally\n           (return flag)))))\n\n\n\n(defun solve (n a)\n  (cond\n    ((pairwise-p n a) \"pairwise coprime\")\n    ((setwise-p a)  \"setwise coprime\")\n    (t \"not coprime\")))\n\n\n(defun main ()\n  (let ((n (read))\n        (a (sort (read-numbers-to-list) #'<)))\n    (format t \"~a~%\" (solve n a))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1598767558, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lisp/s847296583.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s847296583", "user_id": "u425762225"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defun factorize-number-to-lst (x)\n  (assert (and (numberp x)\n               (plusp x)))\n  (labels\n      ((inner (x)\n         (if (= x 1)\n             1)\n         (let ((res nil)\n               (f 2))\n           (loop while (<= (* f f) x) do\n                (if (zerop (mod x f))\n                    (progn\n                      (setf x (truncate x f))\n                      (push f res))\n                    (incf f))\n              finally\n                (progn\n                  (when (/= x 1)\n                    (push x res))\n                  (return (reverse res)))))))\n    (inner x)))\n\n\n(defun setwise-p (xs)\n  (=\n   (reduce #'gcd xs)\n   1))\n\n\n(defun step-sum (sequence start end step)\n  (assert (arrayp sequence))\n  (labels ((inner (start end step &optional (acc 0))\n             (if (< start end)\n                 (inner (+ start step) end step (+ acc\n                                                   (aref sequence start)))\n                 acc)))\n    (inner start end step)))\n\n(defun pairwise-p (n xs)\n  (assert (and (plusp n)\n               (every #'numberp xs)))\n  (let ((memo (make-array (1+ (expt 10 6))::initial-element 0))\n        (flag t))\n    (dotimes (i n)\n      (setf (aref memo (first xs)) 1)\n      (pop xs))\n    (let ((f 2))\n      (loop while (<= f (expt 10 6)) do\n           (when (> (step-sum memo f (expt 10 6) f) 1)\n             (setf flag nil))\n           (incf f)\n         finally\n           (return flag)))))\n\n\n\n(defun solve (n a)\n  (cond\n    ((pairwise-p n a) \"pairwise coprime\")\n    ((setwise-p a)  \"setwise coprime\")\n    (t \"not coprime\")))\n\n\n(defun main ()\n  (let ((n (read))\n        (a (sort (read-numbers-to-list) #'<)))\n    (format t \"~a~%\" (solve n a))))\n\n(main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2913, "cpu_time_ms": 1420, "memory_kb": 137760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s387636980", "group_id": "codeNet:p02574", "input_text": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defun factorize-number-to-lst (x)\n  (assert (and (numberp x)\n               (plusp x)))\n  (labels\n      ((inner (x)\n         (if (= x 1)\n             1)\n         (let ((res nil)\n               (f 2))\n           (loop while (<= (* f f) x) do\n                (if (zerop (mod x f))\n                    (progn\n                      (setf x (truncate x f))\n                      (push f res))\n                    (incf f))\n              finally\n                (progn\n                  (when (/= x 1)\n                    (push x res))\n                  (return (reverse res)))))))\n    (inner x)))\n\n\n(defun setwise-p (xs)\n  (=\n   (reduce #'gcd xs)\n   1))\n\n\n(defun pairwise-p (n xs)\n  (assert (and (plusp n)\n               (every #'numberp xs)))\n  (let ((memo (make-array (1+ (expt 10 6))::initial-element nil))\n        (flag t))\n    (dotimes (i n)\n      (let* ((x (first xs))\n             (ys (factorize-number-to-lst x)))\n        (when (aref memo x)\n          (setf flag nil))\n        (loop while ys do\n             (let* ((y (first ys))\n                    (z y))\n               (loop while (<= z (expt 10 6)) do\n                    (setf (aref memo z) t)\n                    (incf z y)))\n             (pop ys)))\n      (pop xs))\n    flag))\n\n\n\n\n(defun solve (n a)\n  (cond\n    ((pairwise-p n a) \"pairwise coprime\")\n    ((setwise-p a)  \"setwise coprime\")\n    (t \"not coprime\")))\n\n\n(defun main ()\n  (let ((n (read))\n        (a (sort (read-numbers-to-list) #'<)))\n    (format t \"~a~%\" (solve n a))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1598764765, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Lisp/s387636980.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s387636980", "user_id": "u425762225"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": ";;; Utils\n\n(defmacro read-numbers-to-list ()\n  `(read-from-string\n    (concatenate 'string \"(\" (read-line) \")\")))\n\n\n(defmacro read-line-to-array (dimension)\n  (if (< dimension 0)\n      (error \"invalid arguments for dimension.\")\n      `(make-array ,dimension :initial-contents (read-numbers-to-list))))\n\n(defmacro read-line-to--char-list ()\n  `(concatenate 'list (read-line)))\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 nil\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i))))\n\n\n\n;;; Write code here\n\n(defun factorize-number-to-lst (x)\n  (assert (and (numberp x)\n               (plusp x)))\n  (labels\n      ((inner (x)\n         (if (= x 1)\n             1)\n         (let ((res nil)\n               (f 2))\n           (loop while (<= (* f f) x) do\n                (if (zerop (mod x f))\n                    (progn\n                      (setf x (truncate x f))\n                      (push f res))\n                    (incf f))\n              finally\n                (progn\n                  (when (/= x 1)\n                    (push x res))\n                  (return (reverse res)))))))\n    (inner x)))\n\n\n(defun setwise-p (xs)\n  (=\n   (reduce #'gcd xs)\n   1))\n\n\n(defun pairwise-p (n xs)\n  (assert (and (plusp n)\n               (every #'numberp xs)))\n  (let ((memo (make-array (1+ (expt 10 6))::initial-element nil))\n        (flag t))\n    (dotimes (i n)\n      (let* ((x (first xs))\n             (ys (factorize-number-to-lst x)))\n        (when (aref memo x)\n          (setf flag nil))\n        (loop while ys do\n             (let* ((y (first ys))\n                    (z y))\n               (loop while (<= z (expt 10 6)) do\n                    (setf (aref memo z) t)\n                    (incf z y)))\n             (pop ys)))\n      (pop xs))\n    flag))\n\n\n\n\n(defun solve (n a)\n  (cond\n    ((pairwise-p n a) \"pairwise coprime\")\n    ((setwise-p a)  \"setwise coprime\")\n    (t \"not coprime\")))\n\n\n(defun main ()\n  (let ((n (read))\n        (a (sort (read-numbers-to-list) #'<)))\n    (format t \"~a~%\" (solve n a))))\n\n(main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2709, "cpu_time_ms": 2209, "memory_kb": 137732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s869390826", "group_id": "codeNet:p02580", "input_text": "#-swank (declaim (optimize (speed 3) (safety 0) (debug 0)))\n#+swank (declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defconstant +mod+ 1000000007)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))) body...)\n\n\n(defmethod fast-sort ((sequence list) &key (test #'<))\n  (declare (inline sort)\n           (inline sb-impl::stable-sort-list))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n\n(defmethod fast-sort ((sequence array) &key (test #'<))\n  (declare (inline sort))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n\n(defmacro read-numbers-to-array (size)\n  `(progn\n     (when (not (integerp ,size))\n       (error \"Size must be integer.\"))\n     (when (< ,size 0)\n       (error \"Size must be plus or zero.\"))\n     (make-array ,size :initial-contents (read-numbers-to-list ,size))))\n\n(defmacro read-numbers-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size))))\n       (dotimes (,r ,row-size)\n         (dotimes (,c ,column-size)\n           (setf (aref ,board ,r ,c) (read))))\n       ,board)))\n\n\n(defun princ-for-each-line (list)\n  (format t \"~{~a~&~}\" list))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n;;; Write code here\n\n\n(defun main ()\n  (let* ((h (read))\n         (w (read))\n         (m (read))\n         (mines (loop repeat m collect (cons (1- (read))\n                                             (1- (read))))))\n    (declare (fixnum h w m)\n             (list mines))\n    (let ((h-count (make-array h :element-type 'fixnum :adjustable nil))\n          (w-count (make-array w :element-type 'fixnum :adjustable nil))\n          (memo (make-hash-table :size m  :test #'eq)))\n      (declare ((array fixnum 1) h-count w-count)\n               (hash-table memo))\n      (labels ((encode (y x)\n                 (dpb x (byte 20 20) y)))\n\n        (loop for mine of-type list in mines do\n             (setf (gethash (encode (first mine) (rest mine)) memo) t))\n        (loop for mine of-type list in mines do\n             (incf (aref h-count (first mine)))\n             (incf (aref w-count (rest mine))))\n        (let* ((h-max (reduce #'max h-count))\n               (w-max (reduce #'max w-count))\n               (h-max-list (remove-if-not\n                            (lambda (y)\n                              (= (aref h-count y)\n                                 h-max))\n                            (loop for i below h collect i)))\n               (w-max-list (remove-if-not\n                            (lambda (x)\n                              (= (aref w-count x)\n                                 w-max))\n                            (loop for i below w collect i))))\n          (declare (fixnum h-max w-max)\n                   (list h-max-list w-max-list))\n          (let ((ans (1- (+ h-max w-max)))\n                (flag nil))\n            (declare (fixnum ans))\n            (mapc (lambda (h)\n                    (mapc (lambda (w)\n                            (when (not (gethash (encode h w)\n                                                memo))\n                              (setq flag t)))\n                          w-max-list))\n                  h-max-list)\n            (when flag\n              (incf ans))\n            (format t \"~a~&\" ans)))))))\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600738677, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lisp/s869390826.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s869390826", "user_id": "u425762225"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#-swank (declaim (optimize (speed 3) (safety 0) (debug 0)))\n#+swank (declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defconstant +mod+ 1000000007)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))) body...)\n\n\n(defmethod fast-sort ((sequence list) &key (test #'<))\n  (declare (inline sort)\n           (inline sb-impl::stable-sort-list))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n\n(defmethod fast-sort ((sequence array) &key (test #'<))\n  (declare (inline sort))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n\n(defmacro read-numbers-to-array (size)\n  `(progn\n     (when (not (integerp ,size))\n       (error \"Size must be integer.\"))\n     (when (< ,size 0)\n       (error \"Size must be plus or zero.\"))\n     (make-array ,size :initial-contents (read-numbers-to-list ,size))))\n\n(defmacro read-numbers-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size))))\n       (dotimes (,r ,row-size)\n         (dotimes (,c ,column-size)\n           (setf (aref ,board ,r ,c) (read))))\n       ,board)))\n\n\n(defun princ-for-each-line (list)\n  (format t \"~{~a~&~}\" list))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n;;; Write code here\n\n\n(defun main ()\n  (let* ((h (read))\n         (w (read))\n         (m (read))\n         (mines (loop repeat m collect (cons (1- (read))\n                                             (1- (read))))))\n    (declare (fixnum h w m)\n             (list mines))\n    (let ((h-count (make-array h :element-type 'fixnum :adjustable nil))\n          (w-count (make-array w :element-type 'fixnum :adjustable nil))\n          (memo (make-hash-table :size m  :test #'eq)))\n      (declare ((array fixnum 1) h-count w-count)\n               (hash-table memo))\n      (labels ((encode (y x)\n                 (dpb x (byte 20 20) y)))\n\n        (loop for mine of-type list in mines do\n             (setf (gethash (encode (first mine) (rest mine)) memo) t))\n        (loop for mine of-type list in mines do\n             (incf (aref h-count (first mine)))\n             (incf (aref w-count (rest mine))))\n        (let* ((h-max (reduce #'max h-count))\n               (w-max (reduce #'max w-count))\n               (h-max-list (remove-if-not\n                            (lambda (y)\n                              (= (aref h-count y)\n                                 h-max))\n                            (loop for i below h collect i)))\n               (w-max-list (remove-if-not\n                            (lambda (x)\n                              (= (aref w-count x)\n                                 w-max))\n                            (loop for i below w collect i))))\n          (declare (fixnum h-max w-max)\n                   (list h-max-list w-max-list))\n          (let ((ans (1- (+ h-max w-max)))\n                (flag nil))\n            (declare (fixnum ans))\n            (mapc (lambda (h)\n                    (mapc (lambda (w)\n                            (when (not (gethash (encode h w)\n                                                memo))\n                              (setq flag t)))\n                          w-max-list))\n                  h-max-list)\n            (when flag\n              (incf ans))\n            (format t \"~a~&\" ans)))))))\n#-swank (main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3823, "cpu_time_ms": 3310, "memory_kb": 93260}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s283858748", "group_id": "codeNet:p02580", "input_text": "#-swank (declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+swank (declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defconstant +mod+ 1000000007)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))) body...)\n\n\n(defmethod fast-sort ((sequence list) &key (test #'<))\n  (declare (inline sort)\n           (inline sb-impl::stable-sort-list))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n\n(defmethod fast-sort ((sequence array) &key (test #'<))\n  (declare (inline sort))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n\n(defmacro read-numbers-to-array (size)\n  `(progn\n     (when (not (integerp ,size))\n       (error \"Size must be integer.\"))\n     (when (< ,size 0)\n       (error \"Size must be plus or zero.\"))\n     (make-array ,size :initial-contents (read-numbers-to-list ,size))))\n\n(defmacro read-numbers-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size))))\n       (dotimes (,r ,row-size)\n         (dotimes (,c ,column-size)\n           (setf (aref ,board ,r ,c) (read))))\n       ,board)))\n\n\n(defun princ-for-each-line (list)\n  (format t \"~{~a~&~}\" list))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n;;; Write code here\n\n\n(defun main ()\n  (let ((h (read))\n        (w (read))\n        (mines (loop repeat (read) collect (cons (1- (read))\n                                                 (1- (read))))))\n    (let ((h-count (make-array h))\n          (w-count (make-array w)))\n      (loop for m in mines do\n           (incf (aref h-count (first m)))\n           (incf (aref w-count (rest m))))\n      (let* ((h-max (reduce #'max h-count))\n             (w-max (reduce #'max w-count))\n             (h-max-list (remove-if-not\n                          (lambda (y)\n                            (= (aref h-count y)\n                               h-max))\n                          (loop for i below h collect i)))\n             (w-max-list (remove-if-not\n                          (lambda (x)\n                            (= (aref w-count x)\n                               w-max))\n                          (loop for i below w collect i))))\n        (let ((ans (1- (+ h-max w-max)))\n              (flag nil))\n          (mapc (lambda (h)\n                  (mapc (lambda (w)\n                          (when (not (find (cons h w)\n                                           mines\n                                           :test #'equal))\n                            (setq flag t)))\n                        w-max-list))\n                h-max-list)\n          (when flag\n            (incf ans))\n          (format t \"~a~&\" ans))))))\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600734827, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lisp/s283858748.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s283858748", "user_id": "u425762225"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#-swank (declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+swank (declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defconstant +mod+ 1000000007)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))) body...)\n\n\n(defmethod fast-sort ((sequence list) &key (test #'<))\n  (declare (inline sort)\n           (inline sb-impl::stable-sort-list))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n\n(defmethod fast-sort ((sequence array) &key (test #'<))\n  (declare (inline sort))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n\n(defmacro read-numbers-to-array (size)\n  `(progn\n     (when (not (integerp ,size))\n       (error \"Size must be integer.\"))\n     (when (< ,size 0)\n       (error \"Size must be plus or zero.\"))\n     (make-array ,size :initial-contents (read-numbers-to-list ,size))))\n\n(defmacro read-numbers-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size))))\n       (dotimes (,r ,row-size)\n         (dotimes (,c ,column-size)\n           (setf (aref ,board ,r ,c) (read))))\n       ,board)))\n\n\n(defun princ-for-each-line (list)\n  (format t \"~{~a~&~}\" list))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n;;; Write code here\n\n\n(defun main ()\n  (let ((h (read))\n        (w (read))\n        (mines (loop repeat (read) collect (cons (1- (read))\n                                                 (1- (read))))))\n    (let ((h-count (make-array h))\n          (w-count (make-array w)))\n      (loop for m in mines do\n           (incf (aref h-count (first m)))\n           (incf (aref w-count (rest m))))\n      (let* ((h-max (reduce #'max h-count))\n             (w-max (reduce #'max w-count))\n             (h-max-list (remove-if-not\n                          (lambda (y)\n                            (= (aref h-count y)\n                               h-max))\n                          (loop for i below h collect i)))\n             (w-max-list (remove-if-not\n                          (lambda (x)\n                            (= (aref w-count x)\n                               w-max))\n                          (loop for i below w collect i))))\n        (let ((ans (1- (+ h-max w-max)))\n              (flag nil))\n          (mapc (lambda (h)\n                  (mapc (lambda (w)\n                          (when (not (find (cons h w)\n                                           mines\n                                           :test #'equal))\n                            (setq flag t)))\n                        w-max-list))\n                h-max-list)\n          (when flag\n            (incf ans))\n          (format t \"~a~&\" ans))))))\n#-swank (main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3196, "cpu_time_ms": 3311, "memory_kb": 94276}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s872821481", "group_id": "codeNet:p02580", "input_text": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n(defpackage :cp/read-fixnum\n  (:use :cl)\n  (:export #:read-fixnum))\n(in-package :cp/read-fixnum)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.cl-user::opt)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n;; BEGIN_USE_PACKAGE\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/read-fixnum :cl-user))\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.cl-user::opt)\n  (let* ((h (read))\n         (w (read))\n         (m (read))\n         (row-sums (make-array h :element-type 'uint31 :initial-element 0))\n         (col-sums (make-array w :element-type 'uint31 :initial-element 0))\n         (table (make-hash-table :size m :test #'equal)))\n    (declare (uint31 h w m))\n    (dotimes (i m)\n      (let ((y (- (read-fixnum) 1))\n            (x (- (read-fixnum) 1)))\n        (incf (aref row-sums y))\n        (incf (aref col-sums x))\n        (setf (gethash (cons y x) table) t)))\n    (let* ((row-max (reduce #'max row-sums))\n           (col-max (reduce #'max col-sums))\n           (col-nodes (loop for x below w\n                            when (= (aref col-sums x) col-max)\n                            collect x)))\n      (declare (uint31 row-max col-max))\n      (dotimes (row h)\n        (when (= (aref row-sums row) row-max)\n          (dolist (col col-nodes)\n            (unless (gethash (cons row col) table)\n              (println (+ row-max col-max))\n              (return-from main)))))\n      (println (+ row-max col-max -1)))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (equal \"3\n\"\n          (run \"2 3 3\n2 2\n1 1\n1 3\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"3\n\"\n          (run \"3 3 4\n3 3\n3 1\n1 1\n1 2\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"6\n\"\n          (run \"5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\" nil))))\n", "language": "Lisp", "metadata": {"date": 1598180572, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lisp/s872821481.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s872821481", "user_id": "u352600849"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n(defpackage :cp/read-fixnum\n  (:use :cl)\n  (:export #:read-fixnum))\n(in-package :cp/read-fixnum)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.cl-user::opt)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n;; BEGIN_USE_PACKAGE\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/read-fixnum :cl-user))\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.cl-user::opt)\n  (let* ((h (read))\n         (w (read))\n         (m (read))\n         (row-sums (make-array h :element-type 'uint31 :initial-element 0))\n         (col-sums (make-array w :element-type 'uint31 :initial-element 0))\n         (table (make-hash-table :size m :test #'equal)))\n    (declare (uint31 h w m))\n    (dotimes (i m)\n      (let ((y (- (read-fixnum) 1))\n            (x (- (read-fixnum) 1)))\n        (incf (aref row-sums y))\n        (incf (aref col-sums x))\n        (setf (gethash (cons y x) table) t)))\n    (let* ((row-max (reduce #'max row-sums))\n           (col-max (reduce #'max col-sums))\n           (col-nodes (loop for x below w\n                            when (= (aref col-sums x) col-max)\n                            collect x)))\n      (declare (uint31 row-max col-max))\n      (dotimes (row h)\n        (when (= (aref row-sums row) row-max)\n          (dolist (col col-nodes)\n            (unless (gethash (cons row col) table)\n              (println (+ row-max col-max))\n              (return-from main)))))\n      (println (+ row-max col-max -1)))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (equal \"3\n\"\n          (run \"2 3 3\n2 2\n1 1\n1 3\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"3\n\"\n          (run \"3 3 4\n3 3\n3 1\n1 1\n1 2\n\" nil)))\n  (it.bese.fiveam:is\n   (equal \"6\n\"\n          (run \"5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\" nil))))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5724, "cpu_time_ms": 153, "memory_kb": 49128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s690685350", "group_id": "codeNet:p02580", "input_text": "(let* ((h (read))\n       (w (read))\n       (m (read))\n       (pos (make-hash-table :test 'equal :size m))\n       (h-num (make-array (list h) :initial-element nil))\n       (w-num (make-array (list w) :initial-element nil))\n       (stack (make-array (list m) :adjustable t :fill-pointer 0))\n       (p 0)\n       (ans 0))\n  (loop :for i :from 1 :to h\n        :do (setf (aref h-num (1- i)) (cons i 0)))\n  (loop :for j :from 1 :to w\n        :do (setf (aref w-num (1- j)) (cons j 0)))\n  (loop :for k :from 1 :to m\n        :for i := (read)\n        :for j := (read)\n        :do (incf (cdr (aref h-num (1- i))))\n        :do (incf (cdr (aref w-num (1- j))))\n        :do (setf (gethash (cons i j) pos) t))\n  ; \n  (setf h-num (sort h-num (lambda (a b) (> (cdr a) (cdr b)))))\n  (setf w-num (sort w-num (lambda (a b) (> (cdr a) (cdr b)))))\n  ;\n  (vector-push-extend (cons 0 0) stack)\n  (defun s (i j)\n    (let ((x (aref h-num i))\n          (y (aref w-num j)))\n      (cond ((gethash (cons (car x) (car y)) pos)\n             (when (and (< (1+ i) h) (= (cdr x) (cdr (aref h-num (1+ i)))))\n               (vector-push-extend (cons (1+ i) j) stack))\n             (when (and (< (1+ j) w) (= (cdr y) (cdr (aref w-num (1+ j)))))\n               (vector-push-extend (cons i (1+ j)) stack))\n             (setf ans (max ans (+ (cdr x) (cdr y) -1))))\n            (t\n             (setf ans (max ans (+ (cdr x) (cdr y))))))))\n  (loop :while (= (length stack) p)\n        :for arg := (aref stack p)\n        :do (incf p)\n        :do (s (car arg) (cdr arg)))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1598128776, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lisp/s690685350.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s690685350", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((h (read))\n       (w (read))\n       (m (read))\n       (pos (make-hash-table :test 'equal :size m))\n       (h-num (make-array (list h) :initial-element nil))\n       (w-num (make-array (list w) :initial-element nil))\n       (stack (make-array (list m) :adjustable t :fill-pointer 0))\n       (p 0)\n       (ans 0))\n  (loop :for i :from 1 :to h\n        :do (setf (aref h-num (1- i)) (cons i 0)))\n  (loop :for j :from 1 :to w\n        :do (setf (aref w-num (1- j)) (cons j 0)))\n  (loop :for k :from 1 :to m\n        :for i := (read)\n        :for j := (read)\n        :do (incf (cdr (aref h-num (1- i))))\n        :do (incf (cdr (aref w-num (1- j))))\n        :do (setf (gethash (cons i j) pos) t))\n  ; \n  (setf h-num (sort h-num (lambda (a b) (> (cdr a) (cdr b)))))\n  (setf w-num (sort w-num (lambda (a b) (> (cdr a) (cdr b)))))\n  ;\n  (vector-push-extend (cons 0 0) stack)\n  (defun s (i j)\n    (let ((x (aref h-num i))\n          (y (aref w-num j)))\n      (cond ((gethash (cons (car x) (car y)) pos)\n             (when (and (< (1+ i) h) (= (cdr x) (cdr (aref h-num (1+ i)))))\n               (vector-push-extend (cons (1+ i) j) stack))\n             (when (and (< (1+ j) w) (= (cdr y) (cdr (aref w-num (1+ j)))))\n               (vector-push-extend (cons i (1+ j)) stack))\n             (setf ans (max ans (+ (cdr x) (cdr y) -1))))\n            (t\n             (setf ans (max ans (+ (cdr x) (cdr y))))))))\n  (loop :while (= (length stack) p)\n        :for arg := (aref stack p)\n        :do (incf p)\n        :do (s (car arg) (cdr arg)))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1550, "cpu_time_ms": 930, "memory_kb": 104736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s169291553", "group_id": "codeNet:p02580", "input_text": "(let* ((h (read))\n       (w (read))\n       (m (read))\n       (pos (make-hash-table :test 'equal :size m))\n       (h-num (make-array (list h) :initial-element nil))\n       (w-num (make-array (list w) :initial-element nil))\n       (stack nil)\n       (ans 0))\n  (loop :for i :from 1 :to h\n        :do (setf (aref h-num (1- i)) (cons i 0)))\n  (loop :for j :from 1 :to w\n        :do (setf (aref w-num (1- j)) (cons j 0)))\n  (loop :for k :from 1 :to m\n        :for i := (read)\n        :for j := (read)\n        :do (incf (cdr (aref h-num (1- i))))\n        :do (incf (cdr (aref w-num (1- j))))\n        :do (setf (gethash (cons i j) pos) t))\n  ; \n  (setf h-num (sort h-num (lambda (a b) (> (cdr a) (cdr b)))))\n  (setf w-num (sort w-num (lambda (a b) (> (cdr a) (cdr b)))))\n  ;\n  (push (cons 0 0) stack)\n  (defun s (i j)\n    (let ((x (aref h-num i))\n          (y (aref w-num j)))\n      (cond ((gethash (cons (car x) (car y)) pos)\n             (when (and (< (1+ i) h) (= (cdr x) (cdr (aref h-num (1+ i)))))\n               (push (cons (1+ i) j) stack))\n             (when (and (< (1+ j) w) (= (cdr y) (cdr (aref w-num (1+ j)))))\n               (push (cons i (1+ j)) stack))\n             (setf ans (max ans (+ (cdr x) (cdr y) -1))))\n            (t\n             (setf ans (max ans (+ (cdr x) (cdr y))))))))\n  (loop :while stack\n        :for arg := (pop stack)\n        :do (s (car arg) (cdr arg)))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1598128356, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lisp/s169291553.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s169291553", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((h (read))\n       (w (read))\n       (m (read))\n       (pos (make-hash-table :test 'equal :size m))\n       (h-num (make-array (list h) :initial-element nil))\n       (w-num (make-array (list w) :initial-element nil))\n       (stack nil)\n       (ans 0))\n  (loop :for i :from 1 :to h\n        :do (setf (aref h-num (1- i)) (cons i 0)))\n  (loop :for j :from 1 :to w\n        :do (setf (aref w-num (1- j)) (cons j 0)))\n  (loop :for k :from 1 :to m\n        :for i := (read)\n        :for j := (read)\n        :do (incf (cdr (aref h-num (1- i))))\n        :do (incf (cdr (aref w-num (1- j))))\n        :do (setf (gethash (cons i j) pos) t))\n  ; \n  (setf h-num (sort h-num (lambda (a b) (> (cdr a) (cdr b)))))\n  (setf w-num (sort w-num (lambda (a b) (> (cdr a) (cdr b)))))\n  ;\n  (push (cons 0 0) stack)\n  (defun s (i j)\n    (let ((x (aref h-num i))\n          (y (aref w-num j)))\n      (cond ((gethash (cons (car x) (car y)) pos)\n             (when (and (< (1+ i) h) (= (cdr x) (cdr (aref h-num (1+ i)))))\n               (push (cons (1+ i) j) stack))\n             (when (and (< (1+ j) w) (= (cdr y) (cdr (aref w-num (1+ j)))))\n               (push (cons i (1+ j)) stack))\n             (setf ans (max ans (+ (cdr x) (cdr y) -1))))\n            (t\n             (setf ans (max ans (+ (cdr x) (cdr y))))))))\n  (loop :while stack\n        :for arg := (pop stack)\n        :do (s (car arg) (cdr arg)))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1408, "cpu_time_ms": 3311, "memory_kb": 108252}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s091750056", "group_id": "codeNet:p02580", "input_text": "(let* ((h (read))\n       (w (read))\n       (m (read))\n       (pos (make-hash-table :test 'equal :size m))\n       (h-num (make-array (list h) :initial-element nil))\n       (w-num (make-array (list w) :initial-element nil))\n       (stack nil)\n       (ans 0))\n  (loop :for i :from 1 :to h\n        :do (setf (aref h-num (1- i)) (cons i 0)))\n  (loop :for j :from 1 :to w\n        :do (setf (aref w-num (1- j)) (cons j 0)))\n  (loop :for k :from 1 :to m\n        :for i := (read)\n        :for j := (read)\n        :do (incf (cdr (aref h-num (1- i))))\n        :do (incf (cdr (aref w-num (1- j))))\n        :do (setf (gethash (cons i j) pos) t))\n  ; \n  (setf h-num (sort h-num (lambda (a b) (> (cdr a) (cdr b)))))\n  (setf w-num (sort w-num (lambda (a b) (> (cdr a) (cdr b)))))\n  ;\n  (push (cons 0 0) stack)\n  (defun s (i j)\n    (let ((x (aref h-num i))\n          (y (aref w-num j)))\n      (cond ((gethash (cons (car x) (car y)) pos)\n             (when (< (1+ i) h)\n               (push (cons (1+ i) j) stack))\n             (when (< (1+ j) w)\n               (push (cons i (1+ j)) stack))\n             (setf ans (max ans (+ (cdr x) (cdr y) -1))))\n            (t\n             (setf ans (max ans (+ (cdr x) (cdr y))))))))\n  (loop :while stack\n        :for arg := (pop stack)\n        :do (s (car arg) (cdr arg)))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1598128205, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lisp/s091750056.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s091750056", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((h (read))\n       (w (read))\n       (m (read))\n       (pos (make-hash-table :test 'equal :size m))\n       (h-num (make-array (list h) :initial-element nil))\n       (w-num (make-array (list w) :initial-element nil))\n       (stack nil)\n       (ans 0))\n  (loop :for i :from 1 :to h\n        :do (setf (aref h-num (1- i)) (cons i 0)))\n  (loop :for j :from 1 :to w\n        :do (setf (aref w-num (1- j)) (cons j 0)))\n  (loop :for k :from 1 :to m\n        :for i := (read)\n        :for j := (read)\n        :do (incf (cdr (aref h-num (1- i))))\n        :do (incf (cdr (aref w-num (1- j))))\n        :do (setf (gethash (cons i j) pos) t))\n  ; \n  (setf h-num (sort h-num (lambda (a b) (> (cdr a) (cdr b)))))\n  (setf w-num (sort w-num (lambda (a b) (> (cdr a) (cdr b)))))\n  ;\n  (push (cons 0 0) stack)\n  (defun s (i j)\n    (let ((x (aref h-num i))\n          (y (aref w-num j)))\n      (cond ((gethash (cons (car x) (car y)) pos)\n             (when (< (1+ i) h)\n               (push (cons (1+ i) j) stack))\n             (when (< (1+ j) w)\n               (push (cons i (1+ j)) stack))\n             (setf ans (max ans (+ (cdr x) (cdr y) -1))))\n            (t\n             (setf ans (max ans (+ (cdr x) (cdr y))))))))\n  (loop :while stack\n        :for arg := (pop stack)\n        :do (s (car arg) (cdr arg)))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1320, "cpu_time_ms": 3311, "memory_kb": 113376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s515934480", "group_id": "codeNet:p02580", "input_text": "(let* ((h (read))\n       (w (read))\n       (m (read))\n       (pos (make-hash-table :test 'equal :size m))\n       (h-num (make-array (list h) :initial-element nil))\n       (w-num (make-array (list w) :initial-element nil)))\n  (loop :for i :from 1 :to h\n        :do (setf (aref h-num (1- i)) (cons i 0)))\n  (loop :for j :from 1 :to w\n        :do (setf (aref w-num (1- j)) (cons j 0)))\n  (loop :for k :from 1 :to m\n        :for i := (read)\n        :for j := (read)\n        :do (incf (cdr (aref h-num (1- i))))\n        :do (incf (cdr (aref w-num (1- j))))\n        :do (setf (gethash (cons i j) pos) t))\n  ; \n  (setf h-num (sort h-num (lambda (a b) (> (cdr a) (cdr b)))))\n  (setf w-num (sort w-num (lambda (a b) (> (cdr a) (cdr b)))))\n  ;\n  (defun s (i j)\n    (let ((x (aref h-num i))\n          (y (aref w-num j)))\n      (cond ((gethash (cons (car x) (car y)) pos)\n             (max (s (min (1+ i) (1- h)) j)\n                  (s i (min (1+ j) (1- w)))\n                  (+ (cdr x) (cdr y) -1)))\n            (t\n             (+ (cdr x) (cdr y))))))\n  (format t \"~A~%\" (s 0 0)))\n", "language": "Lisp", "metadata": {"date": 1598127055, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lisp/s515934480.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s515934480", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((h (read))\n       (w (read))\n       (m (read))\n       (pos (make-hash-table :test 'equal :size m))\n       (h-num (make-array (list h) :initial-element nil))\n       (w-num (make-array (list w) :initial-element nil)))\n  (loop :for i :from 1 :to h\n        :do (setf (aref h-num (1- i)) (cons i 0)))\n  (loop :for j :from 1 :to w\n        :do (setf (aref w-num (1- j)) (cons j 0)))\n  (loop :for k :from 1 :to m\n        :for i := (read)\n        :for j := (read)\n        :do (incf (cdr (aref h-num (1- i))))\n        :do (incf (cdr (aref w-num (1- j))))\n        :do (setf (gethash (cons i j) pos) t))\n  ; \n  (setf h-num (sort h-num (lambda (a b) (> (cdr a) (cdr b)))))\n  (setf w-num (sort w-num (lambda (a b) (> (cdr a) (cdr b)))))\n  ;\n  (defun s (i j)\n    (let ((x (aref h-num i))\n          (y (aref w-num j)))\n      (cond ((gethash (cons (car x) (car y)) pos)\n             (max (s (min (1+ i) (1- h)) j)\n                  (s i (min (1+ j) (1- w)))\n                  (+ (cdr x) (cdr y) -1)))\n            (t\n             (+ (cdr x) (cdr y))))))\n  (format t \"~A~%\" (s 0 0)))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1072, "cpu_time_ms": 3312, "memory_kb": 105932}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s834165488", "group_id": "codeNet:p02580", "input_text": "(let* ((h (read))\n       (w (read))\n       (m (read))\n       (pos (make-hash-table :test 'equal :size m))\n       (h-num (make-array (list (1+ h)) :initial-element 0))\n       (w-num (make-array (list (1+ w)) :initial-element 0))\n       (h-list nil)\n       (w-list nil))\n  (loop :for k :from 1 :to m\n        :for i := (read)\n        :for j := (read)\n        :do (incf (aref h-num i))\n        :do (incf (aref w-num j))\n        :do (setf (gethash (cons i j) pos) t))\n  ; \n  (setf h-list (sort (loop :for i :from 1 :to h\n                           :collect (cons i (aref h-num i)))\n                     (lambda (a b) (> (cdr a) (cdr b)))))\n  (setf w-list (sort (loop :for j :from 1 :to w\n                           :collect (cons j (aref w-num j)))\n                     (lambda (a b) (> (cdr a) (cdr b)))))\n  ;\n  (defun s (i j)\n    (let ((x (car i))\n          (y (car j)))\n      (unless x\n        (setf x (cons 0 0)))\n      (unless y\n        (setf y (cons 0 0)))\n      (cond ((gethash (cons (car x) (car y)) pos)\n             (max (s (cdr i) j)\n                  (s i (cdr j))\n                  (+ (cdr x) (cdr y) -1)))\n            (t\n             (+ (cdr x) (cdr y))))))\n  (format t \"~A~%\" (s h-list w-list)))\n", "language": "Lisp", "metadata": {"date": 1598126439, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Lisp/s834165488.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s834165488", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((h (read))\n       (w (read))\n       (m (read))\n       (pos (make-hash-table :test 'equal :size m))\n       (h-num (make-array (list (1+ h)) :initial-element 0))\n       (w-num (make-array (list (1+ w)) :initial-element 0))\n       (h-list nil)\n       (w-list nil))\n  (loop :for k :from 1 :to m\n        :for i := (read)\n        :for j := (read)\n        :do (incf (aref h-num i))\n        :do (incf (aref w-num j))\n        :do (setf (gethash (cons i j) pos) t))\n  ; \n  (setf h-list (sort (loop :for i :from 1 :to h\n                           :collect (cons i (aref h-num i)))\n                     (lambda (a b) (> (cdr a) (cdr b)))))\n  (setf w-list (sort (loop :for j :from 1 :to w\n                           :collect (cons j (aref w-num j)))\n                     (lambda (a b) (> (cdr a) (cdr b)))))\n  ;\n  (defun s (i j)\n    (let ((x (car i))\n          (y (car j)))\n      (unless x\n        (setf x (cons 0 0)))\n      (unless y\n        (setf y (cons 0 0)))\n      (cond ((gethash (cons (car x) (car y)) pos)\n             (max (s (cdr i) j)\n                  (s i (cdr j))\n                  (+ (cdr x) (cdr y) -1)))\n            (t\n             (+ (cdr x) (cdr y))))))\n  (format t \"~A~%\" (s h-list w-list)))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1206, "cpu_time_ms": 3313, "memory_kb": 127164}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s085289966", "group_id": "codeNet:p02612", "input_text": "(defun main (price)\n  (let ((remainder (rem price 1000)))\n    (princ\n     (if (not (zerop remainder)) (- 1000 remainder) 0))))\n\n(main (read))\n", "language": "Lisp", "metadata": {"date": 1600893611, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lisp/s085289966.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s085289966", "user_id": "u761519515"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "(defun main (price)\n  (let ((remainder (rem price 1000)))\n    (princ\n     (if (not (zerop remainder)) (- 1000 remainder) 0))))\n\n(main (read))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 142, "cpu_time_ms": 19, "memory_kb": 24312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s777217650", "group_id": "codeNet:p02612", "input_text": "(mod (- (read)) 1000)", "language": "Lisp", "metadata": {"date": 1595310981, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lisp/s777217650.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s777217650", "user_id": "u620944332"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "(mod (- (read)) 1000)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 21, "cpu_time_ms": 17, "memory_kb": 23160}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s413469314", "group_id": "codeNet:p02612", "input_text": "(loop :for k :from 0 :upto 1000\n      :with n := (read)\n      :if (= 0 (mod (+ k n) 1000))\n        :do(princ k))", "language": "Lisp", "metadata": {"date": 1594674780, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lisp/s413469314.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s413469314", "user_id": "u610490393"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "(loop :for k :from 0 :upto 1000\n      :with n := (read)\n      :if (= 0 (mod (+ k n) 1000))\n        :do(princ k))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 112, "cpu_time_ms": 19, "memory_kb": 24492}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s062237701", "group_id": "codeNet:p02612", "input_text": "(princ (mod (read) 1000))", "language": "Lisp", "metadata": {"date": 1594454636, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lisp/s062237701.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s062237701", "user_id": "u610490393"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "(princ (mod (read) 1000))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 25, "cpu_time_ms": 17, "memory_kb": 24160}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s623841869", "group_id": "codeNet:p02612", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read)))\n    (println (- (* 1000 (ceiling n 1000)) n))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1900\n\"\n    \"100\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3000\n\"\n    \"0\n\")))\n", "language": "Lisp", "metadata": {"date": 1594022145, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lisp/s623841869.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s623841869", "user_id": "u352600849"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read)))\n    (println (- (* 1000 (ceiling n 1000)) n))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1900\n\"\n    \"100\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3000\n\"\n    \"0\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3542, "cpu_time_ms": 17, "memory_kb": 24716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s923272604", "group_id": "codeNet:p02612", "input_text": "(defun main ()\n  (let ((n (read)))\n    (if (< 0 (rem n 1000))\n\t(- 1000 (rem n 1000))\n\t0)))\n\n(format t \"~d~%\" (main))\n", "language": "Lisp", "metadata": {"date": 1593997993, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lisp/s923272604.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s923272604", "user_id": "u091381267"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "(defun main ()\n  (let ((n (read)))\n    (if (< 0 (rem n 1000))\n\t(- 1000 (rem n 1000))\n\t0)))\n\n(format t \"~d~%\" (main))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 117, "cpu_time_ms": 20, "memory_kb": 24348}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s007355750", "group_id": "codeNet:p02612", "input_text": "(let ((n (read)))\n    (if (zerop (rem n 1000))\n        (princ 0)\n        (princ (- 1000 (rem n 1000)))\n    )\n)", "language": "Lisp", "metadata": {"date": 1593997367, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lisp/s007355750.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s007355750", "user_id": "u136500538"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "(let ((n (read)))\n    (if (zerop (rem n 1000))\n        (princ 0)\n        (princ (- 1000 (rem n 1000)))\n    )\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 110, "cpu_time_ms": 21, "memory_kb": 24232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s064378164", "group_id": "codeNet:p02612", "input_text": "(let ((x (mod (read) 1000)))\n  (format t \"~A~%\" (if (= x 0) 0 (- 1000 x))))\n", "language": "Lisp", "metadata": {"date": 1593997338, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Lisp/s064378164.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s064378164", "user_id": "u608227593"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "(let ((x (mod (read) 1000)))\n  (format t \"~A~%\" (if (= x 0) 0 (- 1000 x))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 76, "cpu_time_ms": 17, "memory_kb": 24244}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s972177609", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (floor (the uint31 (* day (- (aref ends old-type) 1))) 365))\n        (loop while (< (aref old-history old-pos) day)\n              do (incf old-pos))\n        (loop while (< day (aref old-history old-pos))\n              do (decf old-pos)))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (floor (the uint31 (* day (- (aref ends new-type) 1))) 365))\n        (loop while (< (aref new-history new-pos) day)\n              do (incf new-pos))\n        (loop while (< day (aref new-history new-pos))\n              do (decf new-pos))\n        (incf new-pos))\n      ;; (unless new-pos\n      ;;   (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let ((old-pos (floor (the uint31 (* day (- (aref ends old-type) 1))) 365)))\n        (declare (uint31 old-pos))\n        (loop while (< (aref old-history old-pos) day)\n              do (incf old-pos))\n        (loop while (< day (aref old-history old-pos))\n              do (decf old-pos))\n        (let* ((prev-day (aref old-history (- old-pos 1)))\n               (next-day (aref old-history (+ old-pos 1))))\n          ;; (assert (= day (aref old-history old-pos)))\n          (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n          ;; add new type \n          (incf score (aref ss day new-type))\n          (let ((new-pos (floor (the uint31 (* day (- (aref ends new-type) 1))) 365)))\n            (declare (uint31 new-pos))\n            (loop while (< (aref new-history new-pos) day)\n                  do (incf new-pos))\n            (loop while (< day (aref new-history new-pos))\n                  do (decf new-pos))\n            (incf new-pos)\n            (let* ((next-day (aref new-history new-pos))\n                   (prev-day (aref new-history (- new-pos 1))))\n              ;; (assert (< day (aref new-history new-pos)))\n              (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n              (values score old-pos new-pos))))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.86d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 150d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 100))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n             (setq *random-state* (seed-random-state (+ i 1)))\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593867154, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s972177609.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s972177609", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (floor (the uint31 (* day (- (aref ends old-type) 1))) 365))\n        (loop while (< (aref old-history old-pos) day)\n              do (incf old-pos))\n        (loop while (< day (aref old-history old-pos))\n              do (decf old-pos)))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (floor (the uint31 (* day (- (aref ends new-type) 1))) 365))\n        (loop while (< (aref new-history new-pos) day)\n              do (incf new-pos))\n        (loop while (< day (aref new-history new-pos))\n              do (decf new-pos))\n        (incf new-pos))\n      ;; (unless new-pos\n      ;;   (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let ((old-pos (floor (the uint31 (* day (- (aref ends old-type) 1))) 365)))\n        (declare (uint31 old-pos))\n        (loop while (< (aref old-history old-pos) day)\n              do (incf old-pos))\n        (loop while (< day (aref old-history old-pos))\n              do (decf old-pos))\n        (let* ((prev-day (aref old-history (- old-pos 1)))\n               (next-day (aref old-history (+ old-pos 1))))\n          ;; (assert (= day (aref old-history old-pos)))\n          (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n          ;; add new type \n          (incf score (aref ss day new-type))\n          (let ((new-pos (floor (the uint31 (* day (- (aref ends new-type) 1))) 365)))\n            (declare (uint31 new-pos))\n            (loop while (< (aref new-history new-pos) day)\n                  do (incf new-pos))\n            (loop while (< day (aref new-history new-pos))\n                  do (decf new-pos))\n            (incf new-pos)\n            (let* ((next-day (aref new-history new-pos))\n                   (prev-day (aref new-history (- new-pos 1))))\n              ;; (assert (< day (aref new-history new-pos)))\n              (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n              (values score old-pos new-pos))))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.86d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 150d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 100))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n             (setq *random-state* (seed-random-state (+ i 1)))\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 23149, "cpu_time_ms": 2000, "memory_kb": 79080}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s845237339", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (floor (the uint31 (* day (- (aref ends old-type) 1))) 365))\n        (loop while (< (aref old-history old-pos) day)\n              do (incf old-pos))\n        (loop while (< day (aref old-history old-pos))\n              do (decf old-pos)))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (floor (the uint31 (* day (- (aref ends new-type) 1))) 365))\n        (loop while (< (aref new-history new-pos) day)\n              do (incf new-pos))\n        (loop while (< day (aref new-history new-pos))\n              do (decf new-pos))\n        (incf new-pos))\n      ;; (unless new-pos\n      ;;   (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let ((old-pos (floor (the uint31 (* day (- (aref ends old-type) 1))) 365)))\n        (declare (uint31 old-pos))\n        (loop while (< (aref old-history old-pos) day)\n              do (incf old-pos))\n        (loop while (< day (aref old-history old-pos))\n              do (decf old-pos))\n        (let* ((prev-day (aref old-history (- old-pos 1)))\n               (next-day (aref old-history (+ old-pos 1))))\n          ;; (assert (= day (aref old-history old-pos)))\n          (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n          ;; add new type \n          (incf score (aref ss day new-type))\n          (let ((new-pos (floor (the uint31 (* day (- (aref ends new-type) 1))) 365)))\n            (declare (uint31 new-pos))\n            (loop while (< (aref new-history new-pos) day)\n                  do (incf new-pos))\n            (loop while (< day (aref new-history new-pos))\n                  do (decf new-pos))\n            (incf new-pos)\n            (let* ((next-day (aref new-history new-pos))\n                   (prev-day (aref new-history (- new-pos 1))))\n              ;; (assert (< day (aref new-history new-pos)))\n              (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n              (values score old-pos new-pos))))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.86d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 100))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n             (setq *random-state* (seed-random-state (+ i 1)))\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593866791, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s845237339.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s845237339", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (floor (the uint31 (* day (- (aref ends old-type) 1))) 365))\n        (loop while (< (aref old-history old-pos) day)\n              do (incf old-pos))\n        (loop while (< day (aref old-history old-pos))\n              do (decf old-pos)))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (floor (the uint31 (* day (- (aref ends new-type) 1))) 365))\n        (loop while (< (aref new-history new-pos) day)\n              do (incf new-pos))\n        (loop while (< day (aref new-history new-pos))\n              do (decf new-pos))\n        (incf new-pos))\n      ;; (unless new-pos\n      ;;   (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let ((old-pos (floor (the uint31 (* day (- (aref ends old-type) 1))) 365)))\n        (declare (uint31 old-pos))\n        (loop while (< (aref old-history old-pos) day)\n              do (incf old-pos))\n        (loop while (< day (aref old-history old-pos))\n              do (decf old-pos))\n        (let* ((prev-day (aref old-history (- old-pos 1)))\n               (next-day (aref old-history (+ old-pos 1))))\n          ;; (assert (= day (aref old-history old-pos)))\n          (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n          ;; add new type \n          (incf score (aref ss day new-type))\n          (let ((new-pos (floor (the uint31 (* day (- (aref ends new-type) 1))) 365)))\n            (declare (uint31 new-pos))\n            (loop while (< (aref new-history new-pos) day)\n                  do (incf new-pos))\n            (loop while (< day (aref new-history new-pos))\n                  do (decf new-pos))\n            (incf new-pos)\n            (let* ((next-day (aref new-history new-pos))\n                   (prev-day (aref new-history (- new-pos 1))))\n              ;; (assert (< day (aref new-history new-pos)))\n              (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n              (values score old-pos new-pos))))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.86d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 100))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n             (setq *random-state* (seed-random-state (+ i 1)))\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 23149, "cpu_time_ms": 1999, "memory_kb": 79224}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s914421553", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint16 (#.(* 365 32))))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint16 (#.(* 365 32))) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss (+ (ash i 5) type)))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint16 (#.(* 365 32))) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss (+ (ash day 5) old-type)))\n      (unless old-pos\n        (setq old-pos (let ((ng -1)\n                            (ok (aref ends old-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref old-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid))))))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss (+ (ash day 5) new-type)))\n      (unless new-pos\n        (setq new-pos (let ((ng -1)\n                            (ok (aref ends new-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref new-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid))))))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint16 (#.(* 365 32))) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss (+ (ash day 5) old-type)))\n      (let* ((old-pos (let ((ng -1)\n                            (ok (aref ends old-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref old-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid)))))))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss (+ (ash day 5) new-type)))\n        (let* ((new-pos (let ((ng -1)\n                              (ok (aref ends new-type)))\n                          (declare (int32 ng ok))\n                          (loop\n                            (if (<= (- ok ng) 1)\n                                (return ok)\n                                (let ((mid (ash (+ ng ok) -1)))\n                                  (if (< (aref new-history mid) day)\n                                      (setq ng mid)\n                                      (setq ok mid)))))))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.86d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 100))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint16 (#.(* 365 32))) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss (+ (ash i 5) type))\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss #+swank (make-array #.(* 365 32) :element-type 'uint16 :initial-element 0)\n             #-swank (sb-int:make-static-vector #.(* 365 32) :element-type 'uint16 :initial-element 0)))\n    (declare (uint16 d))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss (+ (ash i 5) j)) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593863784, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s914421553.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s914421553", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint16 (#.(* 365 32))))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint16 (#.(* 365 32))) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss (+ (ash i 5) type)))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint16 (#.(* 365 32))) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss (+ (ash day 5) old-type)))\n      (unless old-pos\n        (setq old-pos (let ((ng -1)\n                            (ok (aref ends old-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref old-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid))))))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss (+ (ash day 5) new-type)))\n      (unless new-pos\n        (setq new-pos (let ((ng -1)\n                            (ok (aref ends new-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref new-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid))))))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint16 (#.(* 365 32))) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss (+ (ash day 5) old-type)))\n      (let* ((old-pos (let ((ng -1)\n                            (ok (aref ends old-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref old-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid)))))))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss (+ (ash day 5) new-type)))\n        (let* ((new-pos (let ((ng -1)\n                              (ok (aref ends new-type)))\n                          (declare (int32 ng ok))\n                          (loop\n                            (if (<= (- ok ng) 1)\n                                (return ok)\n                                (let ((mid (ash (+ ng ok) -1)))\n                                  (if (< (aref new-history mid) day)\n                                      (setq ng mid)\n                                      (setq ok mid)))))))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.86d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 100))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint16 (#.(* 365 32))) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss (+ (ash i 5) type))\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss #+swank (make-array #.(* 365 32) :element-type 'uint16 :initial-element 0)\n             #-swank (sb-int:make-static-vector #.(* 365 32) :element-type 'uint16 :initial-element 0)))\n    (declare (uint16 d))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss (+ (ash i 5) j)) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 20415, "cpu_time_ms": 2000, "memory_kb": 78988}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s740655131", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (let ((ng -1)\n                            (ok (aref ends old-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref old-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid))))))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (let ((ng -1)\n                            (ok (aref ends new-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref new-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid))))))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (let ((ng -1)\n                            (ok (aref ends old-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref old-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid)))))))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (let ((ng -1)\n                              (ok (aref ends new-type)))\n                          (declare (int32 ng ok))\n                          (loop\n                            (if (<= (- ok ng) 1)\n                                (return ok)\n                                (let ((mid (ash (+ ng ok) -1)))\n                                  (if (< (aref new-history mid) day)\n                                      (setq ng mid)\n                                      (setq ok mid)))))))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.86d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 100))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593860458, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s740655131.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740655131", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (let ((ng -1)\n                            (ok (aref ends old-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref old-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid))))))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (let ((ng -1)\n                            (ok (aref ends new-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref new-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid))))))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (let ((ng -1)\n                            (ok (aref ends old-type)))\n                        (declare (int32 ng ok))\n                        (loop\n                          (if (<= (- ok ng) 1)\n                              (return ok)\n                              (let ((mid (ash (+ ng ok) -1)))\n                                (if (< (aref old-history mid) day)\n                                    (setq ng mid)\n                                    (setq ok mid)))))))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (let ((ng -1)\n                              (ok (aref ends new-type)))\n                          (declare (int32 ng ok))\n                          (loop\n                            (if (<= (- ok ng) 1)\n                                (return ok)\n                                (let ((mid (ash (+ ng ok) -1)))\n                                  (if (< (aref new-history mid) day)\n                                      (setq ng mid)\n                                      (setq ok mid)))))))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.86d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 100))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 20161, "cpu_time_ms": 2000, "memory_kb": 79028}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s025225163", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (bisect-left old-history day :end (aref ends old-type))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (bisect-left new-history day :end (aref ends new-type)))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.86d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1500d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 100))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593855594, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s025225163.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s025225163", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (bisect-left old-history day :end (aref ends old-type))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (bisect-left new-history day :end (aref ends new-type)))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.86d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1500d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 100))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 22082, "cpu_time_ms": 1999, "memory_kb": 79176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s006320544", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (bisect-left old-history day :end (aref ends old-type))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (bisect-left new-history day :end (aref ends new-type)))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.76d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 190))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593854618, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s006320544.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s006320544", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (bisect-left old-history day :end (aref ends old-type))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (bisect-left new-history day :end (aref ends new-type)))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (let ((x (/ (- new-score prev-score) temp)))\n        (+ (* x (+ (* x (+ (* x (+ (* x (+ (* x #.(float 1/120 1d0)) #.(float 1/24 1d0))) #.(float 1/6 1d0))) #.(float 1/2 1d0))) 1d0)) 1d0))))\n\n(defun anneal (state &optional (time 1.76d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 190))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 22082, "cpu_time_ms": 1985, "memory_kb": 81972}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s056587219", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (bisect-left old-history day :end (aref ends old-type))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (bisect-left new-history day :end (aref ends new-type)))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 1.76d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 190))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593852340, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s056587219.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s056587219", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (bisect-left old-history day :end (aref ends old-type))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (bisect-left new-history day :end (aref ends new-type)))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 1.76d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 100d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        ;; #>rem-time\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              ;; #>rem-time\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 190))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 21935, "cpu_time_ms": 1988, "memory_kb": 82568}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s593614440", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (bisect-left old-history day :end (aref ends old-type))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (bisect-left new-history day :end (aref ends new-type)))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n;; 32690717\n;; 32749575\n\n(defun anneal (state &optional (time 1.76d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 10d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 190))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593851506, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s593614440.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s593614440", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (bisect-left old-history day :end (aref ends old-type))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (bisect-left new-history day :end (aref ends new-type)))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n;; 32690717\n;; 32749575\n\n(defun anneal (state &optional (time 1.76d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 2000d0)\n         (end-temp 10d0)\n         (loop-count 0)\n         (rem-time time))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp rem-time))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (when (zerop (logand #.(- (ash 2 7) 1) loop-count))\n          (setq rem-time (float (rem-time) 1d0)))\n        (when (zerop rem-time)\n          (return))\n        (if (zerop (random 4))\n            (let* ((day (random (state-d state)))\n                   (old-type (aref (state-schedule state) day))\n                   (new-type (random 26))\n                   (old-score (state-score state)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (multiple-value-bind (new-score old-pos new-pos)\n                    (state-eval-update state day new-type)\n                  (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (<= (random 1.0) prob)\n                      (state-update! state day new-type old-pos new-pos)\n                      (when (> new-score opt-score)\n                        (setq opt-schedule (copy-seq (state-schedule state))\n                              opt-score new-score)))))))\n            (let* ((width (+ 1 (random 16)))\n                   (day (random (- (state-d state) width)))\n                   (type1 (aref (state-schedule state) day))\n                   (type2 (aref (state-schedule state) (+ day width)))\n                   (old-score (state-score state)))\n              (unless (= type1 type2)\n                (multiple-value-bind (_ old-pos1 new-pos1)\n                    (state-update! state day type2)\n                  (multiple-value-bind (new-score old-pos2 new-pos2)\n                      (state-eval-update state (+ day width) type1)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (if (<= (random 1.0) prob)\n                          (progn\n                            (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                            (when (> new-score opt-score)\n                              (setq opt-schedule (copy-seq (state-schedule state))\n                                    opt-score new-score)))\n                          (state-update! state day type1 new-pos1 old-pos1))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 190))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 20\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 21877, "cpu_time_ms": 1988, "memory_kb": 82428}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s501216602", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (bisect-left old-history day :end (aref ends old-type))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (bisect-left new-history day :end (aref ends new-type)))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 1.77d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 10d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (if (zerop (random 4))\n              (let* ((day (random (state-d state)))\n                     (old-type (aref (state-schedule state) day))\n                     (new-type (random 26))\n                     (old-score (state-score state)))\n                (unless (= old-type new-type)\n                  ;; tmp. update\n                  (multiple-value-bind (new-score old-pos new-pos)\n                      (state-eval-update state day new-type)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (when (<= (random 1.0) prob)\n                        (state-update! state day new-type old-pos new-pos)\n                        (when (> new-score opt-score)\n                          (setq opt-schedule (copy-seq (state-schedule state))\n                                opt-score new-score)))))))\n              (let* ((width (+ 1 (random 16)))\n                     (day (random (- (state-d state) width)))\n                     (type1 (aref (state-schedule state) day))\n                     (type2 (aref (state-schedule state) (+ day width)))\n                     (old-score (state-score state)))\n                (unless (= type1 type2)\n                  (multiple-value-bind (_ old-pos1 new-pos1)\n                      (state-update! state day type2)\n                    (multiple-value-bind (new-score old-pos2 new-pos2)\n                        (state-eval-update state (+ day width) type1)\n                      (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                             (prob (calc-prob old-score new-score temp)))\n                        (declare (double-float temp))\n                        (if (<= (random 1.0) prob)\n                            (progn\n                              (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                              (when (> new-score opt-score)\n                                (setq opt-schedule (copy-seq (state-schedule state))\n                                      opt-score new-score)))\n                            (state-update! state day type1 new-pos1 old-pos1)))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 190))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        (let ((result-state (make-state-from d cs ss schedule)))\n          (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593835252, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s501216602.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s501216602", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type &optional old-pos new-pos)\n  (declare #.OPT\n           (uint16 day new-type)\n           ((or null uint16) old-pos new-pos))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (unless old-pos\n        (setq old-pos (bisect-left old-history day :end (aref ends old-type))))\n      (let* ((pos old-pos)\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (unless new-pos\n        (setq new-pos (bisect-left new-history day :end (aref ends new-type))))\n      (let* ((pos new-pos)\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      (values state old-pos new-pos))))\n\n(defun state-eval-update (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((score (state-score state))\n           (old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare (int32 score)\n               ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((old-pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- old-pos 1)))\n             (next-day (aref old-history (+ old-pos 1))))\n        ;; (assert (= day (aref old-history old-pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        ;; add new type \n        (incf score (aref ss day new-type))\n        (let* ((new-pos (bisect-left new-history day :end (aref ends new-type)))\n               (next-day (aref new-history new-pos))\n               (prev-day (aref new-history (- new-pos 1))))\n          ;; (assert (< day (aref new-history new-pos)))\n          (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n          (values score old-pos new-pos))))))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 1.77d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 10d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (if (zerop (random 4))\n              (let* ((day (random (state-d state)))\n                     (old-type (aref (state-schedule state) day))\n                     (new-type (random 26))\n                     (old-score (state-score state)))\n                (unless (= old-type new-type)\n                  ;; tmp. update\n                  (multiple-value-bind (new-score old-pos new-pos)\n                      (state-eval-update state day new-type)\n                    (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      (when (<= (random 1.0) prob)\n                        (state-update! state day new-type old-pos new-pos)\n                        (when (> new-score opt-score)\n                          (setq opt-schedule (copy-seq (state-schedule state))\n                                opt-score new-score)))))))\n              (let* ((width (+ 1 (random 16)))\n                     (day (random (- (state-d state) width)))\n                     (type1 (aref (state-schedule state) day))\n                     (type2 (aref (state-schedule state) (+ day width)))\n                     (old-score (state-score state)))\n                (unless (= type1 type2)\n                  (multiple-value-bind (_ old-pos1 new-pos1)\n                      (state-update! state day type2)\n                    (multiple-value-bind (new-score old-pos2 new-pos2)\n                        (state-eval-update state (+ day width) type1)\n                      (let* ((temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                             (prob (calc-prob old-score new-score temp)))\n                        (declare (double-float temp))\n                        (if (<= (random 1.0) prob)\n                            (progn\n                              (state-update! state (+ day width) type1 old-pos2 new-pos2)\n                              (when (> new-score opt-score)\n                                (setq opt-schedule (copy-seq (state-schedule state))\n                                      opt-score new-score)))\n                            (state-update! state day type1 new-pos1 old-pos1)))))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 190))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        (let ((result-state (make-state-from d cs ss schedule)))\n          (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 21830, "cpu_time_ms": 1997, "memory_kb": 82320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s334455233", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<))\n  (declare (function order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (,accessor target mid) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day :end (aref ends new-type)))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 0.8d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 10d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (if (zerop (random 4))\n              (let* ((day (random (state-d state)))\n                     (old-type (aref (state-schedule state) day))\n                     (new-type (random 26))\n                     (old-score (state-score state)))\n                (unless (= old-type new-type)\n                  ;; tmp. update\n                  (state-update! state day new-type)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (> new-score opt-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day old-type)))))\n              (let* ((width (+ 1 (random 16)))\n                     (day (random (- (state-d state) width)))\n                     (type1 (aref (state-schedule state) day))\n                     (type2 (aref (state-schedule state) (+ day width)))\n                     (old-score (state-score state)))\n                (unless (= type1 type2)\n                  (state-update! state day type2)\n                  (state-update! state (+ day width) type1)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    ;; (dbg day type1 type2 old-score new-score)\n                    (when (> new-score opt-score)\n                      ;; (dbg new-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day type1)\n                      (state-update! state (+ day width) type2)))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 1000))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        (let ((result-state (make-state-from d cs ss schedule)))\n          (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593771122, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s334455233.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334455233", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<))\n  (declare (function order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (,accessor target mid) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day :end (aref ends new-type)))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 0.8d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 10d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (if (zerop (random 4))\n              (let* ((day (random (state-d state)))\n                     (old-type (aref (state-schedule state) day))\n                     (new-type (random 26))\n                     (old-score (state-score state)))\n                (unless (= old-type new-type)\n                  ;; tmp. update\n                  (state-update! state day new-type)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (> new-score opt-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day old-type)))))\n              (let* ((width (+ 1 (random 16)))\n                     (day (random (- (state-d state) width)))\n                     (type1 (aref (state-schedule state) day))\n                     (type2 (aref (state-schedule state) (+ day width)))\n                     (old-score (state-score state)))\n                (unless (= type1 type2)\n                  (state-update! state day type2)\n                  (state-update! state (+ day width) type1)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    ;; (dbg day type1 type2 old-score new-score)\n                    (when (> new-score opt-score)\n                      ;; (dbg new-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day type1)\n                      (state-update! state (+ day width) type2)))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 1000))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        (let ((result-state (make-state-from d cs ss schedule)))\n          (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 19350, "cpu_time_ms": 1947, "memory_kb": 104188}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s483176050", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day :end (aref ends new-type)))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 1.5d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 10d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (if (zerop (random 4))\n              (let* ((day (random (state-d state)))\n                     (old-type (aref (state-schedule state) day))\n                     (new-type (random 26))\n                     (old-score (state-score state)))\n                (unless (= old-type new-type)\n                  ;; tmp. update\n                  (state-update! state day new-type)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (> new-score opt-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day old-type)))))\n              (let* ((width (+ 1 (random 16)))\n                     (day (random (- (state-d state) width)))\n                     (type1 (aref (state-schedule state) day))\n                     (type2 (aref (state-schedule state) (+ day width)))\n                     (old-score (state-score state)))\n                (unless (= type1 type2)\n                  (state-update! state day type2)\n                  (state-update! state (+ day width) type1)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    ;; (dbg day type1 type2 old-score new-score)\n                    (when (> new-score opt-score)\n                      ;; (dbg new-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day type1)\n                      (state-update! state (+ day width) type2)))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 400))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        (let ((result-state (make-state-from d cs ss schedule)))\n          (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593770784, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s483176050.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s483176050", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Sort multiple vectors\n;;;\n\n;; TODO: throw an error if there are two ore more identical vectors in the given\n;; vectors\n\n(declaim (inline %median3))\n(defun %median3 (x y z)\n  (if (> x y)\n      (if (> y z)\n          y\n          (if (> z x)\n              x\n              z))\n      (if (> z y)\n          y\n          (if (> x z)\n              x\n              z))))\n\n(defun parallel-sort! (vector vector1 vector2 end)\n  (declare #.OPT\n           ((simple-array int32 (*)) vector)\n           ((simple-array t (*)) vector1 vector2)\n           ((integer 0 #.array-total-size-limit) end))\n  (labels\n      ((recur (left right)\n         (declare ((integer -1 #.array-total-size-limit) left right))\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r))))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (> (aref vector l) pivot)\n                         do (incf l 1))\n                   (loop while (> pivot (aref vector r))\n                         do (decf r 1))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (rotatef (aref vector1 l) (aref vector1 r))\n                   (rotatef (aref vector2 l) (aref vector2 r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day :end (aref ends new-type)))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 1.5d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 10d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (if (zerop (random 4))\n              (let* ((day (random (state-d state)))\n                     (old-type (aref (state-schedule state) day))\n                     (new-type (random 26))\n                     (old-score (state-score state)))\n                (unless (= old-type new-type)\n                  ;; tmp. update\n                  (state-update! state day new-type)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (> new-score opt-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day old-type)))))\n              (let* ((width (+ 1 (random 16)))\n                     (day (random (- (state-d state) width)))\n                     (type1 (aref (state-schedule state) day))\n                     (type2 (aref (state-schedule state) (+ day width)))\n                     (old-score (state-score state)))\n                (unless (= type1 type2)\n                  (state-update! state day type2)\n                  (state-update! state (+ day width) type1)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    ;; (dbg day type1 type2 old-score new-score)\n                    (when (> new-score opt-score)\n                      ;; (dbg new-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day type1)\n                      (state-update! state (+ day width) type2)))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 400))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* (;; score schedule prevs\n         (que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que1 (make-array #.(* +beam-width+ 26) :element-type 'int32))\n         (new-que2 (make-array #.(* +beam-width+ 26) :element-type t))\n         (new-que3 (make-array #.(* +beam-width+ 26) :element-type t))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array int32 (*)) que1 new-que1)\n             ((simple-array t (*)) que2 new-que2 que3 new-que3)\n             (uint31 end new-end))\n    (setf (aref que1 0) 0\n          (aref que2 0) nil\n          (aref que3 0) (make-array 26 :element-type 'int16 :initial-element -1))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for base-score of-type int32 = (aref que1 j)\n            for schedule of-type list = (aref que2 j)\n            for prevs of-type (simple-array int16 (*)) = (aref que3 j)\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que1 new-end) new-score\n                         (aref new-que2 new-end) (cons type schedule)\n                         (aref new-que3 new-end) new-prevs)\n                   (incf new-end))))\n      (parallel-sort! new-que1 new-que2 new-que3 new-end)\n      (rotatef que1 new-que1)\n      (rotatef que2 new-que2)\n      (rotatef que3 new-que3)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (aref que2 0)) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        (let ((result-state (make-state-from d cs ss schedule)))\n          (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 20053, "cpu_time_ms": 1989, "memory_kb": 86128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s052604164", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Quicksort (deterministic median-of-three partitioning)\n;;;\n\n;; NOTE: This quicksort is NOT randomized. You should shuffle an input when you\n;; need to avoid getting hacked.\n\n;; Reference:\n;; Hannu Erkio, The worst case permutation for median-of-three quicksort\n\n(declaim (inline %median3))\n(defun %median3 (x y z order)\n  (if (funcall order x y)\n      (if (funcall order y z)\n          y\n          (if (funcall order z x)\n              x\n              z))\n      (if (funcall order z y)\n          y\n          (if (funcall order x z)\n              x\n              z))))\n\n(defun quicksort! (vector end)\n  \"Destructively sorts VECTOR w.r.t. ORDER.\"\n  (declare #.OPT\n           ((simple-array list (*)) vector)\n           (uint32 end))\n  (labels\n      ((order (x y)\n         (> (the int32 (car x)) (the int32 (car y))))\n       (recur (left right)\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r)\n                                   #'order)))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (order (aref vector l) pivot)\n                         do (incf l))\n                   (loop while (order pivot (aref vector r))\n                         do (decf r))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (declare (inline order))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day :end (aref ends new-type)))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 1.5d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 10d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (if (zerop (random 4))\n              (let* ((day (random (state-d state)))\n                     (old-type (aref (state-schedule state) day))\n                     (new-type (random 26))\n                     (old-score (state-score state)))\n                (unless (= old-type new-type)\n                  ;; tmp. update\n                  (state-update! state day new-type)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (> new-score opt-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day old-type)))))\n              (let* ((width (+ 1 (random 16)))\n                     (day (random (- (state-d state) width)))\n                     (type1 (aref (state-schedule state) day))\n                     (type2 (aref (state-schedule state) (+ day width)))\n                     (old-score (state-score state)))\n                (unless (= type1 type2)\n                  (state-update! state day type2)\n                  (state-update! state (+ day width) type1)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    ;; (dbg day type1 type2 old-score new-score)\n                    (when (> new-score opt-score)\n                      ;; (dbg new-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day type1)\n                      (state-update! state (+ day width) type2)))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 350))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss)\n           ;; (inline sort sb-impl::stable-sort-list)\n           )\n  (let* (;; score schedule prevs\n         (que (make-array #.(* +beam-width+ 26) :element-type 'list))\n         (new-que (make-array #.(* +beam-width+ 26) :element-type 'list))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array list (*)) que new-que)\n             (uint31 end new-end))\n    (setf (aref que 0)\n          (list* 0 nil (make-array 26 :element-type 'int16 :initial-element -1)))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for (score schedule . prevs)\n            of-type (int32 list . (simple-array int16 (*))) = (aref que j)\n            for base-score of-type int32 = score\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que new-end)\n                         (list* new-score (cons type schedule) new-prevs))\n                   (incf new-end))))\n      (quicksort! new-que new-end)\n      (rotatef que new-que)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (second (aref que 0))) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        (let ((result-state (make-state-from d cs ss schedule)))\n          (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593768116, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s052604164.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s052604164", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Quicksort (deterministic median-of-three partitioning)\n;;;\n\n;; NOTE: This quicksort is NOT randomized. You should shuffle an input when you\n;; need to avoid getting hacked.\n\n;; Reference:\n;; Hannu Erkio, The worst case permutation for median-of-three quicksort\n\n(declaim (inline %median3))\n(defun %median3 (x y z order)\n  (if (funcall order x y)\n      (if (funcall order y z)\n          y\n          (if (funcall order z x)\n              x\n              z))\n      (if (funcall order z y)\n          y\n          (if (funcall order x z)\n              x\n              z))))\n\n(defun quicksort! (vector end)\n  \"Destructively sorts VECTOR w.r.t. ORDER.\"\n  (declare #.OPT\n           ((simple-array list (*)) vector)\n           (uint32 end))\n  (labels\n      ((order (x y)\n         (> (the int32 (car x)) (the int32 (car y))))\n       (recur (left right)\n         (when (< left right)\n           (let* ((l left)\n                  (r right)\n                  (pivot (%median3 (aref vector l)\n                                   (aref vector (ash (+ l r) -1))\n                                   (aref vector r)\n                                   #'order)))\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (loop (loop while (order (aref vector l) pivot)\n                         do (incf l))\n                   (loop while (order pivot (aref vector r))\n                         do (decf r))\n                   (when (>= l r)\n                     (return))\n                   (rotatef (aref vector l) (aref vector r))\n                   (incf l 1)\n                   (decf r 1))\n             (recur left (- l 1))\n             (recur (+ r 1) right)))))\n    (declare (inline order))\n    (recur 0 (- end 1))\n    vector))\n\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (365 26)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (the (simple-array uint32 (365 26)) (state-ss state)))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day :end (aref ends new-type)))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (declare (int32 prev-score new-score)\n           (double-float temp))\n  (if (>= new-score prev-score)\n      1d0\n      (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 1.5d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 10d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (if (zerop (random 4))\n              (let* ((day (random (state-d state)))\n                     (old-type (aref (state-schedule state) day))\n                     (new-type (random 26))\n                     (old-score (state-score state)))\n                (unless (= old-type new-type)\n                  ;; tmp. update\n                  (state-update! state day new-type)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (> new-score opt-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day old-type)))))\n              (let* ((width (+ 1 (random 16)))\n                     (day (random (- (state-d state) width)))\n                     (type1 (aref (state-schedule state) day))\n                     (type2 (aref (state-schedule state) (+ day width)))\n                     (old-score (state-score state)))\n                (unless (= type1 type2)\n                  (state-update! state day type2)\n                  (state-update! state (+ day width) type1)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    ;; (dbg day type1 type2 old-score new-score)\n                    (when (> new-score opt-score)\n                      ;; (dbg new-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day type1)\n                      (state-update! state (+ day width) type2)))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defconstant +beam-width+ 350))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss)\n           ;; (inline sort sb-impl::stable-sort-list)\n           )\n  (let* (;; score schedule prevs\n         (que (make-array #.(* +beam-width+ 26) :element-type 'list))\n         (new-que (make-array #.(* +beam-width+ 26) :element-type 'list))\n         (end 0)\n         (new-end 0))\n    (declare ((simple-array list (*)) que new-que)\n             (uint31 end new-end))\n    (setf (aref que 0)\n          (list* 0 nil (make-array 26 :element-type 'int16 :initial-element -1)))\n    (incf end)\n    (dotimes (i d)\n      (loop for j below (min +beam-width+ end)\n            for (score schedule . prevs)\n            of-type (int32 list . (simple-array int16 (*))) = (aref que j)\n            for base-score of-type int32 = score\n            do (dotimes (type 26)\n                 (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n               (dotimes (type 26)\n                 (let ((new-score (+ base-score\n                                     (aref ss i type)\n                                     (* (aref cs type) (- i (aref prevs type)))))\n                       (new-prevs (copy-seq prevs)))\n                   (setf (aref new-prevs type) i)\n                   (setf (aref new-que new-end)\n                         (list* new-score (cons type schedule) new-prevs))\n                   (incf new-end))))\n      (quicksort! new-que new-end)\n      (rotatef que new-que)\n      (setq end new-end\n            new-end 0))\n    (coerce (reverse (second (aref que 0))) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs #-swank (sb-int:make-static-vector 26)\n             #+swank (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        (let ((result-state (make-state-from d cs ss schedule)))\n          (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n;; #+linux\n;; (eval-when (:compile-toplevel :load-toplevel :execute)\n;;   (require :sb-sprof))\n;; #+linux\n;; (sb-sprof:start-profiling)\n\n#-swank (main)\n\n;; #+linux\n;; (progn\n;;   (sb-sprof:stop-profiling)\n;;   (sb-sprof:report))\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 19687, "cpu_time_ms": 1963, "memory_kb": 88896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s999655073", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (* *)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (state-ss state))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day :end (aref ends new-type)))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (dbg prev-score new-score temp) (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 1.5d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 1d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (if (zerop (random 1))\n              (let* ((day (random (state-d state)))\n                     (old-type (aref (state-schedule state) day))\n                     (new-type (random 26))\n                     (old-score (state-score state)))\n                (unless (= old-type new-type)\n                  ;; tmp. update\n                  (state-update! state day new-type)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (> new-score opt-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score #>new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day old-type)))))\n              (let* ((day (random (- (state-d state) 1)))\n                     (type1 (aref (state-schedule state) day))\n                     (type2 (aref (state-schedule state) (+ day 1)))\n                     (old-score (state-score state)))\n                (unless (= type1 type2)\n                  (state-update! state day type2)\n                  (state-update! state (+ day 1) type1)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (> new-score opt-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day type1)\n                      (state-update! state (+ day 1) type2)))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss)\n           (inline sort sb-impl::stable-sort-list))\n  (let* (;; score schedule prevs\n         que)\n    (push (list* 0 nil (make-array 26 :element-type 'int16 :initial-element -1)) que)\n    (dotimes (i d)\n      (let (new-que)\n        (loop repeat 200\n              for (score schedule . prevs)\n              of-type (int32 list . (simple-array int16 (*))) in que\n              for base-score of-type int32 = score\n              do (dotimes (type 26)\n                   (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n                 (dotimes (type 26)\n                   (let ((new-score (+ base-score\n                                       (aref ss i type)\n                                       (* (aref cs type) (- i (aref prevs type)))))\n                         (new-prevs (copy-seq prevs)))\n                     (setf (aref new-prevs type) i)\n                     (push (list* new-score (cons type schedule) new-prevs) new-que))))\n        (setq que (sort new-que #'> :key (lambda (x) (the int32 (car x)))))))\n    (coerce (reverse (second (first que))) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593650887, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s999655073.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s999655073", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (* *)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (simple-array int16 (*)) (26)))\n  (ends nil :type (simple-array uint16 (*)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(simple-array int16 (*))))\n        (ends (make-array 26 :element-type 'uint16 :initial-element 1)))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16)))\n        (setf (aref history 0) -1)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (setf (aref (aref history-table type) (aref ends type)) i)\n        (incf (aref ends type))))\n    (dotimes (i 26)\n      (setf (aref (aref history-table i) (aref ends i)) d)\n      (incf (aref ends i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :ends ends\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint16 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (state-ss state))\n                    (history-table (state-history-table state))\n                    (ends (state-ends state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day :end (aref ends old-type)))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (loop for i from pos below (aref ends old-type)\n              do (rotatef (aref old-history i) (aref old-history (+ i 1))))\n        (decf (aref ends old-type)))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day :end (aref ends new-type)))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (setf (aref new-history (aref ends new-type)) day)\n        (loop for i from (aref ends new-type) above pos\n              do (rotatef (aref new-history i) (aref new-history (- i 1))))\n        (incf (aref ends new-type)))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (dbg prev-score new-score temp) (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun anneal (state &optional (time 1.5d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 1d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (if (zerop (random 1))\n              (let* ((day (random (state-d state)))\n                     (old-type (aref (state-schedule state) day))\n                     (new-type (random 26))\n                     (old-score (state-score state)))\n                (unless (= old-type new-type)\n                  ;; tmp. update\n                  (state-update! state day new-type)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (> new-score opt-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score #>new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day old-type)))))\n              (let* ((day (random (- (state-d state) 1)))\n                     (type1 (aref (state-schedule state) day))\n                     (type2 (aref (state-schedule state) (+ day 1)))\n                     (old-score (state-score state)))\n                (unless (= type1 type2)\n                  (state-update! state day type2)\n                  (state-update! state (+ day 1) type1)\n                  (let* ((new-score (state-score state))\n                         (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                         (prob (calc-prob old-score new-score temp)))\n                    (declare (double-float temp))\n                    (when (> new-score opt-score)\n                      (setq opt-schedule (copy-seq (state-schedule state))\n                            opt-score new-score))\n                    (when (> (random 1.0) prob)\n                      ;; rollback\n                      (state-update! state day type1)\n                      (state-update! state (+ day 1) type2)))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint16 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss)\n           (inline sort sb-impl::stable-sort-list))\n  (let* (;; score schedule prevs\n         que)\n    (push (list* 0 nil (make-array 26 :element-type 'int16 :initial-element -1)) que)\n    (dotimes (i d)\n      (let (new-que)\n        (loop repeat 200\n              for (score schedule . prevs)\n              of-type (int32 list . (simple-array int16 (*))) in que\n              for base-score of-type int32 = score\n              do (dotimes (type 26)\n                   (decf base-score (* (aref cs type) (- i (aref prevs type)))))\n                 (dotimes (type 26)\n                   (let ((new-score (+ base-score\n                                       (aref ss i type)\n                                       (* (aref cs type) (- i (aref prevs type)))))\n                         (new-prevs (copy-seq prevs)))\n                     (setf (aref new-prevs type) i)\n                     (push (list* new-score (cons type schedule) new-prevs) new-que))))\n        (setq que (sort new-que #'> :key (lambda (x) (the int32 (car x)))))))\n    (coerce (reverse (second (first que))) '(simple-array uint8 (*)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>init-state\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 16991, "cpu_time_ms": 1961, "memory_kb": 83020}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s407576700", "group_id": "codeNet:p02618", "input_text": "(let* ((d-read (read))\n    (c (make-array 27))\n    (s (make-array '(366 27)))\n    (score 0)\n    (max_ 0)\n    (max_contest 0)\n    (last (make-array 27 :initial-element -1)))\n\n    (loop for i from 1 to 26 do\n        (setf (aref c i) (read))\n    )\n    (loop for i from 1 to d-read do\n        (loop for j from 1 to 26 do\n            (setf (aref s i j) (read))\n        )\n    )\n\n    (loop for d from 1 to d-read do\n        (loop for contest from 1 to 26 do\n            (setq score (aref s d contest))\n            (loop for i from 1 to 26 do\n                (if (not (= i contest))\n                (decf score (* (aref c i) (- d (aref last i)))))\n            )\n            (if (or (= contest 1) (> score max_))\n                (progn\n                (setq max_ score)\n                (setq max_contest contest)\n                )\n            )\n        )\n    (setf (aref last max_contest) d)\n    (format t \"~D~%\" max_contest)\n    )\n)", "language": "Lisp", "metadata": {"date": 1593619221, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s407576700.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s407576700", "user_id": "u136500538"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(let* ((d-read (read))\n    (c (make-array 27))\n    (s (make-array '(366 27)))\n    (score 0)\n    (max_ 0)\n    (max_contest 0)\n    (last (make-array 27 :initial-element -1)))\n\n    (loop for i from 1 to 26 do\n        (setf (aref c i) (read))\n    )\n    (loop for i from 1 to d-read do\n        (loop for j from 1 to 26 do\n            (setf (aref s i j) (read))\n        )\n    )\n\n    (loop for d from 1 to d-read do\n        (loop for contest from 1 to 26 do\n            (setq score (aref s d contest))\n            (loop for i from 1 to 26 do\n                (if (not (= i contest))\n                (decf score (* (aref c i) (- d (aref last i)))))\n            )\n            (if (or (= contest 1) (> score max_))\n                (progn\n                (setq max_ score)\n                (setq max_contest contest)\n                )\n            )\n        )\n    (setf (aref last max_contest) d)\n    (format t \"~D~%\" max_contest)\n    )\n)", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 924, "cpu_time_ms": 35, "memory_kb": 29600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s057569957", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline vector-insert))\n(defun vector-insert (vector new-element index)\n  (let ((n (length vector)))\n    (vector-push new-element vector)\n    (loop for i from n above index\n          do (rotatef (aref vector i) (aref vector (- i 1)))))\n  vector)\n\n(declaim (inline vector-delete))\n(defun vector-delete (vector index)\n  (loop for i from index below (- (length vector) 1)\n        do (rotatef (aref vector i) (aref vector (+ i 1))))\n  (vector-pop vector)\n  vector)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (* *)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (array int16 (*)) (26)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(array uint32 (*)))))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16 :fill-pointer 0)))\n        (vector-push -1 history)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (vector-push i (aref history-table type))))\n    (dotimes (i 26)\n      (vector-push d (aref history-table i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint32 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (state-ss state))\n                    (history-table (state-history-table state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (vector-delete old-history pos))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (vector-insert new-history day pos))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (dbg prev-score new-score temp) (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n;; (defun initialize-scores (d cs ss state)\n;;   (declare (fixnum d)\n;;            ((simple-array uint8 (*)) cs state)\n;;            ((simple-array uint32 (* *)) ss))\n;;   (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n;;          (res (make-array 26 :element-type 'int32 :initial-element 0)))\n;;     (dotimes (i d)\n;;       (let ((type (aref state i)))\n;;         (incf (aref res type) (aref ss i type))\n;;         (setf (aref prevs type) i)\n;;         (dotimes (j 26)\n;;           (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n;;     res))\n\n(defun anneal (state &optional (time 1.6d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 1d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (let* ((day (random (state-d state)))\n                 (old-type (aref (state-schedule state) day))\n                 (new-type (random 26))\n                 (old-score (state-score state)))\n            (unless (= old-type new-type)\n              ;; tmp. update\n              (state-update! state day new-type)\n              (let* ((new-score (state-score state))\n                     (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                     (prob (calc-prob old-score new-score temp)))\n                (declare (double-float temp))\n                ;; rollback\n                (when (> new-score opt-score)\n                  (setq opt-schedule (copy-seq (state-schedule state))\n                        opt-score new-score))\n                (when (>= (random 1.0) prob)\n                  ;; rollback\n                  (state-update! state day old-type))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int16 :initial-element -1))\n         (schedule (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i (- d 2))\n      (labels ((%eval (day type)\n                 (declare (uint16 day type))\n                 (let ((value (aref ss day type)))\n                   (declare (fixnum value))\n                   (dotimes (j 26)\n                     (decf value (* (aref cs j) (- day (aref prevs j)))))\n                   value))\n               (%eval-after (day type offset)\n                 (declare (uint16 day type offset))\n                 (let* ((value (aref ss day type))\n                        (end (min d (+ day offset))) ; exclusive\n                        (factor (+ day end -1)))\n                   (declare (uint16 factor)\n                            (int32 value))\n                   (dotimes (j 26)\n                     (let ((l+r (* (aref cs j) (- factor (ash (aref prevs j) 1)))))\n                       (decf value (ash (* l+r (- end day)) -1))))\n                   value)))\n        (let ((max-type1 0)\n              (max-type2 0)\n              (max-type3 0)\n              (max-value most-negative-fixnum))\n          (declare (fixnum max-value))\n          (dotimes (type1 26)\n            (let ((store-i1 (aref prevs type1)))\n              (setf (aref prevs type1) i)\n              (let ((value1 (%eval i type1)))\n                (declare (int32 value1))\n                (dotimes (type2 26)\n                  (let ((store-i2 (aref prevs type2)))\n                    (setf (aref prevs type2) (+ i 1))\n                    (let ((value2 (%eval (+ i 1) type2)))\n                      (declare (int32 value2))\n                      (dotimes (type3 26)\n                        (let ((store-i3 (aref prevs type3)))\n                          (setf (aref prevs type3) (+ i 2))\n                          (let* ((value3 (%eval-after (+ i 2) type3 2)))\n                            (declare (int32 value3))\n                            (let ((value (+ value1 value2 value3)))\n                              (when (> value max-value)\n                                (setq max-type1 type1\n                                      max-type2 type2\n                                      max-type3 type3\n                                      max-value value))))\n                          (setf (aref prevs type3) store-i3))))\n                    (setf (aref prevs type2) store-i2))))\n              (setf (aref prevs type1) store-i1)))\n          (setf (aref prevs max-type1) i\n                (aref schedule i) max-type1)\n          (when (= i (- d 3))\n            (setf (aref prevs max-type2) (+ i 1)\n                  (aref schedule (+ i 1)) max-type2\n                  (aref prevs max-type3) (+ i 2)\n                  (aref schedule (+ i 2)) max-type3)))))\n    schedule))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n\n;; 13132566\n", "language": "Lisp", "metadata": {"date": 1593600058, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s057569957.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s057569957", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline vector-insert))\n(defun vector-insert (vector new-element index)\n  (let ((n (length vector)))\n    (vector-push new-element vector)\n    (loop for i from n above index\n          do (rotatef (aref vector i) (aref vector (- i 1)))))\n  vector)\n\n(declaim (inline vector-delete))\n(defun vector-delete (vector index)\n  (loop for i from index below (- (length vector) 1)\n        do (rotatef (aref vector i) (aref vector (+ i 1))))\n  (vector-pop vector)\n  vector)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (* *)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (array int16 (*)) (26)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(array uint32 (*)))))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16 :fill-pointer 0)))\n        (vector-push -1 history)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (vector-push i (aref history-table type))))\n    (dotimes (i 26)\n      (vector-push d (aref history-table i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint32 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (state-ss state))\n                    (history-table (state-history-table state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (vector-delete old-history pos))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (vector-insert new-history day pos))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (dbg prev-score new-score temp) (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n;; (defun initialize-scores (d cs ss state)\n;;   (declare (fixnum d)\n;;            ((simple-array uint8 (*)) cs state)\n;;            ((simple-array uint32 (* *)) ss))\n;;   (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n;;          (res (make-array 26 :element-type 'int32 :initial-element 0)))\n;;     (dotimes (i d)\n;;       (let ((type (aref state i)))\n;;         (incf (aref res type) (aref ss i type))\n;;         (setf (aref prevs type) i)\n;;         (dotimes (j 26)\n;;           (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n;;     res))\n\n(defun anneal (state &optional (time 1.6d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 1d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (let* ((day (random (state-d state)))\n                 (old-type (aref (state-schedule state) day))\n                 (new-type (random 26))\n                 (old-score (state-score state)))\n            (unless (= old-type new-type)\n              ;; tmp. update\n              (state-update! state day new-type)\n              (let* ((new-score (state-score state))\n                     (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                     (prob (calc-prob old-score new-score temp)))\n                (declare (double-float temp))\n                ;; rollback\n                (when (> new-score opt-score)\n                  (setq opt-schedule (copy-seq (state-schedule state))\n                        opt-score new-score))\n                (when (>= (random 1.0) prob)\n                  ;; rollback\n                  (state-update! state day old-type))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int16 :initial-element -1))\n         (schedule (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i (- d 2))\n      (labels ((%eval (day type)\n                 (declare (uint16 day type))\n                 (let ((value (aref ss day type)))\n                   (declare (fixnum value))\n                   (dotimes (j 26)\n                     (decf value (* (aref cs j) (- day (aref prevs j)))))\n                   value))\n               (%eval-after (day type offset)\n                 (declare (uint16 day type offset))\n                 (let* ((value (aref ss day type))\n                        (end (min d (+ day offset))) ; exclusive\n                        (factor (+ day end -1)))\n                   (declare (uint16 factor)\n                            (int32 value))\n                   (dotimes (j 26)\n                     (let ((l+r (* (aref cs j) (- factor (ash (aref prevs j) 1)))))\n                       (decf value (ash (* l+r (- end day)) -1))))\n                   value)))\n        (let ((max-type1 0)\n              (max-type2 0)\n              (max-type3 0)\n              (max-value most-negative-fixnum))\n          (declare (fixnum max-value))\n          (dotimes (type1 26)\n            (let ((store-i1 (aref prevs type1)))\n              (setf (aref prevs type1) i)\n              (let ((value1 (%eval i type1)))\n                (declare (int32 value1))\n                (dotimes (type2 26)\n                  (let ((store-i2 (aref prevs type2)))\n                    (setf (aref prevs type2) (+ i 1))\n                    (let ((value2 (%eval (+ i 1) type2)))\n                      (declare (int32 value2))\n                      (dotimes (type3 26)\n                        (let ((store-i3 (aref prevs type3)))\n                          (setf (aref prevs type3) (+ i 2))\n                          (let* ((value3 (%eval-after (+ i 2) type3 2)))\n                            (declare (int32 value3))\n                            (let ((value (+ value1 value2 value3)))\n                              (when (> value max-value)\n                                (setq max-type1 type1\n                                      max-type2 type2\n                                      max-type3 type3\n                                      max-value value))))\n                          (setf (aref prevs type3) store-i3))))\n                    (setf (aref prevs type2) store-i2))))\n              (setf (aref prevs type1) store-i1)))\n          (setf (aref prevs max-type1) i\n                (aref schedule i) max-type1)\n          (when (= i (- d 3))\n            (setf (aref prevs max-type2) (+ i 1)\n                  (aref schedule (+ i 1)) max-type2\n                  (aref prevs max-type3) (+ i 2)\n                  (aref schedule (+ i 2)) max-type3)))))\n    schedule))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n\n;; 13132566\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 18004, "cpu_time_ms": 1966, "memory_kb": 49880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s594316168", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline vector-insert))\n(defun vector-insert (vector new-element index)\n  (let ((n (length vector)))\n    (vector-push new-element vector)\n    (loop for i from n above index\n          do (rotatef (aref vector i) (aref vector (- i 1)))))\n  vector)\n\n(declaim (inline vector-delete))\n(defun vector-delete (vector index)\n  (loop for i from index below (- (length vector) 1)\n        do (rotatef (aref vector i) (aref vector (+ i 1))))\n  (vector-pop vector)\n  vector)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (* *)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (array int16 (*)) (26)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(array uint32 (*)))))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16 :fill-pointer 0)))\n        (vector-push -1 history)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (vector-push i (aref history-table type))))\n    (dotimes (i 26)\n      (vector-push d (aref history-table i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint32 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (state-ss state))\n                    (history-table (state-history-table state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (vector-delete old-history pos))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (vector-insert new-history day pos))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (dbg prev-score new-score temp) (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n;; (defun initialize-scores (d cs ss state)\n;;   (declare (fixnum d)\n;;            ((simple-array uint8 (*)) cs state)\n;;            ((simple-array uint32 (* *)) ss))\n;;   (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n;;          (res (make-array 26 :element-type 'int32 :initial-element 0)))\n;;     (dotimes (i d)\n;;       (let ((type (aref state i)))\n;;         (incf (aref res type) (aref ss i type))\n;;         (setf (aref prevs type) i)\n;;         (dotimes (j 26)\n;;           (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n;;     res))\n\n(defun anneal (state &optional (time 1.58d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 1d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (let* ((day (random (state-d state)))\n                 (old-type (aref (state-schedule state) day))\n                 (new-type (random 26))\n                 (old-score (state-score state)))\n            (unless (= old-type new-type)\n              ;; tmp. update\n              (state-update! state day new-type)\n              (let* ((new-score (state-score state))\n                     (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                     (prob (calc-prob old-score new-score temp)))\n                (declare (double-float temp))\n                ;; rollback\n                (when (> new-score opt-score)\n                  (setq opt-schedule (copy-seq (state-schedule state))\n                        opt-score new-score))\n                (when (>= (random 1.0) prob)\n                  ;; rollback\n                  (state-update! state day old-type))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int16 :initial-element -1))\n         (schedule (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i (- d 2))\n      (labels ((%eval (day type)\n                 (declare (uint16 day type))\n                 (let ((value (aref ss day type)))\n                   (declare (fixnum value))\n                   (dotimes (j 26)\n                     (decf value (* (aref cs j) (- day (aref prevs j)))))\n                   value))\n               (%eval-after (day type offset)\n                 (declare (uint16 day type offset))\n                 (let* ((value (aref ss day type))\n                        (end (min d (+ day offset))) ; exclusive\n                        (factor (+ day end -1)))\n                   (declare (uint16 factor)\n                            (int32 value))\n                   (dotimes (j 26)\n                     (let ((l+r (* (aref cs j) (- factor (ash (aref prevs j) 1)))))\n                       (decf value (ash (* l+r (- end day)) -1))))\n                   value)))\n        (let ((max-type1 0)\n              (max-type2 0)\n              (max-type3 0)\n              (max-value most-negative-fixnum))\n          (declare (fixnum max-value))\n          (dotimes (type1 26)\n            (let ((store-i1 (aref prevs type1)))\n              (setf (aref prevs type1) i)\n              (let ((value1 (%eval i type1)))\n                (declare (int32 value1))\n                (dotimes (type2 26)\n                  (let ((store-i2 (aref prevs type2)))\n                    (setf (aref prevs type2) (+ i 1))\n                    (let ((value2 (%eval (+ i 1) type2)))\n                      (declare (int32 value2))\n                      (dotimes (type3 26)\n                        (let ((store-i3 (aref prevs type3)))\n                          (setf (aref prevs type3) (+ i 2))\n                          (let* ((value3 (%eval-after (+ i 2) type3 5)))\n                            (declare (int32 value3))\n                            (let ((value (+ value1 value2 value3)))\n                              (when (> value max-value)\n                                (setq max-type1 type1\n                                      max-type2 type2\n                                      max-type3 type3\n                                      max-value value))))\n                          (setf (aref prevs type3) store-i3))))\n                    (setf (aref prevs type2) store-i2))))\n              (setf (aref prevs type1) store-i1)))\n          (setf (aref prevs max-type1) i\n                (aref schedule i) max-type1)\n          (when (= i (- d 3))\n            (setf (aref prevs max-type2) (+ i 1)\n                  (aref schedule (+ i 1)) max-type2\n                  (aref prevs max-type3) (+ i 2)\n                  (aref schedule (+ i 2)) max-type3)))))\n    schedule))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n\n;; 13132566\n", "language": "Lisp", "metadata": {"date": 1593599752, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s594316168.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s594316168", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline vector-insert))\n(defun vector-insert (vector new-element index)\n  (let ((n (length vector)))\n    (vector-push new-element vector)\n    (loop for i from n above index\n          do (rotatef (aref vector i) (aref vector (- i 1)))))\n  vector)\n\n(declaim (inline vector-delete))\n(defun vector-delete (vector index)\n  (loop for i from index below (- (length vector) 1)\n        do (rotatef (aref vector i) (aref vector (+ i 1))))\n  (vector-pop vector)\n  vector)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (* *)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (array int16 (*)) (26)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(array uint32 (*)))))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16 :fill-pointer 0)))\n        (vector-push -1 history)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (vector-push i (aref history-table type))))\n    (dotimes (i 26)\n      (vector-push d (aref history-table i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint32 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (state-ss state))\n                    (history-table (state-history-table state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (vector-delete old-history pos))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (vector-insert new-history day pos))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (dbg prev-score new-score temp) (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n;; (defun initialize-scores (d cs ss state)\n;;   (declare (fixnum d)\n;;            ((simple-array uint8 (*)) cs state)\n;;            ((simple-array uint32 (* *)) ss))\n;;   (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n;;          (res (make-array 26 :element-type 'int32 :initial-element 0)))\n;;     (dotimes (i d)\n;;       (let ((type (aref state i)))\n;;         (incf (aref res type) (aref ss i type))\n;;         (setf (aref prevs type) i)\n;;         (dotimes (j 26)\n;;           (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n;;     res))\n\n(defun anneal (state &optional (time 1.58d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 1d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (let* ((day (random (state-d state)))\n                 (old-type (aref (state-schedule state) day))\n                 (new-type (random 26))\n                 (old-score (state-score state)))\n            (unless (= old-type new-type)\n              ;; tmp. update\n              (state-update! state day new-type)\n              (let* ((new-score (state-score state))\n                     (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                     (prob (calc-prob old-score new-score temp)))\n                (declare (double-float temp))\n                ;; rollback\n                (when (> new-score opt-score)\n                  (setq opt-schedule (copy-seq (state-schedule state))\n                        opt-score new-score))\n                (when (>= (random 1.0) prob)\n                  ;; rollback\n                  (state-update! state day old-type))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int16 :initial-element -1))\n         (schedule (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i (- d 2))\n      (labels ((%eval (day type)\n                 (declare (uint16 day type))\n                 (let ((value (aref ss day type)))\n                   (declare (fixnum value))\n                   (dotimes (j 26)\n                     (decf value (* (aref cs j) (- day (aref prevs j)))))\n                   value))\n               (%eval-after (day type offset)\n                 (declare (uint16 day type offset))\n                 (let* ((value (aref ss day type))\n                        (end (min d (+ day offset))) ; exclusive\n                        (factor (+ day end -1)))\n                   (declare (uint16 factor)\n                            (int32 value))\n                   (dotimes (j 26)\n                     (let ((l+r (* (aref cs j) (- factor (ash (aref prevs j) 1)))))\n                       (decf value (ash (* l+r (- end day)) -1))))\n                   value)))\n        (let ((max-type1 0)\n              (max-type2 0)\n              (max-type3 0)\n              (max-value most-negative-fixnum))\n          (declare (fixnum max-value))\n          (dotimes (type1 26)\n            (let ((store-i1 (aref prevs type1)))\n              (setf (aref prevs type1) i)\n              (let ((value1 (%eval i type1)))\n                (declare (int32 value1))\n                (dotimes (type2 26)\n                  (let ((store-i2 (aref prevs type2)))\n                    (setf (aref prevs type2) (+ i 1))\n                    (let ((value2 (%eval (+ i 1) type2)))\n                      (declare (int32 value2))\n                      (dotimes (type3 26)\n                        (let ((store-i3 (aref prevs type3)))\n                          (setf (aref prevs type3) (+ i 2))\n                          (let* ((value3 (%eval-after (+ i 2) type3 5)))\n                            (declare (int32 value3))\n                            (let ((value (+ value1 value2 value3)))\n                              (when (> value max-value)\n                                (setq max-type1 type1\n                                      max-type2 type2\n                                      max-type3 type3\n                                      max-value value))))\n                          (setf (aref prevs type3) store-i3))))\n                    (setf (aref prevs type2) store-i2))))\n              (setf (aref prevs type1) store-i1)))\n          (setf (aref prevs max-type1) i\n                (aref schedule i) max-type1)\n          (when (= i (- d 3))\n            (setf (aref prevs max-type2) (+ i 1)\n                  (aref schedule (+ i 1)) max-type2\n                  (aref prevs max-type3) (+ i 2)\n                  (aref schedule (+ i 2)) max-type3)))))\n    schedule))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n\n;; 13132566\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 18005, "cpu_time_ms": 1946, "memory_kb": 49648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s242568804", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline vector-insert))\n(defun vector-insert (vector new-element index)\n  (let ((n (length vector)))\n    (vector-push new-element vector)\n    (loop for i from n above index\n          do (rotatef (aref vector i) (aref vector (- i 1)))))\n  vector)\n\n(declaim (inline vector-delete))\n(defun vector-delete (vector index)\n  (loop for i from index below (- (length vector) 1)\n        do (rotatef (aref vector i) (aref vector (+ i 1))))\n  (vector-pop vector)\n  vector)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (* *)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (array int16 (*)) (26)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(array uint32 (*)))))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16 :fill-pointer 0)))\n        (vector-push -1 history)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (vector-push i (aref history-table type))))\n    (dotimes (i 26)\n      (vector-push d (aref history-table i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint32 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (state-ss state))\n                    (history-table (state-history-table state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (vector-delete old-history pos))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (vector-insert new-history day pos))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (dbg prev-score new-score temp) (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n;; (defun initialize-scores (d cs ss state)\n;;   (declare (fixnum d)\n;;            ((simple-array uint8 (*)) cs state)\n;;            ((simple-array uint32 (* *)) ss))\n;;   (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n;;          (res (make-array 26 :element-type 'int32 :initial-element 0)))\n;;     (dotimes (i d)\n;;       (let ((type (aref state i)))\n;;         (incf (aref res type) (aref ss i type))\n;;         (setf (aref prevs type) i)\n;;         (dotimes (j 26)\n;;           (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n;;     res))\n\n(defun anneal (state &optional (time 1.58d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 1d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (let* ((day (random (state-d state)))\n                 (old-type (aref (state-schedule state) day))\n                 (new-type (random 26))\n                 (old-score (state-score state)))\n            (unless (= old-type new-type)\n              ;; tmp. update\n              (state-update! state day new-type)\n              (let* ((new-score (state-score state))\n                     (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                     (prob (calc-prob old-score new-score temp)))\n                (declare (double-float temp))\n                ;; rollback\n                (when (> new-score opt-score)\n                  (setq opt-schedule (copy-seq (state-schedule state))\n                        opt-score new-score))\n                (when (>= (random 1.0) prob)\n                  ;; rollback\n                  (state-update! state day old-type))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (schedule (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i (- d 2))\n      (labels ((%eval (day type)\n                 (declare (uint16 day type))\n                 (let ((value (aref ss day type)))\n                   (declare (fixnum value))\n                   (dotimes (j 26)\n                     (decf value (* (aref cs j) (- day (aref prevs j)))))\n                   value))\n               (%eval-after (day type offset)\n                 (declare (uint16 day type offset))\n                 (let ((value (aref ss day type))\n                       (end (min d (+ day offset))) ; exclusive\n                       )\n                   (declare (int32 value))\n                   (dotimes (j 26)\n                     (let ((l (* (aref cs j) (- day (aref prevs j))))\n                           (r (* (aref cs j) (- end 1 (aref prevs j)))))\n                       (decf value (ash (* (+ l r) (- end day)) -1))))\n                   value)))\n        (let ((max-type1 0)\n              (max-type2 0)\n              (max-type3 0)\n              (max-value most-negative-fixnum))\n          (declare (fixnum max-value))\n          (dotimes (type1 26)\n            (let ((store-i1 (aref prevs type1)))\n              (setf (aref prevs type1) i)\n              (let ((value1 (%eval i type1)))\n                (declare (int32 value1))\n                (dotimes (type2 26)\n                  (let ((store-i2 (aref prevs type2)))\n                    (setf (aref prevs type2) (+ i 1))\n                    (let ((value2 (%eval (+ i 1) type2)))\n                      (declare (int32 value2))\n                      (dotimes (type3 26)\n                        (let ((store-i3 (aref prevs type3)))\n                          (setf (aref prevs type3) (+ i 2))\n                          (let* ((value3 (%eval-after (+ i 2) type3 5)))\n                            (declare (int32 value3))\n                            (let ((value (+ value1 value2 value3)))\n                              (when (> value max-value)\n                                (setq max-type1 type1\n                                      max-type2 type2\n                                      max-type3 type3\n                                      max-value value))))\n                          (setf (aref prevs type3) store-i3))))\n                    (setf (aref prevs type2) store-i2))))\n              (setf (aref prevs type1) store-i1)))\n          (setf (aref prevs max-type1) i\n                (aref schedule i) max-type1)\n          (when (= i (- d 3))\n            (setf (aref prevs max-type2) (+ i 1)\n                  (aref schedule (+ i 1)) max-type2\n                  (aref prevs max-type3) (+ i 2)\n                  (aref schedule (+ i 2)) max-type3)))))\n    schedule))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n\n;; 13132566\n", "language": "Lisp", "metadata": {"date": 1593599323, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s242568804.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s242568804", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline vector-insert))\n(defun vector-insert (vector new-element index)\n  (let ((n (length vector)))\n    (vector-push new-element vector)\n    (loop for i from n above index\n          do (rotatef (aref vector i) (aref vector (- i 1)))))\n  vector)\n\n(declaim (inline vector-delete))\n(defun vector-delete (vector index)\n  (loop for i from index below (- (length vector) 1)\n        do (rotatef (aref vector i) (aref vector (+ i 1))))\n  (vector-pop vector)\n  vector)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (* *)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (array int16 (*)) (26)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(array uint32 (*)))))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16 :fill-pointer 0)))\n        (vector-push -1 history)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (vector-push i (aref history-table type))))\n    (dotimes (i 26)\n      (vector-push d (aref history-table i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint32 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (state-ss state))\n                    (history-table (state-history-table state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (vector-delete old-history pos))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (vector-insert new-history day pos))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (dbg prev-score new-score temp) (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n;; (defun initialize-scores (d cs ss state)\n;;   (declare (fixnum d)\n;;            ((simple-array uint8 (*)) cs state)\n;;            ((simple-array uint32 (* *)) ss))\n;;   (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n;;          (res (make-array 26 :element-type 'int32 :initial-element 0)))\n;;     (dotimes (i d)\n;;       (let ((type (aref state i)))\n;;         (incf (aref res type) (aref ss i type))\n;;         (setf (aref prevs type) i)\n;;         (dotimes (j 26)\n;;           (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n;;     res))\n\n(defun anneal (state &optional (time 1.58d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 1d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (let* ((day (random (state-d state)))\n                 (old-type (aref (state-schedule state) day))\n                 (new-type (random 26))\n                 (old-score (state-score state)))\n            (unless (= old-type new-type)\n              ;; tmp. update\n              (state-update! state day new-type)\n              (let* ((new-score (state-score state))\n                     (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                     (prob (calc-prob old-score new-score temp)))\n                (declare (double-float temp))\n                ;; rollback\n                (when (> new-score opt-score)\n                  (setq opt-schedule (copy-seq (state-schedule state))\n                        opt-score new-score))\n                (when (>= (random 1.0) prob)\n                  ;; rollback\n                  (state-update! state day old-type))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (365 26)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (schedule (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i (- d 2))\n      (labels ((%eval (day type)\n                 (declare (uint16 day type))\n                 (let ((value (aref ss day type)))\n                   (declare (fixnum value))\n                   (dotimes (j 26)\n                     (decf value (* (aref cs j) (- day (aref prevs j)))))\n                   value))\n               (%eval-after (day type offset)\n                 (declare (uint16 day type offset))\n                 (let ((value (aref ss day type))\n                       (end (min d (+ day offset))) ; exclusive\n                       )\n                   (declare (int32 value))\n                   (dotimes (j 26)\n                     (let ((l (* (aref cs j) (- day (aref prevs j))))\n                           (r (* (aref cs j) (- end 1 (aref prevs j)))))\n                       (decf value (ash (* (+ l r) (- end day)) -1))))\n                   value)))\n        (let ((max-type1 0)\n              (max-type2 0)\n              (max-type3 0)\n              (max-value most-negative-fixnum))\n          (declare (fixnum max-value))\n          (dotimes (type1 26)\n            (let ((store-i1 (aref prevs type1)))\n              (setf (aref prevs type1) i)\n              (let ((value1 (%eval i type1)))\n                (declare (int32 value1))\n                (dotimes (type2 26)\n                  (let ((store-i2 (aref prevs type2)))\n                    (setf (aref prevs type2) (+ i 1))\n                    (let ((value2 (%eval (+ i 1) type2)))\n                      (declare (int32 value2))\n                      (dotimes (type3 26)\n                        (let ((store-i3 (aref prevs type3)))\n                          (setf (aref prevs type3) (+ i 2))\n                          (let* ((value3 (%eval-after (+ i 2) type3 5)))\n                            (declare (int32 value3))\n                            (let ((value (+ value1 value2 value3)))\n                              (when (> value max-value)\n                                (setq max-type1 type1\n                                      max-type2 type2\n                                      max-type3 type3\n                                      max-value value))))\n                          (setf (aref prevs type3) store-i3))))\n                    (setf (aref prevs type2) store-i2))))\n              (setf (aref prevs type1) store-i1)))\n          (setf (aref prevs max-type1) i\n                (aref schedule i) max-type1)\n          (when (= i (- d 3))\n            (setf (aref prevs max-type2) (+ i 1)\n                  (aref schedule (+ i 1)) max-type2\n                  (aref prevs max-type3) (+ i 2)\n                  (aref schedule (+ i 2)) max-type3)))))\n    schedule))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      ;; #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 10\n          do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n\n;; 13132566\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 17998, "cpu_time_ms": 2129, "memory_kb": 50916}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s968967181", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline vector-insert))\n(defun vector-insert (vector new-element index)\n  (let ((n (length vector)))\n    (vector-push new-element vector)\n    (loop for i from n above index\n          do (rotatef (aref vector i) (aref vector (- i 1)))))\n  vector)\n\n(declaim (inline vector-delete))\n(defun vector-delete (vector index)\n  (loop for i from index below (- (length vector) 1)\n        do (rotatef (aref vector i) (aref vector (+ i 1))))\n  (vector-pop vector)\n  vector)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (* *)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (array int16 (*)) (26)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(array uint32 (*)))))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16 :fill-pointer 0)))\n        (vector-push -1 history)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (vector-push i (aref history-table type))))\n    (dotimes (i 26)\n      (vector-push d (aref history-table i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint32 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (state-ss state))\n                    (history-table (state-history-table state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (vector-delete old-history pos))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (vector-insert new-history day pos))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (dbg prev-score new-score temp) (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n;; (defun initialize-scores (d cs ss state)\n;;   (declare (fixnum d)\n;;            ((simple-array uint8 (*)) cs state)\n;;            ((simple-array uint32 (* *)) ss))\n;;   (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n;;          (res (make-array 26 :element-type 'int32 :initial-element 0)))\n;;     (dotimes (i d)\n;;       (let ((type (aref state i)))\n;;         (incf (aref res type) (aref ss i type))\n;;         (setf (aref prevs type) i)\n;;         (dotimes (j 26)\n;;           (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n;;     res))\n\n(defun anneal (state &optional (time 1.6d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 1d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (let* ((day (random (state-d state)))\n                 (old-type (aref (state-schedule state) day))\n                 (new-type (random 26))\n                 (old-score (state-score state)))\n            (unless (= old-type new-type)\n              ;; tmp. update\n              (state-update! state day new-type)\n              (let* ((new-score (state-score state))\n                     (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                     (prob (calc-prob old-score new-score temp)))\n                (declare (double-float temp))\n                ;; rollback\n                (when (> new-score opt-score)\n                  (setq opt-schedule (copy-seq (state-schedule state))\n                        opt-score new-score))\n                (when (>= (random 1.0) prob)\n                  ;; rollback\n                  (state-update! state day old-type))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (schedule (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i (- d 2))\n      (labels ((%eval (day type)\n                 (declare (uint31 day type))\n                 (let ((value (aref ss day type)))\n                   (declare (fixnum value))\n                   (dotimes (j 26)\n                     (unless (= j type)\n                       (decf value (* (aref cs j) (- day (aref prevs j))))))\n                   value))\n               ;; (%eval-after (day offset)\n               ;;   (let ((value 0)\n               ;;         (start day)\n               ;;         (end (min (+ day offset -1) (- d 1)))) ;; inclusive\n               ;;     (declare (fixnum value))\n               ;;     (if (> start end)\n               ;;         0\n               ;;         (dotimes (j 26 value)\n               ;;           (let ((l (* (aref cs j) (- start (aref prevs j))))\n               ;;                 (r (* (aref cs j) (- end (aref prevs j)))))\n               ;;             (declare (int32 l r))\n               ;;             (decf value (floor (the uint32 (* (+ l r) (+ 1 (- end start))))\n               ;;                                2)))))))\n               )\n        (let ((max-type1 0)\n              (max-type2 0)\n              (max-type3 0)\n              (max-value most-negative-fixnum))\n          (declare (fixnum max-value))\n          (dotimes (type1 26)\n            (let ((value1 (%eval i type1))\n                  (store-i1 (aref prevs type1)))\n              (declare (int32 value1))\n              (setf (aref prevs type1) i)\n              (dotimes (type2 26)\n                (let ((value2 (%eval (+ i 1) type2))\n                      (store-i2 (aref prevs type2)))\n                  (declare (int32 value2))\n                  (setf (aref prevs type2) (+ i 1))\n                  (dotimes (type3 26)\n                    (let* ((value3 (%eval (+ i 2) type3))\n                           ;; (store-i3 (aref prevs type3))\n                           )\n                      (declare (int32 value3))\n                      ;; (setf (aref prevs type3) (+ i 2))\n                      (let ((value (+ value1 value2 value3 ;; (%eval-after (+ i 3) 4)\n                                      )))\n                        (when (> value max-value)\n                          (setq max-type1 type1\n                                max-type2 type2\n                                max-type3 type3\n                                max-value value)))\n                      ;; (setf (aref prevs type3) store-i3)\n                      ))\n                  (setf (aref prevs type2) store-i2)))\n              (setf (aref prevs type1) store-i1)))\n          (setf (aref prevs max-type1) i\n                (aref schedule i) max-type1)\n          (when (= i (- d 3))\n            (setf (aref prevs max-type2) (+ i 1)\n                  (aref schedule (+ i 1)) max-type2\n                  (aref prevs max-type3) (+ i 2)\n                  (aref schedule (+ i 2)) max-type3)))))\n    schedule))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 5\n          ;; do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "language": "Lisp", "metadata": {"date": 1593595455, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s968967181.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s968967181", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-left (ng ok)\n                 ;; TARGET[OK] >= VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order (funcall key (,accessor target mid)) value)\n                           (%bisect-left mid ok)\n                           (%bisect-left ng mid))))))\n            (assert (<= start end))\n            (%bisect-left (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(labels\n              ((%bisect-right (ng ok)\n                 ;; TARGET[OK] > VALUE always holds (assuming\n                 ;; TARGET[END] = +infinity)\n                 ,@(when declaration (list declaration))\n                 (if (<= (- ok ng) 1)\n                     ok\n                     (let ((mid (ash (+ ng ok) -1)))\n                       (if (funcall order value (funcall key (,accessor target mid)))\n                           (%bisect-right ng mid)\n                           (%bisect-right mid ok))))))\n            (assert (<= start end))\n            (%bisect-right (- start 1) end))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline vector-insert))\n(defun vector-insert (vector new-element index)\n  (let ((n (length vector)))\n    (vector-push new-element vector)\n    (loop for i from n above index\n          do (rotatef (aref vector i) (aref vector (- i 1)))))\n  vector)\n\n(declaim (inline vector-delete))\n(defun vector-delete (vector index)\n  (loop for i from index below (- (length vector) 1)\n        do (rotatef (aref vector i) (aref vector (+ i 1))))\n  (vector-pop vector)\n  vector)\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n\n(defstruct state\n  (d 0 :type uint16)\n  (cs nil :type (simple-array uint8 (*)))\n  (ss nil :type (simple-array uint32 (* *)))\n  (schedule nil :type (simple-array uint8 (*)))\n  (history-table nil :type (simple-array (array int16 (*)) (26)))\n  (score 0 :type fixnum))\n\n(defun make-state-from (d cs ss schedule)\n  (declare (uint32 d)\n           ((simple-array uint8 (*)) cs schedule)\n           ((simple-array uint32 (* *)) ss))\n  (let ((history-table (make-array 26 :element-type '(array uint32 (*)))))\n    (dotimes (i 26)\n      (let ((history (make-array (+ d 2) :element-type 'int16 :fill-pointer 0)))\n        (vector-push -1 history)\n        (setf (aref history-table i) history)))\n    (dotimes (i d)\n      (let ((type (aref schedule i)))\n        (vector-push i (aref history-table type))))\n    (dotimes (i 26)\n      (vector-push d (aref history-table i)))\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (score 0))\n      (declare (fixnum score))\n      (dotimes (i d)\n        (let ((type (aref schedule i)))\n          (incf score (aref ss i type))\n          (setf (aref prevs type) i)\n          (dotimes (j 26)\n            (decf score (* (aref cs j) (- i (aref prevs j)))))))\n      (make-state :d d\n                  :cs cs\n                  :ss ss\n                  :schedule schedule\n                  :history-table history-table\n                  :score score))))\n\n(defun state-update! (state day new-type)\n  (declare #.OPT\n           (uint32 day new-type))\n  (symbol-macrolet ((score (state-score state))\n                    (cs (state-cs state))\n                    (ss (state-ss state))\n                    (history-table (state-history-table state)))\n    (let* ((old-type (aref (state-schedule state) day))\n           (old-history (aref history-table old-type))\n           (new-history (aref history-table new-type)))\n      (declare ((array int16 (*)) old-history new-history))\n      ;; delete old type\n      (decf score (aref ss day old-type))\n      (let* ((pos (bisect-left old-history day))\n             (prev-day (aref old-history (- pos 1)))\n             (next-day (aref old-history (+ pos 1))))\n        ;; (assert (= day (aref old-history pos)))\n        (decf score (* (aref cs old-type) (- day prev-day) (- next-day day)))\n        (vector-delete old-history pos))\n      ;; add new type \n      (incf score (aref ss day new-type))\n      (let* ((pos (bisect-left new-history day))\n             (next-day (aref new-history pos))\n             (prev-day (aref new-history (- pos 1))))\n        ;; (assert (< day (aref new-history pos)))\n        (incf score (* (aref cs new-type) (- day prev-day) (- next-day day)))\n        (vector-insert new-history day pos))\n      (setf (state-score state) score)\n      (setf (aref (state-schedule state) day) new-type)\n      state)))\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (dbg prev-score new-score temp) (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n;; (defun initialize-scores (d cs ss state)\n;;   (declare (fixnum d)\n;;            ((simple-array uint8 (*)) cs state)\n;;            ((simple-array uint32 (* *)) ss))\n;;   (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n;;          (res (make-array 26 :element-type 'int32 :initial-element 0)))\n;;     (dotimes (i d)\n;;       (let ((type (aref state i)))\n;;         (incf (aref res type) (aref ss i type))\n;;         (setf (aref prevs type) i)\n;;         (dotimes (j 26)\n;;           (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n;;     res))\n\n(defun anneal (state &optional (time 1.6d0))\n  (declare #.OPT\n           (double-float time))\n  (let* ((opt-schedule (copy-seq (state-schedule state)))\n         (opt-score (state-score state))\n         (start-temp 1000d0)\n         (end-temp 1d0)\n         (loop-count 0))\n    (declare (fixnum loop-count opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop\n        (incf loop-count)\n        (let ((rem-time (float (rem-time) 1d0)))\n          (when (zerop rem-time)\n            (return))\n          (let* ((day (random (state-d state)))\n                 (old-type (aref (state-schedule state) day))\n                 (new-type (random 26))\n                 (old-score (state-score state)))\n            (unless (= old-type new-type)\n              ;; tmp. update\n              (state-update! state day new-type)\n              (let* ((new-score (state-score state))\n                     (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                     (prob (calc-prob old-score new-score temp)))\n                (declare (double-float temp))\n                ;; rollback\n                (when (> new-score opt-score)\n                  (setq opt-schedule (copy-seq (state-schedule state))\n                        opt-score new-score))\n                (when (>= (random 1.0) prob)\n                  ;; rollback\n                  (state-update! state day old-type))))))))\n    #>loop-count\n    (values opt-schedule opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun make-initial-schedule (d cs ss)\n  (declare #.OPT\n           (uint32 d)\n           ((simple-array uint8 (*)) cs)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (schedule (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i (- d 2))\n      (labels ((%eval (day type)\n                 (declare (uint31 day type))\n                 (let ((value (aref ss day type)))\n                   (declare (fixnum value))\n                   (dotimes (j 26)\n                     (unless (= j type)\n                       (decf value (* (aref cs j) (- day (aref prevs j))))))\n                   value))\n               ;; (%eval-after (day offset)\n               ;;   (let ((value 0)\n               ;;         (start day)\n               ;;         (end (min (+ day offset -1) (- d 1)))) ;; inclusive\n               ;;     (declare (fixnum value))\n               ;;     (if (> start end)\n               ;;         0\n               ;;         (dotimes (j 26 value)\n               ;;           (let ((l (* (aref cs j) (- start (aref prevs j))))\n               ;;                 (r (* (aref cs j) (- end (aref prevs j)))))\n               ;;             (declare (int32 l r))\n               ;;             (decf value (floor (the uint32 (* (+ l r) (+ 1 (- end start))))\n               ;;                                2)))))))\n               )\n        (let ((max-type1 0)\n              (max-type2 0)\n              (max-type3 0)\n              (max-value most-negative-fixnum))\n          (declare (fixnum max-value))\n          (dotimes (type1 26)\n            (let ((value1 (%eval i type1))\n                  (store-i1 (aref prevs type1)))\n              (declare (int32 value1))\n              (setf (aref prevs type1) i)\n              (dotimes (type2 26)\n                (let ((value2 (%eval (+ i 1) type2))\n                      (store-i2 (aref prevs type2)))\n                  (declare (int32 value2))\n                  (setf (aref prevs type2) (+ i 1))\n                  (dotimes (type3 26)\n                    (let* ((value3 (%eval (+ i 2) type3))\n                           ;; (store-i3 (aref prevs type3))\n                           )\n                      (declare (int32 value3))\n                      ;; (setf (aref prevs type3) (+ i 2))\n                      (let ((value (+ value1 value2 value3 ;; (%eval-after (+ i 3) 4)\n                                      )))\n                        (when (> value max-value)\n                          (setq max-type1 type1\n                                max-type2 type2\n                                max-type3 type3\n                                max-value value)))\n                      ;; (setf (aref prevs type3) store-i3)\n                      ))\n                  (setf (aref prevs type2) store-i2)))\n              (setf (aref prevs type1) store-i1)))\n          (setf (aref prevs max-type1) i\n                (aref schedule i) max-type1)\n          (when (= i (- d 3))\n            (setf (aref prevs max-type2) (+ i 1)\n                  (aref schedule (+ i 1)) max-type2\n                  (aref prevs max-type3) (+ i 2)\n                  (aref schedule (+ i 2)) max-type3)))))\n    schedule))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((init-schedule (make-initial-schedule d cs ss))\n           (init-state (make-state-from d cs ss init-schedule)))\n      #>(state-score init-state)\n      ;; (print* init-state)\n      ;; (loop for x across (initialize-scores d cs ss init-state) sum x)\n      (multiple-value-bind (schedule score) (anneal init-state)\n        ;; (let ((result-state (make-state-from d cs ss schedule)))\n        ;;   (assert (= score (state-score result-state))))\n        (print* schedule)\n        score))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat (seed)\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (let ((state (seed-random-state seed)))\n      (format out \"365~%\")\n      (dotimes (i 26)\n        (println (random 101 state) out))\n      (dotimes (i 365)\n        (dotimes (j 26)\n          (println (random 20001 state) out))))))\n\n#+swank\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop for i below 5\n          ;; do (gen-dat i)\n          sum #>(run *dat-pathname*))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 18179, "cpu_time_ms": 1953, "memory_kb": 49852}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s696029981", "group_id": "codeNet:p02618", "input_text": "(let* ((c (make-array 27 :element-type 'uint8))\n    (s (make-array '(366 27) :element-type 'uint32))\n    (td 0)\n    (ans 0)\n    (last (make-array '(27) :initial-element 0 :element-type 'uint32)))\n\n    (loop for i from 1 to 26 do\n        (setf (aref c i) (read))\n    )\n    (loop for i from 1 to 365 do\n        (loop for j from 1 to 26 do\n            (setf (aref s i j) (read))\n        )\n    )\n    (loop for d from 1 to 365 do\n        (let ((x 1))\n            (loop for i from 2 to 26 do\n                (if (<= (aref s d x) (aref s d i))\n                (setq x i)\n                )\n            )\n            (setq td x)\n            (setf (aref last td) d)\n            (incf ans (aref s d td))\n            (loop for j from 1 to 26 do\n                (decf ans (* (aref c j) (- d (aref last j))))\n            )\n            (format t \"~D~%\" x)\n        )\n    )\n)", "language": "Lisp", "metadata": {"date": 1593477292, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s696029981.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s696029981", "user_id": "u136500538"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(let* ((c (make-array 27 :element-type 'uint8))\n    (s (make-array '(366 27) :element-type 'uint32))\n    (td 0)\n    (ans 0)\n    (last (make-array '(27) :initial-element 0 :element-type 'uint32)))\n\n    (loop for i from 1 to 26 do\n        (setf (aref c i) (read))\n    )\n    (loop for i from 1 to 365 do\n        (loop for j from 1 to 26 do\n            (setf (aref s i j) (read))\n        )\n    )\n    (loop for d from 1 to 365 do\n        (let ((x 1))\n            (loop for i from 2 to 26 do\n                (if (<= (aref s d x) (aref s d i))\n                (setq x i)\n                )\n            )\n            (setq td x)\n            (setf (aref last td) d)\n            (incf ans (aref s d td))\n            (loop for j from 1 to 26 do\n                (decf ans (* (aref c j) (- d (aref last j))))\n            )\n            (format t \"~D~%\" x)\n        )\n    )\n)", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 858, "cpu_time_ms": 34, "memory_kb": 29660}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s986390055", "group_id": "codeNet:p02618", "input_text": "(let* ((d-read (read))\n    (c (make-array 27))\n    (s (make-array (list (+ d-read 1) 27)))\n    (td 0)\n    (ans 0)\n    (last (make-array '(27) :initial-element 0)))\n\n    (loop for i from 1 to 26 do\n        (setf (aref c i) (read))\n    )\n    (loop for i from 1 to d-read do\n        (loop for j from 1 to 26 do\n            (setf (aref s i j) (read))\n        )\n    )\n    (loop for d from 1 to d-read do\n        (let ((x 1))\n            (loop for i from 2 to 26 do\n                (if (<= (aref s d x) (aref s d i))\n                (setq x i)\n                )\n            )\n            (setq td x)\n            (setf (aref last td) d)\n            (incf ans (aref s d td))\n            (loop for j from 1 to 26 do\n                (decf ans (* (aref c j) (- d (aref last j))))\n            )\n            (format t \"~D~%\" x)\n        )\n    )\n)", "language": "Lisp", "metadata": {"date": 1593442809, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s986390055.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s986390055", "user_id": "u136500538"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(let* ((d-read (read))\n    (c (make-array 27))\n    (s (make-array (list (+ d-read 1) 27)))\n    (td 0)\n    (ans 0)\n    (last (make-array '(27) :initial-element 0)))\n\n    (loop for i from 1 to 26 do\n        (setf (aref c i) (read))\n    )\n    (loop for i from 1 to d-read do\n        (loop for j from 1 to 26 do\n            (setf (aref s i j) (read))\n        )\n    )\n    (loop for d from 1 to d-read do\n        (let ((x 1))\n            (loop for i from 2 to 26 do\n                (if (<= (aref s d x) (aref s d i))\n                (setq x i)\n                )\n            )\n            (setq td x)\n            (setf (aref last td) d)\n            (incf ans (aref s d td))\n            (loop for j from 1 to 26 do\n                (decf ans (* (aref c j) (- d (aref last j))))\n            )\n            (format t \"~D~%\" x)\n        )\n    )\n)", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 832, "cpu_time_ms": 33, "memory_kb": 29600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s159628563", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (uint31 d)\n           (fixnum old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (365 26)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss init-state &optional (time 1.6d0))\n  (declare #.OPT\n           (double-float time)\n           (uint32 d)\n           ((simple-array uint8 (*)) cs init-state)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq init-state))\n           (scores (initialize-scores d cs ss state))\n           (score (calc scores))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score score))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (progn\n                        (setf (aref state day) old-type)\n                        (update-scores! d cs ss state scores new-type old-type)))))))))\n      #>loop-count\n      (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array '(365 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (init-state (make-array d :element-type 'uint8 :initial-element 0)))\n      (dotimes (i (- d 2))\n        (labels ((%eval (day type)\n                   (let ((value (aref ss day type)))\n                     (declare (fixnum value))\n                     (dotimes (j 26)\n                       (unless (= j type)\n                         (decf value (* (aref cs j) (- day (aref prevs j))))))\n                     value)))\n          (let ((max-type1 0)\n                (max-type2 0)\n                (max-type3 0)\n                (max-value most-negative-fixnum))\n            (declare (fixnum max-value))\n            (dotimes (type1 26)\n              (let ((value1 (%eval i type1))\n                    (store-i1 (aref prevs type1)))\n                (declare (int32 value1))\n                (setf (aref prevs type1) i)\n                (dotimes (type2 26)\n                  (let ((value2 (%eval (+ i 1) type2))\n                        (store-i2 (aref prevs type2)))\n                    (declare (int32 value2))\n                    (setf (aref prevs type2) (+ i 1))\n                    (dotimes (type3 26)\n                      (let ((value3 (%eval (+ i 2) type3)))\n                        (declare (int32 value3))\n                        (when (> (+ value1 value2 value3) max-value)\n                          (setq max-type1 type1\n                                max-type2 type2\n                                max-type3 type3\n                                max-value (+ value1 value2 value3)))))\n                    (setf (aref prevs type2) store-i2)))\n                (setf (aref prevs type1) store-i1)))\n            (setf (aref prevs max-type1) i\n                  (aref init-state i) max-type1)\n            (when (= i (- d 3))\n              (setf (aref prevs max-type2) (+ i 1)\n                    (aref init-state (+ i 1)) max-type2\n                    (aref prevs max-type3) (+ i 2)\n                    (aref init-state (+ i 2)) max-type3)))))\n      (multiple-value-bind (state scores) (solve d cs ss init-state)\n        (print* state)\n        (loop for x across scores sum x)))))\n\n#-swank (main)\n\n;; (defun bench ()\n;;   (let ((*random-state* (seed-random-state 0)))\n;;     (loop repeat 5\n;;           sum #>(run *dat-pathname*))))\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n", "language": "Lisp", "metadata": {"date": 1593411469, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s159628563.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s159628563", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (uint31 d)\n           (fixnum old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (365 26)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss init-state &optional (time 1.6d0))\n  (declare #.OPT\n           (double-float time)\n           (uint32 d)\n           ((simple-array uint8 (*)) cs init-state)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq init-state))\n           (scores (initialize-scores d cs ss state))\n           (score (calc scores))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score score))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (progn\n                        (setf (aref state day) old-type)\n                        (update-scores! d cs ss state scores new-type old-type)))))))))\n      #>loop-count\n      (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array '(365 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (init-state (make-array d :element-type 'uint8 :initial-element 0)))\n      (dotimes (i (- d 2))\n        (labels ((%eval (day type)\n                   (let ((value (aref ss day type)))\n                     (declare (fixnum value))\n                     (dotimes (j 26)\n                       (unless (= j type)\n                         (decf value (* (aref cs j) (- day (aref prevs j))))))\n                     value)))\n          (let ((max-type1 0)\n                (max-type2 0)\n                (max-type3 0)\n                (max-value most-negative-fixnum))\n            (declare (fixnum max-value))\n            (dotimes (type1 26)\n              (let ((value1 (%eval i type1))\n                    (store-i1 (aref prevs type1)))\n                (declare (int32 value1))\n                (setf (aref prevs type1) i)\n                (dotimes (type2 26)\n                  (let ((value2 (%eval (+ i 1) type2))\n                        (store-i2 (aref prevs type2)))\n                    (declare (int32 value2))\n                    (setf (aref prevs type2) (+ i 1))\n                    (dotimes (type3 26)\n                      (let ((value3 (%eval (+ i 2) type3)))\n                        (declare (int32 value3))\n                        (when (> (+ value1 value2 value3) max-value)\n                          (setq max-type1 type1\n                                max-type2 type2\n                                max-type3 type3\n                                max-value (+ value1 value2 value3)))))\n                    (setf (aref prevs type2) store-i2)))\n                (setf (aref prevs type1) store-i1)))\n            (setf (aref prevs max-type1) i\n                  (aref init-state i) max-type1)\n            (when (= i (- d 3))\n              (setf (aref prevs max-type2) (+ i 1)\n                    (aref init-state (+ i 1)) max-type2\n                    (aref prevs max-type3) (+ i 2)\n                    (aref init-state (+ i 2)) max-type3)))))\n      (multiple-value-bind (state scores) (solve d cs ss init-state)\n        (print* state)\n        (loop for x across scores sum x)))))\n\n#-swank (main)\n\n;; (defun bench ()\n;;   (let ((*random-state* (seed-random-state 0)))\n;;     (loop repeat 5\n;;           sum #>(run *dat-pathname*))))\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 11421, "cpu_time_ms": 1918, "memory_kb": 35252}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s001356769", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (uint31 d)\n           (fixnum old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (365 26)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss init-state &optional (time 1.5d0))\n  (declare #.OPT\n           (double-float time)\n           (uint32 d)\n           ((simple-array uint8 (*)) cs init-state)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq init-state))\n           (scores (initialize-scores d cs ss state))\n           (score (calc scores))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score score))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (progn\n                        (setf (aref state day) old-type)\n                        (update-scores! d cs ss state scores new-type old-type)))))))))\n      #>loop-count\n      (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array '(365 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (init-state (make-array d :element-type 'uint8 :initial-element 0)))\n      (dotimes (i (- d 2))\n        (labels ((%eval (day type)\n                   (let ((value (aref ss day type)))\n                     (declare (fixnum value))\n                     (dotimes (j 26)\n                       (unless (= j type)\n                         (decf value (* (aref cs j) (- day (aref prevs j))))))\n                     value)))\n          (let ((max-type1 0)\n                (max-type2 0)\n                (max-type3 0)\n                (max-value most-negative-fixnum))\n            (declare (fixnum max-value))\n            (dotimes (type1 26)\n              (let ((value1 (%eval i type1))\n                    (store-i1 (aref prevs type1)))\n                (setf (aref prevs type1) i)\n                (dotimes (type2 26)\n                  (let ((value2 (%eval (+ i 1) type2))\n                        (store-i2 (aref prevs type2)))\n                    (setf (aref prevs type2) (+ i 1))\n                    (dotimes (type3 26)\n                      (let ((value3 (%eval (+ i 2) type3)))\n                        (when (> (+ value1 value2 value3) max-value)\n                          (setq max-type1 type1\n                                max-type2 type2\n                                max-type3 type3\n                                max-value (+ value1 value2 value3)))))\n                    (setf (aref prevs type2) store-i2)))\n                (setf (aref prevs type1) store-i1)))\n            (setf (aref prevs max-type1) i\n                  (aref init-state i) max-type1)\n            (when (= i (- d 3))\n              (setf (aref prevs max-type2) (+ i 1)\n                    (aref init-state (+ i 1)) max-type2\n                    (aref prevs max-type3) (+ i 2)\n                    (aref init-state (+ i 2)) max-type3)))))\n      (multiple-value-bind (state scores) (solve d cs ss init-state)\n        (print* state)\n        (loop for x across scores sum x)))))\n\n#-swank (main)\n\n;; (defun bench ()\n;;   (let ((*random-state* (seed-random-state 0)))\n;;     (loop repeat 5\n;;           sum #>(run *dat-pathname*))))\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n", "language": "Lisp", "metadata": {"date": 1593399530, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s001356769.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s001356769", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (uint31 d)\n           (fixnum old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (365 26)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss init-state &optional (time 1.5d0))\n  (declare #.OPT\n           (double-float time)\n           (uint32 d)\n           ((simple-array uint8 (*)) cs init-state)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq init-state))\n           (scores (initialize-scores d cs ss state))\n           (score (calc scores))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score score))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (progn\n                        (setf (aref state day) old-type)\n                        (update-scores! d cs ss state scores new-type old-type)))))))))\n      #>loop-count\n      (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array '(365 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (init-state (make-array d :element-type 'uint8 :initial-element 0)))\n      (dotimes (i (- d 2))\n        (labels ((%eval (day type)\n                   (let ((value (aref ss day type)))\n                     (declare (fixnum value))\n                     (dotimes (j 26)\n                       (unless (= j type)\n                         (decf value (* (aref cs j) (- day (aref prevs j))))))\n                     value)))\n          (let ((max-type1 0)\n                (max-type2 0)\n                (max-type3 0)\n                (max-value most-negative-fixnum))\n            (declare (fixnum max-value))\n            (dotimes (type1 26)\n              (let ((value1 (%eval i type1))\n                    (store-i1 (aref prevs type1)))\n                (setf (aref prevs type1) i)\n                (dotimes (type2 26)\n                  (let ((value2 (%eval (+ i 1) type2))\n                        (store-i2 (aref prevs type2)))\n                    (setf (aref prevs type2) (+ i 1))\n                    (dotimes (type3 26)\n                      (let ((value3 (%eval (+ i 2) type3)))\n                        (when (> (+ value1 value2 value3) max-value)\n                          (setq max-type1 type1\n                                max-type2 type2\n                                max-type3 type3\n                                max-value (+ value1 value2 value3)))))\n                    (setf (aref prevs type2) store-i2)))\n                (setf (aref prevs type1) store-i1)))\n            (setf (aref prevs max-type1) i\n                  (aref init-state i) max-type1)\n            (when (= i (- d 3))\n              (setf (aref prevs max-type2) (+ i 1)\n                    (aref init-state (+ i 1)) max-type2\n                    (aref prevs max-type3) (+ i 2)\n                    (aref init-state (+ i 2)) max-type3)))))\n      (multiple-value-bind (state scores) (solve d cs ss init-state)\n        (print* state)\n        (loop for x across scores sum x)))))\n\n#-swank (main)\n\n;; (defun bench ()\n;;   (let ((*random-state* (seed-random-state 0)))\n;;     (loop repeat 5\n;;           sum #>(run *dat-pathname*))))\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 11286, "cpu_time_ms": 1851, "memory_kb": 34468}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s587389109", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (uint31 d)\n           (fixnum old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (365 26)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss init-state &optional (time 1.93d0))\n  (declare #.OPT\n           (double-float time)\n           (uint32 d)\n           ((simple-array uint8 (*)) cs init-state)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq init-state))\n           (scores (initialize-scores d cs ss state))\n           (score (calc scores))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score score))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (progn\n                        (setf (aref state day) old-type)\n                        (update-scores! d cs ss state scores new-type old-type)))))))))\n      #>loop-count\n      (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (init-state (make-array d :element-type 'uint8 :initial-element 0)))\n      (dotimes (i (- d 1))\n        (labels ((%eval (day type)\n                   (let ((value (aref ss day type)))\n                     (dotimes (j 26)\n                       (unless (= j type)\n                         (decf value (* (aref cs j) (- day (aref prevs j))))))\n                     value)))\n          (let ((max-type1 0)\n                (max-type2 0)\n                (max-value most-negative-fixnum))\n            (dotimes (type1 26)\n              (let ((value1 (%eval i type1))\n                    (store-i (aref prevs type1)))\n                (setf (aref prevs type1) i)\n                (dotimes (type2 26)\n                  (let ((value2 (%eval (+ i 1) type2)))\n                    (when (> (+ value1 value2) max-value)\n                      (setq max-type1 type1\n                            max-type2 type2\n                            max-value (+ value1 value2)))))\n                (setf (aref prevs type1) store-i)))\n            (setf (aref prevs max-type1) i\n                  (aref init-state i) max-type1)\n            (when (= i (- d 2))\n              (setf (aref prevs max-type2) (+ i 1)\n                    (aref init-state (+ i 1)) max-type2)))))\n      (multiple-value-bind (state scores) (solve d cs ss init-state)\n        (print* state)\n        (loop for x across scores sum x)))))\n\n#-swank (main)\n\n;; (defun bench ()\n;;   (let ((*random-state* (seed-random-state 0)))\n;;     (loop repeat 5\n;;           sum #>(run *dat-pathname*))))\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n", "language": "Lisp", "metadata": {"date": 1593399182, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s587389109.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s587389109", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (uint31 d)\n           (fixnum old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (365 26)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss init-state &optional (time 1.93d0))\n  (declare #.OPT\n           (double-float time)\n           (uint32 d)\n           ((simple-array uint8 (*)) cs init-state)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq init-state))\n           (scores (initialize-scores d cs ss state))\n           (score (calc scores))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score score))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (progn\n                        (setf (aref state day) old-type)\n                        (update-scores! d cs ss state scores new-type old-type)))))))))\n      #>loop-count\n      (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n           (init-state (make-array d :element-type 'uint8 :initial-element 0)))\n      (dotimes (i (- d 1))\n        (labels ((%eval (day type)\n                   (let ((value (aref ss day type)))\n                     (dotimes (j 26)\n                       (unless (= j type)\n                         (decf value (* (aref cs j) (- day (aref prevs j))))))\n                     value)))\n          (let ((max-type1 0)\n                (max-type2 0)\n                (max-value most-negative-fixnum))\n            (dotimes (type1 26)\n              (let ((value1 (%eval i type1))\n                    (store-i (aref prevs type1)))\n                (setf (aref prevs type1) i)\n                (dotimes (type2 26)\n                  (let ((value2 (%eval (+ i 1) type2)))\n                    (when (> (+ value1 value2) max-value)\n                      (setq max-type1 type1\n                            max-type2 type2\n                            max-value (+ value1 value2)))))\n                (setf (aref prevs type1) store-i)))\n            (setf (aref prevs max-type1) i\n                  (aref init-state i) max-type1)\n            (when (= i (- d 2))\n              (setf (aref prevs max-type2) (+ i 1)\n                    (aref init-state (+ i 1)) max-type2)))))\n      (multiple-value-bind (state scores) (solve d cs ss init-state)\n        (print* state)\n        (loop for x across scores sum x)))))\n\n#-swank (main)\n\n;; (defun bench ()\n;;   (let ((*random-state* (seed-random-state 0)))\n;;     (loop repeat 5\n;;           sum #>(run *dat-pathname*))))\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 10702, "cpu_time_ms": 1983, "memory_kb": 36880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s139635122", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (uint31 d)\n           (fixnum old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (365 26)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss max-types &optional (time 1.93d0))\n  (declare #.OPT\n           (double-float time)\n           (uint32 d)\n           ((simple-array uint8 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq max-types))\n           (scores (initialize-scores d cs ss state))\n           (score (calc scores))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score score))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (progn\n                        (setf (aref state day) old-type)\n                        (update-scores! d cs ss state scores new-type old-type)))))))))\n      #>loop-count\n      ;; (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (multiple-value-bind (state scores) (solve d cs ss max-types)\n      (print* state)\n      (loop for x across scores sum x))))\n\n#-swank (main)\n\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop repeat 5\n          sum #>(run *dat-pathname*))))\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n", "language": "Lisp", "metadata": {"date": 1593398339, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s139635122.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s139635122", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (uint31 d)\n           (fixnum old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (365 26)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss max-types &optional (time 1.93d0))\n  (declare #.OPT\n           (double-float time)\n           (uint32 d)\n           ((simple-array uint8 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq max-types))\n           (scores (initialize-scores d cs ss state))\n           (score (calc scores))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score score))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (progn\n                        (setf (aref state day) old-type)\n                        (update-scores! d cs ss state scores new-type old-type)))))))))\n      #>loop-count\n      ;; (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (multiple-value-bind (state scores) (solve d cs ss max-types)\n      (print* state)\n      (loop for x across scores sum x))))\n\n#-swank (main)\n\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (loop repeat 5\n          sum #>(run *dat-pathname*))))\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9674, "cpu_time_ms": 1958, "memory_kb": 37032}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s316411239", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (uint31 d)\n           (fixnum old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss max-types &optional (time 1.93d0))\n  (declare #.OPT\n           (double-float time)\n           (uint32 d)\n           ((simple-array uint8 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq max-types))\n           (scores (initialize-scores d cs ss state))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score (calc scores)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (when (>= (random 1.0) prob)\n                    (setf (aref state day) old-type)\n                    (update-scores! d cs ss state scores new-type old-type))))))))\n      #>loop-count\n      ;; (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (multiple-value-bind (state scores) (solve d cs ss max-types)\n      (print* state)\n      (loop for x across scores sum x))))\n\n#-swank (main)\n\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (run *dat-pathname*)))\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "language": "Lisp", "metadata": {"date": 1593397894, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s316411239.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s316411239", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (uint31 d)\n           (fixnum old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss max-types &optional (time 1.93d0))\n  (declare #.OPT\n           (double-float time)\n           (uint32 d)\n           ((simple-array uint8 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq max-types))\n           (scores (initialize-scores d cs ss state))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score (calc scores)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (when (>= (random 1.0) prob)\n                    (setf (aref state day) old-type)\n                    (update-scores! d cs ss state scores new-type old-type))))))))\n      #>loop-count\n      ;; (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (multiple-value-bind (state scores) (solve d cs ss max-types)\n      (print* state)\n      (loop for x across scores sum x))))\n\n#-swank (main)\n\n(defun bench ()\n  (let ((*random-state* (seed-random-state 0)))\n    (run *dat-pathname*)))\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9633, "cpu_time_ms": 1956, "memory_kb": 36796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s982692251", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (fixnum d old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss max-types &optional (time 1.93d0))\n  (declare (optimize (speed 3))\n           (uint32 d)\n           ((simple-array uint8 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq max-types))\n           (scores (initialize-scores d cs ss state))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score (calc scores)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    #>new-score\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (when (>= (random 1.0) prob)\n                    (setf (aref state day) old-type)\n                    (update-scores! d cs ss state scores new-type old-type))))))))\n      ;; #>loop-count\n      ;; (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (multiple-value-bind (state score) (solve d cs ss max-types)\n      (print* state)\n      score)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "language": "Lisp", "metadata": {"date": 1593397348, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s982692251.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s982692251", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (handler-bind ((floating-point-overflow (lambda (c) #>c (return-from calc-prob 1d0))))\n    (exp (/ (- new-score prev-score) temp))))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (fixnum d old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int16 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev))))\n              (t (decf (aref scores old-type) (* (aref cs old-type) (- i old-prev)))\n                 (decf (aref scores new-type) (* (aref cs new-type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss max-types &optional (time 1.93d0))\n  (declare (optimize (speed 3))\n           (uint32 d)\n           ((simple-array uint8 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq max-types))\n           (scores (initialize-scores d cs ss state))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop\n          (incf loop-count)\n          (let ((rem-time (float (rem-time) 1d0)))\n            (when (zerop rem-time)\n              (return))\n            (let* ((day (random d))\n                   (old-type (aref state day))\n                   (new-type (random 26))\n                   (old-score (calc scores)))\n              (unless (= old-type new-type)\n                ;; tmp. update\n                (setf (aref state day) new-type)\n                (update-scores! d cs ss state scores old-type new-type)\n                (let* ((new-score (calc scores))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob old-score new-score temp)))\n                  (declare (double-float temp))\n                  ;; rollback\n                  (when (> new-score opt-score)\n                    #>new-score\n                    (setq opt-scores (copy-seq scores)\n                          opt-score new-score\n                          opt-state (copy-seq state)))\n                  (when (>= (random 1.0) prob)\n                    (setf (aref state day) old-type)\n                    (update-scores! d cs ss state scores new-type old-type))))))))\n      ;; #>loop-count\n      ;; (assert (= opt-score (calc (initialize-scores d cs ss opt-state))))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (multiple-value-bind (state score) (solve d cs ss max-types)\n      (print* state)\n      score)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9513, "cpu_time_ms": 1953, "memory_kb": 44336}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s994556300", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  ;; (handler-bind ((floating-point-overflow (lambda (c) (declare )))))\n  (exp (/ (- new-score prev-score) temp)))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (fixnum d old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int32 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores type) (* (aref cs type) (- i old-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores type) (* (aref cs type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss max-types &optional (time 1.93))\n  (declare (optimize (speed 3))\n           (uint32 d)\n           ((simple-array uint8 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq max-types))\n           (scores (initialize-scores d cs ss state))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      \n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop (incf loop-count)\n              (let ((rem-time (rem-time)))\n                (when (zerop rem-time)\n                  (return))\n                (let* ((day (random d))\n                       (old-type (aref state day))\n                       (new-type (random 26))\n                       (old-score (calc scores)))\n                  (unless (= old-type new-type)\n                    ;; tmp. update\n                    (setf (aref state day) new-type)\n                    (update-scores! d cs ss state scores old-type new-type)\n                    (let* ((new-score (calc scores))\n                           (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      ;; rollback\n                      (when (>= (random 1.0) prob)\n                        (setf (aref state day) old-type)\n                        (update-scores! d cs ss state scores new-type old-type))\n                      (when (> new-score opt-score)\n                        (setq opt-scores scores\n                              opt-score new-score\n                              opt-state (copy-seq state)))))))))\n      #>loop-count\n      ;; (assert (= opt-score (calc opt-scores)))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (multiple-value-bind (state score) (solve d cs ss max-types)\n      (print* state)\n      score)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "language": "Lisp", "metadata": {"date": 1593396246, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s994556300.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s994556300", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  ;; (handler-bind ((floating-point-overflow (lambda (c) (declare )))))\n  (exp (/ (- new-score prev-score) temp)))\n\n(defun initialize-scores (d cs ss state)\n  (declare (fixnum d)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n         (res (make-array 26 :element-type 'int32 :initial-element 0)))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf (aref res type) (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf (aref res j) (* (aref cs j) (- i (aref prevs j)))))))\n    res))\n\n(defun update-scores! (d cs ss state scores old-type new-type)\n  (declare #.OPT\n           (fixnum d old-type new-type)\n           ((simple-array uint8 (*)) cs state)\n           ((simple-array uint32 (* *)) ss)\n           ((simple-array int32 (*)) scores))\n  (setf (aref scores old-type) 0\n        (aref scores new-type) 0)\n  (let* ((old-prev -1)\n         (new-prev -1))\n    (declare (int32 old-prev new-prev))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (cond ((= type old-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq old-prev i)\n               (decf (aref scores type) (* (aref cs type) (- i old-prev))))\n              ((= type new-type)\n               (incf (aref scores type) (aref ss i type))\n               (setq new-prev i)\n               (decf (aref scores type) (* (aref cs type) (- i new-prev)))))))\n    scores))\n\n(defun solve (d cs ss max-types &optional (time 1.93))\n  (declare (optimize (speed 3))\n           (uint32 d)\n           ((simple-array uint8 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (labels ((calc (scores) (loop for x across scores sum x of-type fixnum)))\n    (let* ((state (copy-seq max-types))\n           (scores (initialize-scores d cs ss state))\n           (opt-scores (copy-seq scores))\n           (opt-score (calc opt-scores))\n           (opt-state (copy-seq state))\n           (start-temp 1000d0)\n           (end-temp 1d0)\n           (loop-count 0))\n      (declare (fixnum loop-count)\n               (fixnum opt-score)\n               ((simple-array int32 (*)) scores opt-scores)\n               (double-float start-temp end-temp))\n      \n      (sb-int:with-progressive-timeout (rem-time :seconds time)\n        (loop (incf loop-count)\n              (let ((rem-time (rem-time)))\n                (when (zerop rem-time)\n                  (return))\n                (let* ((day (random d))\n                       (old-type (aref state day))\n                       (new-type (random 26))\n                       (old-score (calc scores)))\n                  (unless (= old-type new-type)\n                    ;; tmp. update\n                    (setf (aref state day) new-type)\n                    (update-scores! d cs ss state scores old-type new-type)\n                    (let* ((new-score (calc scores))\n                           (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                           (prob (calc-prob old-score new-score temp)))\n                      (declare (double-float temp))\n                      ;; rollback\n                      (when (>= (random 1.0) prob)\n                        (setf (aref state day) old-type)\n                        (update-scores! d cs ss state scores new-type old-type))\n                      (when (> new-score opt-score)\n                        (setq opt-scores scores\n                              opt-score new-score\n                              opt-state (copy-seq state)))))))))\n      #>loop-count\n      ;; (assert (= opt-score (calc opt-scores)))\n      (values opt-state opt-scores))))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint8 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint8 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (multiple-value-bind (state score) (solve d cs ss max-types)\n      (print* state)\n      score)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9308, "cpu_time_ms": 87, "memory_kb": 26952}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s336185366", "group_id": "codeNet:p02618", "input_text": "(let* ((dmax (read))\n       (c (make-array '(27)))\n       (s (make-array (list (1+ dmax) 27)))\n       (score 0)\n       (last (make-array '(27) :initial-element 0)))\n  ; read\n  (loop :for i :from 1 :to 26\n        :do (setf (aref c i) (read)))\n  (loop :for d :from 1 :to dmax\n        :do (loop :for i :from 1 :to 26\n                  :do (setf (aref s d i) (read))))\n  ;\n  (defun delta (x d)\n    (- (aref s d x)\n       (loop :for i :from 1 :to 26\n             :sum (* (aref c i) (- d (if (= i x) d (aref last i)))))))\n\n  ;;\n  (loop :for d :from 1 :to dmax\n        :do (let ((cand-c 1)\n                  (cand-v (delta 1 d)))\n              (loop :for i :from 2 :to 26\n                    :do (let ((v (delta i d)))\n                          (when (> v cand-v)\n                            (setf cand-c i)\n                            (setf cand-v v))))\n              (setf (aref last cand-c) d)\n              (incf score cand-v)\n              ;(format t \"SCORE: ~A~%\" score)\n              (format t \"~A~%\" cand-c)))\n  ;(format t \"SCORE: ~A~%\" score)\n  t)\n", "language": "Lisp", "metadata": {"date": 1593395496, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s336185366.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s336185366", "user_id": "u608227593"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(let* ((dmax (read))\n       (c (make-array '(27)))\n       (s (make-array (list (1+ dmax) 27)))\n       (score 0)\n       (last (make-array '(27) :initial-element 0)))\n  ; read\n  (loop :for i :from 1 :to 26\n        :do (setf (aref c i) (read)))\n  (loop :for d :from 1 :to dmax\n        :do (loop :for i :from 1 :to 26\n                  :do (setf (aref s d i) (read))))\n  ;\n  (defun delta (x d)\n    (- (aref s d x)\n       (loop :for i :from 1 :to 26\n             :sum (* (aref c i) (- d (if (= i x) d (aref last i)))))))\n\n  ;;\n  (loop :for d :from 1 :to dmax\n        :do (let ((cand-c 1)\n                  (cand-v (delta 1 d)))\n              (loop :for i :from 2 :to 26\n                    :do (let ((v (delta i d)))\n                          (when (> v cand-v)\n                            (setf cand-c i)\n                            (setf cand-v v))))\n              (setf (aref last cand-c) d)\n              (incf score cand-v)\n              ;(format t \"SCORE: ~A~%\" score)\n              (format t \"~A~%\" cand-c)))\n  ;(format t \"SCORE: ~A~%\" score)\n  t)\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1050, "cpu_time_ms": 37, "memory_kb": 29672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s246618333", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  ;; (handler-bind ((floating-point-overflow (lambda (c) (declare )))))\n  (exp (/ (- new-score prev-score) temp)))\n\n(defun eval-score (d cs ss state)\n  (declare #.OPT\n           (fixnum d)\n           ((simple-array uint32 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n        (res 0))\n    (declare (fixnum res))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf res (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf res (the fixnum (* (aref cs j) (- i (aref prevs j))))))))\n    res))\n\n(defun solve (d cs ss max-types &optional (time 1.9))\n  (declare (optimize (speed 3))\n           (uint32 d)\n           ((simple-array uint32 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((state (copy-seq max-types))\n         (score (eval-score d cs ss state))\n         (opt-score score)\n         (opt-state (copy-seq state))\n         (start-temp 1000d0)\n         (end-temp 1d0))\n    (declare (fixnum score opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop (let ((rem-time (rem-time)))\n              (when (zerop rem-time)\n                (return))\n              (let* ((day (random d))\n                     (old-type (aref state day))\n                     (new-type (random 26)))\n                (setf (aref state day) new-type)\n                (let* ((new-score (eval-score d cs ss state))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob score new-score temp)))\n                  (declare (double-float temp)\n                           (fixnum new-score))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (setf (aref state day) old-type))\n                  (when (> score opt-score)\n                    (setq opt-score #>score\n                          opt-state (copy-seq state))))))))\n    (values opt-state opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint32 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (multiple-value-bind (state score) (solve d cs ss max-types)\n      (print* state)\n      score)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "language": "Lisp", "metadata": {"date": 1593394544, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s246618333.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s246618333", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  ;; (handler-bind ((floating-point-overflow (lambda (c) (declare )))))\n  (exp (/ (- new-score prev-score) temp)))\n\n(defun eval-score (d cs ss state)\n  (declare #.OPT\n           (fixnum d)\n           ((simple-array uint32 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n        (res 0))\n    (declare (fixnum res))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf res (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf res (the fixnum (* (aref cs j) (- i (aref prevs j))))))))\n    res))\n\n(defun solve (d cs ss max-types &optional (time 1.9))\n  (declare (optimize (speed 3))\n           (uint32 d)\n           ((simple-array uint32 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((state (copy-seq max-types))\n         (score (eval-score d cs ss state))\n         (opt-score score)\n         (opt-state (copy-seq state))\n         (start-temp 1000d0)\n         (end-temp 1d0))\n    (declare (fixnum score opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop (let ((rem-time (rem-time)))\n              (when (zerop rem-time)\n                (return))\n              (let* ((day (random d))\n                     (old-type (aref state day))\n                     (new-type (random 26)))\n                (setf (aref state day) new-type)\n                (let* ((new-score (eval-score d cs ss state))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob score new-score temp)))\n                  (declare (double-float temp)\n                           (fixnum new-score))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (setf (aref state day) old-type))\n                  (when (> score opt-score)\n                    (setq opt-score #>score\n                          opt-state (copy-seq state))))))))\n    (values opt-state opt-score)))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint32 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (multiple-value-bind (state score) (solve d cs ss max-types)\n      (print* state)\n      score)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7689, "cpu_time_ms": 1924, "memory_kb": 51572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s721856484", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (exp (/ (- new-score prev-score) temp)))\n\n(defun eval-score (d cs ss state)\n  (declare (optimize (speed 3))\n           (fixnum d)\n           ((simple-array uint32 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n        (res 0))\n    (declare (fixnum res))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf res (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf res (the fixnum (* (aref cs j) (- i (aref prevs j))))))))\n    res))\n\n(defun solve (d cs ss max-types &optional (time 1.9))\n  (declare (optimize (speed 3))\n           ((simple-array uint32 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((state (copy-seq max-types))\n         (score (eval-score d cs ss state))\n         (opt-score score)\n         (opt-state (copy-seq state))\n         (start-temp 10000d0)\n         (end-temp 10d0))\n    (declare (fixnum score opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop (let ((rem-time (rem-time)))\n              (when (zerop rem-time)\n                (return))\n              (let* ((day (random d))\n                     (old-type (aref state day))\n                     (new-type (random 26)))\n                (setf (aref state day) new-type)\n                (let* ((new-score (eval-score d cs ss state))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob score new-score temp)))\n                  (declare (double-float temp)\n                           (fixnum new-score))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (setf (aref state day) old-type))\n                  (when (> score opt-score)\n                    (setq opt-score #>score\n                          opt-state (copy-seq state))))))))\n    opt-state))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint32 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (print* (solve d cs ss max-types))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "language": "Lisp", "metadata": {"date": 1593394234, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s721856484.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s721856484", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (exp (/ (- new-score prev-score) temp)))\n\n(defun eval-score (d cs ss state)\n  (declare (optimize (speed 3))\n           (fixnum d)\n           ((simple-array uint32 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n        (res 0))\n    (declare (fixnum res))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf res (aref ss i type))\n        (setf (aref prevs type) i)\n        (dotimes (j 26)\n          (decf res (the fixnum (* (aref cs j) (- i (aref prevs j))))))))\n    res))\n\n(defun solve (d cs ss max-types &optional (time 1.9))\n  (declare (optimize (speed 3))\n           ((simple-array uint32 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((state (copy-seq max-types))\n         (score (eval-score d cs ss state))\n         (opt-score score)\n         (opt-state (copy-seq state))\n         (start-temp 10000d0)\n         (end-temp 10d0))\n    (declare (fixnum score opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop (let ((rem-time (rem-time)))\n              (when (zerop rem-time)\n                (return))\n              (let* ((day (random d))\n                     (old-type (aref state day))\n                     (new-type (random 26)))\n                (setf (aref state day) new-type)\n                (let* ((new-score (eval-score d cs ss state))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob score new-score temp)))\n                  (declare (double-float temp)\n                           (fixnum new-score))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (setf (aref state day) old-type))\n                  (when (> score opt-score)\n                    (setq opt-score #>score\n                          opt-state (copy-seq state))))))))\n    opt-state))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint32 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    ;; #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (print* (solve d cs ss max-types))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"365~%\")\n    (dotimes (i 26)\n      (println (random 101) out))\n    (dotimes (i 365)\n      (dotimes (j 26)\n        (println (random 20001) out)))))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7533, "cpu_time_ms": 1922, "memory_kb": 35236}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s193890329", "group_id": "codeNet:p02618", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (exp (/ (- new-score prev-score) temp)))\n\n(defun eval-score (d cs ss state)\n  (declare (optimize (speed 3))\n           (fixnum d)\n           ((simple-array uint32 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n        (res 0))\n    (declare (fixnum res))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf res (aref ss i type))\n        (setf (aref prevs i) type)\n        (dotimes (j 26)\n          (decf res (the fixnum (* (aref cs j) (- i (aref prevs j))))))))\n    (max 0 (+ 1000000 res))))\n\n(defun solve (d cs ss max-types &optional (time 1.9))\n  (declare (optimize (speed 3))\n           ((simple-array uint32 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((state (copy-seq max-types))\n         (score (eval-score d cs ss state))\n         (opt-score score)\n         (opt-state (copy-seq state))\n         (start-temp 10000d0)\n         (end-temp 10d0))\n    (declare (fixnum score opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop (let ((rem-time (rem-time)))\n              (when (zerop rem-time)\n                (return))\n              (let* ((day (random d))\n                     (old-type (aref state day))\n                     (new-type (random 26)))\n                (setf (aref state day) new-type)\n                (let* ((new-score (eval-score d cs ss state))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob score new-score temp)))\n                  (declare (double-float temp)\n                           (fixnum new-score))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (setf (aref state day) old-type))\n                  (when (> score opt-score)\n                    (setq opt-score score\n                          opt-state (copy-seq state))))))))\n    opt-state))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint32 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (print* (solve d cs ss max-types))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "language": "Lisp", "metadata": {"date": 1593393932, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s193890329.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s193890329", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (inline calc-prob))\n(defun calc-prob (prev-score new-score temp)\n  (exp (/ (- new-score prev-score) temp)))\n\n(defun eval-score (d cs ss state)\n  (declare (optimize (speed 3))\n           (fixnum d)\n           ((simple-array uint32 (*)) cs state)\n           ((simple-array uint32 (* *)) ss))\n  (let ((prevs (make-array 26 :element-type 'int32 :initial-element -1))\n        (res 0))\n    (declare (fixnum res))\n    (dotimes (i d)\n      (let ((type (aref state i)))\n        (incf res (aref ss i type))\n        (setf (aref prevs i) type)\n        (dotimes (j 26)\n          (decf res (the fixnum (* (aref cs j) (- i (aref prevs j))))))))\n    (max 0 (+ 1000000 res))))\n\n(defun solve (d cs ss max-types &optional (time 1.9))\n  (declare (optimize (speed 3))\n           ((simple-array uint32 (*)) cs max-types)\n           ((simple-array uint32 (* *)) ss))\n  (let* ((state (copy-seq max-types))\n         (score (eval-score d cs ss state))\n         (opt-score score)\n         (opt-state (copy-seq state))\n         (start-temp 10000d0)\n         (end-temp 10d0))\n    (declare (fixnum score opt-score)\n             (double-float start-temp end-temp))\n    (sb-int:with-progressive-timeout (rem-time :seconds time)\n      (loop (let ((rem-time (rem-time)))\n              (when (zerop rem-time)\n                (return))\n              (let* ((day (random d))\n                     (old-type (aref state day))\n                     (new-type (random 26)))\n                (setf (aref state day) new-type)\n                (let* ((new-score (eval-score d cs ss state))\n                       (temp (+ end-temp (/ (* rem-time (- start-temp end-temp)) time)))\n                       (prob (calc-prob score new-score temp)))\n                  (declare (double-float temp)\n                           (fixnum new-score))\n                  (if (< (random 1.0) prob)\n                      (setq score new-score)\n                      (setf (aref state day) old-type))\n                  (when (> score opt-score)\n                    (setq opt-score score\n                          opt-state (copy-seq state))))))))\n    opt-state))\n\n(defun print* (state)\n  (write-string\n   (with-output-to-string (*standard-output* nil :element-type 'base-char)\n     (loop for x across state\n           do (println (+ x 1))))))\n\n(defun main ()\n  (let* ((d (read))\n         (cs (make-array 26 :element-type 'uint32 :initial-element 0))\n         (ss (make-array (list d 26) :element-type 'uint32 :initial-element 0))\n         (max-types (make-array d :element-type 'uint32 :initial-element 0)))\n    (dotimes (i 26)\n      (setf (aref cs i) (read-fixnum)))\n    (dotimes (i d)\n      (dotimes (j 26)\n        (setf (aref ss i j) (read-fixnum))))\n    #>ss\n    (dotimes (i d)\n      (let ((max-type 0)\n            (max 0))\n        (dotimes  (j 26)\n          (when (>= (aref ss i j) max)\n            (setq max-type j\n                  max (aref ss i j))))\n        (setf (aref max-types i) max-type)))\n    (print* (solve d cs ss max-types))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7407, "cpu_time_ms": 56, "memory_kb": 27188}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s801232989", "group_id": "codeNet:p02618", "input_text": "(defun simple (d c s)\n  (declare (ignore c))\n  (loop :for i :from 1 :to d\n        :do (let ((con 1))\n              (loop :for j :from 2 :to 26\n                    :if (> (aref s i j) (aref s i con))\n                    :do (setf con j))\n              (format t \"~A~%\" con)))) \n\n(defun main (d c s)\n  (simple d c s))\n\n(let* ((d (read))\n       (c (make-array '(27)))\n       (s (make-array (list (1+ d) 27))))\n  ; read\n  (loop :for i :from 1 :to 26\n        :do (setf (aref c i) (read)))\n  (loop :for i :from 1 :to d\n        :do (loop :for j :from 1 :to 26\n                  :do (setf (aref s i j) (read))))\n  (main d c s))\n", "language": "Lisp", "metadata": {"date": 1593393361, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Lisp/s801232989.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s801232989", "user_id": "u608227593"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "(defun simple (d c s)\n  (declare (ignore c))\n  (loop :for i :from 1 :to d\n        :do (let ((con 1))\n              (loop :for j :from 2 :to 26\n                    :if (> (aref s i j) (aref s i con))\n                    :do (setf con j))\n              (format t \"~A~%\" con)))) \n\n(defun main (d c s)\n  (simple d c s))\n\n(let* ((d (read))\n       (c (make-array '(27)))\n       (s (make-array (list (1+ d) 27))))\n  ; read\n  (loop :for i :from 1 :to 26\n        :do (setf (aref c i) (read)))\n  (loop :for i :from 1 :to d\n        :do (loop :for j :from 1 :to 26\n                  :do (setf (aref s i j) (read))))\n  (main d c s))\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 620, "cpu_time_ms": 33, "memory_kb": 29804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s931683476", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array (+ n 1) :initial-element 0))\n    (b (make-array (+ m 1) :initial-element 0))\n    (pre m)\n    (ans 0))\n    (loop for i from 1 to n do\n        (incf (aref a i) (+ (read) (aref a (- i 1))))\n    )\n    (loop for j from 1 to m do\n        (incf (aref b j) (+ (read) (aref b (- j 1))))\n    )\n\n    (loop for i from 0 to n do\n        (progn\n        (loop while (and (> (+ (aref a i) (aref b pre)) k) (not (= pre 0))) do\n            (decf pre)\n        )\n        (if (<= (+ (aref a i) (aref b pre)) k)\n        (if (< ans (+ i pre))\n            (setq ans (+ i pre))\n        )\n        )\n        )\n    )\n    (princ ans)\n)", "language": "Lisp", "metadata": {"date": 1593317483, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s931683476.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s931683476", "user_id": "u136500538"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array (+ n 1) :initial-element 0))\n    (b (make-array (+ m 1) :initial-element 0))\n    (pre m)\n    (ans 0))\n    (loop for i from 1 to n do\n        (incf (aref a i) (+ (read) (aref a (- i 1))))\n    )\n    (loop for j from 1 to m do\n        (incf (aref b j) (+ (read) (aref b (- j 1))))\n    )\n\n    (loop for i from 0 to n do\n        (progn\n        (loop while (and (> (+ (aref a i) (aref b pre)) k) (not (= pre 0))) do\n            (decf pre)\n        )\n        (if (<= (+ (aref a i) (aref b pre)) k)\n        (if (< ans (+ i pre))\n            (setq ans (+ i pre))\n        )\n        )\n        )\n    )\n    (princ ans)\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 673, "cpu_time_ms": 511, "memory_kb": 80240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s178736644", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array (+ n 1) :initial-element 0))\n    (b (make-array (+ m 1) :initial-element 0))\n    (pre m)\n    (ans 0))\n    (loop for i from 1 to n do\n        (incf (aref a i) (+ (read) (aref a (- i 1))))\n    )\n    (loop for j from 1 to m do\n        (incf (aref b j) (+ (read) (aref b (- j 1))))\n    )\n\n    (loop for i from 0 to n do\n        (progn\n        (loop while (and (> (+ (aref a i) (aref b pre)) k) (not (= pre 0))) do\n            (decf pre)\n        )\n        (if (< ans (+ i pre))\n            (setq ans (+ i pre))\n        )\n        )\n    )\n    (princ ans)\n)", "language": "Lisp", "metadata": {"date": 1593317328, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s178736644.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s178736644", "user_id": "u136500538"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array (+ n 1) :initial-element 0))\n    (b (make-array (+ m 1) :initial-element 0))\n    (pre m)\n    (ans 0))\n    (loop for i from 1 to n do\n        (incf (aref a i) (+ (read) (aref a (- i 1))))\n    )\n    (loop for j from 1 to m do\n        (incf (aref b j) (+ (read) (aref b (- j 1))))\n    )\n\n    (loop for i from 0 to n do\n        (progn\n        (loop while (and (> (+ (aref a i) (aref b pre)) k) (not (= pre 0))) do\n            (decf pre)\n        )\n        (if (< ans (+ i pre))\n            (setq ans (+ i pre))\n        )\n        )\n    )\n    (princ ans)\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 616, "cpu_time_ms": 473, "memory_kb": 80260}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s460339080", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array (+ n 1) :initial-element 0))\n    (b (make-array (+ m 1) :initial-element 0))\n    (pre m)\n    (ans 0))\n    (loop for i from 1 to n do\n        (incf (aref a i) (+ (read) (aref a (- i 1))))\n    )\n    (loop for j from 1 to m do\n        (incf (aref b j) (+ (read) (aref b (- j 1))))\n    )\n\n    (loop for i from 0 to n do\n        (progn\n        (loop while (and (>= (+ (aref a i) (aref b pre)) k) (not (= pre 0))) do\n            (decf pre)\n        )\n        (if (< ans (+ i pre))\n            (setq ans (+ i pre))\n        )\n        )\n    )\n    (princ ans)\n)", "language": "Lisp", "metadata": {"date": 1593317118, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s460339080.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s460339080", "user_id": "u136500538"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array (+ n 1) :initial-element 0))\n    (b (make-array (+ m 1) :initial-element 0))\n    (pre m)\n    (ans 0))\n    (loop for i from 1 to n do\n        (incf (aref a i) (+ (read) (aref a (- i 1))))\n    )\n    (loop for j from 1 to m do\n        (incf (aref b j) (+ (read) (aref b (- j 1))))\n    )\n\n    (loop for i from 0 to n do\n        (progn\n        (loop while (and (>= (+ (aref a i) (aref b pre)) k) (not (= pre 0))) do\n            (decf pre)\n        )\n        (if (< ans (+ i pre))\n            (setq ans (+ i pre))\n        )\n        )\n    )\n    (princ ans)\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 617, "cpu_time_ms": 496, "memory_kb": 80280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s981348294", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array (+ n 1) :initial-element 0))\n    (b (make-array (+ m 1) :initial-element 0))\n    (pre m)\n    (ans 0))\n    (loop for i from 1 to n do\n        (incf (aref a i) (+ (read) (aref a (- i 1))))\n    )\n    (loop for j from 1 to m do\n        (incf (aref b j) (+ (read) (aref b (- j 1))))\n    )\n\n    (loop for i from 0 below (+ n 1) do\n        (progn\n        (loop while (> (+ (aref a i) (aref b pre)) k) do\n            (decf pre)\n        )\n        (if (< ans (+ i pre))\n            (setq ans (+ i pre))\n        )\n        )\n    )\n    (princ ans)\n)", "language": "Lisp", "metadata": {"date": 1593316635, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s981348294.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s981348294", "user_id": "u136500538"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array (+ n 1) :initial-element 0))\n    (b (make-array (+ m 1) :initial-element 0))\n    (pre m)\n    (ans 0))\n    (loop for i from 1 to n do\n        (incf (aref a i) (+ (read) (aref a (- i 1))))\n    )\n    (loop for j from 1 to m do\n        (incf (aref b j) (+ (read) (aref b (- j 1))))\n    )\n\n    (loop for i from 0 below (+ n 1) do\n        (progn\n        (loop while (> (+ (aref a i) (aref b pre)) k) do\n            (decf pre)\n        )\n        (if (< ans (+ i pre))\n            (setq ans (+ i pre))\n        )\n        )\n    )\n    (princ ans)\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 603, "cpu_time_ms": 498, "memory_kb": 82296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s032238676", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n)) :initial-element 0))\n       (b (make-array `(,(1+ m)) :initial-element 0))\n       (bestj m)\n       (ans 0))\n  ; read\n  (loop :with acc := 0\n        :for i :from 1 :to n\n        :do (setf (aref a i) (incf acc (read))))\n  (loop :with acc := 0\n        :for i :from 1 :to m\n        :do (setf (aref b i) (incf acc (read))))\n  ;\n  (loop :for i :from 0 :to n\n        :do (loop :named inner\n                  :for j :downfrom bestj :to 0\n                  :if (<= (+ (aref a i) (aref b j)) k)\n                  :do (progn\n                        (setf ans (max ans (+ i j)))\n                        (setf bestj j)\n                        (return-from inner))))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1593314145, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s032238676.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s032238676", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n)) :initial-element 0))\n       (b (make-array `(,(1+ m)) :initial-element 0))\n       (bestj m)\n       (ans 0))\n  ; read\n  (loop :with acc := 0\n        :for i :from 1 :to n\n        :do (setf (aref a i) (incf acc (read))))\n  (loop :with acc := 0\n        :for i :from 1 :to m\n        :do (setf (aref b i) (incf acc (read))))\n  ;\n  (loop :for i :from 0 :to n\n        :do (loop :named inner\n                  :for j :downfrom bestj :to 0\n                  :if (<= (+ (aref a i) (aref b j)) k)\n                  :do (progn\n                        (setf ans (max ans (+ i j)))\n                        (setf bestj j)\n                        (return-from inner))))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 765, "cpu_time_ms": 500, "memory_kb": 80412}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s301269006", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (b (make-array `(,(1+ m))))\n       (amax 0)\n       (bmax 0)\n       (atop 1)\n       (btop 1)\n       (alast 0)\n       (blast 0)\n       (arest 0)\n       (brest 0)\n       (ans 0))\n  ; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read))\n        :if (>= k (+ amax (aref a i)))\n        :do (progn\n              (incf amax (aref a i))\n              (incf arest)\n              (setf alast i)))\n  (loop :for i :from 1 :to m\n        :do (setf (aref b i) (read))\n        :if (>= k (+ bmax (aref b i)))\n        :do (progn\n              (incf bmax (aref b i))\n              (incf brest)\n              (setf blast i)))\n  ;\n  (loop :named main\n        :do (let ((at (if (<= atop n) (aref a atop) nil))\n                  (bt (if (<= btop m) (aref b btop) nil)))\n              (cond ((and (null at) (null bt))\n                     (return-from main))\n                    ((or (null bt) (> arest brest) (and at (/= brest 0) (= arest brest) (>= (aref b blast) at)))\n                     (if (or (null at) (> at k)) (return-from main))\n                     ;(format t \"A ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf amax at)\n                     (decf arest)\n                     (decf k at)\n                     (loop :for i :downfrom blast :to 1\n                           :while (> bmax k)\n                           :do (progn\n                                 (decf bmax (aref b i))\n                                 (decf brest)\n                                 (decf blast)))\n                     (incf atop))\n                    (t\n                     (if (or (null bt) (> bt k)) (return-from main))\n                     ;(format t \"B ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf bmax bt)\n                     (decf brest)\n                     (decf k bt)\n                     (loop :for i :downfrom alast :to 1\n                           :while (> amax k)\n                           :do (progn\n                                 (decf amax (aref a i))\n                                 (decf arest)\n                                 (decf alast)))\n                     (incf btop)))))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1593311963, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s301269006.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s301269006", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (b (make-array `(,(1+ m))))\n       (amax 0)\n       (bmax 0)\n       (atop 1)\n       (btop 1)\n       (alast 0)\n       (blast 0)\n       (arest 0)\n       (brest 0)\n       (ans 0))\n  ; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read))\n        :if (>= k (+ amax (aref a i)))\n        :do (progn\n              (incf amax (aref a i))\n              (incf arest)\n              (setf alast i)))\n  (loop :for i :from 1 :to m\n        :do (setf (aref b i) (read))\n        :if (>= k (+ bmax (aref b i)))\n        :do (progn\n              (incf bmax (aref b i))\n              (incf brest)\n              (setf blast i)))\n  ;\n  (loop :named main\n        :do (let ((at (if (<= atop n) (aref a atop) nil))\n                  (bt (if (<= btop m) (aref b btop) nil)))\n              (cond ((and (null at) (null bt))\n                     (return-from main))\n                    ((or (null bt) (> arest brest) (and at (/= brest 0) (= arest brest) (>= (aref b blast) at)))\n                     (if (or (null at) (> at k)) (return-from main))\n                     ;(format t \"A ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf amax at)\n                     (decf arest)\n                     (decf k at)\n                     (loop :for i :downfrom blast :to 1\n                           :while (> bmax k)\n                           :do (progn\n                                 (decf bmax (aref b i))\n                                 (decf brest)\n                                 (decf blast)))\n                     (incf atop))\n                    (t\n                     (if (or (null bt) (> bt k)) (return-from main))\n                     ;(format t \"B ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf bmax bt)\n                     (decf brest)\n                     (decf k bt)\n                     (loop :for i :downfrom alast :to 1\n                           :while (> amax k)\n                           :do (progn\n                                 (decf amax (aref a i))\n                                 (decf arest)\n                                 (decf alast)))\n                     (incf btop)))))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2280, "cpu_time_ms": 498, "memory_kb": 80192}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s462075509", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (b (make-array `(,(1+ m))))\n       (amax 0)\n       (bmax 0)\n       (atop 1)\n       (btop 1)\n       (alast 0)\n       (blast 0)\n       (arest 0)\n       (brest 0)\n       (ans 0))\n  ; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read))\n        :if (>= k (+ amax (aref a i)))\n        :do (progn\n              (incf amax (aref a i))\n              (incf arest)\n              (setf alast i)))\n  (loop :for i :from 1 :to m\n        :do (setf (aref b i) (read))\n        :if (>= k (+ bmax (aref b i)))\n        :do (progn\n              (incf bmax (aref b i))\n              (incf brest)\n              (setf blast i)))\n  ;\n  (loop :named main\n        :do (let ((at (if (<= atop n) (aref a atop) nil))\n                  (bt (if (<= btop m) (aref b btop) nil)))\n              (cond ((and (null at) (null bt))\n                     (return-from main))\n                    ((or (null bt) (> arest brest) (and at (= arest brest) (>= (aref b blast) at)))\n                     (if (or (null at) (> at k)) (return-from main))\n                     ;(format t \"A ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf amax at)\n                     (decf arest)\n                     (decf k at)\n                     (loop :for i :downfrom blast :to 1\n                           :while (> bmax k)\n                           :do (progn\n                                 (decf bmax (aref b i))\n                                 (decf brest)\n                                 (decf blast)))\n                     (incf atop))\n                    (t\n                     (if (or (null bt) (> bt k)) (return-from main))\n                     ;(format t \"B ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf bmax bt)\n                     (decf brest)\n                     (decf k bt)\n                     (loop :for i :downfrom alast :to 1\n                           :while (> amax k)\n                           :do (progn\n                                 (decf amax (aref a i))\n                                 (decf arest)\n                                 (decf alast)))\n                     (incf btop)))))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1593311811, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s462075509.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s462075509", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (b (make-array `(,(1+ m))))\n       (amax 0)\n       (bmax 0)\n       (atop 1)\n       (btop 1)\n       (alast 0)\n       (blast 0)\n       (arest 0)\n       (brest 0)\n       (ans 0))\n  ; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read))\n        :if (>= k (+ amax (aref a i)))\n        :do (progn\n              (incf amax (aref a i))\n              (incf arest)\n              (setf alast i)))\n  (loop :for i :from 1 :to m\n        :do (setf (aref b i) (read))\n        :if (>= k (+ bmax (aref b i)))\n        :do (progn\n              (incf bmax (aref b i))\n              (incf brest)\n              (setf blast i)))\n  ;\n  (loop :named main\n        :do (let ((at (if (<= atop n) (aref a atop) nil))\n                  (bt (if (<= btop m) (aref b btop) nil)))\n              (cond ((and (null at) (null bt))\n                     (return-from main))\n                    ((or (null bt) (> arest brest) (and at (= arest brest) (>= (aref b blast) at)))\n                     (if (or (null at) (> at k)) (return-from main))\n                     ;(format t \"A ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf amax at)\n                     (decf arest)\n                     (decf k at)\n                     (loop :for i :downfrom blast :to 1\n                           :while (> bmax k)\n                           :do (progn\n                                 (decf bmax (aref b i))\n                                 (decf brest)\n                                 (decf blast)))\n                     (incf atop))\n                    (t\n                     (if (or (null bt) (> bt k)) (return-from main))\n                     ;(format t \"B ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf bmax bt)\n                     (decf brest)\n                     (decf k bt)\n                     (loop :for i :downfrom alast :to 1\n                           :while (> amax k)\n                           :do (progn\n                                 (decf amax (aref a i))\n                                 (decf arest)\n                                 (decf alast)))\n                     (incf btop)))))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2267, "cpu_time_ms": 480, "memory_kb": 80124}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s276319061", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (b (make-array `(,(1+ m))))\n       (amax 0)\n       (bmax 0)\n       (atop 1)\n       (btop 1)\n       (alast 0)\n       (blast 0)\n       (arest 0)\n       (brest 0)\n       (ans 0))\n  ; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read))\n        :if (>= k (+ amax (aref a i)))\n        :do (progn\n              (incf amax (aref a i))\n              (incf arest)\n              (setf alast i)))\n  (loop :for i :from 1 :to m\n        :do (setf (aref b i) (read))\n        :if (>= k (+ bmax (aref b i)))\n        :do (progn\n              (incf bmax (aref b i))\n              (incf brest)\n              (setf blast i)))\n  ;\n  (loop :named main\n        :do (let ((at (if (<= atop n) (aref a atop) nil))\n                  (bt (if (<= btop m) (aref b btop) nil)))\n              (cond ((and (null at) (null bt))\n                     (return-from main))\n                    ((or (null bt) (> arest brest) (and at (= arest brest) (> (aref b blast) at)))\n                     (if (or (null at) (> at k)) (return-from main))\n                     ;(format t \"A ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf amax at)\n                     (decf arest)\n                     (decf k at)\n                     (loop :for i :downfrom blast :to 1\n                           :while (> bmax k)\n                           :do (progn\n                                 (decf bmax (aref b i))\n                                 (decf brest)\n                                 (decf blast)))\n                     (incf atop))\n                    (t\n                     (if (or (null bt) (> bt k)) (return-from main))\n                     ;(format t \"B ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf bmax bt)\n                     (decf brest)\n                     (decf k bt)\n                     (loop :for i :downfrom alast :to 1\n                           :while (> amax k)\n                           :do (progn\n                                 (decf amax (aref a i))\n                                 (decf arest)\n                                 (decf alast)))\n                     (incf btop)))))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1593311514, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s276319061.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s276319061", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (b (make-array `(,(1+ m))))\n       (amax 0)\n       (bmax 0)\n       (atop 1)\n       (btop 1)\n       (alast 0)\n       (blast 0)\n       (arest 0)\n       (brest 0)\n       (ans 0))\n  ; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read))\n        :if (>= k (+ amax (aref a i)))\n        :do (progn\n              (incf amax (aref a i))\n              (incf arest)\n              (setf alast i)))\n  (loop :for i :from 1 :to m\n        :do (setf (aref b i) (read))\n        :if (>= k (+ bmax (aref b i)))\n        :do (progn\n              (incf bmax (aref b i))\n              (incf brest)\n              (setf blast i)))\n  ;\n  (loop :named main\n        :do (let ((at (if (<= atop n) (aref a atop) nil))\n                  (bt (if (<= btop m) (aref b btop) nil)))\n              (cond ((and (null at) (null bt))\n                     (return-from main))\n                    ((or (null bt) (> arest brest) (and at (= arest brest) (> (aref b blast) at)))\n                     (if (or (null at) (> at k)) (return-from main))\n                     ;(format t \"A ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf amax at)\n                     (decf arest)\n                     (decf k at)\n                     (loop :for i :downfrom blast :to 1\n                           :while (> bmax k)\n                           :do (progn\n                                 (decf bmax (aref b i))\n                                 (decf brest)\n                                 (decf blast)))\n                     (incf atop))\n                    (t\n                     (if (or (null bt) (> bt k)) (return-from main))\n                     ;(format t \"B ~A ~A~%\" arest brest)\n                     (incf ans)\n                     (decf bmax bt)\n                     (decf brest)\n                     (decf k bt)\n                     (loop :for i :downfrom alast :to 1\n                           :while (> amax k)\n                           :do (progn\n                                 (decf amax (aref a i))\n                                 (decf arest)\n                                 (decf alast)))\n                     (incf btop)))))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2266, "cpu_time_ms": 477, "memory_kb": 80180}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s576698589", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (b (make-array `(,(1+ m))))\n       (amax 0)\n       (bmax 0)\n       (atop 1)\n       (btop 1)\n       (alast 0)\n       (blast 0)\n       (arest 0)\n       (brest 0)\n       (ans 0))\n  ; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read))\n        :if (>= k (+ amax (aref a i)))\n        :do (progn\n              (incf amax (aref a i))\n              (incf arest)\n              (setf alast i)))\n  (loop :for i :from 1 :to m\n        :do (setf (aref b i) (read))\n        :if (>= k (+ bmax (aref b i)))\n        :do (progn\n              (incf bmax (aref b i))\n              (incf brest)\n              (setf blast i)))\n  ;\n  (loop :named main\n        :do (let ((at (if (<= atop n) (aref a atop) nil))\n                  (bt (if (<= btop m) (aref b btop) nil)))\n              (cond ((and (null at) (null bt))\n                     (return-from main))\n                    ((or (null bt) (= 0 bmax) (and at (or (> arest brest) (and (= arest brest) (> (aref b blast) at)))))\n                     (if (or (null at) (> at k)) (return-from main))\n                     ;(format t \"A ~A ~A~%\" alast blast)\n                     (incf ans)\n                     (decf amax at)\n                     (decf arest)\n                     (decf k at)\n                     (loop :for i :downfrom blast :to 1\n                           :while (> bmax k)\n                           :do (progn \n                                 (decf bmax (aref b i))\n                                 (decf brest)\n                                 (decf blast)))\n                     (incf atop))\n                    (t\n                     (if (or (null bt) (> bt k)) (return-from main))\n                     ;(format t \"B ~A ~A~%\" amax bmax)\n                     (incf ans)\n                     (decf bmax bt)\n                     (decf brest)\n                     (decf k bt)\n                     (loop :for i :downfrom alast :to 1\n                           :while (> amax k)\n                           :do (progn \n                                 (decf amax (aref a i))\n                                 (decf arest)\n                                 (decf alast)))\n                     (incf btop)))))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1593310418, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s576698589.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s576698589", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (b (make-array `(,(1+ m))))\n       (amax 0)\n       (bmax 0)\n       (atop 1)\n       (btop 1)\n       (alast 0)\n       (blast 0)\n       (arest 0)\n       (brest 0)\n       (ans 0))\n  ; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read))\n        :if (>= k (+ amax (aref a i)))\n        :do (progn\n              (incf amax (aref a i))\n              (incf arest)\n              (setf alast i)))\n  (loop :for i :from 1 :to m\n        :do (setf (aref b i) (read))\n        :if (>= k (+ bmax (aref b i)))\n        :do (progn\n              (incf bmax (aref b i))\n              (incf brest)\n              (setf blast i)))\n  ;\n  (loop :named main\n        :do (let ((at (if (<= atop n) (aref a atop) nil))\n                  (bt (if (<= btop m) (aref b btop) nil)))\n              (cond ((and (null at) (null bt))\n                     (return-from main))\n                    ((or (null bt) (= 0 bmax) (and at (or (> arest brest) (and (= arest brest) (> (aref b blast) at)))))\n                     (if (or (null at) (> at k)) (return-from main))\n                     ;(format t \"A ~A ~A~%\" alast blast)\n                     (incf ans)\n                     (decf amax at)\n                     (decf arest)\n                     (decf k at)\n                     (loop :for i :downfrom blast :to 1\n                           :while (> bmax k)\n                           :do (progn \n                                 (decf bmax (aref b i))\n                                 (decf brest)\n                                 (decf blast)))\n                     (incf atop))\n                    (t\n                     (if (or (null bt) (> bt k)) (return-from main))\n                     ;(format t \"B ~A ~A~%\" amax bmax)\n                     (incf ans)\n                     (decf bmax bt)\n                     (decf brest)\n                     (decf k bt)\n                     (loop :for i :downfrom alast :to 1\n                           :while (> amax k)\n                           :do (progn \n                                 (decf amax (aref a i))\n                                 (decf arest)\n                                 (decf alast)))\n                     (incf btop)))))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2288, "cpu_time_ms": 494, "memory_kb": 80236}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s345772496", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (b (make-array `(,(1+ m))))\n       (amax 0)\n       (bmax 0)\n       (atop 1)\n       (btop 1)\n       (alast 0)\n       (blast 0)\n       (arest 0)\n       (brest 0)\n       (ans 0))\n  ; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read))\n        :if (>= k (+ amax (aref a i)))\n        :do (progn\n              (incf amax (aref a i))\n              (incf arest)\n              (setf alast i)))\n  (loop :for i :from 1 :to m\n        :do (setf (aref b i) (read))\n        :if (>= k (+ bmax (aref b i)))\n        :do (progn\n              (incf bmax (aref b i))\n              (incf brest)\n              (setf blast i)))\n  ;\n  (loop :named main\n        :do (let ((at (if (<= atop n) (aref a atop) nil))\n                  (bt (if (<= btop m) (aref b btop) nil)))\n              (cond ((and (null at) (null bt))\n                     (return-from main))\n                    ((or (null bt) (= 0 bmax) (and at (or (> arest brest) (and (= arest brest) (> bt at)))))\n                     (if (or (null at) (> at k)) (return-from main))\n                     ;(format t \"A ~A ~A~%\" alast blast)\n                     (incf ans)\n                     (decf amax at)\n                     (decf arest)\n                     (decf k at)\n                     (loop :for i :downfrom blast :to 1\n                           :while (> bmax k)\n                           :do (progn \n                                 (decf bmax (aref b i))\n                                 (decf brest)\n                                 (decf blast)))\n                     (incf atop))\n                    (t\n                     (if (or (null bt) (> bt k)) (return-from main))\n                     ;(format t \"B ~A ~A~%\" amax bmax)\n                     (incf ans)\n                     (decf bmax bt)\n                     (decf brest)\n                     (decf k bt)\n                     (loop :for i :downfrom alast :to 1\n                           :while (> amax k)\n                           :do (progn \n                                 (decf amax (aref a i))\n                                 (decf arest)\n                                 (decf alast)))\n                     (incf btop)))))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1593310181, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s345772496.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s345772496", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (b (make-array `(,(1+ m))))\n       (amax 0)\n       (bmax 0)\n       (atop 1)\n       (btop 1)\n       (alast 0)\n       (blast 0)\n       (arest 0)\n       (brest 0)\n       (ans 0))\n  ; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read))\n        :if (>= k (+ amax (aref a i)))\n        :do (progn\n              (incf amax (aref a i))\n              (incf arest)\n              (setf alast i)))\n  (loop :for i :from 1 :to m\n        :do (setf (aref b i) (read))\n        :if (>= k (+ bmax (aref b i)))\n        :do (progn\n              (incf bmax (aref b i))\n              (incf brest)\n              (setf blast i)))\n  ;\n  (loop :named main\n        :do (let ((at (if (<= atop n) (aref a atop) nil))\n                  (bt (if (<= btop m) (aref b btop) nil)))\n              (cond ((and (null at) (null bt))\n                     (return-from main))\n                    ((or (null bt) (= 0 bmax) (and at (or (> arest brest) (and (= arest brest) (> bt at)))))\n                     (if (or (null at) (> at k)) (return-from main))\n                     ;(format t \"A ~A ~A~%\" alast blast)\n                     (incf ans)\n                     (decf amax at)\n                     (decf arest)\n                     (decf k at)\n                     (loop :for i :downfrom blast :to 1\n                           :while (> bmax k)\n                           :do (progn \n                                 (decf bmax (aref b i))\n                                 (decf brest)\n                                 (decf blast)))\n                     (incf atop))\n                    (t\n                     (if (or (null bt) (> bt k)) (return-from main))\n                     ;(format t \"B ~A ~A~%\" amax bmax)\n                     (incf ans)\n                     (decf bmax bt)\n                     (decf brest)\n                     (decf k bt)\n                     (loop :for i :downfrom alast :to 1\n                           :while (> amax k)\n                           :do (progn \n                                 (decf amax (aref a i))\n                                 (decf arest)\n                                 (decf alast)))\n                     (incf btop)))))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2276, "cpu_time_ms": 502, "memory_kb": 80296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s591397764", "group_id": "codeNet:p02623", "input_text": "(defun number-of-readable-books+rest-time (books time-limit)\n  (labels ((rec (books time-limit nbook)\n             (declare (optimize (speed 3))\n                      (sb-ext:muffle-conditions sb-ext:compiler-note))\n             (if (or (endp books)\n                     (< time-limit (first books)))\n                 (values nbook time-limit)\n                 (rec (rest books) (- time-limit (first books)) (1+ nbook)))))\n    (rec books time-limit 0)))\n\n(let* ((n (read))\n       (m (read))\n       (k (read))\n       (as (loop :repeat n :collect (read)))\n       (bs (loop :repeat m :collect (read))))\n  (declare (type (integer 1 200000) n m)\n           (type (integer 1 1000000000) k))\n  (multiple-value-bind (number-of-readable-books rest-time) (number-of-readable-books+rest-time as k)\n    (princ\n      (loop :for na :below (1+ number-of-readable-books)\n            :maximize (+ na (number-of-readable-books+rest-time bs rest-time))))))\n", "language": "Lisp", "metadata": {"date": 1593309810, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s591397764.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s591397764", "user_id": "u956039157"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defun number-of-readable-books+rest-time (books time-limit)\n  (labels ((rec (books time-limit nbook)\n             (declare (optimize (speed 3))\n                      (sb-ext:muffle-conditions sb-ext:compiler-note))\n             (if (or (endp books)\n                     (< time-limit (first books)))\n                 (values nbook time-limit)\n                 (rec (rest books) (- time-limit (first books)) (1+ nbook)))))\n    (rec books time-limit 0)))\n\n(let* ((n (read))\n       (m (read))\n       (k (read))\n       (as (loop :repeat n :collect (read)))\n       (bs (loop :repeat m :collect (read))))\n  (declare (type (integer 1 200000) n m)\n           (type (integer 1 1000000000) k))\n  (multiple-value-bind (number-of-readable-books rest-time) (number-of-readable-books+rest-time as k)\n    (princ\n      (loop :for na :below (1+ number-of-readable-books)\n            :maximize (+ na (number-of-readable-books+rest-time bs rest-time))))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 938, "cpu_time_ms": 2209, "memory_kb": 83296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s419486398", "group_id": "codeNet:p02623", "input_text": "(defun number-of-readable-books+rest-time (books time-limit)\n  (labels ((rec (books time-limit nbook)\n             (declare (optimize (speed 3))\n                      (sb-ext:muffle-conditions sb-ext:compiler-note))\n             (if (or (endp books)\n                     (< time-limit (first books)))\n                 (values nbook time-limit)\n                 (rec (rest books) (- time-limit (first books)) (1+ nbook)))))\n    (rec books time-limit 0)))\n\n(let* ((n (read))\n       (m (read))\n       (k (read))\n       (as (loop :repeat n :collect (read)))\n       (bs (loop :repeat m :collect (read))))\n  (declare (type (integer 1 200000) n m)\n           (type (integer 1 1000000000) k))\n  (multiple-value-bind (number-of-readable-books rest-time) (number-of-readable-books+rest-time as k)\n    (loop :for na :below (1+ number-of-readable-books)\n          :maximize (+ na (number-of-readable-books+rest-time bs rest-time)))))\n", "language": "Lisp", "metadata": {"date": 1593309694, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s419486398.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s419486398", "user_id": "u956039157"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defun number-of-readable-books+rest-time (books time-limit)\n  (labels ((rec (books time-limit nbook)\n             (declare (optimize (speed 3))\n                      (sb-ext:muffle-conditions sb-ext:compiler-note))\n             (if (or (endp books)\n                     (< time-limit (first books)))\n                 (values nbook time-limit)\n                 (rec (rest books) (- time-limit (first books)) (1+ nbook)))))\n    (rec books time-limit 0)))\n\n(let* ((n (read))\n       (m (read))\n       (k (read))\n       (as (loop :repeat n :collect (read)))\n       (bs (loop :repeat m :collect (read))))\n  (declare (type (integer 1 200000) n m)\n           (type (integer 1 1000000000) k))\n  (multiple-value-bind (number-of-readable-books rest-time) (number-of-readable-books+rest-time as k)\n    (loop :for na :below (1+ number-of-readable-books)\n          :maximize (+ na (number-of-readable-books+rest-time bs rest-time)))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 922, "cpu_time_ms": 2208, "memory_kb": 82436}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s852167803", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array n))\n    (b (make-array m))\n    (ans_time 0)\n    (ans 0))\n    (dotimes (i n)\n    (setf (aref a i) (read)))\n    (dotimes (j m)\n    (setf (aref b j) (read))\n    )\n    (let ((i 0)\n        (j 0)\n        (hikaku_a 0)\n        (hikaku_b 0))\n        (loop while (< ans_time k) do\n            (if (> n i)\n                (setq hikaku_a (aref a i))\n                (setq hikaku_a -1)\n            )\n            (if (> m j)\n                (setq hikaku_b (aref b i))\n                (setq hikaku_b -1)\n            )\n\n            (if (= hikaku_a -1)\n                (if (= hikaku_b -1)\n                    (return)\n                    (if (>= k (+ ans_time hikaku_b))\n                        (progn\n                        (incf j)\n                        (incf ans)\n                        (incf ans_time hikaku_b)\n                        )\n                        (return)\n                    )\n                )\n                (if (= hikaku_b -1)\n                    (if (>= k (+ ans_time hikaku_a))\n                        (progn\n                        (incf i)\n                        (incf ans)\n                        (incf ans_time hikaku_a)\n                        )\n                        (return)\n                    )\n                    (if (>= hikaku_a hikaku_b)\n                        (if (>= k (+ ans_time hikaku_b))\n                        (progn\n                        (incf j)\n                        (incf ans)\n                        (incf ans_time hikaku_b)\n                        )\n                        (return)\n                        )\n                        (if (>= k (+ ans_time hikaku_a))\n                        (progn\n                        (incf i)\n                        (incf ans)\n                        (incf ans_time hikaku_a)\n                        )\n                        (return)\n                    )\n                    )\n                )\n            )\n        )\n        \n    )\n    (princ ans)\n)", "language": "Lisp", "metadata": {"date": 1593309669, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s852167803.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s852167803", "user_id": "u136500538"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array n))\n    (b (make-array m))\n    (ans_time 0)\n    (ans 0))\n    (dotimes (i n)\n    (setf (aref a i) (read)))\n    (dotimes (j m)\n    (setf (aref b j) (read))\n    )\n    (let ((i 0)\n        (j 0)\n        (hikaku_a 0)\n        (hikaku_b 0))\n        (loop while (< ans_time k) do\n            (if (> n i)\n                (setq hikaku_a (aref a i))\n                (setq hikaku_a -1)\n            )\n            (if (> m j)\n                (setq hikaku_b (aref b i))\n                (setq hikaku_b -1)\n            )\n\n            (if (= hikaku_a -1)\n                (if (= hikaku_b -1)\n                    (return)\n                    (if (>= k (+ ans_time hikaku_b))\n                        (progn\n                        (incf j)\n                        (incf ans)\n                        (incf ans_time hikaku_b)\n                        )\n                        (return)\n                    )\n                )\n                (if (= hikaku_b -1)\n                    (if (>= k (+ ans_time hikaku_a))\n                        (progn\n                        (incf i)\n                        (incf ans)\n                        (incf ans_time hikaku_a)\n                        )\n                        (return)\n                    )\n                    (if (>= hikaku_a hikaku_b)\n                        (if (>= k (+ ans_time hikaku_b))\n                        (progn\n                        (incf j)\n                        (incf ans)\n                        (incf ans_time hikaku_b)\n                        )\n                        (return)\n                        )\n                        (if (>= k (+ ans_time hikaku_a))\n                        (progn\n                        (incf i)\n                        (incf ans)\n                        (incf ans_time hikaku_a)\n                        )\n                        (return)\n                    )\n                    )\n                )\n            )\n        )\n        \n    )\n    (princ ans)\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2005, "cpu_time_ms": 500, "memory_kb": 80256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s164378139", "group_id": "codeNet:p02623", "input_text": "(defun number-of-readable-books+rest-time (books time-limit)\n  (labels ((rec (books time-limit nbook)\n             (declare (optimize (speed 3)))\n             (if (or (endp books)\n                     (< time-limit (first books)))\n                 (values nbook time-limit)\n                 (rec (rest books) (- time-limit (first books)) (1+ nbook)))))\n    (rec books time-limit 0)))\n\n(let* ((n (read))\n       (m (read))\n       (k (read))\n       (as (loop :repeat n :collect (read)))\n       (bs (loop :repeat m :collect (read))))\n  (declare (type (integer 1 200000) n m)\n           (type (integer 1 1000000000) k))\n  (multiple-value-bind (number-of-readable-books rest-time) (number-of-readable-books+rest-time as k)\n    (loop :for na :below (1+ number-of-readable-books)\n          :maximize (+ na (number-of-readable-books+rest-time bs rest-time)))))\n", "language": "Lisp", "metadata": {"date": 1593309547, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s164378139.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s164378139", "user_id": "u956039157"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defun number-of-readable-books+rest-time (books time-limit)\n  (labels ((rec (books time-limit nbook)\n             (declare (optimize (speed 3)))\n             (if (or (endp books)\n                     (< time-limit (first books)))\n                 (values nbook time-limit)\n                 (rec (rest books) (- time-limit (first books)) (1+ nbook)))))\n    (rec books time-limit 0)))\n\n(let* ((n (read))\n       (m (read))\n       (k (read))\n       (as (loop :repeat n :collect (read)))\n       (bs (loop :repeat m :collect (read))))\n  (declare (type (integer 1 200000) n m)\n           (type (integer 1 1000000000) k))\n  (multiple-value-bind (number-of-readable-books rest-time) (number-of-readable-books+rest-time as k)\n    (loop :for na :below (1+ number-of-readable-books)\n          :maximize (+ na (number-of-readable-books+rest-time bs rest-time)))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 852, "cpu_time_ms": 2208, "memory_kb": 82580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s467713445", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array n))\n    (b (make-array m))\n    (ans_time 0)\n    (ans 0))\n    (dotimes (i n)\n    (setf (aref a i) (read)))\n    (dotimes (j m)\n    (setf (aref b j) (read))\n    )\n    (let ((i 0)\n        (j 0))\n        (loop while (< ans_time k) do\n        (if (< ans_time k)\n            (if (and (> n i) (> m j))\n                (if (<= (aref a i) (aref b j))\n                    (if (>= k (+ ans_time (aref a i)))\n                    (progn\n                    (incf ans)\n                    (incf ans_time (aref a i))\n                    (incf i)\n                    )\n                    (return))\n                    (if (>= k (+ ans_time (aref b j)))\n                    (progn\n                    (incf ans)\n                    (incf ans_time (aref b j))\n                    (incf j)\n                    )\n                    (return))\n                )\n                (if (> n i)\n                    (if (>= k (+ ans_time (aref a i)))\n                    (progn\n                    (incf ans)\n                    (incf ans_time (aref a i))\n                    (incf i)\n                    )\n                    (return))\n                    (if (>= k (+ ans_time (aref b j)))\n                    (progn\n                    (incf ans)\n                    (incf ans_time (aref b j))\n                    (incf j)\n                    )\n                    (return))\n                )\n            )\n            (return)\n        )\n        (if (and (= n i) (= m j))\n        (return))\n        )\n        \n    )\n\n    (princ ans)\n)", "language": "Lisp", "metadata": {"date": 1593308739, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s467713445.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s467713445", "user_id": "u136500538"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n    (m (read))\n    (k (read))\n    (a (make-array n))\n    (b (make-array m))\n    (ans_time 0)\n    (ans 0))\n    (dotimes (i n)\n    (setf (aref a i) (read)))\n    (dotimes (j m)\n    (setf (aref b j) (read))\n    )\n    (let ((i 0)\n        (j 0))\n        (loop while (< ans_time k) do\n        (if (< ans_time k)\n            (if (and (> n i) (> m j))\n                (if (<= (aref a i) (aref b j))\n                    (if (>= k (+ ans_time (aref a i)))\n                    (progn\n                    (incf ans)\n                    (incf ans_time (aref a i))\n                    (incf i)\n                    )\n                    (return))\n                    (if (>= k (+ ans_time (aref b j)))\n                    (progn\n                    (incf ans)\n                    (incf ans_time (aref b j))\n                    (incf j)\n                    )\n                    (return))\n                )\n                (if (> n i)\n                    (if (>= k (+ ans_time (aref a i)))\n                    (progn\n                    (incf ans)\n                    (incf ans_time (aref a i))\n                    (incf i)\n                    )\n                    (return))\n                    (if (>= k (+ ans_time (aref b j)))\n                    (progn\n                    (incf ans)\n                    (incf ans_time (aref b j))\n                    (incf j)\n                    )\n                    (return))\n                )\n            )\n            (return)\n        )\n        (if (and (= n i) (= m j))\n        (return))\n        )\n        \n    )\n\n    (princ ans)\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1576, "cpu_time_ms": 503, "memory_kb": 80376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s594407164", "group_id": "codeNet:p02623", "input_text": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (loop repeat n collect (read)))\n       (b (loop repeat m collect (read))))\n  (format t \"~A~%\"\n          (loop while (and (plusp k)\n                           (or (and (first a) (>= k (first a)))\n                               (and (first b) (>= k (first b)))))\n                count 1\n                do (cond\n                     ((not (first a))\n                      (let ((diff (pop b)))\n                        (decf k diff)))\n                     ((not (first b))\n                      (let ((diff (pop a)))\n                        (decf k diff)))\n                     ((> (first a) (first b))\n                      (let ((diff (pop b)))\n                        (decf k diff)))\n                     (t\n                      (let ((diff (pop a)))\n                        (decf k diff)))))))\n", "language": "Lisp", "metadata": {"date": 1593307610, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Lisp/s594407164.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s594407164", "user_id": "u607637432"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (k (read))\n       (a (loop repeat n collect (read)))\n       (b (loop repeat m collect (read))))\n  (format t \"~A~%\"\n          (loop while (and (plusp k)\n                           (or (and (first a) (>= k (first a)))\n                               (and (first b) (>= k (first b)))))\n                count 1\n                do (cond\n                     ((not (first a))\n                      (let ((diff (pop b)))\n                        (decf k diff)))\n                     ((not (first b))\n                      (let ((diff (pop a)))\n                        (decf k diff)))\n                     ((> (first a) (first b))\n                      (let ((diff (pop b)))\n                        (decf k diff)))\n                     (t\n                      (let ((diff (pop a)))\n                        (decf k diff)))))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 860, "cpu_time_ms": 489, "memory_kb": 83116}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s928847307", "group_id": "codeNet:p02624", "input_text": "(defun sum-of-divisor (n)\n  (loop :for i :from n :downto 1\n        :with basis = 1 and prev-div = 1 and sum = 0 \n        :do (progn\n              (unless (= prev-div (floor n i))\n                (let ((tmp (floor n i)))\n                  (loop :for i :from (+ prev-div 1) :to tmp\n                        :do (incf basis i))\n                  ;(format t \"prev-div: ~A,tmp: ~A~%\" prev-div tmp)\n                  (setq prev-div tmp)))\n              (incf sum (* basis i)))\n              ;(format t \"index:~A, basis:~A, sum:~A~%\" i basis sum))\n        :finally (return sum)))\n\n(format t \"~A~%\" (sum-of-divisor (read)))\n", "language": "Lisp", "metadata": {"date": 1594268125, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Lisp/s928847307.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s928847307", "user_id": "u324761590"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "(defun sum-of-divisor (n)\n  (loop :for i :from n :downto 1\n        :with basis = 1 and prev-div = 1 and sum = 0 \n        :do (progn\n              (unless (= prev-div (floor n i))\n                (let ((tmp (floor n i)))\n                  (loop :for i :from (+ prev-div 1) :to tmp\n                        :do (incf basis i))\n                  ;(format t \"prev-div: ~A,tmp: ~A~%\" prev-div tmp)\n                  (setq prev-div tmp)))\n              (incf sum (* basis i)))\n              ;(format t \"index:~A, basis:~A, sum:~A~%\" i basis sum))\n        :finally (return sum)))\n\n(format t \"~A~%\" (sum-of-divisor (read)))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 615, "cpu_time_ms": 264, "memory_kb": 24244}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s166948882", "group_id": "codeNet:p02624", "input_text": "(let ((n (read))\n    (ans 0))\n    (loop for i from 1 to n do\n        (let ((num (floor (/ n i))))\n            (incf ans (floor (/ (* num (+ num 1) i) 2)))\n        )\n    )\n    (princ ans)\n)", "language": "Lisp", "metadata": {"date": 1593357825, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Lisp/s166948882.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s166948882", "user_id": "u136500538"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "(let ((n (read))\n    (ans 0))\n    (loop for i from 1 to n do\n        (let ((num (floor (/ n i))))\n            (incf ans (floor (/ (* num (+ num 1) i) 2)))\n        )\n    )\n    (princ ans)\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 2407, "memory_kb": 77200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s272590718", "group_id": "codeNet:p02624", "input_text": "(let* ((n (read))\n       (upper (floor (/ n 2)))\n       (ans 0))\n  (loop :for i :from 1 :to upper\n        :do (let ((num (floor (/ n i))))\n              (incf ans (/ (* num (1+ num) i) 2))))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1593315549, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Lisp/s272590718.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s272590718", "user_id": "u608227593"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "(let* ((n (read))\n       (upper (floor (/ n 2)))\n       (ans 0))\n  (loop :for i :from 1 :to upper\n        :do (let ((num (floor (/ n i))))\n              (incf ans (/ (* num (1+ num) i) 2))))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 216, "cpu_time_ms": 1486, "memory_kb": 77340}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s574706297", "group_id": "codeNet:p02624", "input_text": "(declaim (inline divisor?))\n(defun divisor? (n m)\n  (zerop (mod m n)))\n\n(let ((n (read)))\n  (princ (loop :for k :from 1 :to n\n               :sum (* k\n                       (1+ (loop :for i :from 1 :to (if (evenp k) (/ k 2) (/ (1- k) 2))\n                                 :count (divisor? i k)))))))\n", "language": "Lisp", "metadata": {"date": 1593311985, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Lisp/s574706297.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s574706297", "user_id": "u956039157"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "(declaim (inline divisor?))\n(defun divisor? (n m)\n  (zerop (mod m n)))\n\n(let ((n (read)))\n  (princ (loop :for k :from 1 :to n\n               :sum (* k\n                       (1+ (loop :for i :from 1 :to (if (evenp k) (/ k 2) (/ (1- k) 2))\n                                 :count (divisor? i k)))))))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 300, "cpu_time_ms": 3308, "memory_kb": 24600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s612636944", "group_id": "codeNet:p02624", "input_text": "(declaim (inline divisor?))\n(defun divisor? (n m)\n  (zerop (mod m n)))\n\n(let ((n (read)))\n  (princ (loop :for k :from 1 :to n\n               :sum (* k\n                       (loop :for i :from 1 :to k\n                             :count (divisor? i k))))))\n", "language": "Lisp", "metadata": {"date": 1593311882, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Lisp/s612636944.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s612636944", "user_id": "u956039157"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "(declaim (inline divisor?))\n(defun divisor? (n m)\n  (zerop (mod m n)))\n\n(let ((n (read)))\n  (princ (loop :for k :from 1 :to n\n               :sum (* k\n                       (loop :for i :from 1 :to k\n                             :count (divisor? i k))))))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 257, "cpu_time_ms": 3308, "memory_kb": 24604}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s321891837", "group_id": "codeNet:p02642", "input_text": "(let* ((n (read))\n    (a (make-array n :initial-element 0))\n    (cnt (make-array 1000005 :initial-element 0))\n    (ans 0))\n    (dotimes (i n)\n        (incf (aref a i) (read))\n    )\n    (loop for x across a do\n        (if (not (= (aref cnt x) 0))\n            (setf (aref cnt x) 2)\n            (loop for i from x by x while (< i 1000005) do\n                (incf (aref cnt i))\n            )\n        )\n    )\n\n    (loop for x across a do\n        (if (= (aref cnt x) 1)\n        (incf ans))\n    )\n    (princ ans)\n)", "language": "Lisp", "metadata": {"date": 1593367959, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lisp/s321891837.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s321891837", "user_id": "u136500538"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n    (a (make-array n :initial-element 0))\n    (cnt (make-array 1000005 :initial-element 0))\n    (ans 0))\n    (dotimes (i n)\n        (incf (aref a i) (read))\n    )\n    (loop for x across a do\n        (if (not (= (aref cnt x) 0))\n            (setf (aref cnt x) 2)\n            (loop for i from x by x while (< i 1000005) do\n                (incf (aref cnt i))\n            )\n        )\n    )\n\n    (loop for x across a do\n        (if (= (aref cnt x) 1)\n        (incf ans))\n    )\n    (princ ans)\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 508, "cpu_time_ms": 217, "memory_kb": 86420}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s401949279", "group_id": "codeNet:p02642", "input_text": "(let* ((n (read))\n       (a (make-array `(,(+ n 1)) :initial-element 0))\n       (m 0)\n       (dp)\n       (c)\n       (r 0))\n  ;; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  ;;\n  (setf a (sort a #'<))\n  (setf m (aref a (1- (length a))))\n  (setf dp (make-array `(,(1+ m)) :initial-element t))\n  (setf c (make-array `(,(1+ m)) :initial-element nil))\n  ;;\n  (loop :for i :from 1 :to n\n        :do (let ((x (aref a i)))\n              (when (and (null (aref c x)) (aref dp x))\n                (setf (aref c x) t)\n                (loop :for y :from (* x 2) :upto m :by x\n                      :do (setf (aref dp y) nil)))))\n  ;;\n  (loop :for i :from 1 :to n\n        :if (and (or (= i n) (/= (aref a i) (aref a (1+ i))))\n                 (or (= i 1) (/= (aref a (1- i)) (aref a i)))\n                 (aref dp (aref a i)))\n        :do (incf r))\n  (format t \"~A~%\" r))\n", "language": "Lisp", "metadata": {"date": 1592349200, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lisp/s401949279.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s401949279", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (a (make-array `(,(+ n 1)) :initial-element 0))\n       (m 0)\n       (dp)\n       (c)\n       (r 0))\n  ;; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  ;;\n  (setf a (sort a #'<))\n  (setf m (aref a (1- (length a))))\n  (setf dp (make-array `(,(1+ m)) :initial-element t))\n  (setf c (make-array `(,(1+ m)) :initial-element nil))\n  ;;\n  (loop :for i :from 1 :to n\n        :do (let ((x (aref a i)))\n              (when (and (null (aref c x)) (aref dp x))\n                (setf (aref c x) t)\n                (loop :for y :from (* x 2) :upto m :by x\n                      :do (setf (aref dp y) nil)))))\n  ;;\n  (loop :for i :from 1 :to n\n        :if (and (or (= i n) (/= (aref a i) (aref a (1+ i))))\n                 (or (= i 1) (/= (aref a (1- i)) (aref a i)))\n                 (aref dp (aref a i)))\n        :do (incf r))\n  (format t \"~A~%\" r))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 888, "cpu_time_ms": 266, "memory_kb": 88060}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s702613984", "group_id": "codeNet:p02642", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  \"I refered from https://competitive12.blogspot.com/2020/03/common-lisp.html thank you!\"\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n#-swank\n(unless (member :child-sbcl *features*)\n  \"I refered from https://competitive12.blogspot.com/2020/03/common-lisp.html thank you!\"\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"256MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dpline (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defmacro dphash (name args &body expr)\n  `(let ((table (make-hash-table :test #'equal)))\n     (defun  ,name ,args \n       (or (gethash (list ,@args) table)\n           (setf (gethash (list ,@args) table)\n                 (progn \n                   ,@expr))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defmacro aif (expr then else)\n  `(let ((it ,expr))\n     (if it ,then ,else)))\n\n(defmacro awhen (expr &rest then)\n  `(aif ,expr (progn ,@then) nil))\n\n(defun comulative (function list &key base)\n  (if base\n      (comulative function (cons base list))\n      (do ((lst (cdr list) (cdr lst))\n           (acc (list (car list))))\n          ((null lst) (reverse acc))\n        (push (funcall function (car acc) (car lst)) acc))))\n\n(defun binary-search (function left right\n                      &optional\n                        (eps 1)\n                        (average-function (lambda (x y) (ash (+ x y) -1))))\n  (if (<= (abs (- left right)) eps)\n      right\n      (let ((mid (funcall average-function left right)))\n        (if (funcall function mid)\n            (binary-search function left mid eps average-function)\n            (binary-search function mid right eps average-function)))))\n\n(defun arithmetic-mean (&rest body)\n  (/ (apply #'+ body) (length body)))\n\n(defvar +MOD+ (+ (expt 10 9) 7))\n\n(defun range-0-n (n &optional (step 1))\n  (loop for i from 0 below n by step collect i))\n\n(defun range-1-n (n &optional (step 1))\n  (loop for i from 1 below n by step collect i))\n\n(defun range-a-b (a b &optional (step 1))\n  (loop for i from a below b by step collect i))\n\n(defun map-0-n (function n &optional (step 1))\n  (mapcar function (range-0-n n step)))\n\n(defun map-1-n (function n &optional (step 1))\n  (mapcar function (range-1-n n step)))\n\n(defun map-a-b (function a b &optional (step 1))\n  (mapcar function (range-a-b a b step)))\n\n(defun read-string (&optional (stream *standard-input*))\n  (labels ((is-empty (x)\n             (or (char= x #\\space) (char= x #\\newline))))\n    (loop for char = (read-char stream)\n          with result\n          when (and result (is-empty char))\n            do (return (concatenate 'string (nreverse result)))\n          when (null (is-empty char))\n            do (push char result))))\n\n(defun merge-sort (lst &optional (compare #'<))\n  (let ((turn 0))\n    (labels ((merge-list (a b a-length b-length)\n               (cond ((zerop a-length) b)\n                     ((zerop b-length) a)\n                     ((funcall compare (car b) (car a))\n                      (incf turn a-length)\n                      (cons (car b)\n                            (merge-list a (cdr b) a-length (1- b-length))))\n                     (t\n                      (cons (car a)\n                            (merge-list (cdr a) b (1- a-length) b-length)))))\n             (f (lst length)\n               (if (= length 1)\n                   lst\n                   (let ((mid (ash length -1)))\n                     (merge-list (f (subseq lst 0 mid) mid)\n                                 (f (subseq lst mid) (- length mid))\n                                 mid\n                                 (- length mid))))))\n      (values (f lst (length lst)) turn))))\n\n(defun group (lst &optional (test #'eql) (key nil))\n  (let ((table (make-hash-table :test test)))\n    (mapc (lambda (x)\n            (push x (gethash (if key (funcall key x) x) table)))\n          lst)\n    (loop for value being each hash-value in table\n          collect value)))\n\n(defun nearby (&rest args)\n  (let ((current (subseq args 0 (ash (length args) -1)))\n        (validator (subseq args (ash (length args) -1)))\n        (res nil))\n    (labels ((check ()\n               (every (lambda (x y) (and (<= 0 x) (< x y)))\n                      current validator))\n             (f (lst)\n               (unless lst (return-from f))\n               (let ((x (car lst)))\n                 (setf (car lst) (1+ x))\n                 (when (check) (push (copy-list current) res))\n                 (setf (car lst) (1- x))\n                 (when (check) (push (copy-list current) res))\n                 (setf (car lst) x))\n               (f (cdr lst))))\n      (f current)\n      res)))\n\n(defun count-same (lst)\n  (reverse\n   (reduce\n    (lambda (x y)\n      (if (= (caar x) y)\n          (progn\n            (incf (cdar x))\n            x)\n          (cons (cons y 1) x)))\n    (cdr lst)\n    :initial-value (list (cons (car lst) 1)))))\n\n(defun remove-if-duplicates (lst)\n  (loop for i in (count-same lst)\n        when (= (cdr i) 1)\n          collect (car i)))\n\n(defun func (lst)\n  (if lst\n      (let ((current (car lst)))\n        (1+ (func (remove-if (lambda (x) (zerop (mod x current))) lst))))\n      0))\n\n\n(defun main (lst)\n  (func (remove-if-duplicates (sort lst #'<))))\n\n\n#-swank\n(princ (main (read-times (read))))\n", "language": "Lisp", "metadata": {"date": 1592192441, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lisp/s702613984.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s702613984", "user_id": "u493610446"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  \"I refered from https://competitive12.blogspot.com/2020/03/common-lisp.html thank you!\"\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n#-swank\n(unless (member :child-sbcl *features*)\n  \"I refered from https://competitive12.blogspot.com/2020/03/common-lisp.html thank you!\"\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"256MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dpline (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defmacro dphash (name args &body expr)\n  `(let ((table (make-hash-table :test #'equal)))\n     (defun  ,name ,args \n       (or (gethash (list ,@args) table)\n           (setf (gethash (list ,@args) table)\n                 (progn \n                   ,@expr))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defmacro aif (expr then else)\n  `(let ((it ,expr))\n     (if it ,then ,else)))\n\n(defmacro awhen (expr &rest then)\n  `(aif ,expr (progn ,@then) nil))\n\n(defun comulative (function list &key base)\n  (if base\n      (comulative function (cons base list))\n      (do ((lst (cdr list) (cdr lst))\n           (acc (list (car list))))\n          ((null lst) (reverse acc))\n        (push (funcall function (car acc) (car lst)) acc))))\n\n(defun binary-search (function left right\n                      &optional\n                        (eps 1)\n                        (average-function (lambda (x y) (ash (+ x y) -1))))\n  (if (<= (abs (- left right)) eps)\n      right\n      (let ((mid (funcall average-function left right)))\n        (if (funcall function mid)\n            (binary-search function left mid eps average-function)\n            (binary-search function mid right eps average-function)))))\n\n(defun arithmetic-mean (&rest body)\n  (/ (apply #'+ body) (length body)))\n\n(defvar +MOD+ (+ (expt 10 9) 7))\n\n(defun range-0-n (n &optional (step 1))\n  (loop for i from 0 below n by step collect i))\n\n(defun range-1-n (n &optional (step 1))\n  (loop for i from 1 below n by step collect i))\n\n(defun range-a-b (a b &optional (step 1))\n  (loop for i from a below b by step collect i))\n\n(defun map-0-n (function n &optional (step 1))\n  (mapcar function (range-0-n n step)))\n\n(defun map-1-n (function n &optional (step 1))\n  (mapcar function (range-1-n n step)))\n\n(defun map-a-b (function a b &optional (step 1))\n  (mapcar function (range-a-b a b step)))\n\n(defun read-string (&optional (stream *standard-input*))\n  (labels ((is-empty (x)\n             (or (char= x #\\space) (char= x #\\newline))))\n    (loop for char = (read-char stream)\n          with result\n          when (and result (is-empty char))\n            do (return (concatenate 'string (nreverse result)))\n          when (null (is-empty char))\n            do (push char result))))\n\n(defun merge-sort (lst &optional (compare #'<))\n  (let ((turn 0))\n    (labels ((merge-list (a b a-length b-length)\n               (cond ((zerop a-length) b)\n                     ((zerop b-length) a)\n                     ((funcall compare (car b) (car a))\n                      (incf turn a-length)\n                      (cons (car b)\n                            (merge-list a (cdr b) a-length (1- b-length))))\n                     (t\n                      (cons (car a)\n                            (merge-list (cdr a) b (1- a-length) b-length)))))\n             (f (lst length)\n               (if (= length 1)\n                   lst\n                   (let ((mid (ash length -1)))\n                     (merge-list (f (subseq lst 0 mid) mid)\n                                 (f (subseq lst mid) (- length mid))\n                                 mid\n                                 (- length mid))))))\n      (values (f lst (length lst)) turn))))\n\n(defun group (lst &optional (test #'eql) (key nil))\n  (let ((table (make-hash-table :test test)))\n    (mapc (lambda (x)\n            (push x (gethash (if key (funcall key x) x) table)))\n          lst)\n    (loop for value being each hash-value in table\n          collect value)))\n\n(defun nearby (&rest args)\n  (let ((current (subseq args 0 (ash (length args) -1)))\n        (validator (subseq args (ash (length args) -1)))\n        (res nil))\n    (labels ((check ()\n               (every (lambda (x y) (and (<= 0 x) (< x y)))\n                      current validator))\n             (f (lst)\n               (unless lst (return-from f))\n               (let ((x (car lst)))\n                 (setf (car lst) (1+ x))\n                 (when (check) (push (copy-list current) res))\n                 (setf (car lst) (1- x))\n                 (when (check) (push (copy-list current) res))\n                 (setf (car lst) x))\n               (f (cdr lst))))\n      (f current)\n      res)))\n\n(defun count-same (lst)\n  (reverse\n   (reduce\n    (lambda (x y)\n      (if (= (caar x) y)\n          (progn\n            (incf (cdar x))\n            x)\n          (cons (cons y 1) x)))\n    (cdr lst)\n    :initial-value (list (cons (car lst) 1)))))\n\n(defun remove-if-duplicates (lst)\n  (loop for i in (count-same lst)\n        when (= (cdr i) 1)\n          collect (car i)))\n\n(defun func (lst)\n  (if lst\n      (let ((current (car lst)))\n        (1+ (func (remove-if (lambda (x) (zerop (mod x current))) lst))))\n      0))\n\n\n(defun main (lst)\n  (func (remove-if-duplicates (sort lst #'<))))\n\n\n#-swank\n(princ (main (read-times (read))))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6395, "cpu_time_ms": 2206, "memory_kb": 890576}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s925011771", "group_id": "codeNet:p02642", "input_text": "(defun main ()\n  (let* ((n (read))\n         (m 1)\n         (a (make-array `(,(1+ n)) :initial-element 0))\n         (c (make-array `(,(1+ n)) :initial-element 1))\n         (b (make-array `(,(1+ n)) :initial-element 0))\n         (r 0))\n    (when (= n 1)\n      (format t \"~A~%\" 1)\n      (return-from main))\n    ;; read\n    (loop :for i :from 1 :to n\n          :do (setf (aref a i) (read)))\n    (setf a (sort a #'<))\n    ;;\n    (setf (aref b 1) (aref a 1))\n    (loop :for i :from 2 :to n\n          :do (let* ((x (aref a i))\n                     (flag t))\n                (loop :named inner\n                      :for j :from 1 :to m\n                      :do (let* ((y (aref b j))\n                                 (gcd (gcd x y)))\n                            (when (/= gcd 1)\n                              (if (= gcd y)\n                                  (setf (aref c j) 0)\n                                  (setf (aref b j) (min gcd y)))\n                              (setf flag nil)\n                              (return-from inner))))\n                (when flag\n                  (setf (aref b (incf m)) x))))\n    ;;\n    (loop :for i :from 1 :to n\n          :if (> (* (aref b i) (aref c i)) 0)\n          :do (incf r))\n    (format t \"~A~%\" r)))\n(main)\n\n                                ", "language": "Lisp", "metadata": {"date": 1592188701, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lisp/s925011771.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s925011771", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (m 1)\n         (a (make-array `(,(1+ n)) :initial-element 0))\n         (c (make-array `(,(1+ n)) :initial-element 1))\n         (b (make-array `(,(1+ n)) :initial-element 0))\n         (r 0))\n    (when (= n 1)\n      (format t \"~A~%\" 1)\n      (return-from main))\n    ;; read\n    (loop :for i :from 1 :to n\n          :do (setf (aref a i) (read)))\n    (setf a (sort a #'<))\n    ;;\n    (setf (aref b 1) (aref a 1))\n    (loop :for i :from 2 :to n\n          :do (let* ((x (aref a i))\n                     (flag t))\n                (loop :named inner\n                      :for j :from 1 :to m\n                      :do (let* ((y (aref b j))\n                                 (gcd (gcd x y)))\n                            (when (/= gcd 1)\n                              (if (= gcd y)\n                                  (setf (aref c j) 0)\n                                  (setf (aref b j) (min gcd y)))\n                              (setf flag nil)\n                              (return-from inner))))\n                (when flag\n                  (setf (aref b (incf m)) x))))\n    ;;\n    (loop :for i :from 1 :to n\n          :if (> (* (aref b i) (aref c i)) 0)\n          :do (incf r))\n    (format t \"~A~%\" r)))\n(main)\n\n                                ", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1283, "cpu_time_ms": 2209, "memory_kb": 80236}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s958168215", "group_id": "codeNet:p02642", "input_text": "(defun main ()\n  (let* ((n (read))\n         (s 1)\n         (j (1+ s))\n         (m n)\n         (a (make-array `(,(1+ n)) :initial-element 0))\n         (r 0))\n    (when (= n 1)\n      (format t \"~A~%\" 1)\n      (return-from main))\n    ;; read\n    (loop :for i :from 1 :to n\n          :do (setf (aref a i) (read)))\n    ;;\n    (setf a (sort a #'<))\n    ;;\n    (loop :named main\n          :do  (loop :for i :from (1+ s) :to m\n                     :do (when (/= 0 (mod (aref a i) (aref a s)))\n                           (setf (aref a j) (aref a i))\n                           (incf j)))\n               (when (= (aref a s) (aref a (1+ s)))\n                 (setf (aref a s) 0))\n               (incf s)\n               (setf m (1- j))\n               (setf j (1+ s))\n               (when (or (>= s m) (> (aref a s) 500000))\n                 (return-from main)))\n    (loop :for i :from 1 :to m\n          :if (/= 0 (aref a m))\n          :do (incf r))\n    (format t \"~A~%\" r)))\n(main)\n", "language": "Lisp", "metadata": {"date": 1592187350, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lisp/s958168215.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s958168215", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (s 1)\n         (j (1+ s))\n         (m n)\n         (a (make-array `(,(1+ n)) :initial-element 0))\n         (r 0))\n    (when (= n 1)\n      (format t \"~A~%\" 1)\n      (return-from main))\n    ;; read\n    (loop :for i :from 1 :to n\n          :do (setf (aref a i) (read)))\n    ;;\n    (setf a (sort a #'<))\n    ;;\n    (loop :named main\n          :do  (loop :for i :from (1+ s) :to m\n                     :do (when (/= 0 (mod (aref a i) (aref a s)))\n                           (setf (aref a j) (aref a i))\n                           (incf j)))\n               (when (= (aref a s) (aref a (1+ s)))\n                 (setf (aref a s) 0))\n               (incf s)\n               (setf m (1- j))\n               (setf j (1+ s))\n               (when (or (>= s m) (> (aref a s) 500000))\n                 (return-from main)))\n    (loop :for i :from 1 :to m\n          :if (/= 0 (aref a m))\n          :do (incf r))\n    (format t \"~A~%\" r)))\n(main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 970, "cpu_time_ms": 2208, "memory_kb": 78644}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s978650340", "group_id": "codeNet:p02642", "input_text": "(let* ((n (read))\n       (s 1)\n       (j (1+ s))\n       (m n)\n       (a (make-array `(,(1+ n)) :initial-element 0))\n       (r 0))\n  ;; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  ;;\n  (setf a (sort a #'<))\n  ;;\n  (loop :named main\n        :do  (loop :for i :from (1+ s) :to m\n                   :do (when (/= 0 (mod (aref a i) (aref a s)))\n                         (setf (aref a j) (aref a i))\n                         (incf j)))\n             (when (= (aref a s) (aref a (1+ s)))\n               (setf (aref a s) 0))\n             (incf s)\n             (setf m (1- j))\n             (setf j (1+ s))\n             (when (>= s m)\n               (return-from main)))\n  (loop :for i :from 1 :to m\n        :if (/= 0 (aref a m))\n        :do (incf r))\n  (format t \"~A~%\" r))\n", "language": "Lisp", "metadata": {"date": 1592186736, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lisp/s978650340.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s978650340", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (s 1)\n       (j (1+ s))\n       (m n)\n       (a (make-array `(,(1+ n)) :initial-element 0))\n       (r 0))\n  ;; read\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  ;;\n  (setf a (sort a #'<))\n  ;;\n  (loop :named main\n        :do  (loop :for i :from (1+ s) :to m\n                   :do (when (/= 0 (mod (aref a i) (aref a s)))\n                         (setf (aref a j) (aref a i))\n                         (incf j)))\n             (when (= (aref a s) (aref a (1+ s)))\n               (setf (aref a s) 0))\n             (incf s)\n             (setf m (1- j))\n             (setf j (1+ s))\n             (when (>= s m)\n               (return-from main)))\n  (loop :for i :from 1 :to m\n        :if (/= 0 (aref a m))\n        :do (incf r))\n  (format t \"~A~%\" r))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 794, "cpu_time_ms": 2208, "memory_kb": 78804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s322024358", "group_id": "codeNet:p02642", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  \"I refered from https://competitive12.blogspot.com/2020/03/common-lisp.html thank you!\"\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n#-swank\n(unless (member :child-sbcl *features*)\n  \"I refered from https://competitive12.blogspot.com/2020/03/common-lisp.html thank you!\"\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"256MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dpline (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defmacro dphash (name args &body expr)\n  `(let ((table (make-hash-table :test #'equal)))\n     (defun  ,name ,args \n       (or (gethash (list ,@args) table)\n           (setf (gethash (list ,@args) table)\n                 (progn \n                   ,@expr))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defmacro aif (expr then else)\n  `(let ((it ,expr))\n     (if it ,then ,else)))\n\n(defmacro awhen (expr &rest then)\n  `(aif ,expr (progn ,@then) nil))\n\n(defun comulative (function list &key base)\n  (if base\n      (comulative function (cons base list))\n      (do ((lst (cdr list) (cdr lst))\n           (acc (list (car list))))\n          ((null lst) (reverse acc))\n        (push (funcall function (car acc) (car lst)) acc))))\n\n(defun binary-search (function left right\n                      &optional\n                        (eps 1)\n                        (average-function (lambda (x y) (ash (+ x y) -1))))\n  (if (<= (abs (- left right)) eps)\n      right\n      (let ((mid (funcall average-function left right)))\n        (if (funcall function mid)\n            (binary-search function left mid eps average-function)\n            (binary-search function mid right eps average-function)))))\n\n(defun arithmetic-mean (&rest body)\n  (/ (apply #'+ body) (length body)))\n\n(defvar +MOD+ (+ (expt 10 9) 7))\n\n(defun range-0-n (n &optional (step 1))\n  (loop for i from 0 below n by step collect i))\n\n(defun range-1-n (n &optional (step 1))\n  (loop for i from 1 below n by step collect i))\n\n(defun range-a-b (a b &optional (step 1))\n  (loop for i from a below b by step collect i))\n\n(defun map-0-n (function n &optional (step 1))\n  (mapcar function (range-0-n n step)))\n\n(defun map-1-n (function n &optional (step 1))\n  (mapcar function (range-1-n n step)))\n\n(defun map-a-b (function a b &optional (step 1))\n  (mapcar function (range-a-b a b step)))\n\n(defun read-string (&optional (stream *standard-input*))\n  (labels ((is-empty (x)\n             (or (char= x #\\space) (char= x #\\newline))))\n    (loop for char = (read-char stream)\n          with result\n          when (and result (is-empty char))\n            do (return (concatenate 'string (nreverse result)))\n          when (null (is-empty char))\n            do (push char result))))\n\n(defun merge-sort (lst &optional (compare #'<))\n  (let ((turn 0))\n    (labels ((merge-list (a b a-length b-length)\n               (cond ((zerop a-length) b)\n                     ((zerop b-length) a)\n                     ((funcall compare (car b) (car a))\n                      (incf turn a-length)\n                      (cons (car b)\n                            (merge-list a (cdr b) a-length (1- b-length))))\n                     (t\n                      (cons (car a)\n                            (merge-list (cdr a) b (1- a-length) b-length)))))\n             (f (lst length)\n               (if (= length 1)\n                   lst\n                   (let ((mid (ash length -1)))\n                     (merge-list (f (subseq lst 0 mid) mid)\n                                 (f (subseq lst mid) (- length mid))\n                                 mid\n                                 (- length mid))))))\n      (values (f lst (length lst)) turn))))\n\n(defun group (lst &optional (test #'eql) (key nil))\n  (let ((table (make-hash-table :test test)))\n    (mapc (lambda (x)\n            (push x (gethash (if key (funcall key x) x) table)))\n          lst)\n    (loop for value being each hash-value in table\n          collect value)))\n\n(defun nearby (&rest args)\n  (let ((current (subseq args 0 (ash (length args) -1)))\n        (validator (subseq args (ash (length args) -1)))\n        (res nil))\n    (labels ((check ()\n               (every (lambda (x y) (and (<= 0 x) (< x y)))\n                      current validator))\n             (f (lst)\n               (unless lst (return-from f))\n               (let ((x (car lst)))\n                 (setf (car lst) (1+ x))\n                 (when (check) (push (copy-list current) res))\n                 (setf (car lst) (1- x))\n                 (when (check) (push (copy-list current) res))\n                 (setf (car lst) x))\n               (f (cdr lst))))\n      (f current)\n      res)))\n\n(defvar var-max (expt 10 6))\n\n(defun main (n lst)\n  (let ((nums (make-array (list (1+ var-max)) :initial-element 0))\n        (cnt 0))\n    (dolist (i lst)\n      (incf (aref nums i)))\n    (loop for i from 1 to var-max\n          when (= (aref nums i) 1)\n            sum 1\n          when (>= (aref nums i) 1)\n            do\n               (loop for j from i to var-max by i\n                     do\n                     (setf (aref nums j) 0)))))\n\n\n#-swank\n(let ((n (read)))\n  (princ (main n (read-times n))))\n\n(main 5\n      (list 24 11 8 3 16))\n", "language": "Lisp", "metadata": {"date": 1592186459, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lisp/s322024358.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s322024358", "user_id": "u493610446"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  \"I refered from https://competitive12.blogspot.com/2020/03/common-lisp.html thank you!\"\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n#-swank\n(unless (member :child-sbcl *features*)\n  \"I refered from https://competitive12.blogspot.com/2020/03/common-lisp.html thank you!\"\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"256MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dpline (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defmacro dphash (name args &body expr)\n  `(let ((table (make-hash-table :test #'equal)))\n     (defun  ,name ,args \n       (or (gethash (list ,@args) table)\n           (setf (gethash (list ,@args) table)\n                 (progn \n                   ,@expr))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defmacro aif (expr then else)\n  `(let ((it ,expr))\n     (if it ,then ,else)))\n\n(defmacro awhen (expr &rest then)\n  `(aif ,expr (progn ,@then) nil))\n\n(defun comulative (function list &key base)\n  (if base\n      (comulative function (cons base list))\n      (do ((lst (cdr list) (cdr lst))\n           (acc (list (car list))))\n          ((null lst) (reverse acc))\n        (push (funcall function (car acc) (car lst)) acc))))\n\n(defun binary-search (function left right\n                      &optional\n                        (eps 1)\n                        (average-function (lambda (x y) (ash (+ x y) -1))))\n  (if (<= (abs (- left right)) eps)\n      right\n      (let ((mid (funcall average-function left right)))\n        (if (funcall function mid)\n            (binary-search function left mid eps average-function)\n            (binary-search function mid right eps average-function)))))\n\n(defun arithmetic-mean (&rest body)\n  (/ (apply #'+ body) (length body)))\n\n(defvar +MOD+ (+ (expt 10 9) 7))\n\n(defun range-0-n (n &optional (step 1))\n  (loop for i from 0 below n by step collect i))\n\n(defun range-1-n (n &optional (step 1))\n  (loop for i from 1 below n by step collect i))\n\n(defun range-a-b (a b &optional (step 1))\n  (loop for i from a below b by step collect i))\n\n(defun map-0-n (function n &optional (step 1))\n  (mapcar function (range-0-n n step)))\n\n(defun map-1-n (function n &optional (step 1))\n  (mapcar function (range-1-n n step)))\n\n(defun map-a-b (function a b &optional (step 1))\n  (mapcar function (range-a-b a b step)))\n\n(defun read-string (&optional (stream *standard-input*))\n  (labels ((is-empty (x)\n             (or (char= x #\\space) (char= x #\\newline))))\n    (loop for char = (read-char stream)\n          with result\n          when (and result (is-empty char))\n            do (return (concatenate 'string (nreverse result)))\n          when (null (is-empty char))\n            do (push char result))))\n\n(defun merge-sort (lst &optional (compare #'<))\n  (let ((turn 0))\n    (labels ((merge-list (a b a-length b-length)\n               (cond ((zerop a-length) b)\n                     ((zerop b-length) a)\n                     ((funcall compare (car b) (car a))\n                      (incf turn a-length)\n                      (cons (car b)\n                            (merge-list a (cdr b) a-length (1- b-length))))\n                     (t\n                      (cons (car a)\n                            (merge-list (cdr a) b (1- a-length) b-length)))))\n             (f (lst length)\n               (if (= length 1)\n                   lst\n                   (let ((mid (ash length -1)))\n                     (merge-list (f (subseq lst 0 mid) mid)\n                                 (f (subseq lst mid) (- length mid))\n                                 mid\n                                 (- length mid))))))\n      (values (f lst (length lst)) turn))))\n\n(defun group (lst &optional (test #'eql) (key nil))\n  (let ((table (make-hash-table :test test)))\n    (mapc (lambda (x)\n            (push x (gethash (if key (funcall key x) x) table)))\n          lst)\n    (loop for value being each hash-value in table\n          collect value)))\n\n(defun nearby (&rest args)\n  (let ((current (subseq args 0 (ash (length args) -1)))\n        (validator (subseq args (ash (length args) -1)))\n        (res nil))\n    (labels ((check ()\n               (every (lambda (x y) (and (<= 0 x) (< x y)))\n                      current validator))\n             (f (lst)\n               (unless lst (return-from f))\n               (let ((x (car lst)))\n                 (setf (car lst) (1+ x))\n                 (when (check) (push (copy-list current) res))\n                 (setf (car lst) (1- x))\n                 (when (check) (push (copy-list current) res))\n                 (setf (car lst) x))\n               (f (cdr lst))))\n      (f current)\n      res)))\n\n(defvar var-max (expt 10 6))\n\n(defun main (n lst)\n  (let ((nums (make-array (list (1+ var-max)) :initial-element 0))\n        (cnt 0))\n    (dolist (i lst)\n      (incf (aref nums i)))\n    (loop for i from 1 to var-max\n          when (= (aref nums i) 1)\n            sum 1\n          when (>= (aref nums i) 1)\n            do\n               (loop for j from i to var-max by i\n                     do\n                     (setf (aref nums j) 0)))))\n\n\n#-swank\n(let ((n (read)))\n  (princ (main n (read-times n))))\n\n(main 5\n      (list 24 11 8 3 16))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6310, "cpu_time_ms": 253, "memory_kb": 95224}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s846771267", "group_id": "codeNet:p02642", "input_text": "(let* ((n (read))\n       (m (sort (loop :repeat n :collect (read)) #'<))\n       (ll (make-array (+ 2 (expt 10 6)) :element-type 'bit :initial-element 1))\n       (ans 0))\n  (loop :for k :in m\n        :with x = -1\n        :do(if (and (not (= k x)) (= 1 (aref ll k)))\n               (progn (loop :for j :from k :upto (1+ (expt 10 6)) :by k\n                            :if (= 1 (aref ll j)) :do(setf (aref ll j) 0))\n                      (incf ans)))\n        :do(setf x k))\n  (princ ans))", "language": "Lisp", "metadata": {"date": 1592185030, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lisp/s846771267.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s846771267", "user_id": "u610490393"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (m (sort (loop :repeat n :collect (read)) #'<))\n       (ll (make-array (+ 2 (expt 10 6)) :element-type 'bit :initial-element 1))\n       (ans 0))\n  (loop :for k :in m\n        :with x = -1\n        :do(if (and (not (= k x)) (= 1 (aref ll k)))\n               (progn (loop :for j :from k :upto (1+ (expt 10 6)) :by k\n                            :if (= 1 (aref ll j)) :do(setf (aref ll j) 0))\n                      (incf ans)))\n        :do(setf x k))\n  (princ ans))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 484, "cpu_time_ms": 282, "memory_kb": 80076}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s702551137", "group_id": "codeNet:p02642", "input_text": "(let* ((n (read))\n       (m (sort (loop :repeat n :collect (read)) #'<))\n       (ll (make-array (+ 2 (expt 10 6)) :element-type 'bit :initial-element 1))\n       (ans 0))\n  (loop :for k :in m\n        :with x = -1\n        :do(if (and (= k x) (= 1 (aref ll k))) (incf ans))\n        :do(loop :for j :from k :upto (1+ (expt 10 6)) :by k\n                 :if (= 1 (aref ll j)) :do(setf (aref ll j) 0))\n        :do(setf x k))\n  (princ ans))", "language": "Lisp", "metadata": {"date": 1592184736, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lisp/s702551137.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s702551137", "user_id": "u610490393"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (m (sort (loop :repeat n :collect (read)) #'<))\n       (ll (make-array (+ 2 (expt 10 6)) :element-type 'bit :initial-element 1))\n       (ans 0))\n  (loop :for k :in m\n        :with x = -1\n        :do(if (and (= k x) (= 1 (aref ll k))) (incf ans))\n        :do(loop :for j :from k :upto (1+ (expt 10 6)) :by k\n                 :if (= 1 (aref ll j)) :do(setf (aref ll j) 0))\n        :do(setf x k))\n  (princ ans))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 433, "cpu_time_ms": 2208, "memory_kb": 79940}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s247697372", "group_id": "codeNet:p02642", "input_text": "(let* ((n (read))\n       (m (concatenate 'vector (loop :repeat n :collect (read)))))\n  (loop :for k :from 0 :upto (1- n)\n        :count (not (loop :for j :from 0 :upto (1- n)\n                          :if (and (not (= k j))\n                                   (= 0 (mod (aref m k) (aref m j))))\n                            :return t))))", "language": "Lisp", "metadata": {"date": 1592184026, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Lisp/s247697372.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s247697372", "user_id": "u610490393"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (m (concatenate 'vector (loop :repeat n :collect (read)))))\n  (loop :for k :from 0 :upto (1- n)\n        :count (not (loop :for j :from 0 :upto (1- n)\n                          :if (and (not (= k j))\n                                   (= 0 (mod (aref m k) (aref m j))))\n                            :return t))))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 335, "cpu_time_ms": 2208, "memory_kb": 79312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s584068084", "group_id": "codeNet:p02658", "input_text": "(defun main (lst accum)\n  (cond ((not (car lst)) accum)\n        ((position 0 lst) 0)\n        ((< (expt 10 18) (car lst)) -1)\n        ((< (expt 10 18) (* (car lst) accum)) -1)\n        (t (main (cdr lst) (* (car lst) accum)))))\n\n(princ (write-to-string (main (sort (loop :repeat (read) :collect (read)) #'<) 1)))\n", "language": "Lisp", "metadata": {"date": 1601275682, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s584068084.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s584068084", "user_id": "u761519515"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun main (lst accum)\n  (cond ((not (car lst)) accum)\n        ((position 0 lst) 0)\n        ((< (expt 10 18) (car lst)) -1)\n        ((< (expt 10 18) (* (car lst) accum)) -1)\n        (t (main (cdr lst) (* (car lst) accum)))))\n\n(princ (write-to-string (main (sort (loop :repeat (read) :collect (read)) #'<) 1)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 311, "cpu_time_ms": 2208, "memory_kb": 77716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s323436912", "group_id": "codeNet:p02658", "input_text": "(defun main (lst accum)\n  (cond ((not (car lst)) accum)\n        ((find 0 lst) 0)\n        ((< (expt 10 18) (* (car lst) accum)) -1)\n        (t (main (cdr lst) (* (car lst) accum)))))\n\n(princ (write-to-string (main (loop :repeat (read) :collect (read)) 1)))\n", "language": "Lisp", "metadata": {"date": 1601275071, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s323436912.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s323436912", "user_id": "u761519515"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun main (lst accum)\n  (cond ((not (car lst)) accum)\n        ((find 0 lst) 0)\n        ((< (expt 10 18) (* (car lst) accum)) -1)\n        (t (main (cdr lst) (* (car lst) accum)))))\n\n(princ (write-to-string (main (loop :repeat (read) :collect (read)) 1)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 256, "cpu_time_ms": 2207, "memory_kb": 77760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s106004621", "group_id": "codeNet:p02658", "input_text": "(defun main (lst accum)\n  (cond ((not (car lst)) accum)\n        ((< (expt 10 18) (* (car lst) accum)) -1)\n        (t (main (cdr lst) (* (car lst) accum))))  )\n\n(princ (write-to-string (main (loop :repeat (read) :collect (read)) 1)))\n", "language": "Lisp", "metadata": {"date": 1601274667, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s106004621.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s106004621", "user_id": "u761519515"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun main (lst accum)\n  (cond ((not (car lst)) accum)\n        ((< (expt 10 18) (* (car lst) accum)) -1)\n        (t (main (cdr lst) (* (car lst) accum))))  )\n\n(princ (write-to-string (main (loop :repeat (read) :collect (read)) 1)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 233, "cpu_time_ms": 216, "memory_kb": 77636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s583154119", "group_id": "codeNet:p02658", "input_text": "(let ((accum 1))\n  (dotimes (index (read))\n    (setq accum (* accum (read))))\n  (princ (if (<= accum (expt 10 18)) (write-to-string accum) \"-1\")))\n", "language": "Lisp", "metadata": {"date": 1601003790, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s583154119.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s583154119", "user_id": "u761519515"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(let ((accum 1))\n  (dotimes (index (read))\n    (setq accum (* accum (read))))\n  (princ (if (<= accum (expt 10 18)) (write-to-string accum) \"-1\")))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 2208, "memory_kb": 103192}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s326763575", "group_id": "codeNet:p02658", "input_text": "(defun main (lst)\n  (reduce  #'(lambda (accum elem) (* accum elem)) lst :initial-value 1))\n\n(let ((sum (main (loop :repeat (read) :collect (read)))))\n  (princ (if (<= sum (expt 10 18)) (write-to-string sum) \"-1\")))\n", "language": "Lisp", "metadata": {"date": 1601003523, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s326763575.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s326763575", "user_id": "u761519515"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun main (lst)\n  (reduce  #'(lambda (accum elem) (* accum elem)) lst :initial-value 1))\n\n(let ((sum (main (loop :repeat (read) :collect (read)))))\n  (princ (if (<= sum (expt 10 18)) (write-to-string sum) \"-1\")))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 215, "cpu_time_ms": 2208, "memory_kb": 110416}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s464954004", "group_id": "codeNet:p02658", "input_text": "(defun App (n)\n    (let ((ans 1)\n        (a Nil))\n\n    (loop for i below n\n        do (push (read) a)\n    )\n\n    (setf a (sort a #'<))\n\n    (loop for i in a\n        do (progn\n            (if (and (= ans 0))\n            (return)\n            (progn (setf ans (* ans i))\n                (if (> ans 1000000000000000000)\n                (progn \n                    (setq ans -1)\n                    (return)\n                )\n                )\n            )\n            )\n        )\n    )   \n    ans)\n)\n(format t \"~D~%\" (App (read)))\n", "language": "Lisp", "metadata": {"date": 1592322406, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s464954004.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s464954004", "user_id": "u136500538"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun App (n)\n    (let ((ans 1)\n        (a Nil))\n\n    (loop for i below n\n        do (push (read) a)\n    )\n\n    (setf a (sort a #'<))\n\n    (loop for i in a\n        do (progn\n            (if (and (= ans 0))\n            (return)\n            (progn (setf ans (* ans i))\n                (if (> ans 1000000000000000000)\n                (progn \n                    (setq ans -1)\n                    (return)\n                )\n                )\n            )\n            )\n        )\n    )   \n    ans)\n)\n(format t \"~D~%\" (App (read)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 528, "cpu_time_ms": 226, "memory_kb": 78456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s936718317", "group_id": "codeNet:p02658", "input_text": "(defun main ()\n  (let ((l (loop repeat (read)\n                 collect (read)))\n        (result 1))\n    (block calc\n      (dolist (x l)\n        (if (> (write-to-string result) 18)\n            (progn\n              (setq result nil)\n              (return-from calc nil))\n            (setq result (* result x)))))\n    (format t \"~A~%\"\n            (if result\n                result\n                -1))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1591580778, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s936718317.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s936718317", "user_id": "u631655863"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun main ()\n  (let ((l (loop repeat (read)\n                 collect (read)))\n        (result 1))\n    (block calc\n      (dolist (x l)\n        (if (> (write-to-string result) 18)\n            (progn\n              (setq result nil)\n              (return-from calc nil))\n            (setq result (* result x)))))\n    (format t \"~A~%\"\n            (if result\n                result\n                -1))))\n\n(main)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 409, "cpu_time_ms": 205, "memory_kb": 80812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s549292549", "group_id": "codeNet:p02658", "input_text": "(let* ((n (read))\n       (arr (loop :repeat n :collect (read)))\n       (product (apply #'* arr)))\n      (princ (if (< (expt 10 18) product) -1 product)))", "language": "Lisp", "metadata": {"date": 1591192491, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s549292549.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s549292549", "user_id": "u606976120"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(let* ((n (read))\n       (arr (loop :repeat n :collect (read)))\n       (product (apply #'* arr)))\n      (princ (if (< (expt 10 18) product) -1 product)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 153, "cpu_time_ms": 2209, "memory_kb": 110868}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s015619958", "group_id": "codeNet:p02658", "input_text": "(defun mul (xs &optional (ans 1))\n  (cond\n    ((null xs) ans)\n    ((= ans 0) 0)\n    (t (mul (rest xs) (min (+ (expt 10 18) 1) (* ans (first xs)))))))\n\n    \n(defun solve (a)\n  (if (> a (expt 10 18))\n      -1\n      a))\n\n(let ((n (read))\n      (a (sort (read-from-string\n          (concatenate 'string\n                       \"(\" (read-line) \")\")) #'<=)))\n     (princ (solve (mul a))))", "language": "Lisp", "metadata": {"date": 1591105489, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s015619958.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s015619958", "user_id": "u425762225"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun mul (xs &optional (ans 1))\n  (cond\n    ((null xs) ans)\n    ((= ans 0) 0)\n    (t (mul (rest xs) (min (+ (expt 10 18) 1) (* ans (first xs)))))))\n\n    \n(defun solve (a)\n  (if (> a (expt 10 18))\n      -1\n      a))\n\n(let ((n (read))\n      (a (sort (read-from-string\n          (concatenate 'string\n                       \"(\" (read-line) \")\")) #'<=)))\n     (princ (solve (mul a))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 201, "memory_kb": 56800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s025215574", "group_id": "codeNet:p02658", "input_text": "(defun mul (xs &optional (ans 1))\n  (cond\n    ((null xs) ans)\n    ((= ans 0) 0)\n    (t (mul (rest xs) (min (+ (expt 10 18) 1) (* ans (first xs)))))))\n\n    \n(defun solve (a)\n  (if (> a (expt 10 18))\n      -1\n      a))\n\n(let ((n (read))\n      (a (read-from-string\n          (concatenate 'string\n                       \"(\" (read-line) \")\"))))\n     (princ (solve (mul a))))", "language": "Lisp", "metadata": {"date": 1591105191, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s025215574.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s025215574", "user_id": "u425762225"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun mul (xs &optional (ans 1))\n  (cond\n    ((null xs) ans)\n    ((= ans 0) 0)\n    (t (mul (rest xs) (min (+ (expt 10 18) 1) (* ans (first xs)))))))\n\n    \n(defun solve (a)\n  (if (> a (expt 10 18))\n      -1\n      a))\n\n(let ((n (read))\n      (a (read-from-string\n          (concatenate 'string\n                       \"(\" (read-line) \")\"))))\n     (princ (solve (mul a))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 369, "cpu_time_ms": 178, "memory_kb": 56940}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s507742336", "group_id": "codeNet:p02658", "input_text": "(defun mult-all (n a)\n  (let ((res 1))\n\t(dotimes (i n)\n\t  (if (zerop (aref a i) )\n\t\t  (setf res 0)\n\t\t  (setf res (* res (aref a i)))))\n\t(if (> res 1000000000000000000)\n\t\t(setf res -1))\n\tres))\n\n(defun create-data ()\n  (let* ((n (read))\n         (a (make-array `(,n) :element-type 'integer)))\n    (dotimes (i n)\n      (setf (aref a i) (read)))\n    (values n a)))\n\n(multiple-value-bind (n a) (create-data)\n  (format t \"~A~%\" (mult-all n a)))", "language": "Lisp", "metadata": {"date": 1591050386, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s507742336.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s507742336", "user_id": "u028655291"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun mult-all (n a)\n  (let ((res 1))\n\t(dotimes (i n)\n\t  (if (zerop (aref a i) )\n\t\t  (setf res 0)\n\t\t  (setf res (* res (aref a i)))))\n\t(if (> res 1000000000000000000)\n\t\t(setf res -1))\n\tres))\n\n(defun create-data ()\n  (let* ((n (read))\n         (a (make-array `(,n) :element-type 'integer)))\n    (dotimes (i n)\n      (setf (aref a i) (read)))\n    (values n a)))\n\n(multiple-value-bind (n a) (create-data)\n  (format t \"~A~%\" (mult-all n a)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 438, "cpu_time_ms": 2208, "memory_kb": 109572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s857614342", "group_id": "codeNet:p02658", "input_text": "(defun App (n)\n    (setf ans 1 hikaku (expt 10 18))\n    (loop for i\n        below n\n        do (setq ans (* ans (read)))\n            (if (> ans hikaku)\n            (setq ans -1)\n        )\n        )\n        \n        ans)\n\n(format t \"~D~%\" (App (read)))", "language": "Lisp", "metadata": {"date": 1590978926, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s857614342.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s857614342", "user_id": "u136500538"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun App (n)\n    (setf ans 1 hikaku (expt 10 18))\n    (loop for i\n        below n\n        do (setq ans (* ans (read)))\n            (if (> ans hikaku)\n            (setq ans -1)\n        )\n        )\n        \n        ans)\n\n(format t \"~D~%\" (App (read)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 251, "cpu_time_ms": 2209, "memory_kb": 112848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s264266807", "group_id": "codeNet:p02658", "input_text": "(defun main ()\n  (let ((n (read))\n        (ans 1))\n    (dotimes (i n)\n      (setf ans (* ans (read))))\n\n    (if (<= ans 1000000000000000000)\n        ans\n        -1)))\n\n(format t \"~d~%\" (main))\n", "language": "Lisp", "metadata": {"date": 1590978132, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s264266807.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s264266807", "user_id": "u091381267"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun main ()\n  (let ((n (read))\n        (ans 1))\n    (dotimes (i n)\n      (setf ans (* ans (read))))\n\n    (if (<= ans 1000000000000000000)\n        ans\n        -1)))\n\n(format t \"~d~%\" (main))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 193, "cpu_time_ms": 2208, "memory_kb": 103036}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s198705663", "group_id": "codeNet:p02658", "input_text": "(defun main ()\n  (let ((n (read))\n        (a ())\n        (ans))\n    (dotimes (i n)\n      (push (read) a))\n    (setf ans (reduce #'* a))\n\n    (if (<= ans 1000000000000000000)\n        ans\n        -1)))\n\n(format t \"~d~%\" (main))\n", "language": "Lisp", "metadata": {"date": 1590977843, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s198705663.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s198705663", "user_id": "u091381267"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun main ()\n  (let ((n (read))\n        (a ())\n        (ans))\n    (dotimes (i n)\n      (push (read) a))\n    (setf ans (reduce #'* a))\n\n    (if (<= ans 1000000000000000000)\n        ans\n        -1)))\n\n(format t \"~d~%\" (main))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 226, "cpu_time_ms": 2208, "memory_kb": 110044}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s775780268", "group_id": "codeNet:p02658", "input_text": "(defun splitat (c line)\n  (labels ((rec (line acc)\n\t\t\t\t(let ((pos (position-if (lambda(cc) (char= c cc)) line)))\n\t\t\t\t  (if pos\n\t\t\t\t\t  (rec (subseq line (1+ pos)) (cons (subseq line 0 pos) acc))\n\t\t\t\t\t(nreverse (cons line acc))))))\n\t(rec line nil)))\n\n(defun f(lst n)\n  (labels ((rec(lst acc n)\n             (if (null lst)\n               (if (<= acc (expt 10 18)) acc -1)\n               (if (<= acc (expt 10 18))\n                 (rec (cdr lst) (* (car lst) acc) (1- n))\n                 -1))))\n    (rec lst 1 n)))\n(compile 'f)\n(let ((line0 (parse-integer (read-line nil nil)))\n      (line (mapcar #'parse-integer (splitat #\\space (read-line nil nil)))))\n      (format t \"~A~%\" (f line line0)))\n", "language": "Lisp", "metadata": {"date": 1590975868, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s775780268.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s775780268", "user_id": "u254205055"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun splitat (c line)\n  (labels ((rec (line acc)\n\t\t\t\t(let ((pos (position-if (lambda(cc) (char= c cc)) line)))\n\t\t\t\t  (if pos\n\t\t\t\t\t  (rec (subseq line (1+ pos)) (cons (subseq line 0 pos) acc))\n\t\t\t\t\t(nreverse (cons line acc))))))\n\t(rec line nil)))\n\n(defun f(lst n)\n  (labels ((rec(lst acc n)\n             (if (null lst)\n               (if (<= acc (expt 10 18)) acc -1)\n               (if (<= acc (expt 10 18))\n                 (rec (cdr lst) (* (car lst) acc) (1- n))\n                 -1))))\n    (rec lst 1 n)))\n(compile 'f)\n(let ((line0 (parse-integer (read-line nil nil)))\n      (line (mapcar #'parse-integer (splitat #\\space (read-line nil nil)))))\n      (format t \"~A~%\" (f line line0)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 692, "cpu_time_ms": 2209, "memory_kb": 172844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s298306257", "group_id": "codeNet:p02658", "input_text": "(defun splitat (c line)\n  (labels ((rec (line acc)\n\t\t\t\t(let ((pos (position-if (lambda(cc) (char= c cc)) line)))\n\t\t\t\t  (if pos\n\t\t\t\t\t  (rec (subseq line (1+ pos)) (cons (subseq line 0 pos) acc))\n\t\t\t\t\t(nreverse (cons line acc))))))\n\t(rec line nil)))\n\n(defun f(lst n)\n  (labels ((rec(lst acc n)\n             (if (null lst)\n               (if (<= acc (expt 10 18)) acc -1)\n               (if (<= acc (expt 10 18))\n                 (rec (cdr lst) (* (car lst) acc) (1- n))\n                 -1))))\n    (rec lst 1 n)))\n(compile 'f)\n(let ((line0 (read-line nil nil))\n      (line (mapcar #'parse-integer (splitat #\\space (read-line nil nil)))))\n      (format t \"~A~%\" (f line line0)))\n", "language": "Lisp", "metadata": {"date": 1590975225, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s298306257.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s298306257", "user_id": "u254205055"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun splitat (c line)\n  (labels ((rec (line acc)\n\t\t\t\t(let ((pos (position-if (lambda(cc) (char= c cc)) line)))\n\t\t\t\t  (if pos\n\t\t\t\t\t  (rec (subseq line (1+ pos)) (cons (subseq line 0 pos) acc))\n\t\t\t\t\t(nreverse (cons line acc))))))\n\t(rec line nil)))\n\n(defun f(lst n)\n  (labels ((rec(lst acc n)\n             (if (null lst)\n               (if (<= acc (expt 10 18)) acc -1)\n               (if (<= acc (expt 10 18))\n                 (rec (cdr lst) (* (car lst) acc) (1- n))\n                 -1))))\n    (rec lst 1 n)))\n(compile 'f)\n(let ((line0 (read-line nil nil))\n      (line (mapcar #'parse-integer (splitat #\\space (read-line nil nil)))))\n      (format t \"~A~%\" (f line line0)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 676, "cpu_time_ms": 2210, "memory_kb": 172772}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s618285397", "group_id": "codeNet:p02658", "input_text": "(defun splitat (c line)\n  (labels ((rec (line acc)\n\t\t\t\t(let ((pos (position-if (lambda(cc) (char= c cc)) line)))\n\t\t\t\t  (if pos\n\t\t\t\t\t  (rec (subseq line (1+ pos)) (cons (subseq line 0 pos) acc))\n\t\t\t\t\t(nreverse (cons line acc))))))\n\t(rec line nil)))\n\n(defun f(lst)\n  (labels ((rec(lst acc)\n             (if (null lst)\n               (if (<= acc (expt 10 18)) acc -1)\n               (if (<= acc (expt 10 18))\n                 (rec (cdr lst) (* (car lst) acc))\n                 -1))))\n    (rec lst 1)))\n(compile 'f)\n(let ((line0 (read-line nil nil))\n      (line (mapcar #'parse-integer (splitat #\\space (read-line nil nil)))))\n      (format t \"~A~%\" (f line)))\n", "language": "Lisp", "metadata": {"date": 1590975001, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s618285397.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s618285397", "user_id": "u254205055"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun splitat (c line)\n  (labels ((rec (line acc)\n\t\t\t\t(let ((pos (position-if (lambda(cc) (char= c cc)) line)))\n\t\t\t\t  (if pos\n\t\t\t\t\t  (rec (subseq line (1+ pos)) (cons (subseq line 0 pos) acc))\n\t\t\t\t\t(nreverse (cons line acc))))))\n\t(rec line nil)))\n\n(defun f(lst)\n  (labels ((rec(lst acc)\n             (if (null lst)\n               (if (<= acc (expt 10 18)) acc -1)\n               (if (<= acc (expt 10 18))\n                 (rec (cdr lst) (* (car lst) acc))\n                 -1))))\n    (rec lst 1)))\n(compile 'f)\n(let ((line0 (read-line nil nil))\n      (line (mapcar #'parse-integer (splitat #\\space (read-line nil nil)))))\n      (format t \"~A~%\" (f line)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 657, "cpu_time_ms": 2210, "memory_kb": 172720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s881693099", "group_id": "codeNet:p02658", "input_text": "(defun splitat (c line)\n  (labels ((rec (line acc)\n\t\t\t\t(let ((pos (position-if (lambda(cc) (char= c cc)) line)))\n\t\t\t\t  (if pos\n\t\t\t\t\t  (rec (subseq line (1+ pos)) (cons (subseq line 0 pos) acc))\n\t\t\t\t\t(nreverse (cons line acc))))))\n\t(rec line nil)))\n\n(let ((line0 (read-line nil nil))\n      (line (mapcar #'parse-integer (splitat #\\space (read-line nil nil)))))\n  (let ((a (reduce #'* line)))\n      (format t \"~A~%\" (if (<= a (expt 10 18)) a -1))))\n", "language": "Lisp", "metadata": {"date": 1590974764, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s881693099.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s881693099", "user_id": "u254205055"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun splitat (c line)\n  (labels ((rec (line acc)\n\t\t\t\t(let ((pos (position-if (lambda(cc) (char= c cc)) line)))\n\t\t\t\t  (if pos\n\t\t\t\t\t  (rec (subseq line (1+ pos)) (cons (subseq line 0 pos) acc))\n\t\t\t\t\t(nreverse (cons line acc))))))\n\t(rec line nil)))\n\n(let ((line0 (read-line nil nil))\n      (line (mapcar #'parse-integer (splitat #\\space (read-line nil nil)))))\n  (let ((a (reduce #'* line)))\n      (format t \"~A~%\" (if (<= a (expt 10 18)) a -1))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 447, "cpu_time_ms": 2211, "memory_kb": 172688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s132791525", "group_id": "codeNet:p02658", "input_text": "(let ((n (read)) (x 1))\n  (loop for i below n\n        do (setq x (* x (read))))\n  (princ x))", "language": "Lisp", "metadata": {"date": 1590974629, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s132791525.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s132791525", "user_id": "u643747754"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(let ((n (read)) (x 1))\n  (loop for i below n\n        do (setq x (* x (read))))\n  (princ x))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 92, "cpu_time_ms": 2208, "memory_kb": 102872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s068439544", "group_id": "codeNet:p02658", "input_text": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defvar *n* (read))\n(defvar arr (make-array *n*))\n(dotimes (i *n*) (setf (aref arr i) (read)))\n\n(let ((i 0) (p 1))\n  (loop for j from 0 below *n*\n\tfor a = (aref arr j)\n\twhen (> p 1000000000000000000) do (return)\n\tdo (setf p (* p a)) (incf i))\n  (loop for j from i below *n*\n\tfor a = (aref arr j)\n\twhen (= a 0) do (setf p 0))\n  (princ (if (> p 1000000000000000000) -1 p)))\n", "language": "Lisp", "metadata": {"date": 1590974132, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s068439544.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s068439544", "user_id": "u203134021"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defvar *n* (read))\n(defvar arr (make-array *n*))\n(dotimes (i *n*) (setf (aref arr i) (read)))\n\n(let ((i 0) (p 1))\n  (loop for j from 0 below *n*\n\tfor a = (aref arr j)\n\twhen (> p 1000000000000000000) do (return)\n\tdo (setf p (* p a)) (incf i))\n  (loop for j from i below *n*\n\tfor a = (aref arr j)\n\twhen (= a 0) do (setf p 0))\n  (princ (if (> p 1000000000000000000) -1 p)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 479, "cpu_time_ms": 205, "memory_kb": 77016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s436738041", "group_id": "codeNet:p02658", "input_text": "(defun main ()\n  (let ((n (read))\n        (ans 1)\n        (a nil))\n    ; read\n    (loop :for _ :from 1 :to n\n          :do (push (read) a))\n    (setf a (sort a #'<))\n    ;\n    (loop :for ai :in a\n          :do (progn \n                (setf ans (* ans ai))\n                (when (> ans 1000000000000000000)\n                  (format t \"-1~%\")\n                  (return-from main))))\n    (format t \"~A~%\" ans)))\n(main)\n", "language": "Lisp", "metadata": {"date": 1590973775, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s436738041.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s436738041", "user_id": "u608227593"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(defun main ()\n  (let ((n (read))\n        (ans 1)\n        (a nil))\n    ; read\n    (loop :for _ :from 1 :to n\n          :do (push (read) a))\n    (setf a (sort a #'<))\n    ;\n    (loop :for ai :in a\n          :do (progn \n                (setf ans (* ans ai))\n                (when (> ans 1000000000000000000)\n                  (format t \"-1~%\")\n                  (return-from main))))\n    (format t \"~A~%\" ans)))\n(main)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 417, "cpu_time_ms": 231, "memory_kb": 78428}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s949685108", "group_id": "codeNet:p02658", "input_text": "(let ((n (read)))\n     (loop with a = 1\n           repeat n\n           do (setf a (* a (read)))\n           finally (if (> a (expt 10 18))\n                       (format t \"-1\")\n                       (format t \"~A\" a))))", "language": "Lisp", "metadata": {"date": 1590973433, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s949685108.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s949685108", "user_id": "u425317134"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(let ((n (read)))\n     (loop with a = 1\n           repeat n\n           do (setf a (* a (read)))\n           finally (if (> a (expt 10 18))\n                       (format t \"-1\")\n                       (format t \"~A\" a))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 220, "cpu_time_ms": 2207, "memory_kb": 103096}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s635616266", "group_id": "codeNet:p02658", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read))\n         (res 1))\n    (dotimes (_ n)\n      (setq res (min most-positive-fixnum (* res (read-fixnum)))))\n    #>res\n    (println\n     (if (> res #.(expt 10 18))\n         -1\n         res))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\n1000000000 1000000000\n\"\n    \"1000000000000000000\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3\n101 9901 999999000001\n\"\n    \"-1\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\"\n    \"0\n\")))\n", "language": "Lisp", "metadata": {"date": 1590973347, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Lisp/s635616266.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s635616266", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read))\n         (res 1))\n    (dotimes (_ n)\n      (setq res (min most-positive-fixnum (* res (read-fixnum)))))\n    #>res\n    (println\n     (if (> res #.(expt 10 18))\n         -1\n         res))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\n1000000000 1000000000\n\"\n    \"1000000000000000000\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3\n101 9901 999999000001\n\"\n    \"-1\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\"\n    \"0\n\")))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5040, "cpu_time_ms": 43, "memory_kb": 28048}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s532730509", "group_id": "codeNet:p02659", "input_text": "(princ (truncate (* (read) (rationalize (read)))))", "language": "Lisp", "metadata": {"date": 1591584346, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s532730509.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s532730509", "user_id": "u631655863"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(princ (truncate (* (read) (rationalize (read)))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 50, "cpu_time_ms": 13, "memory_kb": 24144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s745428183", "group_id": "codeNet:p02659", "input_text": "(let ((a (read))\n      (b (read)))\n  (princ (floor (/ (* a (floor (* (+ b 0.005) 100))) 100))))\n", "language": "Lisp", "metadata": {"date": 1591116264, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s745428183.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s745428183", "user_id": "u606976120"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let ((a (read))\n      (b (read)))\n  (princ (floor (/ (* a (floor (* (+ b 0.005) 100))) 100))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 16, "memory_kb": 24068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s450068181", "group_id": "codeNet:p02659", "input_text": "(let ((a (read))\n      (b (rationalize (read))))\n     (format t \"~A~%\" (floor (* a b))))\n", "language": "Lisp", "metadata": {"date": 1591103535, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s450068181.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s450068181", "user_id": "u425762225"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let ((a (read))\n      (b (rationalize (read))))\n     (format t \"~A~%\" (floor (* a b))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 89, "cpu_time_ms": 14, "memory_kb": 24060}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s988557850", "group_id": "codeNet:p02659", "input_text": "(let ((a (read))\n      (b (rationize (read))))\n     (format t \"~A~%\" (floor (* a b))))", "language": "Lisp", "metadata": {"date": 1591103446, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s988557850.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s988557850", "user_id": "u425762225"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let ((a (read))\n      (b (rationize (read))))\n     (format t \"~A~%\" (floor (* a b))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 31, "memory_kb": 26384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s186551282", "group_id": "codeNet:p02659", "input_text": "(let ((a (read))\n      (b (rationalize (read))))\n  (prin1 (floor (* a b))))", "language": "Lisp", "metadata": {"date": 1590990100, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s186551282.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s186551282", "user_id": "u480300350"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let ((a (read))\n      (b (rationalize (read))))\n  (prin1 (floor (* a b))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 75, "cpu_time_ms": 15, "memory_kb": 24308}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s890690405", "group_id": "codeNet:p02659", "input_text": "(defvar a (read))\n(defvar b (read))\n(princ \n (floor \n  (/ \n   (* a \n      (floor (* b 100)\n                       )\n                    )\n                 100)\n              )\n       )", "language": "Lisp", "metadata": {"date": 1590982118, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s890690405.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s890690405", "user_id": "u765865533"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(defvar a (read))\n(defvar b (read))\n(princ \n (floor \n  (/ \n   (* a \n      (floor (* b 100)\n                       )\n                    )\n                 100)\n              )\n       )", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 184, "cpu_time_ms": 14, "memory_kb": 24412}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s001240886", "group_id": "codeNet:p02659", "input_text": "(defvar a (read))\n(defvar b (read))\n(princ (floor (* a b)))(defvar a (read))\n(defvar b (read))\n(princ (floor (/ (* a (floar (* b 100))) 100) ))", "language": "Lisp", "metadata": {"date": 1590982025, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s001240886.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s001240886", "user_id": "u765865533"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(defvar a (read))\n(defvar b (read))\n(princ (floor (* a b)))(defvar a (read))\n(defvar b (read))\n(princ (floor (/ (* a (floar (* b 100))) 100) ))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 143, "cpu_time_ms": 36, "memory_kb": 26456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s798411592", "group_id": "codeNet:p02659", "input_text": "(defvar a (read))\n(defvar b (read))\n(princ (floor (* a b)))(defvar a (read))\n(defvar b (read))\n(princ (floor (/ (* a (* b 100)) 100) ))", "language": "Lisp", "metadata": {"date": 1590981971, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s798411592.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s798411592", "user_id": "u765865533"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(defvar a (read))\n(defvar b (read))\n(princ (floor (* a b)))(defvar a (read))\n(defvar b (read))\n(princ (floor (/ (* a (* b 100)) 100) ))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 135, "cpu_time_ms": 16, "memory_kb": 24360}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s152657055", "group_id": "codeNet:p02659", "input_text": "(defvar a (read))\n(defvar b (read))\n(princ (floor (* a b)))", "language": "Lisp", "metadata": {"date": 1590981848, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s152657055.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s152657055", "user_id": "u765865533"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(defvar a (read))\n(defvar b (read))\n(princ (floor (* a b)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 59, "cpu_time_ms": 16, "memory_kb": 24372}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s852541768", "group_id": "codeNet:p02659", "input_text": "(let ((a (read))\n      (b (round (* (read) 100))))\n     (princ (floor (* a b) 100)))", "language": "Lisp", "metadata": {"date": 1590981025, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s852541768.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s852541768", "user_id": "u425762225"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let ((a (read))\n      (b (round (* (read) 100))))\n     (princ (floor (* a b) 100)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 84, "cpu_time_ms": 15, "memory_kb": 24164}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s277439103", "group_id": "codeNet:p02659", "input_text": "(let ((a (read))\n      (b (floor (* (read) 100))))\n     (princ (floor (* a b) 100))\n     )", "language": "Lisp", "metadata": {"date": 1590980377, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s277439103.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s277439103", "user_id": "u425762225"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let ((a (read))\n      (b (floor (* (read) 100))))\n     (princ (floor (* a b) 100))\n     )", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 90, "cpu_time_ms": 14, "memory_kb": 24192}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s627080389", "group_id": "codeNet:p02659", "input_text": "(let ((a (read))\n      (b (floor (* (read) 100))))\n     (princ (floor (* a b) 100)))", "language": "Lisp", "metadata": {"date": 1590980244, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s627080389.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s627080389", "user_id": "u425762225"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let ((a (read))\n      (b (floor (* (read) 100))))\n     (princ (floor (* a b) 100)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 84, "cpu_time_ms": 16, "memory_kb": 24044}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s368069363", "group_id": "codeNet:p02659", "input_text": "(let ((a (read))\n      (b (* (read) 100)))\n     (princ (floor (* a b) 100)))", "language": "Lisp", "metadata": {"date": 1590979785, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s368069363.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s368069363", "user_id": "u425762225"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let ((a (read))\n      (b (* (read) 100)))\n     (princ (floor (* a b) 100)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 76, "cpu_time_ms": 14, "memory_kb": 24152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s036522020", "group_id": "codeNet:p02659", "input_text": "(let ((a (read)) (b (read)))\n     (setq b (floor (* b 100)))\n     (princ (floor (/ (* a b) 100))))", "language": "Lisp", "metadata": {"date": 1590978672, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s036522020.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s036522020", "user_id": "u643747754"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let ((a (read)) (b (read)))\n     (setq b (floor (* b 100)))\n     (princ (floor (/ (* a b) 100))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 98, "cpu_time_ms": 15, "memory_kb": 24488}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s465273589", "group_id": "codeNet:p02659", "input_text": "(defun App (a b)\n  (floor(* a b)))\n(format t \"~D~%\" (App (read) (read)))", "language": "Lisp", "metadata": {"date": 1590976610, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s465273589.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s465273589", "user_id": "u136500538"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(defun App (a b)\n  (floor(* a b)))\n(format t \"~D~%\" (App (read) (read)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 72, "cpu_time_ms": 19, "memory_kb": 24356}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s705683556", "group_id": "codeNet:p02659", "input_text": "(let ((a (read))\n      (b (floor (* 100 (read)))))\n  (format t \"~A~%\" (floor (* a b) 100)))\n", "language": "Lisp", "metadata": {"date": 1590974680, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s705683556.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s705683556", "user_id": "u607637432"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let ((a (read))\n      (b (floor (* 100 (read)))))\n  (format t \"~A~%\" (floor (* a b) 100)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 92, "cpu_time_ms": 15, "memory_kb": 24144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s772708874", "group_id": "codeNet:p02659", "input_text": "(let* ((n (read))\n       (m (read-line))\n       (a (/ (parse-integer (remove #\\. m :test #'char=))\n             (expt 10 (1+ (position #\\. m :test #'char=))))))\n  (princ (floor (* n a))))", "language": "Lisp", "metadata": {"date": 1590974359, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s772708874.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s772708874", "user_id": "u610490393"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read-line))\n       (a (/ (parse-integer (remove #\\. m :test #'char=))\n             (expt 10 (1+ (position #\\. m :test #'char=))))))\n  (princ (floor (* n a))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 15, "memory_kb": 24204}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s347827460", "group_id": "codeNet:p02659", "input_text": "(let ((a (read))\n      (b (read)))\n     (princ (floor (* a b))))", "language": "Lisp", "metadata": {"date": 1590973865, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s347827460.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s347827460", "user_id": "u425762225"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(let ((a (read))\n      (b (read)))\n     (princ (floor (* a b))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 64, "cpu_time_ms": 12, "memory_kb": 24144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s743573203", "group_id": "codeNet:p02659", "input_text": "(princ (floor (* (read) (read))))", "language": "Lisp", "metadata": {"date": 1590973634, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s743573203.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s743573203", "user_id": "u610490393"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(princ (floor (* (read) (read))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 33, "cpu_time_ms": 13, "memory_kb": 24148}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s289422605", "group_id": "codeNet:p02659", "input_text": "(format t \"~A\" (floor (* (read) (read))))", "language": "Lisp", "metadata": {"date": 1590973510, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s289422605.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s289422605", "user_id": "u425317134"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(format t \"~A\" (floor (* (read) (read))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 41, "cpu_time_ms": 18, "memory_kb": 24144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s158669530", "group_id": "codeNet:p02659", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((*read-default-float-format* 'double-float)\n         (a (* 100 (read)))\n         (b (round (* 100 (read)))))\n    (println (floor (/ (* a b) 10000)))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"198 1.10\n\"\n    \"217\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1 0.01\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1000000000000000 9.99\n\"\n    \"9990000000000000\n\")))\n", "language": "Lisp", "metadata": {"date": 1590973507, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Lisp/s158669530.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s158669530", "user_id": "u352600849"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((*read-default-float-format* 'double-float)\n         (a (* 100 (read)))\n         (b (round (* 100 (read)))))\n    (println (floor (/ (* a b) 10000)))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"198 1.10\n\"\n    \"217\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1 0.01\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1000000000000000 9.99\n\"\n    \"9990000000000000\n\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3742, "cpu_time_ms": 18, "memory_kb": 24852}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s594349727", "group_id": "codeNet:p02684", "input_text": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(declaim (type fixnum n k))\n(defvar n (read))\n(defvar k (read))\n\n(defvar *a* (make-array (1+ n) :element-type 'fixnum))\n(defvar *v* (make-array (1+ n) :initial-element nil :element-type 'boolean))\n(loop for i from 1 to n do\n      (setf (aref *a* i) (read)))\n\n(defvar *prelude*)\n(defvar *cycle*)\n\n(let ((v (make-array n :element-type 'fixnum :fill-pointer 0))\n      (town 1))\n  (loop\n   (when (aref *v* town) ; cycle detected\n     (let ((p (position town v)))\n       (setf *prelude* (subseq v 0 p))\n       (setf *cycle* (subseq v p)))\n     (return))\n   (setf (aref *v* town) t)\n   (vector-push-extend town v)\n   (setf town (aref *a* town))))\n\n(princ (if (< k (length *prelude*))\n\t   (aref *prelude* k)\n\t (aref *cycle* (mod (- k (length *prelude*)) (length *cycle*)))))\n", "language": "Lisp", "metadata": {"date": 1590150034, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s594349727.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s594349727", "user_id": "u203134021"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(declaim (type fixnum n k))\n(defvar n (read))\n(defvar k (read))\n\n(defvar *a* (make-array (1+ n) :element-type 'fixnum))\n(defvar *v* (make-array (1+ n) :initial-element nil :element-type 'boolean))\n(loop for i from 1 to n do\n      (setf (aref *a* i) (read)))\n\n(defvar *prelude*)\n(defvar *cycle*)\n\n(let ((v (make-array n :element-type 'fixnum :fill-pointer 0))\n      (town 1))\n  (loop\n   (when (aref *v* town) ; cycle detected\n     (let ((p (position town v)))\n       (setf *prelude* (subseq v 0 p))\n       (setf *cycle* (subseq v p)))\n     (return))\n   (setf (aref *v* town) t)\n   (vector-push-extend town v)\n   (setf town (aref *a* town))))\n\n(princ (if (< k (length *prelude*))\n\t   (aref *prelude* k)\n\t (aref *cycle* (mod (- k (length *prelude*)) (length *cycle*)))))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 875, "cpu_time_ms": 205, "memory_kb": 82104}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s601474538", "group_id": "codeNet:p02684", "input_text": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(declaim (type fixnum n k))\n(defvar n (read))\n(defvar k (read))\n\n(defvar *a* (make-array (1+ n) :element-type 'fixnum))\n(loop for i from 1 to n do\n      (setf (aref *a* i) (read)))\n\n(defvar *prelude*)\n(defvar *cycle*)\n\n(let ((v (make-array n :element-type 'fixnum :fill-pointer 0))\n      (town 1))\n  (loop\n   (let ((p (position town v)))\n     (when p ; cycle detected\n       (setf *prelude* (subseq v 0 p))\n       (setf *cycle* (subseq v p))\n       (return))\n     (vector-push-extend town v)\n     (setf town (aref *a* town)))))\n\n(princ (if (< k (length *prelude*))\n\t   (aref *prelude* k)\n\t (aref *cycle* (mod (- k (length *prelude*)) (length *cycle*)))))\n", "language": "Lisp", "metadata": {"date": 1590148911, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s601474538.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s601474538", "user_id": "u203134021"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(declaim (type fixnum n k))\n(defvar n (read))\n(defvar k (read))\n\n(defvar *a* (make-array (1+ n) :element-type 'fixnum))\n(loop for i from 1 to n do\n      (setf (aref *a* i) (read)))\n\n(defvar *prelude*)\n(defvar *cycle*)\n\n(let ((v (make-array n :element-type 'fixnum :fill-pointer 0))\n      (town 1))\n  (loop\n   (let ((p (position town v)))\n     (when p ; cycle detected\n       (setf *prelude* (subseq v 0 p))\n       (setf *cycle* (subseq v p))\n       (return))\n     (vector-push-extend town v)\n     (setf town (aref *a* town)))))\n\n(princ (if (< k (length *prelude*))\n\t   (aref *prelude* k)\n\t (aref *cycle* (mod (- k (length *prelude*)) (length *cycle*)))))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 762, "cpu_time_ms": 2207, "memory_kb": 78712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s206241149", "group_id": "codeNet:p02684", "input_text": "(let* ((n (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (last-index 0)\n       (memo (make-array `(,(1+ n)) :initial-element nil))\n       (hist (make-array `(,(1+ n)) :initial-element nil)))\n  ;; input\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  ;; init\n  (setf (aref hist 0) 1)\n  (setf (aref memo 1) 0)\n  ;; \n  (loop :for m :from 1 :to n\n        :for p :from 0\n        :for pos := (aref a (aref hist p))\n        :until (aref memo pos)\n        :do (progn\n              (setf (aref memo pos) m)\n              (setf (aref hist m) pos)\n              (setf last-index m)))\n  (let* ((loop-end (aref hist last-index))\n         (loop-start (aref a loop-end))\n         (loop-end-index (aref memo loop-end))\n         (loop-start-index (aref memo loop-start))\n         (period (1+ (- loop-end-index loop-start-index))))\n    (cond ((<= k loop-start-index)\n           (format t \"~A~%\" (aref hist k)))\n          (t\n           (format t \"~A~%\"\n                   (aref hist (+ loop-start-index\n                                 (mod (- k loop-start-index) period))))))))\n", "language": "Lisp", "metadata": {"date": 1589246548, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s206241149.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s206241149", "user_id": "u608227593"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(let* ((n (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (last-index 0)\n       (memo (make-array `(,(1+ n)) :initial-element nil))\n       (hist (make-array `(,(1+ n)) :initial-element nil)))\n  ;; input\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  ;; init\n  (setf (aref hist 0) 1)\n  (setf (aref memo 1) 0)\n  ;; \n  (loop :for m :from 1 :to n\n        :for p :from 0\n        :for pos := (aref a (aref hist p))\n        :until (aref memo pos)\n        :do (progn\n              (setf (aref memo pos) m)\n              (setf (aref hist m) pos)\n              (setf last-index m)))\n  (let* ((loop-end (aref hist last-index))\n         (loop-start (aref a loop-end))\n         (loop-end-index (aref memo loop-end))\n         (loop-start-index (aref memo loop-start))\n         (period (1+ (- loop-end-index loop-start-index))))\n    (cond ((<= k loop-start-index)\n           (format t \"~A~%\" (aref hist k)))\n          (t\n           (format t \"~A~%\"\n                   (aref hist (+ loop-start-index\n                                 (mod (- k loop-start-index) period))))))))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1102, "cpu_time_ms": 200, "memory_kb": 81924}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s883638980", "group_id": "codeNet:p02684", "input_text": "(let* ((n (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (last-index 0)\n       (memo (make-array `(,(1+ n)) :initial-element nil))\n       (hist (make-array `(,(1+ n)) :initial-element nil)))\n  ;; input\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  ;; init\n  (setf (aref hist 0) 1)\n  (setf (aref memo 1) 0)\n  ;; \n  (loop :for m :from 1 :to n\n        :for p :from 0\n        :for pos := (aref a (aref hist p))\n        :while (null (aref memo pos))\n        :do (progn\n              (setf (aref memo pos) m)\n              (setf (aref hist m) pos)\n              (setf last-index m)))\n  (let* ((loop-end (aref hist last-index))\n         (loop-start (aref a loop-end))\n         (loop-end-index (aref memo loop-end))\n         (loop-start-index (aref memo loop-start))\n         (period (1+ (- loop-end-index loop-start-index))))\n    (cond ((<= k loop-start-index)\n           (format t \"~A~%\" k))\n          (t\n           (format t \"~A~%\"\n                   (aref hist (+ loop-start-index\n                                 (mod (- k loop-start-index) period))))))))\n", "language": "Lisp", "metadata": {"date": 1589245856, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s883638980.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s883638980", "user_id": "u608227593"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(let* ((n (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (last-index 0)\n       (memo (make-array `(,(1+ n)) :initial-element nil))\n       (hist (make-array `(,(1+ n)) :initial-element nil)))\n  ;; input\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  ;; init\n  (setf (aref hist 0) 1)\n  (setf (aref memo 1) 0)\n  ;; \n  (loop :for m :from 1 :to n\n        :for p :from 0\n        :for pos := (aref a (aref hist p))\n        :while (null (aref memo pos))\n        :do (progn\n              (setf (aref memo pos) m)\n              (setf (aref hist m) pos)\n              (setf last-index m)))\n  (let* ((loop-end (aref hist last-index))\n         (loop-start (aref a loop-end))\n         (loop-end-index (aref memo loop-end))\n         (loop-start-index (aref memo loop-start))\n         (period (1+ (- loop-end-index loop-start-index))))\n    (cond ((<= k loop-start-index)\n           (format t \"~A~%\" k))\n          (t\n           (format t \"~A~%\"\n                   (aref hist (+ loop-start-index\n                                 (mod (- k loop-start-index) period))))))))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1097, "cpu_time_ms": 204, "memory_kb": 81928}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s189874837", "group_id": "codeNet:p02684", "input_text": "(let* ((n (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (len 1)\n       (mem (make-array `(,(1+ n)) :initial-element nil))\n       (result (make-array `(,(1+ n)))))\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  (setf (aref result 0) 1)\n  (setf (aref mem 1) 0)\n  (block calc\n    (loop :for m :from 1 :to k\n          :do (let ((next (aref a (aref result (1- m)))))\n                (cond ((aref mem next)\n                       (return-from calc))\n                      (t\n                       (incf len)\n                       (setf (aref mem next) m)\n                       (setf (aref result m) next))))))\n  (let* ((loop-e (aref result (1- len)))\n         (loop-s (aref a loop-e))\n         (loop-e-num (1- len))\n         (loop-s-num (aref mem loop-s)))\n    (cond ((<= k loop-s-num)\n           (format t \"~A~%\" loop-s))\n          (t\n           (format t \n                   \"~A~%\"\n                   (aref result \n                         (+ loop-s-num (mod (- k loop-s-num) (1+ (- loop-e-num loop-s-num))))))))))\n", "language": "Lisp", "metadata": {"date": 1589243783, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s189874837.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s189874837", "user_id": "u608227593"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(let* ((n (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (len 1)\n       (mem (make-array `(,(1+ n)) :initial-element nil))\n       (result (make-array `(,(1+ n)))))\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  (setf (aref result 0) 1)\n  (setf (aref mem 1) 0)\n  (block calc\n    (loop :for m :from 1 :to k\n          :do (let ((next (aref a (aref result (1- m)))))\n                (cond ((aref mem next)\n                       (return-from calc))\n                      (t\n                       (incf len)\n                       (setf (aref mem next) m)\n                       (setf (aref result m) next))))))\n  (let* ((loop-e (aref result (1- len)))\n         (loop-s (aref a loop-e))\n         (loop-e-num (1- len))\n         (loop-s-num (aref mem loop-s)))\n    (cond ((<= k loop-s-num)\n           (format t \"~A~%\" loop-s))\n          (t\n           (format t \n                   \"~A~%\"\n                   (aref result \n                         (+ loop-s-num (mod (- k loop-s-num) (1+ (- loop-e-num loop-s-num))))))))))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1058, "cpu_time_ms": 202, "memory_kb": 83184}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s502206625", "group_id": "codeNet:p02684", "input_text": "(defun teleporter (n k)\n  (let\n   ((a (make-array 0 :fill-pointer 0 :adjustable t))\n    (b (make-array 0 :fill-pointer 0 :adjustable t))\n    (tmp 1)\n    (counter 0))\n   (loop :repeat n\n         :do (vector-push-extend (read) a))\n   (loop :repeat n\n         :do (incf counter 1)\n             (vector-push-extend tmp b)\n             (setq tmp (aref a (- tmp 1)))\n         :until (= tmp 1))\n   (aref b (mod k counter))))\n\n(print (teleporter (read) (read)))", "language": "Lisp", "metadata": {"date": 1589165331, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s502206625.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s502206625", "user_id": "u046178504"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun teleporter (n k)\n  (let\n   ((a (make-array 0 :fill-pointer 0 :adjustable t))\n    (b (make-array 0 :fill-pointer 0 :adjustable t))\n    (tmp 1)\n    (counter 0))\n   (loop :repeat n\n         :do (vector-push-extend (read) a))\n   (loop :repeat n\n         :do (incf counter 1)\n             (vector-push-extend tmp b)\n             (setq tmp (aref a (- tmp 1)))\n         :until (= tmp 1))\n   (aref b (mod k counter))))\n\n(print (teleporter (read) (read)))", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 453, "cpu_time_ms": 200, "memory_kb": 79348}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s346773527", "group_id": "codeNet:p02684", "input_text": "(defun teleporter (n k)\n  (let\n   ((a (make-array 0 :fill-pointer 0 :adjustable t))\n    (b (make-array 0 :fill-pointer 0 :adjustable t))\n    (tmp 1)\n    (counter 0))\n   (loop :repeat n\n         :do (vector-push-extend (read) a))\n   (loop :repeat n\n         :do (incf counter 1)\n             (setq tmp (aref a (- tmp 1)))\n             (vector-push-extend tmp b)\n         :until (= tmp 1))\n   (aref b (mod k counter))))\n\n(print (teleporter (read) (read)))", "language": "Lisp", "metadata": {"date": 1589164795, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s346773527.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s346773527", "user_id": "u046178504"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun teleporter (n k)\n  (let\n   ((a (make-array 0 :fill-pointer 0 :adjustable t))\n    (b (make-array 0 :fill-pointer 0 :adjustable t))\n    (tmp 1)\n    (counter 0))\n   (loop :repeat n\n         :do (vector-push-extend (read) a))\n   (loop :repeat n\n         :do (incf counter 1)\n             (setq tmp (aref a (- tmp 1)))\n             (vector-push-extend tmp b)\n         :until (= tmp 1))\n   (aref b (mod k counter))))\n\n(print (teleporter (read) (read)))", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 453, "cpu_time_ms": 204, "memory_kb": 79348}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s926878566", "group_id": "codeNet:p02684", "input_text": "(let* ((n (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (len 1)\n       (mem (make-array `(,(1+ n)) :initial-element nil))\n       (result (make-array `(,n))))\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  (setf (aref result 0) 1)\n  (setf (aref mem 1) 0)\n  (block calc\n    (loop :for m :from 1 :to k\n          :do (let ((next (aref a (aref result (1- m)))))\n                (cond ((aref mem next)\n                       (return-from calc))\n                      (t\n                       (incf len)\n                       (setf (aref mem next) m)\n                       (setf (aref result m) next))))))\n  (let* ((loop-e (aref result (1- len)))\n         (loop-s (aref a loop-e))\n         (loop-e-num (1- len))\n         (loop-s-num (aref mem loop-s)))\n    (cond ((<= k loop-s-num)\n           (format t \"~A~%\" loop-s))\n          (t\n           (format t \n                   \"~A~%\"\n                   (aref result \n                         (+ loop-s-num (mod (- k loop-s-num) (1+ (- loop-e-num loop-s-num))))))))))\n", "language": "Lisp", "metadata": {"date": 1589164733, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s926878566.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s926878566", "user_id": "u608227593"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(let* ((n (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (len 1)\n       (mem (make-array `(,(1+ n)) :initial-element nil))\n       (result (make-array `(,n))))\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  (setf (aref result 0) 1)\n  (setf (aref mem 1) 0)\n  (block calc\n    (loop :for m :from 1 :to k\n          :do (let ((next (aref a (aref result (1- m)))))\n                (cond ((aref mem next)\n                       (return-from calc))\n                      (t\n                       (incf len)\n                       (setf (aref mem next) m)\n                       (setf (aref result m) next))))))\n  (let* ((loop-e (aref result (1- len)))\n         (loop-s (aref a loop-e))\n         (loop-e-num (1- len))\n         (loop-s-num (aref mem loop-s)))\n    (cond ((<= k loop-s-num)\n           (format t \"~A~%\" loop-s))\n          (t\n           (format t \n                   \"~A~%\"\n                   (aref result \n                         (+ loop-s-num (mod (- k loop-s-num) (1+ (- loop-e-num loop-s-num))))))))))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1053, "cpu_time_ms": 205, "memory_kb": 83128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s019980001", "group_id": "codeNet:p02684", "input_text": "(defun teleporter (n k)\n  (let\n   ((a (make-array 0 :fill-pointer 0 :adjustable t))\n    (b (make-array 0 :fill-pointer 0 :adjustable t))\n    (tmp 0)\n    (counter 0))\n   (loop :repeat n\n         :do (vector-push-extend (- (read) 1) a))\n   (loop :repeat n\n         :do (incf counter 1)\n             (setq tmp (aref a tmp))\n         \t (vector-push-extend tmp b)\n         :until (= tmp 0))\n   (+ 1 (aref b (mod k counter)))))\n\n(print (teleporter (read) (read)))", "language": "Lisp", "metadata": {"date": 1589164723, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s019980001.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s019980001", "user_id": "u046178504"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun teleporter (n k)\n  (let\n   ((a (make-array 0 :fill-pointer 0 :adjustable t))\n    (b (make-array 0 :fill-pointer 0 :adjustable t))\n    (tmp 0)\n    (counter 0))\n   (loop :repeat n\n         :do (vector-push-extend (- (read) 1) a))\n   (loop :repeat n\n         :do (incf counter 1)\n             (setq tmp (aref a tmp))\n         \t (vector-push-extend tmp b)\n         :until (= tmp 0))\n   (+ 1 (aref b (mod k counter)))))\n\n(print (teleporter (read) (read)))", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 457, "cpu_time_ms": 210, "memory_kb": 79404}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s149792200", "group_id": "codeNet:p02684", "input_text": "(defun get-loop-origin (n arr)\n  (let ((visited (make-array n\n                             :initial-contents\n                             (loop repeat n collect 0))))\n       (loop with pos = 0\n             while t\n             when (= 1 (aref visited pos))\n               return (1- (aref arr pos))\n             do (setf (aref visited pos) 1)\n                (setf pos (1- (aref arr pos))))))\n\n(defun get-loop-length (n arr idx)\n  (let ((visited (make-array n\n                             :initial-contents\n                             (loop repeat n collect 0))))\n       (loop with c = 0\n             with pos = idx\n             when (= 1 (aref visited pos))\n               return c\n             do (setf (aref visited pos) 1)\n                (setf pos (1- (aref arr pos)))\n                (incf c))))\n\n(defun cost-until-origin (arr idx)\n  (loop with c = 0\n        with pos = 0\n        when (= pos idx)\n          return c\n        do (setf pos (1- (aref arr pos)))\n           (incf c)))\n\n(defun solve (n arr k)\n  (let* ((origin (get-loop-origin n arr))\n         (length (get-loop-length n arr origin))\n         (cost (cost-until-origin arr origin))\n         (shortened-k (mod (- k cost) length)))\n        (if (<= k cost)\n            (loop with pos = 0\n                  with rest-time = k\n                  when (= rest-time 0)\n                    return (1+ pos)\n                  do (setf pos (1- (aref arr pos)))\n                     (decf rest-time))\n            (loop with pos = 0\n                  with rest-time = (+ cost shortened-k)\n                  when (= rest-time 0)\n                    return (1+ pos)\n                  do (setf pos (1- (aref arr pos)))\n                     (decf rest-time)))))\n              \n  \n(let* ((n (read))\n       (k (read))\n       (arr (make-array n\n                        :initial-contents\n                        (loop repeat n collect (read)))))\n      (format t \"~A\" (solve n arr k)))\n", "language": "Lisp", "metadata": {"date": 1589164664, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s149792200.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s149792200", "user_id": "u425317134"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun get-loop-origin (n arr)\n  (let ((visited (make-array n\n                             :initial-contents\n                             (loop repeat n collect 0))))\n       (loop with pos = 0\n             while t\n             when (= 1 (aref visited pos))\n               return (1- (aref arr pos))\n             do (setf (aref visited pos) 1)\n                (setf pos (1- (aref arr pos))))))\n\n(defun get-loop-length (n arr idx)\n  (let ((visited (make-array n\n                             :initial-contents\n                             (loop repeat n collect 0))))\n       (loop with c = 0\n             with pos = idx\n             when (= 1 (aref visited pos))\n               return c\n             do (setf (aref visited pos) 1)\n                (setf pos (1- (aref arr pos)))\n                (incf c))))\n\n(defun cost-until-origin (arr idx)\n  (loop with c = 0\n        with pos = 0\n        when (= pos idx)\n          return c\n        do (setf pos (1- (aref arr pos)))\n           (incf c)))\n\n(defun solve (n arr k)\n  (let* ((origin (get-loop-origin n arr))\n         (length (get-loop-length n arr origin))\n         (cost (cost-until-origin arr origin))\n         (shortened-k (mod (- k cost) length)))\n        (if (<= k cost)\n            (loop with pos = 0\n                  with rest-time = k\n                  when (= rest-time 0)\n                    return (1+ pos)\n                  do (setf pos (1- (aref arr pos)))\n                     (decf rest-time))\n            (loop with pos = 0\n                  with rest-time = (+ cost shortened-k)\n                  when (= rest-time 0)\n                    return (1+ pos)\n                  do (setf pos (1- (aref arr pos)))\n                     (decf rest-time)))))\n              \n  \n(let* ((n (read))\n       (k (read))\n       (arr (make-array n\n                        :initial-contents\n                        (loop repeat n collect (read)))))\n      (format t \"~A\" (solve n arr k)))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1930, "cpu_time_ms": 214, "memory_kb": 81400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s906931707", "group_id": "codeNet:p02684", "input_text": "(let* ((n (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (len 1)\n       (mem (make-hash-table :size (ceiling (* n 1.1))))\n       (result (make-array `(,n))))\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  (setf (aref result 0) 1)\n  (setf (gethash 1 mem) 0)\n  (block calc\n    (loop :for m :from 1 :to k\n          :do (let ((next (aref a (aref result (1- m)))))\n                (cond ((gethash next mem)\n                       (return-from calc))\n                      (t\n                       (incf len)\n                       (setf (gethash next mem) m)\n                       (setf (aref result m) next))))))\n  (let* ((loop-e (aref result (1- len)))\n         (loop-s (aref a loop-e))\n         (loop-e-num (1- len))\n         (loop-s-num (gethash loop-s mem)))\n    (cond ((<= k loop-s-num)\n           (format t \"~A~%\" loop-s))\n          (t\n           (format t \n                   \"~A~%\"\n                   (aref result \n                         (+ loop-s-num (mod (- k loop-s-num) (1+ (- loop-e-num loop-s-num))))))))))\n\n           ", "language": "Lisp", "metadata": {"date": 1589164532, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s906931707.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s906931707", "user_id": "u608227593"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(let* ((n (read))\n       (k (read))\n       (a (make-array `(,(1+ n))))\n       (len 1)\n       (mem (make-hash-table :size (ceiling (* n 1.1))))\n       (result (make-array `(,n))))\n  (loop :for i :from 1 :to n\n        :do (setf (aref a i) (read)))\n  (setf (aref result 0) 1)\n  (setf (gethash 1 mem) 0)\n  (block calc\n    (loop :for m :from 1 :to k\n          :do (let ((next (aref a (aref result (1- m)))))\n                (cond ((gethash next mem)\n                       (return-from calc))\n                      (t\n                       (incf len)\n                       (setf (gethash next mem) m)\n                       (setf (aref result m) next))))))\n  (let* ((loop-e (aref result (1- len)))\n         (loop-s (aref a loop-e))\n         (loop-e-num (1- len))\n         (loop-s-num (gethash loop-s mem)))\n    (cond ((<= k loop-s-num)\n           (format t \"~A~%\" loop-s))\n          (t\n           (format t \n                   \"~A~%\"\n                   (aref result \n                         (+ loop-s-num (mod (- k loop-s-num) (1+ (- loop-e-num loop-s-num))))))))))\n\n           ", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1076, "cpu_time_ms": 216, "memory_kb": 86888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s803213195", "group_id": "codeNet:p02684", "input_text": "(let* ((n (read))\n       (m (read))\n       (lst (concatenate 'vector (loop :repeat n :collect (1- (read)))))\n       (arr (make-array n :initial-element -1 :element-type 'fixnum))\n       (st nil)\n       (ans 0))\n  (setf st (loop :for j :from 0\n                 :for k := 0 :then (aref lst k)\n                 :if (= -1 (aref arr k)) :do (setf (aref arr k) j)\n                   :else :return (list (aref arr k) k)))\n  (setf ans (loop :for j :from 1\n                  :for k := (aref lst (second st)) :then (aref lst k)\n                  :if (= k (second st)) :return j))\n  (if (<= (first st) m)\n      (loop :for j :from (mod (- m (first st)) ans) :downto 0\n            :for k := (second st) :then (aref lst k)\n            :finally (princ (1+ k)))\n      (loop :for j :from m :downto 0\n            :for k := 0 :then (aref lst k)\n            :finally (princ (1+ k)))))", "language": "Lisp", "metadata": {"date": 1589164094, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s803213195.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s803213195", "user_id": "u610490393"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (lst (concatenate 'vector (loop :repeat n :collect (1- (read)))))\n       (arr (make-array n :initial-element -1 :element-type 'fixnum))\n       (st nil)\n       (ans 0))\n  (setf st (loop :for j :from 0\n                 :for k := 0 :then (aref lst k)\n                 :if (= -1 (aref arr k)) :do (setf (aref arr k) j)\n                   :else :return (list (aref arr k) k)))\n  (setf ans (loop :for j :from 1\n                  :for k := (aref lst (second st)) :then (aref lst k)\n                  :if (= k (second st)) :return j))\n  (if (<= (first st) m)\n      (loop :for j :from (mod (- m (first st)) ans) :downto 0\n            :for k := (second st) :then (aref lst k)\n            :finally (princ (1+ k)))\n      (loop :for j :from m :downto 0\n            :for k := 0 :then (aref lst k)\n            :finally (princ (1+ k)))))", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 864, "cpu_time_ms": 216, "memory_kb": 83136}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s683811096", "group_id": "codeNet:p02684", "input_text": "(defun get-loop-origin (n arr)\n  (let ((visited (make-array n\n                             :initial-contents\n                             (loop repeat n collect 0))))\n       (loop with pos = 0\n             while t\n             when (= 1 (aref visited pos))\n               return (1- (aref visited pos))\n             do (setf (aref visited pos) 1)\n                (setf pos (1- (aref arr pos))))))\n\n(defun get-loop-length (n arr idx)\n  (let ((visited (make-array n\n                             :initial-contents\n                             (loop repeat n collect 0))))\n       (loop with c = 0\n             with pos = idx\n             when (= 1 (aref visited pos))\n               return c\n             do (setf (aref visited pos) 1)\n                (setf pos (1- (aref arr pos)))\n                (incf c))))\n\n(defun cost-until-origin (arr idx)\n  (loop with c = 0\n        with pos = 0\n        when (= pos idx)\n          return c\n        do (setf pos (1- (aref arr pos)))\n           (incf c)))\n\n(defun solve (n arr k)\n  (let* ((origin (get-loop-origin n arr))\n         (length (get-loop-length n arr origin))\n         (cost (cost-until-origin arr origin))\n         (shortened-k (mod (- k cost) length)))\n        (if (<= k cost)\n            (loop with pos = 0\n                  with rest-time = k\n                  when (= rest-time 0)\n                    return (aref arr pos)\n                  do (setf pos (1- (aref arr pos)))\n                     (decf rest-time))\n            (loop with pos = origin\n                  with rest-time = shortened-k\n                  when (= rest-time 0)\n                    return (aref arr pos)\n                  do (setf pos (1- (aref arr pos)))\n                     (decf rest-time)))))\n              \n  \n(let* ((n (read))\n       (k (read))\n       (arr (make-array n\n                        :initial-contents\n                        (loop repeat n collect (read)))))\n      (format t \"~A\" (solve n arr k)))", "language": "Lisp", "metadata": {"date": 1589161850, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s683811096.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s683811096", "user_id": "u425317134"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun get-loop-origin (n arr)\n  (let ((visited (make-array n\n                             :initial-contents\n                             (loop repeat n collect 0))))\n       (loop with pos = 0\n             while t\n             when (= 1 (aref visited pos))\n               return (1- (aref visited pos))\n             do (setf (aref visited pos) 1)\n                (setf pos (1- (aref arr pos))))))\n\n(defun get-loop-length (n arr idx)\n  (let ((visited (make-array n\n                             :initial-contents\n                             (loop repeat n collect 0))))\n       (loop with c = 0\n             with pos = idx\n             when (= 1 (aref visited pos))\n               return c\n             do (setf (aref visited pos) 1)\n                (setf pos (1- (aref arr pos)))\n                (incf c))))\n\n(defun cost-until-origin (arr idx)\n  (loop with c = 0\n        with pos = 0\n        when (= pos idx)\n          return c\n        do (setf pos (1- (aref arr pos)))\n           (incf c)))\n\n(defun solve (n arr k)\n  (let* ((origin (get-loop-origin n arr))\n         (length (get-loop-length n arr origin))\n         (cost (cost-until-origin arr origin))\n         (shortened-k (mod (- k cost) length)))\n        (if (<= k cost)\n            (loop with pos = 0\n                  with rest-time = k\n                  when (= rest-time 0)\n                    return (aref arr pos)\n                  do (setf pos (1- (aref arr pos)))\n                     (decf rest-time))\n            (loop with pos = origin\n                  with rest-time = shortened-k\n                  when (= rest-time 0)\n                    return (aref arr pos)\n                  do (setf pos (1- (aref arr pos)))\n                     (decf rest-time)))))\n              \n  \n(let* ((n (read))\n       (k (read))\n       (arr (make-array n\n                        :initial-contents\n                        (loop repeat n collect (read)))))\n      (format t \"~A\" (solve n arr k)))", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1941, "cpu_time_ms": 216, "memory_kb": 81408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s997064163", "group_id": "codeNet:p02684", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  \"I refered from https://competitive12.blogspot.com/2020/03/common-lisp.html thank you!\"\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defmacro aif (expr then else)\n  `(let ((it ,expr))\n     (if it ,then ,else)))\n\n(defmacro awhen (expr &rest then)\n  `(aif ,expr (progn ,@then) nil))\n\n(defun comulative (function list &key base)\n  (if base\n      (comulative function (cons base list))\n      (do ((lst (cdr list) (cdr lst))\n           (acc (list (car list))))\n          ((null lst) (reverse acc))\n        (push (funcall function (car acc) (car lst)) acc))))\n\n(defun binary-search (function left right\n                      &optional\n                        (eps 1)\n                        (average-function (lambda (x y) (ash (+ x y) -1))))\n  (if (<= (abs (- left right)) eps)\n      right\n      (let ((mid (funcall average-function left right)))\n        (if (funcall function mid)\n            (binary-search function left mid eps average-function)\n            (binary-search function mid right eps average-function)))))\n\n(defun arithmetic-mean (&rest body)\n  (/ (apply #'+ body) (length body)))\n\n(defvar +MOD+ (+ (expt 10 9) 7))\n\n(defun mapa-b (fn a b &optional (step 1))\n  (do ((i a (+ i step))\n       (result nil))\n      ((> i b) (nreverse result))\n    (push (funcall fn i) result)))\n\n(defun map0-n (fn n)\n  (mapa-b fn 0 n))\n\n(defun map1-n (fn n)\n  (mapa-b fn 1 n))\n\n(defun read-string (&optional (stream *standard-input*))\n  (labels ((is-empty (x)\n             (or (char= x #\\space) (char= x #\\newline))))\n    (loop for char = (read-char stream)\n          with result\n          when (is-empty char)\n            do (return (concatenate 'string (nreverse result)))\n          do (push char result))))\n\n(defun merge-sort (lst &optional (compare #'<))\n  (let ((turn 0))\n    (labels ((merge-list (a b a-length b-length)\n               (cond ((zerop a-length) b)\n                     ((zerop b-length) a)\n                     ((funcall compare (car b) (car a))\n                      (incf turn a-length)\n                      (cons (car b)\n                            (merge-list a (cdr b) a-length (1- b-length))))\n                     (t\n                      (cons (car a)\n                            (merge-list (cdr a) b (1- a-length) b-length)))))\n             (f (lst length)\n               (if (= length 1)\n                   lst\n                   (let ((mid (ash length -1)))\n                     (merge-list (f (subseq lst 0 mid) mid)\n                                 (f (subseq lst mid) (- length mid))\n                                 mid\n                                 (- length mid))))))\n      (values (f lst (length lst)) turn))))\n\n(defun group (lst &optional (test #'eql) (key nil))\n  (let ((table (make-hash-table :test test)))\n    (mapc (lambda (x)\n            (push x (gethash (if key (funcall key x) x) table)))\n          lst)\n    (loop for value being each hash-value in table\n          collect value)))\n\n(defun main (n k teleport &aux (teleports (coerce teleport 'vector)))\n  (let ((fast (make-array (list n) :initial-element nil)))\n    (labels ((f (p time rem)\n               (if (and (aref fast p) (>= rem (- time (aref fast p))))\n                   (f p time (mod rem (- time (aref fast p))))\n                   (if (zerop rem) p\n                       (progn\n                         (setf (aref fast p) time)\n                         (f (aref teleports p) (1+ time) (1- rem)))))))\n      (f 0 0 k))))\n\n(let ((n (read))\n      (k (read)))\n  (princ (1+ (main n k (collect-times n (1- (read)))))))\n", "language": "Lisp", "metadata": {"date": 1589160348, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s997064163.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s997064163", "user_id": "u493610446"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  \"I refered from https://competitive12.blogspot.com/2020/03/common-lisp.html thank you!\"\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defmacro aif (expr then else)\n  `(let ((it ,expr))\n     (if it ,then ,else)))\n\n(defmacro awhen (expr &rest then)\n  `(aif ,expr (progn ,@then) nil))\n\n(defun comulative (function list &key base)\n  (if base\n      (comulative function (cons base list))\n      (do ((lst (cdr list) (cdr lst))\n           (acc (list (car list))))\n          ((null lst) (reverse acc))\n        (push (funcall function (car acc) (car lst)) acc))))\n\n(defun binary-search (function left right\n                      &optional\n                        (eps 1)\n                        (average-function (lambda (x y) (ash (+ x y) -1))))\n  (if (<= (abs (- left right)) eps)\n      right\n      (let ((mid (funcall average-function left right)))\n        (if (funcall function mid)\n            (binary-search function left mid eps average-function)\n            (binary-search function mid right eps average-function)))))\n\n(defun arithmetic-mean (&rest body)\n  (/ (apply #'+ body) (length body)))\n\n(defvar +MOD+ (+ (expt 10 9) 7))\n\n(defun mapa-b (fn a b &optional (step 1))\n  (do ((i a (+ i step))\n       (result nil))\n      ((> i b) (nreverse result))\n    (push (funcall fn i) result)))\n\n(defun map0-n (fn n)\n  (mapa-b fn 0 n))\n\n(defun map1-n (fn n)\n  (mapa-b fn 1 n))\n\n(defun read-string (&optional (stream *standard-input*))\n  (labels ((is-empty (x)\n             (or (char= x #\\space) (char= x #\\newline))))\n    (loop for char = (read-char stream)\n          with result\n          when (is-empty char)\n            do (return (concatenate 'string (nreverse result)))\n          do (push char result))))\n\n(defun merge-sort (lst &optional (compare #'<))\n  (let ((turn 0))\n    (labels ((merge-list (a b a-length b-length)\n               (cond ((zerop a-length) b)\n                     ((zerop b-length) a)\n                     ((funcall compare (car b) (car a))\n                      (incf turn a-length)\n                      (cons (car b)\n                            (merge-list a (cdr b) a-length (1- b-length))))\n                     (t\n                      (cons (car a)\n                            (merge-list (cdr a) b (1- a-length) b-length)))))\n             (f (lst length)\n               (if (= length 1)\n                   lst\n                   (let ((mid (ash length -1)))\n                     (merge-list (f (subseq lst 0 mid) mid)\n                                 (f (subseq lst mid) (- length mid))\n                                 mid\n                                 (- length mid))))))\n      (values (f lst (length lst)) turn))))\n\n(defun group (lst &optional (test #'eql) (key nil))\n  (let ((table (make-hash-table :test test)))\n    (mapc (lambda (x)\n            (push x (gethash (if key (funcall key x) x) table)))\n          lst)\n    (loop for value being each hash-value in table\n          collect value)))\n\n(defun main (n k teleport &aux (teleports (coerce teleport 'vector)))\n  (let ((fast (make-array (list n) :initial-element nil)))\n    (labels ((f (p time rem)\n               (if (and (aref fast p) (>= rem (- time (aref fast p))))\n                   (f p time (mod rem (- time (aref fast p))))\n                   (if (zerop rem) p\n                       (progn\n                         (setf (aref fast p) time)\n                         (f (aref teleports p) (1+ time) (1- rem)))))))\n      (f 0 0 k))))\n\n(let ((n (read))\n      (k (read)))\n  (princ (1+ (main n k (collect-times n (1- (read)))))))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4513, "cpu_time_ms": 221, "memory_kb": 82528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s772315703", "group_id": "codeNet:p02684", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n;;;\n;;; Some operations on symmetric group\n;;;\n\n;; NOTE: Here the underlying set is 0-based: {0, 1, 2, ..., N-1}\n\n(declaim (inline decompose-to-cycles))\n(defun decompose-to-cycles (permutation)\n  \"Returns the list of all the cyclic permutations in PERMUTATION and returns\nthe parity of it as the second value. (Actually the second value is the distance\nto the identity permutation, (0, 1, ..., N-1), w.r.t. swapping.)\"\n  (declare (vector permutation))\n  (let* ((n (length permutation))\n         result\n         (visited (make-array n :element-type 'bit :initial-element 0))\n         (sign 0))\n    (declare ((integer 0 #.most-positive-fixnum) sign))\n    (dotimes (init n)\n      (when (zerop (sbit visited init))\n        (push (loop for x = init then (aref permutation x)\n                    until (= (sbit visited x) 1)\n                    collect x\n                    do (setf (sbit visited x) 1)\n                       (incf sign))\n              result)\n        (decf sign)))\n    (values result sign)))\n\n(declaim (inline perm*))\n(defun perm* (perm1 perm2)\n  \"Composes two permutations.\"\n  (let* ((n (length perm1))\n         (result (make-array n :element-type 'fixnum)))\n    (dotimes (i n)\n      (setf (aref result i) (aref perm2 (aref perm1 i))))\n    result))\n\n(declaim (inline perm-inverse))\n(defun perm-inverse (perm)\n  (let* ((n (length perm))\n         (result (make-array n :element-type 'fixnum)))\n    (dotimes (i n)\n      (setf (aref result (aref perm i)) i))\n    result))\n\n;;;\n;;; Calculate a^n on any monoids in O(log(n)) time\n;;;\n\n(declaim (inline power))\n(defun power (base exponent op identity)\n  \"OP := binary operation (comprising a monoid)\nIDENTITY := identity element w.r.t. OP\"\n  (declare ((integer 0) exponent))\n  (labels ((recur (x p)\n             (declare ((integer 0 #.most-positive-fixnum) p))\n             (cond ((zerop p) identity)\n                   ((evenp p) (recur (funcall op x x) (ash p -1)))\n                   (t (nth-value 0 (funcall op x (recur x (- p 1)))))))\n           (recur-big (x p)\n             (declare ((integer 0) p))\n             (cond ((zerop p) identity)\n                   ((evenp p) (recur-big (funcall op x x) (ash p -1)))\n                   (t (nth-value 0 (funcall op x (recur-big x (- p 1))))))))\n    (typecase exponent\n      (fixnum (recur base exponent))\n      (otherwise (recur-big base exponent)))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'uint31 :initial-element 0))\n         (iden (make-array n :element-type 'uint31 :initial-element 0)))\n    (dotimes (i n)\n      (setf (aref as i) (- (read-fixnum) 1)\n            (aref iden i) i))\n    #>as\n    (let ((res (power as k #'perm* iden)))\n      #>res\n      (println (+ 1 (aref res 0))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 5\n3 2 4 1\n\"\n    \"4\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"6 727202214173249351\n6 5 2 5 3 2\n\"\n    \"2\n\")))\n", "language": "Lisp", "metadata": {"date": 1589159493, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Lisp/s772315703.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s772315703", "user_id": "u352600849"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n;;;\n;;; Some operations on symmetric group\n;;;\n\n;; NOTE: Here the underlying set is 0-based: {0, 1, 2, ..., N-1}\n\n(declaim (inline decompose-to-cycles))\n(defun decompose-to-cycles (permutation)\n  \"Returns the list of all the cyclic permutations in PERMUTATION and returns\nthe parity of it as the second value. (Actually the second value is the distance\nto the identity permutation, (0, 1, ..., N-1), w.r.t. swapping.)\"\n  (declare (vector permutation))\n  (let* ((n (length permutation))\n         result\n         (visited (make-array n :element-type 'bit :initial-element 0))\n         (sign 0))\n    (declare ((integer 0 #.most-positive-fixnum) sign))\n    (dotimes (init n)\n      (when (zerop (sbit visited init))\n        (push (loop for x = init then (aref permutation x)\n                    until (= (sbit visited x) 1)\n                    collect x\n                    do (setf (sbit visited x) 1)\n                       (incf sign))\n              result)\n        (decf sign)))\n    (values result sign)))\n\n(declaim (inline perm*))\n(defun perm* (perm1 perm2)\n  \"Composes two permutations.\"\n  (let* ((n (length perm1))\n         (result (make-array n :element-type 'fixnum)))\n    (dotimes (i n)\n      (setf (aref result i) (aref perm2 (aref perm1 i))))\n    result))\n\n(declaim (inline perm-inverse))\n(defun perm-inverse (perm)\n  (let* ((n (length perm))\n         (result (make-array n :element-type 'fixnum)))\n    (dotimes (i n)\n      (setf (aref result (aref perm i)) i))\n    result))\n\n;;;\n;;; Calculate a^n on any monoids in O(log(n)) time\n;;;\n\n(declaim (inline power))\n(defun power (base exponent op identity)\n  \"OP := binary operation (comprising a monoid)\nIDENTITY := identity element w.r.t. OP\"\n  (declare ((integer 0) exponent))\n  (labels ((recur (x p)\n             (declare ((integer 0 #.most-positive-fixnum) p))\n             (cond ((zerop p) identity)\n                   ((evenp p) (recur (funcall op x x) (ash p -1)))\n                   (t (nth-value 0 (funcall op x (recur x (- p 1)))))))\n           (recur-big (x p)\n             (declare ((integer 0) p))\n             (cond ((zerop p) identity)\n                   ((evenp p) (recur-big (funcall op x x) (ash p -1)))\n                   (t (nth-value 0 (funcall op x (recur-big x (- p 1))))))))\n    (typecase exponent\n      (fixnum (recur base exponent))\n      (otherwise (recur-big base exponent)))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'uint31 :initial-element 0))\n         (iden (make-array n :element-type 'uint31 :initial-element 0)))\n    (dotimes (i n)\n      (setf (aref as i) (- (read-fixnum) 1)\n            (aref iden i) i))\n    #>as\n    (let ((res (power as k #'perm* iden)))\n      #>res\n      (println (+ 1 (aref res 0))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 5\n3 2 4 1\n\"\n    \"4\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"6 727202214173249351\n6 5 2 5 3 2\n\"\n    \"2\n\")))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7417, "cpu_time_ms": 286, "memory_kb": 119100}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s923897108", "group_id": "codeNet:p02700", "input_text": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (d (read)))\n  (if (<= (ceiling c b) (ceiling a d))\n      (format t \"Yes~%\")\n      (format t \"No~%\")))\n", "language": "Lisp", "metadata": {"date": 1593572653, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lisp/s923897108.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s923897108", "user_id": "u608227593"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (d (read)))\n  (if (<= (ceiling c b) (ceiling a d))\n      (format t \"Yes~%\")\n      (format t \"No~%\")))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 159, "cpu_time_ms": 18, "memory_kb": 23344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s847035302", "group_id": "codeNet:p02700", "input_text": "(defun App ()\n    (let ((a (read))\n        (b (read))\n        (c (read))\n        (d (read)))\n\n        (loop while (or (> a 0) (> c 0))\n        do (progn\n            (setf a (- a d))\n            (setf c (- c b))\n            (if (<= c 0)\n                (progn\n                (format t \"Yes~%\")\n                 \t(return)\n                )\n            )\n            (if (<= a 0)\n                (progn\n                (format t \"No~%\")\n                (return)\n                )\n            )\n        )\n        )\n    )\n    \n)\n\n(App)", "language": "Lisp", "metadata": {"date": 1592583187, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lisp/s847035302.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s847035302", "user_id": "u136500538"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(defun App ()\n    (let ((a (read))\n        (b (read))\n        (c (read))\n        (d (read)))\n\n        (loop while (or (> a 0) (> c 0))\n        do (progn\n            (setf a (- a d))\n            (setf c (- c b))\n            (if (<= c 0)\n                (progn\n                (format t \"Yes~%\")\n                 \t(return)\n                )\n            )\n            (if (<= a 0)\n                (progn\n                (format t \"No~%\")\n                (return)\n                )\n            )\n        )\n        )\n    )\n    \n)\n\n(App)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 531, "cpu_time_ms": 16, "memory_kb": 23432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s819597807", "group_id": "codeNet:p02700", "input_text": "(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n;;(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defvar *t-health* (read))\n(defvar *t-attack* (read))\n(defvar *a-health* (read))\n(defvar *a-attack* (read))\n\n(let ((n-t-die (ceiling *t-health* *a-attack*))\n      ;; 青木君に何回攻撃されると高橋君は死ぬか \n      (n-a-die (ceiling *a-health* *t-attack*)))\n  ;; 高橋君に何回攻撃されると青木君は死ぬか\n  (format t \"~:[No~;Yes~]\" (<= n-a-die n-t-die)))\n;; 高橋君が先制攻撃するので死ぬまでの回数が同じなら高橋君の勝ち \n", "language": "Lisp", "metadata": {"date": 1590266493, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lisp/s819597807.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s819597807", "user_id": "u203134021"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n;;(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defvar *t-health* (read))\n(defvar *t-attack* (read))\n(defvar *a-health* (read))\n(defvar *a-attack* (read))\n\n(let ((n-t-die (ceiling *t-health* *a-attack*))\n      ;; 青木君に何回攻撃されると高橋君は死ぬか \n      (n-a-die (ceiling *a-health* *t-attack*)))\n  ;; 高橋君に何回攻撃されると青木君は死ぬか\n  (format t \"~:[No~;Yes~]\" (<= n-a-die n-t-die)))\n;; 高橋君が先制攻撃するので死ぬまでの回数が同じなら高橋君の勝ち \n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 656, "cpu_time_ms": 15, "memory_kb": 23720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s544514132", "group_id": "codeNet:p02700", "input_text": "(defun attack (a b c d &optional (turn 'takahashi))\n  (cond ((<= a 0)\n         \"No\")\n        ((<= c 0)\n         \"Yes\")\n        ((eq turn 'takahashi)\n         (attack a b (- c b) d 'aoki))\n        ((eq turn 'aoki)\n         (attack (- a d) b c d 'takahashi))))\n\n(princ (attack (read) (read) (read) (read)))", "language": "Lisp", "metadata": {"date": 1587954137, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lisp/s544514132.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s544514132", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(defun attack (a b c d &optional (turn 'takahashi))\n  (cond ((<= a 0)\n         \"No\")\n        ((<= c 0)\n         \"Yes\")\n        ((eq turn 'takahashi)\n         (attack a b (- c b) d 'aoki))\n        ((eq turn 'aoki)\n         (attack (- a d) b c d 'takahashi))))\n\n(princ (attack (read) (read) (read) (read)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 304, "cpu_time_ms": 16, "memory_kb": 24376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s919452906", "group_id": "codeNet:p02700", "input_text": "(let* ((a (read))\n       (b (read))\n       (c (read))\n       (d (read))\n       (time-t (ceiling (/ c b)))\n       (time-a (ceiling (/ a d))))\n      (if (<= time-t time-a)\n          (format t \"Yes\")\n          (format t \"No\")))", "language": "Lisp", "metadata": {"date": 1587950769, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lisp/s919452906.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s919452906", "user_id": "u425317134"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let* ((a (read))\n       (b (read))\n       (c (read))\n       (d (read))\n       (time-t (ceiling (/ c b)))\n       (time-a (ceiling (/ a d))))\n      (if (<= time-t time-a)\n          (format t \"Yes\")\n          (format t \"No\")))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 224, "cpu_time_ms": 13, "memory_kb": 23192}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s962027013", "group_id": "codeNet:p02700", "input_text": "(let* ((n (cons (read) (read)))\n       (m (cons (read) (read))))\n  (loop :do (if (<= (car n) 0)\n                (progn (princ \"No\") (return))\n                (decf (car m) (cdr n)))\n        :do (if (<= (car m) 0)\n                (progn (princ \"Yes\") (return))\n                (decf (car n) (cdr m)))\n        )\n  )", "language": "Lisp", "metadata": {"date": 1587950576, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lisp/s962027013.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s962027013", "user_id": "u610490393"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let* ((n (cons (read) (read)))\n       (m (cons (read) (read))))\n  (loop :do (if (<= (car n) 0)\n                (progn (princ \"No\") (return))\n                (decf (car m) (cdr n)))\n        :do (if (<= (car m) 0)\n                (progn (princ \"Yes\") (return))\n                (decf (car n) (cdr m)))\n        )\n  )", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 313, "cpu_time_ms": 14, "memory_kb": 23584}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s542913386", "group_id": "codeNet:p02700", "input_text": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (d (read)))\n  (format t \"~:[No~;Yes~]~%\" (<= (ceiling c b) (ceiling a d))))", "language": "Lisp", "metadata": {"date": 1587950273, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lisp/s542913386.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s542913386", "user_id": "u320993798"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (d (read)))\n  (format t \"~:[No~;Yes~]~%\" (<= (ceiling c b) (ceiling a d))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 132, "cpu_time_ms": 18, "memory_kb": 23248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s315844566", "group_id": "codeNet:p02700", "input_text": "(let* ((n (cons (read) (read)))\n       (m (cons (read) (read))))\n  (loop :do (if (<= (car n) 0)\n                (progn (princ \"No\") (return))\n                (decf (car m) (cdr n)))\n        :do (if (<= (cdr m) 0)\n                (progn (princ \"Yes\") (return))\n                (decf (car n) (cdr m)))\n        )\n  )", "language": "Lisp", "metadata": {"date": 1587950214, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lisp/s315844566.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s315844566", "user_id": "u610490393"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let* ((n (cons (read) (read)))\n       (m (cons (read) (read))))\n  (loop :do (if (<= (car n) 0)\n                (progn (princ \"No\") (return))\n                (decf (car m) (cdr n)))\n        :do (if (<= (cdr m) 0)\n                (progn (princ \"Yes\") (return))\n                (decf (car n) (cdr m)))\n        )\n  )", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 313, "cpu_time_ms": 13, "memory_kb": 23576}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s717680138", "group_id": "codeNet:p02700", "input_text": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (d (read)))\n  (format t \"~a~%\"\n          (if (loop\n                do (decf c b)\n                if (<= c 0) do (return t)\n                do (decf a d)\n                if (<= a 0) do (return nil))\n              \"Yes\"\n              \"No\")))\n\n", "language": "Lisp", "metadata": {"date": 1587949606, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lisp/s717680138.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s717680138", "user_id": "u690263481"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (d (read)))\n  (format t \"~a~%\"\n          (if (loop\n                do (decf c b)\n                if (<= c 0) do (return t)\n                do (decf a d)\n                if (<= a 0) do (return nil))\n              \"Yes\"\n              \"No\")))\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 298, "cpu_time_ms": 16, "memory_kb": 23464}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s019358099", "group_id": "codeNet:p02700", "input_text": "(let ((A (read))\n      (B (read))\n      (C (read))\n      (D (read)))\n     (if (< (ceiling A D)\n            (ceiling C B))\n         (princ \"No\")\n         (princ \"Yes\")))", "language": "Lisp", "metadata": {"date": 1587949503, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lisp/s019358099.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s019358099", "user_id": "u334552723"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let ((A (read))\n      (B (read))\n      (C (read))\n      (D (read)))\n     (if (< (ceiling A D)\n            (ceiling C B))\n         (princ \"No\")\n         (princ \"Yes\")))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 168, "cpu_time_ms": 16, "memory_kb": 24200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s627331328", "group_id": "codeNet:p02700", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((a (read))\n         (b (read))\n         (c (read))\n         (d (read)))\n    (write-line\n     (loop for i from 0\n           do (when (<= a 0)\n                (return \"No\"))\n              (when (<= c 0)\n                (return \"Yes\"))\n              (if (evenp i)\n                  (decf c b)\n                  (decf a d))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 9 10 10\n\"\n    \"No\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"46 4 40 5\n\"\n    \"Yes\n\")))\n", "language": "Lisp", "metadata": {"date": 1587949354, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Lisp/s627331328.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s627331328", "user_id": "u352600849"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((a (read))\n         (b (read))\n         (c (read))\n         (d (read)))\n    (write-line\n     (loop for i from 0\n           do (when (<= a 0)\n                (return \"No\"))\n              (when (<= c 0)\n                (return \"Yes\"))\n              (if (evenp i)\n                  (decf c b)\n                  (decf a d))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 9 10 10\n\"\n    \"No\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"46 4 40 5\n\"\n    \"Yes\n\")))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3818, "cpu_time_ms": 17, "memory_kb": 23980}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s616505051", "group_id": "codeNet:p02702", "input_text": "#|\n------------------------------------\n|               Utils               |\n------------------------------------\n|#\n\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n(defconstant +mod+ 1000000007)\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n\n#|\n------------------------------------\n|               Body               |\n------------------------------------\n|#\n\n\n(defun calc-digit (k)\n  (length (format nil \"~a\" k)))\n\n(defun char->int (c)\n  (- (char-int c)\n     (char-int #\\0)))\n\n(defun solve (n)\n  (let* ((d (calc-digit n))\n         (dp (make-array (1+ d) :initial-element 0))\n         (n (reverse (concatenate 'list (format nil \"~a\" n)))))\n    (loop for i below d\n       do\n         (setf (aref dp (1+ i))\n               (mod (+ (aref dp i)\n                       (* (char->int (pop n))\n                          (expt 10 i)))\n                    2019)))\n    (loop for i below (1+ d)\n       with memo = (make-array 2019) \n       do\n         (incf (aref memo (aref dp i)))\n       finally\n         (return \n           (reduce #'+\n                   (map 'vector (lambda (m)\n                                  (floor (* m (1- m)) 2))\n                        memo))))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read)))\n    (princ (solve n))\n    (fresh-line)))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600459686, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s616505051.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s616505051", "user_id": "u425762225"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#|\n------------------------------------\n|               Utils               |\n------------------------------------\n|#\n\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n(defconstant +mod+ 1000000007)\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n\n#|\n------------------------------------\n|               Body               |\n------------------------------------\n|#\n\n\n(defun calc-digit (k)\n  (length (format nil \"~a\" k)))\n\n(defun char->int (c)\n  (- (char-int c)\n     (char-int #\\0)))\n\n(defun solve (n)\n  (let* ((d (calc-digit n))\n         (dp (make-array (1+ d) :initial-element 0))\n         (n (reverse (concatenate 'list (format nil \"~a\" n)))))\n    (loop for i below d\n       do\n         (setf (aref dp (1+ i))\n               (mod (+ (aref dp i)\n                       (* (char->int (pop n))\n                          (expt 10 i)))\n                    2019)))\n    (loop for i below (1+ d)\n       with memo = (make-array 2019) \n       do\n         (incf (aref memo (aref dp i)))\n       finally\n         (return \n           (reduce #'+\n                   (map 'vector (lambda (m)\n                                  (floor (* m (1- m)) 2))\n                        memo))))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read)))\n    (princ (solve n))\n    (fresh-line)))\n\n#-swank (main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6547, "cpu_time_ms": 2206, "memory_kb": 92540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s799232642", "group_id": "codeNet:p02702", "input_text": "#|\n------------------------------------\n|               Utils               |\n------------------------------------\n|#\n\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n(defconstant +mod+ 1000000007)\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n\n#|\n------------------------------------\n|               Body               |\n------------------------------------\n|#\n\n\n(defun calc-digit (k)\n  (length (format nil \"~a\" k)))\n\n(defun int->lst (k &optional (acc nil))\n  (if (zerop k)\n      acc\n      (int->lst (floor k 10) (cons (rem k 10) acc))))\n\n(defun solve (n)\n  (let* ((d (calc-digit n))\n         (dp (make-array (1+ d) :initial-element 0))\n         (l (reverse (int->lst n))))\n    (loop for i below d\n       do\n         (setf (aref dp (1+ i))\n               (mod (+ (aref dp i)\n                       (* (pop l)\n                          (expt 10 i)))\n                    2019)))\n    (loop for i below (1+ d)\n       with memo = (make-array 2019) \n       do\n         (incf (aref memo (aref dp i)))\n       finally\n         (return \n           (reduce #'+\n                   (map 'vector (lambda (m)\n                                  (floor (* m (1- m)) 2))\n                        memo))))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read)))\n    (princ (solve n))\n    (fresh-line)))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600459137, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s799232642.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s799232642", "user_id": "u425762225"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#|\n------------------------------------\n|               Utils               |\n------------------------------------\n|#\n\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n(defconstant +mod+ 1000000007)\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n\n#|\n------------------------------------\n|               Body               |\n------------------------------------\n|#\n\n\n(defun calc-digit (k)\n  (length (format nil \"~a\" k)))\n\n(defun int->lst (k &optional (acc nil))\n  (if (zerop k)\n      acc\n      (int->lst (floor k 10) (cons (rem k 10) acc))))\n\n(defun solve (n)\n  (let* ((d (calc-digit n))\n         (dp (make-array (1+ d) :initial-element 0))\n         (l (reverse (int->lst n))))\n    (loop for i below d\n       do\n         (setf (aref dp (1+ i))\n               (mod (+ (aref dp i)\n                       (* (pop l)\n                          (expt 10 i)))\n                    2019)))\n    (loop for i below (1+ d)\n       with memo = (make-array 2019) \n       do\n         (incf (aref memo (aref dp i)))\n       finally\n         (return \n           (reduce #'+\n                   (map 'vector (lambda (m)\n                                  (floor (* m (1- m)) 2))\n                        memo))))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read)))\n    (princ (solve n))\n    (fresh-line)))\n\n#-swank (main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6567, "cpu_time_ms": 2206, "memory_kb": 92480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s899596491", "group_id": "codeNet:p02702", "input_text": "#|\n------------------------------------\n|               Utils               |\n------------------------------------\n|#\n\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n(defconstant +mod+ 1000000007)\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n\n#|\n------------------------------------\n|               Body               |\n------------------------------------\n|#\n\n\n(defun calc-digit (k &optional (acc 0))\n  (if (zerop k)\n      acc\n      (calc-digit (floor k 10) (1+ acc))))\n\n(defun int->lst (k &optional (acc nil))\n  (if (zerop k)\n      acc\n      (int->lst (floor k 10) (cons (rem k 10) acc))))\n\n(defun solve (n)\n  (let* ((d (calc-digit n))\n         (dp (make-array (1+ d) :initial-element 0))\n         (l (reverse (int->lst n))))\n    (loop for i below d\n       do\n         (setf (aref dp (1+ i))\n               (mod (+ (aref dp i)\n                       (* (pop l)\n                          (expt 10 i)))\n                    2019)))\n    (loop for i below 2019\n       with res = 0\n       with tmp = 0\n       do\n         (setq tmp (count i dp\n                          :test #'=))\n         (incf res (floor (* tmp (1- tmp))\n                          2))\n       finally\n         (return res))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read)))\n    (princ (solve n))\n    (fresh-line)))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600458399, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s899596491.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s899596491", "user_id": "u425762225"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#|\n------------------------------------\n|               Utils               |\n------------------------------------\n|#\n\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n(defconstant +mod+ 1000000007)\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n\n#|\n------------------------------------\n|               Body               |\n------------------------------------\n|#\n\n\n(defun calc-digit (k &optional (acc 0))\n  (if (zerop k)\n      acc\n      (calc-digit (floor k 10) (1+ acc))))\n\n(defun int->lst (k &optional (acc nil))\n  (if (zerop k)\n      acc\n      (int->lst (floor k 10) (cons (rem k 10) acc))))\n\n(defun solve (n)\n  (let* ((d (calc-digit n))\n         (dp (make-array (1+ d) :initial-element 0))\n         (l (reverse (int->lst n))))\n    (loop for i below d\n       do\n         (setf (aref dp (1+ i))\n               (mod (+ (aref dp i)\n                       (* (pop l)\n                          (expt 10 i)))\n                    2019)))\n    (loop for i below 2019\n       with res = 0\n       with tmp = 0\n       do\n         (setq tmp (count i dp\n                          :test #'=))\n         (incf res (floor (* tmp (1- tmp))\n                          2))\n       finally\n         (return res))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read)))\n    (princ (solve n))\n    (fresh-line)))\n\n#-swank (main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6571, "cpu_time_ms": 2206, "memory_kb": 92564}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s209129525", "group_id": "codeNet:p02702", "input_text": "(let* ((s (read-line))\n       (n (length s))\n       (dp (make-array (list (1+ n)) :initial-element 0))\n       (c (make-array (list 2019) :initial-element 0))\n       (ans 0))\n  ;\n  (setf (aref c 0) 1)\n  ;\n  (loop :for i :downfrom (1- n) :to 0\n        :do (setf (aref dp i)\n                  (mod (+ (aref dp (1+ i))\n                          (* (mod (expt 10 (- n i 1)) 2019)\n                             (- (char-code (aref s i)) #x30)))\n                       2019))\n        :do (incf (aref c (aref dp i))))\n  (setf ans (loop :for i :from 0 :to 2018\n                  :sum (/ (* (aref c i) (1- (aref c i))) 2)))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1599100694, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s209129525.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s209129525", "user_id": "u608227593"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((s (read-line))\n       (n (length s))\n       (dp (make-array (list (1+ n)) :initial-element 0))\n       (c (make-array (list 2019) :initial-element 0))\n       (ans 0))\n  ;\n  (setf (aref c 0) 1)\n  ;\n  (loop :for i :downfrom (1- n) :to 0\n        :do (setf (aref dp i)\n                  (mod (+ (aref dp (1+ i))\n                          (* (mod (expt 10 (- n i 1)) 2019)\n                             (- (char-code (aref s i)) #x30)))\n                       2019))\n        :do (incf (aref c (aref dp i))))\n  (setf ans (loop :for i :from 0 :to 2018\n                  :sum (/ (* (aref c i) (1- (aref c i))) 2)))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 638, "cpu_time_ms": 2208, "memory_kb": 81372}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s629657187", "group_id": "codeNet:p02702", "input_text": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(declaim (type simple-string *s*))\n(defvar *s* (coerce (read-line) 'simple-string))\n\n(declaim (type fixnum *count*))\n(defvar *count* 0) ;; *count* <= |S| <= 200000\n\n(dotimes (i (length *s*))\n  (let ((prev-mod 0))\n    (declare (type fixnum prev-mod)) ;; 0<=prev-mod<=2019\n    (loop for j from i to (1- (length *s*)) do\n\t  ;; calc curr-mod\n\t  (let ((curr-mod (mod (+ (* prev-mod 10)\n\t\t\t\t  (the (integer 0 10) (- (char-code (aref *s* j))\n\t\t\t\t     (char-code #\\0))))\n\t\t\t       2019)))\n\t    (if (zerop curr-mod)\n\t\t(incf *count*))\n\t    (setf prev-mod curr-mod)))))\n(princ *count*)\n", "language": "Lisp", "metadata": {"date": 1590269142, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s629657187.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s629657187", "user_id": "u203134021"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(declaim (type simple-string *s*))\n(defvar *s* (coerce (read-line) 'simple-string))\n\n(declaim (type fixnum *count*))\n(defvar *count* 0) ;; *count* <= |S| <= 200000\n\n(dotimes (i (length *s*))\n  (let ((prev-mod 0))\n    (declare (type fixnum prev-mod)) ;; 0<=prev-mod<=2019\n    (loop for j from i to (1- (length *s*)) do\n\t  ;; calc curr-mod\n\t  (let ((curr-mod (mod (+ (* prev-mod 10)\n\t\t\t\t  (the (integer 0 10) (- (char-code (aref *s* j))\n\t\t\t\t     (char-code #\\0))))\n\t\t\t       2019)))\n\t    (if (zerop curr-mod)\n\t\t(incf *count*))\n\t    (setf prev-mod curr-mod)))))\n(princ *count*)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 749, "cpu_time_ms": 2206, "memory_kb": 26312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s389488785", "group_id": "codeNet:p02702", "input_text": "(defun create-answer (s size)\n  (let ((tmp-result nil)\n        (current-pos 0))\n    (labels ((detect (base pos)\n               (cond ((< size pos)\n                      (return-from detect 'success))\n                     ((< size (+ pos base))\n                      (incf current-pos)\n                      (detect 4 current-pos))\n                     (t\n                      (let ((tmp (subseq s pos (+ pos base))))\n                        (if (= (mod (parse-integer tmp) 2019) 0)\n                            (progn\n                              (push t tmp-result)\n                              (incf current-pos)\n                              (detect 4 (+ base pos)))\n                            (detect (1+ base) pos)))))))\n      (detect 4 0)\n      (length tmp-result))))\n\n(let ((S (read-line)))\n  (princ (create-answer S (length S))))", "language": "Lisp", "metadata": {"date": 1588013910, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s389488785.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s389488785", "user_id": "u631655863"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defun create-answer (s size)\n  (let ((tmp-result nil)\n        (current-pos 0))\n    (labels ((detect (base pos)\n               (cond ((< size pos)\n                      (return-from detect 'success))\n                     ((< size (+ pos base))\n                      (incf current-pos)\n                      (detect 4 current-pos))\n                     (t\n                      (let ((tmp (subseq s pos (+ pos base))))\n                        (if (= (mod (parse-integer tmp) 2019) 0)\n                            (progn\n                              (push t tmp-result)\n                              (incf current-pos)\n                              (detect 4 (+ base pos)))\n                            (detect (1+ base) pos)))))))\n      (detect 4 0)\n      (length tmp-result))))\n\n(let ((S (read-line)))\n  (princ (create-answer S (length S))))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 840, "cpu_time_ms": 2209, "memory_kb": 83608}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s543845775", "group_id": "codeNet:p02702", "input_text": "(let ((s (read-line)))\n     (loop with x = 0\n           for i from 1 to (floor (/ (parse-integer s) \n                                     2019))\n           do (let ((num (write-to-string (* i 2019))))\n                   (loop for pos from 0 to (- (length s)\n                                              (length num))\n                         do (if (string= (subseq s \n                                                 pos \n                                                 (+ pos (length num)))\n                                         num)\n                                (incf x))))\n           finally (format t \"~A\" x)))", "language": "Lisp", "metadata": {"date": 1587955495, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s543845775.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s543845775", "user_id": "u425317134"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let ((s (read-line)))\n     (loop with x = 0\n           for i from 1 to (floor (/ (parse-integer s) \n                                     2019))\n           do (let ((num (write-to-string (* i 2019))))\n                   (loop for pos from 0 to (- (length s)\n                                              (length num))\n                         do (if (string= (subseq s \n                                                 pos \n                                                 (+ pos (length num)))\n                                         num)\n                                (incf x))))\n           finally (format t \"~A\" x)))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 623, "cpu_time_ms": 2209, "memory_kb": 129008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s079494823", "group_id": "codeNet:p02702", "input_text": "(defun f (n)\n  (- (char-code n) 48))\n\n(defun ff (lst)\n  (let* ((n (reverse lst)))\n    (loop :for k :from 0\n          :for j :in n\n          :sum (* j (expt 10 k)))))\n\n(let* ((len (map 'vector #'f (concatenate 'list (read-line))))\n       (ln (1- (length len))))\n  (princ (loop :for k :from 0 :upto (- ln 3)\n               :sum (loop :for x :from (+ k 3) :upto ln\n                          :for y := (subseq len k (1+ x))\n                          :count t))))", "language": "Lisp", "metadata": {"date": 1587954145, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s079494823.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s079494823", "user_id": "u610490393"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defun f (n)\n  (- (char-code n) 48))\n\n(defun ff (lst)\n  (let* ((n (reverse lst)))\n    (loop :for k :from 0\n          :for j :in n\n          :sum (* j (expt 10 k)))))\n\n(let* ((len (map 'vector #'f (concatenate 'list (read-line))))\n       (ln (1- (length len))))\n  (princ (loop :for k :from 0 :upto (- ln 3)\n               :sum (loop :for x :from (+ k 3) :upto ln\n                          :for y := (subseq len k (1+ x))\n                          :count t))))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 458, "cpu_time_ms": 2210, "memory_kb": 113212}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s025287430", "group_id": "codeNet:p02702", "input_text": "(defun f (n)\n  (- (char-code n) 48))\n\n(defun ff (lst)\n  (let* ((n (reverse lst)))\n    (loop :for k :from 0\n          :for j :in n\n          :sum (* j (expt 10 k)))))\n\n(let* ((len (map 'list #'f (concatenate 'list (read-line))))\n       (ln (1- (length len))))\n  (princ (loop :for k :from 0 :upto (- ln 3)\n               :sum (loop :for x :from (+ k 3) :upto ln\n                          :for y := (subseq len k (1+ x))\n                          :count (= 0 (mod (ff y) 2019))))))\n", "language": "Lisp", "metadata": {"date": 1587954027, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s025287430.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s025287430", "user_id": "u610490393"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defun f (n)\n  (- (char-code n) 48))\n\n(defun ff (lst)\n  (let* ((n (reverse lst)))\n    (loop :for k :from 0\n          :for j :in n\n          :sum (* j (expt 10 k)))))\n\n(let* ((len (map 'list #'f (concatenate 'list (read-line))))\n       (ln (1- (length len))))\n  (princ (loop :for k :from 0 :upto (- ln 3)\n               :sum (loop :for x :from (+ k 3) :upto ln\n                          :for y := (subseq len k (1+ x))\n                          :count (= 0 (mod (ff y) 2019))))))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 479, "cpu_time_ms": 2208, "memory_kb": 83092}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s685344527", "group_id": "codeNet:p02702", "input_text": "(let* ((len (map 'list #'f (concatenate 'list (read-line))))\n       (ln (1- (length len))))\n  (princ (loop :for k :from 0 :upto (- ln 3)\n               :sum (loop :for x :from (+ k 3) :upto ln\n                          :for y := (subseq len k (1+ x))\n                          :count (= 0 (mod (ff y) 2019))))))", "language": "Lisp", "metadata": {"date": 1587953929, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s685344527.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s685344527", "user_id": "u610490393"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((len (map 'list #'f (concatenate 'list (read-line))))\n       (ln (1- (length len))))\n  (princ (loop :for k :from 0 :upto (- ln 3)\n               :sum (loop :for x :from (+ k 3) :upto ln\n                          :for y := (subseq len k (1+ x))\n                          :count (= 0 (mod (ff y) 2019))))))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 311, "cpu_time_ms": 112, "memory_kb": 26468}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s252041677", "group_id": "codeNet:p02702", "input_text": "(let ((s (read-line)))\n     (loop with x = 0\n           for i from 0 below (- (length s) 3)\n           do (loop for j from (+ i 3) below (length s)\n                    do (if (zerop (mod (parse-integer (subseq s i (1+ j)))\n                                       2019))\n                           (incf x)))\n           finally (format t \"~A\" x)))\n", "language": "Lisp", "metadata": {"date": 1587953461, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s252041677.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s252041677", "user_id": "u425317134"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let ((s (read-line)))\n     (loop with x = 0\n           for i from 0 below (- (length s) 3)\n           do (loop for j from (+ i 3) below (length s)\n                    do (if (zerop (mod (parse-integer (subseq s i (1+ j)))\n                                       2019))\n                           (incf x)))\n           finally (format t \"~A\" x)))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 346, "cpu_time_ms": 2208, "memory_kb": 82860}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s204610134", "group_id": "codeNet:p02702", "input_text": "(let* ((s (read-line))\n       (l (length s))\n       m)\n  (labels ((f (n)\n\t     (let ((result (assoc n m :test #'=)))\n\t       (if result\n\t\t   (cdr result)\n\t\t   (prog1\n\t\t       (setf result (loop for x = n then (floor x 10)\n\t\t\t\t       until (< x 2019)\n\t\t\t\t       count (zerop (mod x 2019))))\n\t\t     (acons n result m))))))\n    (if (< l 4)\n\t(format t \"0~%\")\n\t(format t \"~d~%\"\n\t\t(loop for i upto (- (length s) 4)\n\t\t   sum (f (parse-integer s :start i)))))))", "language": "Lisp", "metadata": {"date": 1587952969, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s204610134.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s204610134", "user_id": "u320993798"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((s (read-line))\n       (l (length s))\n       m)\n  (labels ((f (n)\n\t     (let ((result (assoc n m :test #'=)))\n\t       (if result\n\t\t   (cdr result)\n\t\t   (prog1\n\t\t       (setf result (loop for x = n then (floor x 10)\n\t\t\t\t       until (< x 2019)\n\t\t\t\t       count (zerop (mod x 2019))))\n\t\t     (acons n result m))))))\n    (if (< l 4)\n\t(format t \"0~%\")\n\t(format t \"~d~%\"\n\t\t(loop for i upto (- (length s) 4)\n\t\t   sum (f (parse-integer s :start i)))))))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 453, "cpu_time_ms": 2210, "memory_kb": 129072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s212774757", "group_id": "codeNet:p02702", "input_text": "(defvar arr1 (make-array 2019 :initial-element 0))\n(defvar arr2 (make-array 2019))\n\n(defun solve (S)\n  (loop for x in S with result = 0 do \n        (loop for i below 2019 with j do\n              (setf j (mod (+ (* 10 i) x) 2019))\n              (setf (aref arr2 j) (aref arr1 i)))\n        (incf (aref arr2 x))\n        (incf result (aref arr2 0))\n        (rotatef arr1 arr2)\n        finally (princ result)))\n\n\n;(solve (loop repeat 200000 collect 1))\n\n(solve (map 'list #'digit-char-p (read-line)))\n", "language": "Lisp", "metadata": {"date": 1587952818, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s212774757.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s212774757", "user_id": "u334552723"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defvar arr1 (make-array 2019 :initial-element 0))\n(defvar arr2 (make-array 2019))\n\n(defun solve (S)\n  (loop for x in S with result = 0 do \n        (loop for i below 2019 with j do\n              (setf j (mod (+ (* 10 i) x) 2019))\n              (setf (aref arr2 j) (aref arr1 i)))\n        (incf (aref arr2 x))\n        (incf result (aref arr2 0))\n        (rotatef arr1 arr2)\n        finally (princ result)))\n\n\n;(solve (loop repeat 200000 collect 1))\n\n(solve (map 'list #'digit-char-p (read-line)))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 496, "cpu_time_ms": 2206, "memory_kb": 29344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s639150340", "group_id": "codeNet:p02702", "input_text": "(let* ((s (read-line))\n       (l (length s)))\n  (if (< l 4)\n      (format t \"0~%\")\n      (format t \"~d~%\"\n\t      (loop for i upto (- l 4)\n\t\t for x = (parse-integer s :start i)\n\t\t sum (loop for j upto (- l 4 i)\n\t\t\tcount (zerop (mod (floor x (expt 10 j)) 2019)))))))", "language": "Lisp", "metadata": {"date": 1587951933, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s639150340.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s639150340", "user_id": "u320993798"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((s (read-line))\n       (l (length s)))\n  (if (< l 4)\n      (format t \"0~%\")\n      (format t \"~d~%\"\n\t      (loop for i upto (- l 4)\n\t\t for x = (parse-integer s :start i)\n\t\t sum (loop for j upto (- l 4 i)\n\t\t\tcount (zerop (mod (floor x (expt 10 j)) 2019)))))))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 264, "cpu_time_ms": 2208, "memory_kb": 128888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s706771074", "group_id": "codeNet:p02702", "input_text": "(let ((s (read-line)))\n     (loop with x = 0\n           for i from 0 below (length s)\n           do (loop for j from i below (length s)\n                    do (if (zerop (mod (parse-integer (subseq s i (1+ j)))\n                                       2019))\n                           (incf x)))\n           finally (format t \"~A\" x)))", "language": "Lisp", "metadata": {"date": 1587951527, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s706771074.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s706771074", "user_id": "u425317134"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let ((s (read-line)))\n     (loop with x = 0\n           for i from 0 below (length s)\n           do (loop for j from i below (length s)\n                    do (if (zerop (mod (parse-integer (subseq s i (1+ j)))\n                                       2019))\n                           (incf x)))\n           finally (format t \"~A\" x)))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 333, "cpu_time_ms": 2207, "memory_kb": 82500}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s454648215", "group_id": "codeNet:p02702", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Arithmetic operations with static modulus\n;;;\n\n;; FIXME: Currently MOD* and MOD+ doesn't apply MOD when the number of\n;; parameters is one.\n(defmacro define-mod-operations (divisor)\n  `(progn\n     (defun mod* (&rest args)\n       (reduce (lambda (x y) (mod (* x y) ,divisor)) args))\n\n     (defun mod+ (&rest args)\n       (reduce (lambda (x y) (mod (+ x y) ,divisor)) args))\n\n     #+sbcl\n     (eval-when (:compile-toplevel :load-toplevel :execute)\n       (locally (declare (muffle-conditions warning))\n         (sb-c:define-source-transform mod* (&rest args)\n           (if (null args)\n               1\n               (reduce (lambda (x y) `(mod (* ,x ,y) ,',divisor)) args)))\n         (sb-c:define-source-transform mod+ (&rest args)\n           (if (null args)\n               0\n               (reduce (lambda (x y) `(mod (+ ,x ,y) ,',divisor)) args)))))\n\n     (define-modify-macro incfmod (delta)\n       (lambda (x y) (mod (+ x y) ,divisor)))\n\n     (define-modify-macro decfmod (delta)\n       (lambda (x y) (mod (- x y) ,divisor)))\n\n     (define-modify-macro mulfmod (multiplier)\n       (lambda (x y) (mod (* x y) ,divisor)))))\n\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 2019)\n\n;;;\n;;; Body\n;;;\n\n(define-mod-operations +mod+)\n(defun main ()\n  (let* ((s (map '(simple-array uint8 (*)) #'digit-char-p (read-line)))\n         (n (length s))\n         (cumul (make-array (+ n 1) :element-type 'uint31 :initial-element 0))\n         (invs (make-array (+ n 1) :element-type 'uint31 :initial-element 0))\n         (table (make-array 2020 :element-type 'uint31 :initial-element 0)))\n    (setf (aref invs 0) 1)\n    (dotimes (i n)\n      (setf (aref invs (+ i 1))\n            (mod* 202 (aref invs i))))\n    #>invs\n    (dotimes (i n)\n      (setf (aref cumul (+ i 1))\n            (mod+ (mod* (aref cumul i) 10) (aref s i))))\n    #>cumul\n    (let ((res 0))\n      (dotimes (i (+ n 1))\n        (let ((f (mod* (aref cumul i) (aref invs i))))\n          (incf res (aref table f))\n          (incf (aref table f))))\n      (println res))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1817181712114\n\"\n    \"3\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"14282668646\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2119\n\"\n    \"0\n\")))\n", "language": "Lisp", "metadata": {"date": 1587950125, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Lisp/s454648215.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s454648215", "user_id": "u352600849"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Arithmetic operations with static modulus\n;;;\n\n;; FIXME: Currently MOD* and MOD+ doesn't apply MOD when the number of\n;; parameters is one.\n(defmacro define-mod-operations (divisor)\n  `(progn\n     (defun mod* (&rest args)\n       (reduce (lambda (x y) (mod (* x y) ,divisor)) args))\n\n     (defun mod+ (&rest args)\n       (reduce (lambda (x y) (mod (+ x y) ,divisor)) args))\n\n     #+sbcl\n     (eval-when (:compile-toplevel :load-toplevel :execute)\n       (locally (declare (muffle-conditions warning))\n         (sb-c:define-source-transform mod* (&rest args)\n           (if (null args)\n               1\n               (reduce (lambda (x y) `(mod (* ,x ,y) ,',divisor)) args)))\n         (sb-c:define-source-transform mod+ (&rest args)\n           (if (null args)\n               0\n               (reduce (lambda (x y) `(mod (+ ,x ,y) ,',divisor)) args)))))\n\n     (define-modify-macro incfmod (delta)\n       (lambda (x y) (mod (+ x y) ,divisor)))\n\n     (define-modify-macro decfmod (delta)\n       (lambda (x y) (mod (- x y) ,divisor)))\n\n     (define-modify-macro mulfmod (multiplier)\n       (lambda (x y) (mod (* x y) ,divisor)))))\n\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 2019)\n\n;;;\n;;; Body\n;;;\n\n(define-mod-operations +mod+)\n(defun main ()\n  (let* ((s (map '(simple-array uint8 (*)) #'digit-char-p (read-line)))\n         (n (length s))\n         (cumul (make-array (+ n 1) :element-type 'uint31 :initial-element 0))\n         (invs (make-array (+ n 1) :element-type 'uint31 :initial-element 0))\n         (table (make-array 2020 :element-type 'uint31 :initial-element 0)))\n    (setf (aref invs 0) 1)\n    (dotimes (i n)\n      (setf (aref invs (+ i 1))\n            (mod* 202 (aref invs i))))\n    #>invs\n    (dotimes (i n)\n      (setf (aref cumul (+ i 1))\n            (mod+ (mod* (aref cumul i) 10) (aref s i))))\n    #>cumul\n    (let ((res 0))\n      (dotimes (i (+ n 1))\n        (let ((f (mod* (aref cumul i) (aref invs i))))\n          (incf res (aref table f))\n          (incf (aref table f))))\n      (println res))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1817181712114\n\"\n    \"3\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"14282668646\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2119\n\"\n    \"0\n\")))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5491, "cpu_time_ms": 36, "memory_kb": 29360}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s317549898", "group_id": "codeNet:p02705", "input_text": "(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n;;(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defvar *radius* (read))\n\n(format t \"~,6F\" (* 2 pi *radius*))\n", "language": "Lisp", "metadata": {"date": 1590414711, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s317549898.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s317549898", "user_id": "u203134021"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n;;(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defvar *radius* (read))\n\n(format t \"~,6F\" (* 2 pi *radius*))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 236, "cpu_time_ms": 14, "memory_kb": 23760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s269072450", "group_id": "codeNet:p02705", "input_text": "(format t \"~,100F\" (coerce (* pi (read) 2) 'double-float))", "language": "Lisp", "metadata": {"date": 1588059107, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s269072450.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s269072450", "user_id": "u610490393"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(format t \"~,100F\" (coerce (* pi (read) 2) 'double-float))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 58, "cpu_time_ms": 16, "memory_kb": 23364}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s350427863", "group_id": "codeNet:p02705", "input_text": "(princ (* 2 (read) 3.14))", "language": "Lisp", "metadata": {"date": 1587525326, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s350427863.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s350427863", "user_id": "u631655863"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(princ (* 2 (read) 3.14))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 25, "cpu_time_ms": 17, "memory_kb": 24128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s089004333", "group_id": "codeNet:p02705", "input_text": "(princ (coerce (float (* x pi 2)) 'single-float)) ", "language": "Lisp", "metadata": {"date": 1587525095, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s089004333.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s089004333", "user_id": "u631655863"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(princ (coerce (float (* x pi 2)) 'single-float)) ", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 50, "cpu_time_ms": 89, "memory_kb": 26492}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s300062446", "group_id": "codeNet:p02705", "input_text": "(format t \"~A~%\" (* (read) pi 2))", "language": "Lisp", "metadata": {"date": 1587438326, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s300062446.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s300062446", "user_id": "u631655863"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(format t \"~A~%\" (* (read) pi 2))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 33, "cpu_time_ms": 16, "memory_kb": 24148}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s936510544", "group_id": "codeNet:p02705", "input_text": "(format t \"~f~%\" (* 2 pi (read)))", "language": "Lisp", "metadata": {"date": 1587348083, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s936510544.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s936510544", "user_id": "u320993798"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(format t \"~f~%\" (* 2 pi (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 33, "cpu_time_ms": 15, "memory_kb": 23376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s934083936", "group_id": "codeNet:p02705", "input_text": "(princ (* (read) 6.282))", "language": "Lisp", "metadata": {"date": 1587347782, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s934083936.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s934083936", "user_id": "u466161487"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(princ (* (read) 6.282))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 24, "cpu_time_ms": 14, "memory_kb": 24144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s686062060", "group_id": "codeNet:p02705", "input_text": "scale=0\nprint 6.282*read()\n", "language": "Lisp", "metadata": {"date": 1587346809, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s686062060.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s686062060", "user_id": "u466161487"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "scale=0\nprint 6.282*read()\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 27, "cpu_time_ms": 33, "memory_kb": 26496}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s682646031", "group_id": "codeNet:p02705", "input_text": "(let ((*read-default-float-format* 'double-float))\n  (let ((r (read)))\n    (format t \"~a~%\" (* 2 pi r))))\n", "language": "Lisp", "metadata": {"date": 1587346792, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s682646031.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s682646031", "user_id": "u690263481"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(let ((*read-default-float-format* 'double-float))\n  (let ((r (read)))\n    (format t \"~a~%\" (* 2 pi r))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 106, "cpu_time_ms": 11, "memory_kb": 24432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s375478174", "group_id": "codeNet:p02705", "input_text": "(defun main ()\n  (let ((r (read)))\n    (format t \"~f~%\" (* 2 pi r))))\n(main)\n", "language": "Lisp", "metadata": {"date": 1587346469, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s375478174.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s375478174", "user_id": "u091381267"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(defun main ()\n  (let ((r (read)))\n    (format t \"~f~%\" (* 2 pi r))))\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 77, "cpu_time_ms": 16, "memory_kb": 23536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s063271226", "group_id": "codeNet:p02705", "input_text": "(format t \"~A~%\" (* 3.141592653589793 2 (read)))\n", "language": "Lisp", "metadata": {"date": 1587346457, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s063271226.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s063271226", "user_id": "u607637432"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(format t \"~A~%\" (* 3.141592653589793 2 (read)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 49, "cpu_time_ms": 14, "memory_kb": 24140}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s128811413", "group_id": "codeNet:p02705", "input_text": "(princ (* (read)  6.28318530717958623200))", "language": "Lisp", "metadata": {"date": 1587345569, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s128811413.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s128811413", "user_id": "u046178504"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(princ (* (read)  6.28318530717958623200))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 42, "cpu_time_ms": 15, "memory_kb": 24124}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s373844173", "group_id": "codeNet:p02705", "input_text": "(princ (* (read)  6.2830))", "language": "Lisp", "metadata": {"date": 1587345333, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s373844173.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s373844173", "user_id": "u046178504"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(princ (* (read)  6.2830))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 26, "cpu_time_ms": 15, "memory_kb": 24152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s385269829", "group_id": "codeNet:p02705", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((r (read)))\n    (println (* 2 pi r))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1\n\"\n    \"6.28318530717958623200\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"73\n\"\n    \"458.67252742410977361942\n\")))\n", "language": "Lisp", "metadata": {"date": 1587345242, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s385269829.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s385269829", "user_id": "u352600849"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((r (read)))\n    (println (* 2 pi r))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1\n\"\n    \"6.28318530717958623200\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"73\n\"\n    \"458.67252742410977361942\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3558, "cpu_time_ms": 16, "memory_kb": 24876}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s121553751", "group_id": "codeNet:p02705", "input_text": "(let ((r (read)))\n  (format t \"~F~%\" (* 2 r pi)))\n", "language": "Lisp", "metadata": {"date": 1587345129, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s121553751.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s121553751", "user_id": "u608227593"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(let ((r (read)))\n  (format t \"~F~%\" (* 2 r pi)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 50, "cpu_time_ms": 16, "memory_kb": 23356}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s613580996", "group_id": "codeNet:p02705", "input_text": "(format t \"~a~%\"\n\t(let ((r (read)))\n\t  (* 2 pi r)))", "language": "Lisp", "metadata": {"date": 1587345064, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s613580996.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s613580996", "user_id": "u320993798"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(format t \"~a~%\"\n\t(let ((r (read)))\n\t  (* 2 pi r)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 51, "cpu_time_ms": 14, "memory_kb": 24212}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s435491282", "group_id": "codeNet:p02705", "input_text": "(defun main ()\n  (let ((r (read)))\n    (format t \"~f~%\" (* 2 pi r))))\n(main)\n", "language": "Lisp", "metadata": {"date": 1587345063, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s435491282.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s435491282", "user_id": "u091381267"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(defun main ()\n  (let ((r (read)))\n    (format t \"~f~%\" (* 2 pi r))))\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 77, "cpu_time_ms": 16, "memory_kb": 23616}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s844899631", "group_id": "codeNet:p02705", "input_text": "(let ((N (read)))\n     (princ (* N 2 3.1415926535)))", "language": "Lisp", "metadata": {"date": 1587344883, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s844899631.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s844899631", "user_id": "u334552723"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(let ((N (read)))\n     (princ (* N 2 3.1415926535)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 52, "cpu_time_ms": 14, "memory_kb": 24136}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s635686249", "group_id": "codeNet:p02705", "input_text": "(princ (* (read)  pi 2))", "language": "Lisp", "metadata": {"date": 1587344843, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s635686249.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s635686249", "user_id": "u046178504"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(princ (* (read)  pi 2))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 24, "cpu_time_ms": 16, "memory_kb": 24356}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s796736977", "group_id": "codeNet:p02705", "input_text": "(let ((r (read)))\n(format t \"~A\" (* 2 r pi)))", "language": "Lisp", "metadata": {"date": 1587344690, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s796736977.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s796736977", "user_id": "u425317134"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(let ((r (read)))\n(format t \"~A\" (* 2 r pi)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 45, "cpu_time_ms": 15, "memory_kb": 24212}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s547061219", "group_id": "codeNet:p02705", "input_text": "(let ((r (read)))\n   (format t \"~a~%\" (* 2 pi r)))", "language": "Lisp", "metadata": {"date": 1587344674, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s547061219.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s547061219", "user_id": "u690263481"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(let ((r (read)))\n   (format t \"~a~%\" (* 2 pi r)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 50, "cpu_time_ms": 14, "memory_kb": 24208}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s584788824", "group_id": "codeNet:p02705", "input_text": "(let ((N (read)))\n     (princ (* N 2 3.1415926535)))", "language": "Lisp", "metadata": {"date": 1587344669, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Lisp/s584788824.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s584788824", "user_id": "u334552723"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "(let ((N (read)))\n     (princ (* N 2 3.1415926535)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 52, "cpu_time_ms": 14, "memory_kb": 24140}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s954455972", "group_id": "codeNet:p02711", "input_text": "(princ \n  (if (equal (find #\\7 (read-line) :test #'equal) #\\7) \n      \"Yes\" \n      \"No\"))\n", "language": "Lisp", "metadata": {"date": 1593386318, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lisp/s954455972.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s954455972", "user_id": "u526532903"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(princ \n  (if (equal (find #\\7 (read-line) :test #'equal) #\\7) \n      \"Yes\" \n      \"No\"))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 90, "cpu_time_ms": 18, "memory_kb": 24252}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s947367888", "group_id": "codeNet:p02711", "input_text": "(defun app ()\n    (let ((n (read-line))\n        (ans \"No\"))\n\n        (if (or (equal \"7\" (subseq n 0 1)) (equal \"7\" (subseq n 1 2)) (equal \"7\" (subseq n 2 3)))\n        (setq ans \"Yes\"))\n\n    (format t \"~A~%\" ans)\n    )\n)\n\n(app)", "language": "Lisp", "metadata": {"date": 1592592877, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lisp/s947367888.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s947367888", "user_id": "u136500538"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun app ()\n    (let ((n (read-line))\n        (ans \"No\"))\n\n        (if (or (equal \"7\" (subseq n 0 1)) (equal \"7\" (subseq n 1 2)) (equal \"7\" (subseq n 2 3)))\n        (setq ans \"Yes\"))\n\n    (format t \"~A~%\" ans)\n    )\n)\n\n(app)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 226, "cpu_time_ms": 19, "memory_kb": 23528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s082461608", "group_id": "codeNet:p02711", "input_text": "(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n;;(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(format t \"~:[No~;Yes~]\" (loop for i fixnum = (read) then (floor i 10)\n\t\t\t      for r fixnum = (mod i 10)\n\t\t\t      while (/= i 0)\n\t\t\t      when (= r 7) do (return t)\n\t\t\t      finally (return nil)))\n", "language": "Lisp", "metadata": {"date": 1590523479, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lisp/s082461608.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s082461608", "user_id": "u203134021"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n;;(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(format t \"~:[No~;Yes~]\" (loop for i fixnum = (read) then (floor i 10)\n\t\t\t      for r fixnum = (mod i 10)\n\t\t\t      while (/= i 0)\n\t\t\t      when (= r 7) do (return t)\n\t\t\t      finally (return nil)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 372, "cpu_time_ms": 15, "memory_kb": 23744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s297340571", "group_id": "codeNet:p02711", "input_text": "(princ (if (find #\\7 (coerce (read-line) 'list)) \"Yes\" \"No\"))", "language": "Lisp", "metadata": {"date": 1588732702, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lisp/s297340571.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s297340571", "user_id": "u631655863"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(princ (if (find #\\7 (coerce (read-line) 'list)) \"Yes\" \"No\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 61, "cpu_time_ms": 16, "memory_kb": 24172}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s892914116", "group_id": "codeNet:p02711", "input_text": "(defun has777p (str)\n (< 0 (loop :as c :across str\n               :as c7 :across \"777\"\n        :when (eq c7 c)\n        :count 1)))\n\n(let ((str (read-line)))\n  (princ (if (has777p str)\n             \"Yes\"\n             \"No\")))", "language": "Lisp", "metadata": {"date": 1587091029, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lisp/s892914116.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s892914116", "user_id": "u606976120"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun has777p (str)\n (< 0 (loop :as c :across str\n               :as c7 :across \"777\"\n        :when (eq c7 c)\n        :count 1)))\n\n(let ((str (read-line)))\n  (princ (if (has777p str)\n             \"Yes\"\n             \"No\")))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 223, "cpu_time_ms": 14, "memory_kb": 24500}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s790114031", "group_id": "codeNet:p02711", "input_text": "(defun main ()\n  (let* ((n (read-line)))\n    (if (zerop (loop for c across n count (equal c #\\7)))\n      (format t \"~a~%\" \"No\")\n      (format t \"~a~%\" \"Yes\"))))\n(main)", "language": "Lisp", "metadata": {"date": 1586740317, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lisp/s790114031.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s790114031", "user_id": "u652695471"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read-line)))\n    (if (zerop (loop for c across n count (equal c #\\7)))\n      (format t \"~a~%\" \"No\")\n      (format t \"~a~%\" \"Yes\"))))\n(main)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 167, "cpu_time_ms": 16, "memory_kb": 23580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s638841470", "group_id": "codeNet:p02711", "input_text": "(defun lucky-7 (s)\n  (let ((counter 0))\n    (loop :for c :across s\n          :do (if (string= c \"7\") (incf counter)))\n    (if (> counter 0)\n        (princ \"Yes\")\n        (princ \"No\"))))\n\n(lucky-7 (read-line))", "language": "Lisp", "metadata": {"date": 1586740155, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lisp/s638841470.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s638841470", "user_id": "u046178504"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun lucky-7 (s)\n  (let ((counter 0))\n    (loop :for c :across s\n          :do (if (string= c \"7\") (incf counter)))\n    (if (> counter 0)\n        (princ \"Yes\")\n        (princ \"No\"))))\n\n(lucky-7 (read-line))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 208, "cpu_time_ms": 14, "memory_kb": 23612}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s178401745", "group_id": "codeNet:p02711", "input_text": "(if (some (lambda (x) (char= x #\\7)) (concatenate 'list (read-line)))\n    (princ \"Yes\")\n    (princ \"No\"))", "language": "Lisp", "metadata": {"date": 1586739812, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lisp/s178401745.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s178401745", "user_id": "u610490393"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(if (some (lambda (x) (char= x #\\7)) (concatenate 'list (read-line)))\n    (princ \"Yes\")\n    (princ \"No\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 105, "cpu_time_ms": 14, "memory_kb": 24392}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s520189736", "group_id": "codeNet:p02711", "input_text": "(let ((n (read-line)))\n  (format t \"~a~%\" (if (some #'(lambda (x) (char= x #\\7)) n)\n                       \"Yes\"\n                       \"No\")))\n", "language": "Lisp", "metadata": {"date": 1586739750, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lisp/s520189736.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s520189736", "user_id": "u690263481"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(let ((n (read-line)))\n  (format t \"~a~%\" (if (some #'(lambda (x) (char= x #\\7)) n)\n                       \"Yes\"\n                       \"No\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 144, "cpu_time_ms": 15, "memory_kb": 23612}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s979560469", "group_id": "codeNet:p02711", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read-line)))\n    (write-line (if (or (char= #\\7 (aref n 0))\n                        (char= #\\7 (aref n 1))\n                        (char= #\\7 (aref n 2)))\n                    \"Yes\"\n                    \"No\"))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"117\n\"\n    \"Yes\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"123\n\"\n    \"No\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"777\n\"\n    \"Yes\n\")))\n", "language": "Lisp", "metadata": {"date": 1586739654, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Lisp/s979560469.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s979560469", "user_id": "u352600849"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read-line)))\n    (write-line (if (or (char= #\\7 (aref n 0))\n                        (char= #\\7 (aref n 1))\n                        (char= #\\7 (aref n 2)))\n                    \"Yes\"\n                    \"No\"))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"117\n\"\n    \"Yes\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"123\n\"\n    \"No\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"777\n\"\n    \"Yes\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3825, "cpu_time_ms": 14, "memory_kb": 24004}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s305734950", "group_id": "codeNet:p02713", "input_text": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(declaim (type (integer 1 200) *k*))\n(defvar *k* (read))\n\n;; gcd(a,b,c) = gcd(gcd(a,b),c)\n\n(princ (loop for a from 1 to *k* summing\n\t     (loop for b from 1 to *k*\n\t\t   for z = (gcd a b) summing\n\t\t   (loop for c from 1 to *k* summing\n\t\t\t (gcd z c) fixnum) fixnum) fixnum))\n", "language": "Lisp", "metadata": {"date": 1590524605, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lisp/s305734950.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s305734950", "user_id": "u203134021"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(declaim (type (integer 1 200) *k*))\n(defvar *k* (read))\n\n;; gcd(a,b,c) = gcd(gcd(a,b),c)\n\n(princ (loop for a from 1 to *k* summing\n\t     (loop for b from 1 to *k*\n\t\t   for z = (gcd a b) summing\n\t\t   (loop for c from 1 to *k* summing\n\t\t\t (gcd z c) fixnum) fixnum) fixnum))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 447, "cpu_time_ms": 189, "memory_kb": 24624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s346636226", "group_id": "codeNet:p02713", "input_text": "(defun main ()\n  (let ((n (read)))\n    (princ (loop :as i :below n\n                 :sum  (loop :as j :below n\n                           :sum (loop :as k :below n\n                                     :sum (gcd (+ i 1)\n                                               (+ j 1)\n                                               (+ k 1))))))))\n(main)\n", "language": "Lisp", "metadata": {"date": 1588793623, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lisp/s346636226.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s346636226", "user_id": "u606976120"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(defun main ()\n  (let ((n (read)))\n    (princ (loop :as i :below n\n                 :sum  (loop :as j :below n\n                           :sum (loop :as k :below n\n                                     :sum (gcd (+ i 1)\n                                               (+ j 1)\n                                               (+ k 1))))))))\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 343, "cpu_time_ms": 594, "memory_kb": 24400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s271018506", "group_id": "codeNet:p02713", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((k (read))\n         (res 0)\n         (table (make-array 65536 :element-type 'uint8)))\n    (declare (uint31 k res))\n    (loop for x from 1 to k\n          do (loop for y from 1 to k\n                   do (setf (aref table (+ (ash x 8) y)) (gcd x y))))\n    (loop for a from 1 to 200\n          do (loop for b from 1 to 200\n                   for gcd<<8 = (ash (aref table (+ (ash a 8) b)) 8)\n                   do (loop for c from (+ gcd<<8 1) to (+ gcd<<8 191) by 10\n                            do (incf res (aref table c))\n                               (incf res (aref table (+ c 1)))\n                               (incf res (aref table (+ c 2)))\n                               (incf res (aref table (+ c 3)))\n                               (incf res (aref table (+ c 4)))\n                               (incf res (aref table (+ c 5)))\n                               (incf res (aref table (+ c 6)))\n                               (incf res (aref table (+ c 7)))\n                               (incf res (aref table (+ c 8)))\n                               (incf res (aref table (+ c 9))))))\n    (println res)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\n\"\n    \"9\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"200\n\"\n    \"10813692\n\")))\n", "language": "Lisp", "metadata": {"date": 1586914628, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lisp/s271018506.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s271018506", "user_id": "u352600849"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((k (read))\n         (res 0)\n         (table (make-array 65536 :element-type 'uint8)))\n    (declare (uint31 k res))\n    (loop for x from 1 to k\n          do (loop for y from 1 to k\n                   do (setf (aref table (+ (ash x 8) y)) (gcd x y))))\n    (loop for a from 1 to 200\n          do (loop for b from 1 to 200\n                   for gcd<<8 = (ash (aref table (+ (ash a 8) b)) 8)\n                   do (loop for c from (+ gcd<<8 1) to (+ gcd<<8 191) by 10\n                            do (incf res (aref table c))\n                               (incf res (aref table (+ c 1)))\n                               (incf res (aref table (+ c 2)))\n                               (incf res (aref table (+ c 3)))\n                               (incf res (aref table (+ c 4)))\n                               (incf res (aref table (+ c 5)))\n                               (incf res (aref table (+ c 6)))\n                               (incf res (aref table (+ c 7)))\n                               (incf res (aref table (+ c 8)))\n                               (incf res (aref table (+ c 9))))))\n    (println res)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\n\"\n    \"9\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"200\n\"\n    \"10813692\n\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4670, "cpu_time_ms": 20, "memory_kb": 24888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s741010718", "group_id": "codeNet:p02713", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((k (read))\n         (res 0)\n         (table (make-array '65536 :element-type 'uint8)))\n    (declare (uint31 k res))\n    (loop for x from 1 to 200\n          do (loop for y from 1 to 200\n                   do (setf (aref table (+ (ash x 8) y)) (gcd x y))))\n    (loop for a from 1 to k\n          do (loop for b from 1 to k\n                   for gcd<<8 = (ash (aref table (+ (ash a 8) b)) 8)\n                   do (loop for c from 1 to k\n                            do (incf res (aref table (+ gcd<<8 c))))))\n    (println res)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\n\"\n    \"9\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"200\n\"\n    \"10813692\n\")))\n", "language": "Lisp", "metadata": {"date": 1586914218, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lisp/s741010718.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s741010718", "user_id": "u352600849"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((k (read))\n         (res 0)\n         (table (make-array '65536 :element-type 'uint8)))\n    (declare (uint31 k res))\n    (loop for x from 1 to 200\n          do (loop for y from 1 to 200\n                   do (setf (aref table (+ (ash x 8) y)) (gcd x y))))\n    (loop for a from 1 to k\n          do (loop for b from 1 to k\n                   for gcd<<8 = (ash (aref table (+ (ash a 8) b)) 8)\n                   do (loop for c from 1 to k\n                            do (incf res (aref table (+ gcd<<8 c))))))\n    (println res)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\n\"\n    \"9\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"200\n\"\n    \"10813692\n\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4085, "cpu_time_ms": 22, "memory_kb": 24908}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s796956552", "group_id": "codeNet:p02713", "input_text": "(defun Sum-of-gcd-of-Tuples (n)\n    (let ((ans 0))\n        (progn  \n            (loop\n                :for i :from 1 :to n\n                :do (loop\n                        :for j :from 1 :to n\n                        :do (loop\n                                :for k :from 1 :to n\n                                :do (incf ans (gcd (gcd i j) (gcd i k))))))\n            ans)))\n\n(princ (Sum-of-gcd-of-Tuples (read)))", "language": "Lisp", "metadata": {"date": 1586744725, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lisp/s796956552.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s796956552", "user_id": "u046178504"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(defun Sum-of-gcd-of-Tuples (n)\n    (let ((ans 0))\n        (progn  \n            (loop\n                :for i :from 1 :to n\n                :do (loop\n                        :for j :from 1 :to n\n                        :do (loop\n                                :for k :from 1 :to n\n                                :do (incf ans (gcd (gcd i j) (gcd i k))))))\n            ans)))\n\n(princ (Sum-of-gcd-of-Tuples (read)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 414, "cpu_time_ms": 688, "memory_kb": 24384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s415230486", "group_id": "codeNet:p02713", "input_text": "(defun main ()\n  (let* ((k (read)))\n    (format t \"~A~%\"\n\t    (loop for a from 1 to k sum\n\t\t  (loop for b from 1 to k sum\n\t\t\t(loop for c from 1 to k sum\n\t\t\t      (gcd a b c)))))))\n(main)", "language": "Lisp", "metadata": {"date": 1586743076, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lisp/s415230486.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s415230486", "user_id": "u652695471"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(defun main ()\n  (let* ((k (read)))\n    (format t \"~A~%\"\n\t    (loop for a from 1 to k sum\n\t\t  (loop for b from 1 to k sum\n\t\t\t(loop for c from 1 to k sum\n\t\t\t      (gcd a b c)))))))\n(main)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 186, "cpu_time_ms": 565, "memory_kb": 24392}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s728393787", "group_id": "codeNet:p02713", "input_text": "\n(defvar K (read))\n\n(loop for a from 1 to K with s = 0 do\n  (loop for b from 1 to K do\n    (loop for c from 1 to K do\n      (incf s (gcd a b c))\n      ))\n  finally (princ s))", "language": "Lisp", "metadata": {"date": 1586741439, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lisp/s728393787.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s728393787", "user_id": "u334552723"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "\n(defvar K (read))\n\n(loop for a from 1 to K with s = 0 do\n  (loop for b from 1 to K do\n    (loop for c from 1 to K do\n      (incf s (gcd a b c))\n      ))\n  finally (princ s))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 565, "memory_kb": 24540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s104451676", "group_id": "codeNet:p02713", "input_text": "(defvar K (read))\n\n(loop for a from 1 to K with s\n  (loop for b from 1 to K\n    (loop for c from 1 to K\n      (incf s (gcd a b c))\n      ))\n  finally (princ s))", "language": "Lisp", "metadata": {"date": 1586740297, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lisp/s104451676.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s104451676", "user_id": "u334552723"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(defvar K (read))\n\n(loop for a from 1 to K with s\n  (loop for b from 1 to K\n    (loop for c from 1 to K\n      (incf s (gcd a b c))\n      ))\n  finally (princ s))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 160, "cpu_time_ms": 59, "memory_kb": 26724}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s378980413", "group_id": "codeNet:p02713", "input_text": "(let ((k (read)))\n  (format t \"~a~%\"\n          (loop for a from 1 to k\n                summing (loop for b from 1 to k\n                              for gcd-ab = (gcd a b)\n                              summing (loop for c from 1 to k\n                                            summing (gcd gcd-ab c))))))\n", "language": "Lisp", "metadata": {"date": 1586740184, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lisp/s378980413.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s378980413", "user_id": "u690263481"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(let ((k (read)))\n  (format t \"~a~%\"\n          (loop for a from 1 to k\n                summing (loop for b from 1 to k\n                              for gcd-ab = (gcd a b)\n                              summing (loop for c from 1 to k\n                                            summing (gcd gcd-ab c))))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 306, "cpu_time_ms": 306, "memory_kb": 24388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s648375103", "group_id": "codeNet:p02713", "input_text": "(let* ((n (read)))\n  (princ (loop :for a :from 1 :upto n\n               :sum(loop :for b :from 1 :upto n\n                         :sum(loop :for c :from 1 :upto n\n                                   :sum(gcd a b c))))))", "language": "Lisp", "metadata": {"date": 1586739985, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lisp/s648375103.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s648375103", "user_id": "u610490393"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(let* ((n (read)))\n  (princ (loop :for a :from 1 :upto n\n               :sum(loop :for b :from 1 :upto n\n                         :sum(loop :for c :from 1 :upto n\n                                   :sum(gcd a b c))))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 218, "cpu_time_ms": 562, "memory_kb": 24516}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s116765605", "group_id": "codeNet:p02713", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((k (read))\n         (res 0))\n    (declare (uint31 k))\n    (loop for a from 1 to k\n          do (loop for b from 1 to k\n                   do (loop for c from 1 to k\n                            do (incf res (gcd a b c)))))\n    (println res)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\n\"\n    \"9\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"200\n\"\n    \"10813692\n\")))\n", "language": "Lisp", "metadata": {"date": 1586739886, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Lisp/s116765605.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s116765605", "user_id": "u352600849"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((k (read))\n         (res 0))\n    (declare (uint31 k))\n    (loop for a from 1 to k\n          do (loop for b from 1 to k\n                   do (loop for c from 1 to k\n                            do (incf res (gcd a b c)))))\n    (println res)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\n\"\n    \"9\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"200\n\"\n    \"10813692\n\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3783, "cpu_time_ms": 480, "memory_kb": 24844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s576960423", "group_id": "codeNet:p02714", "input_text": "#+swank (declaim (optimize (speed 0) (safety 3) (debug 3)))\n#-swank (declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defconstant +mod+ 1000000007)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))) body...)\n\n\n(defmethod fast-sort ((sequence list) &key (test #'<))\n  (declare (inline sort)\n           (inline sb-impl::stable-sort-list))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n\n(defmethod fast-sort ((sequence array) &key (test #'<))\n  (declare (inline sort))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n\n(defmacro read-numbers-to-array (size)\n  `(progn\n     (when (not (integerp ,size))\n       (error \"Size must be integer.\"))\n     (when (< ,size 0)\n       (error \"Size must be plus or zero.\"))\n     (make-array ,size :initial-contents (read-numbers-to-list ,size))))\n\n(defmacro read-numbers-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size))))\n       (dotimes (,r ,row-size)\n         (dotimes (,c ,column-size)\n           (setf (aref ,board ,r ,c) (read))))\n       ,board)))\n\n\n(defun princ-for-each-line (list)\n  (format t \"~{~a~&~}\" list))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n;;; Write code here\n\n(defun solve (n s)\n  (declare (fixnum n)\n           (string s))\n  (the fixnum\n       (let ((ans (*\n                   (count #\\R s :test #'char-equal)\n                   (count #\\G s :test #'char-equal)\n                   (count #\\B s :test #'char-equal)\n                   )))\n         (declare (fixnum ans))\n         (loop for i from 0 below (- n 2) do\n              (loop for j from (1+ i) below (- n 1) do\n                   (let ((k (- (* j 2)\n                               i\n                               )))\n                     (unless (or\n                              (>= k n)\n                              (char-equal (elt s k)\n                                          (elt s i))\n                              (char-equal (elt s k)\n                                          (elt s j))\n                              (char-equal (elt s i)\n                                          (elt s j)))\n                       (decf ans))))\n            finally\n              (return ans)))))\n\n\n(defun main ()\n  (let ((n (read))\n        (s (read-line)))\n    (declare (fixnum n))\n    (format t \"~a~&\" (solve n s))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1599195801, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s576960423.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s576960423", "user_id": "u425762225"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#+swank (declaim (optimize (speed 0) (safety 3) (debug 3)))\n#-swank (declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defconstant +mod+ 1000000007)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))) body...)\n\n\n(defmethod fast-sort ((sequence list) &key (test #'<))\n  (declare (inline sort)\n           (inline sb-impl::stable-sort-list))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n\n(defmethod fast-sort ((sequence array) &key (test #'<))\n  (declare (inline sort))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n\n(defmacro read-numbers-to-array (size)\n  `(progn\n     (when (not (integerp ,size))\n       (error \"Size must be integer.\"))\n     (when (< ,size 0)\n       (error \"Size must be plus or zero.\"))\n     (make-array ,size :initial-contents (read-numbers-to-list ,size))))\n\n(defmacro read-numbers-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size))))\n       (dotimes (,r ,row-size)\n         (dotimes (,c ,column-size)\n           (setf (aref ,board ,r ,c) (read))))\n       ,board)))\n\n\n(defun princ-for-each-line (list)\n  (format t \"~{~a~&~}\" list))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n;;; Write code here\n\n(defun solve (n s)\n  (declare (fixnum n)\n           (string s))\n  (the fixnum\n       (let ((ans (*\n                   (count #\\R s :test #'char-equal)\n                   (count #\\G s :test #'char-equal)\n                   (count #\\B s :test #'char-equal)\n                   )))\n         (declare (fixnum ans))\n         (loop for i from 0 below (- n 2) do\n              (loop for j from (1+ i) below (- n 1) do\n                   (let ((k (- (* j 2)\n                               i\n                               )))\n                     (unless (or\n                              (>= k n)\n                              (char-equal (elt s k)\n                                          (elt s i))\n                              (char-equal (elt s k)\n                                          (elt s j))\n                              (char-equal (elt s i)\n                                          (elt s j)))\n                       (decf ans))))\n            finally\n              (return ans)))))\n\n\n(defun main ()\n  (let ((n (read))\n        (s (read-line)))\n    (declare (fixnum n))\n    (format t \"~a~&\" (solve n s))))\n\n#-swank (main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2924, "cpu_time_ms": 190, "memory_kb": 25240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s464340378", "group_id": "codeNet:p02714", "input_text": "#+swank (declaim (optimize (speed 0) (safety 3) (debug 3)))\n#-swank (declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defconstant +mod+ 1000000007)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))) body...)\n\n\n(defmethod fast-sort ((sequence list) &key (test #'<))\n  (declare (inline sort)\n           (inline sb-impl::stable-sort-list))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n\n(defmethod fast-sort ((sequence array) &key (test #'<))\n  (declare (inline sort))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n\n(defmacro read-numbers-to-array (size)\n  `(progn\n     (when (not (integerp ,size))\n       (error \"Size must be integer.\"))\n     (when (< ,size 0)\n       (error \"Size must be plus or zero.\"))\n     (make-array ,size :initial-contents (read-numbers-to-list ,size))))\n\n(defmacro read-numbers-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size))))\n       (dotimes (,r ,row-size)\n         (dotimes (,c ,column-size)\n           (setf (aref ,board ,r ,c) (read))))\n       ,board)))\n\n\n(defun princ-for-each-line (list)\n  (format t \"~{~a~&~}\" list))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n;;; Write code here\n\n(defun solve (n s)\n  (let ((ans 0))\n    (loop for i from 0 below (- n 2) do\n         (loop for j from (1+ i) below (- n 1) do\n              (unless (char-equal (elt s i)\n                                  (elt s j))\n                (loop for k from (1+ j) below n do\n                     (unless (or\n                              (char-equal (elt s j)\n                                          (elt s k))\n                              (char-equal (elt s i)\n                                          (elt s k))\n                              (= (- j i)\n                                 (- k j)))\n                       (incf ans)))))\n       finally\n         (return ans))))\n\n\n(defun main ()\n  (let ((n (read))\n        (s (read-line)))\n    (format t \"~a~&\" (solve n s))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1599193161, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s464340378.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s464340378", "user_id": "u425762225"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#+swank (declaim (optimize (speed 0) (safety 3) (debug 3)))\n#-swank (declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defconstant +mod+ 1000000007)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))) body...)\n\n\n(defmethod fast-sort ((sequence list) &key (test #'<))\n  (declare (inline sort)\n           (inline sb-impl::stable-sort-list))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n\n(defmethod fast-sort ((sequence array) &key (test #'<))\n  (declare (inline sort))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n\n(defmacro read-numbers-to-array (size)\n  `(progn\n     (when (not (integerp ,size))\n       (error \"Size must be integer.\"))\n     (when (< ,size 0)\n       (error \"Size must be plus or zero.\"))\n     (make-array ,size :initial-contents (read-numbers-to-list ,size))))\n\n(defmacro read-numbers-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size))))\n       (dotimes (,r ,row-size)\n         (dotimes (,c ,column-size)\n           (setf (aref ,board ,r ,c) (read))))\n       ,board)))\n\n\n(defun princ-for-each-line (list)\n  (format t \"~{~a~&~}\" list))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n;;; Write code here\n\n(defun solve (n s)\n  (let ((ans 0))\n    (loop for i from 0 below (- n 2) do\n         (loop for j from (1+ i) below (- n 1) do\n              (unless (char-equal (elt s i)\n                                  (elt s j))\n                (loop for k from (1+ j) below n do\n                     (unless (or\n                              (char-equal (elt s j)\n                                          (elt s k))\n                              (char-equal (elt s i)\n                                          (elt s k))\n                              (= (- j i)\n                                 (- k j)))\n                       (incf ans)))))\n       finally\n         (return ans))))\n\n\n(defun main ()\n  (let ((n (read))\n        (s (read-line)))\n    (format t \"~a~&\" (solve n s))))\n\n#-swank (main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2577, "cpu_time_ms": 2206, "memory_kb": 25228}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s998895880", "group_id": "codeNet:p02714", "input_text": "(let ((n (read))\n      (s (read-line))\n      (ans 0))\n  (loop :for a :from 0 :to (1- n)\n        :for x := (char s a)\n        :do (loop :for b :from (1+ a) :to (1- n)\n                  :for y := (char s b)\n                  :do (loop :for c :from (1+ b) :to (1- n)\n                            :for z := (char s c)\n                            :if (and (char/= x y z)\n                                     (/= (- b a) (- c b)))\n                            :do (incf ans))))\n  (format t \"~A~%\" ans))\n", "language": "Lisp", "metadata": {"date": 1594257571, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s998895880.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s998895880", "user_id": "u608227593"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(let ((n (read))\n      (s (read-line))\n      (ans 0))\n  (loop :for a :from 0 :to (1- n)\n        :for x := (char s a)\n        :do (loop :for b :from (1+ a) :to (1- n)\n                  :for y := (char s b)\n                  :do (loop :for c :from (1+ b) :to (1- n)\n                            :for z := (char s c)\n                            :if (and (char/= x y z)\n                                     (/= (- b a) (- c b)))\n                            :do (incf ans))))\n  (format t \"~A~%\" ans))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 495, "cpu_time_ms": 2206, "memory_kb": 24572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s550073179", "group_id": "codeNet:p02714", "input_text": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(declaim (type (integer 1 4000) *str-len*))\n(defvar *str-len* (read))\n\n(declaim (type simple-string *str*))\n(defvar *str* (coerce (read-line) 'simple-string))\n\n;; t_i = s[0..i]\n;; cnt(t_n) = cnt(t_(n-1)) +\n\n(declaim (type (simple-array fixnum (*)) *table*))\n(defvar *table* (make-array (1+ *str-len*)\n\t\t\t    :element-type 'fixnum))\n(setf (aref *table* 0) 0)\n(setf (aref *table* 1) 0)\n\n(loop for i of-type (integer 1 4000) from 2 to (1- *str-len*) do\n      ;; calculate (aref *table i)\n      (let ((sum (aref *table* (1- i))))\n\t(loop for j of-type (integer 0 4000) from (1- i) downto 1 do\n\t      (when (char/= (aref *str* i) (aref *str* j))\n\t\t(incf sum\n\t\t      (count-if #'(lambda (c) (and (char/= (aref *str* j)\n\t\t\t\t\t\t\t   (aref *str* i)\n\t\t\t\t\t\t\t   c)))\n\t\t\t\t*str*\n\t\t\t\t:start 0\n\t\t\t\t:end j))\n\t\t(when (and (>= (+ j j (- i)) 0)\n\t\t\t   (char/= (aref *str* j)\n\t\t\t\t   (aref *str* i)\n\t\t\t\t   (aref *str* (+ j j (- i)))))\n\t\t  (decf sum))))\n\t(setf (aref *table* i) sum)))\n(princ (aref *table* (1- *str-len*)))\n", "language": "Lisp", "metadata": {"date": 1590527193, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s550073179.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s550073179", "user_id": "u203134021"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": ";;(declaim (optimize (speed 0) (safety 3) (debug 3)))\n#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(declaim (type (integer 1 4000) *str-len*))\n(defvar *str-len* (read))\n\n(declaim (type simple-string *str*))\n(defvar *str* (coerce (read-line) 'simple-string))\n\n;; t_i = s[0..i]\n;; cnt(t_n) = cnt(t_(n-1)) +\n\n(declaim (type (simple-array fixnum (*)) *table*))\n(defvar *table* (make-array (1+ *str-len*)\n\t\t\t    :element-type 'fixnum))\n(setf (aref *table* 0) 0)\n(setf (aref *table* 1) 0)\n\n(loop for i of-type (integer 1 4000) from 2 to (1- *str-len*) do\n      ;; calculate (aref *table i)\n      (let ((sum (aref *table* (1- i))))\n\t(loop for j of-type (integer 0 4000) from (1- i) downto 1 do\n\t      (when (char/= (aref *str* i) (aref *str* j))\n\t\t(incf sum\n\t\t      (count-if #'(lambda (c) (and (char/= (aref *str* j)\n\t\t\t\t\t\t\t   (aref *str* i)\n\t\t\t\t\t\t\t   c)))\n\t\t\t\t*str*\n\t\t\t\t:start 0\n\t\t\t\t:end j))\n\t\t(when (and (>= (+ j j (- i)) 0)\n\t\t\t   (char/= (aref *str* j)\n\t\t\t\t   (aref *str* i)\n\t\t\t\t   (aref *str* (+ j j (- i)))))\n\t\t  (decf sum))))\n\t(setf (aref *table* i) sum)))\n(princ (aref *table* (1- *str-len*)))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1170, "cpu_time_ms": 2206, "memory_kb": 36408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s041601704", "group_id": "codeNet:p02714", "input_text": "(defun count-RGB (s c)\n  (let ((counter 0))\n    (loop :for i :across s\n          :do (if (string= i c) (incf counter)))\n    counter))\n\n(defun RGB-Triplets (n s)\n    (let ((ans 0))\n        (incf ans (* (count-RGB s \"R\") (count-RGB s \"G\") (count-RGB s \"B\")))\n        (loop\n            :for i :from 0 :to (- n 3)\n            :do (loop\n                    :for j :from (+ i 2) :to (- n 1) :by 2\n                    :do (cond\n                            ((string= (char s i) (char s j)) ())\n                            ((string= (char s i) (char s (/ (+ i j) 2))) ())\n                            ((string= (char s j) (char s (/ (+ i j) 2))) ())\n                            (t (decf ans)))))\n        ans))\n\n(princ (RGB-Triplets (read) (read-line)))", "language": "Lisp", "metadata": {"date": 1586771620, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s041601704.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s041601704", "user_id": "u046178504"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun count-RGB (s c)\n  (let ((counter 0))\n    (loop :for i :across s\n          :do (if (string= i c) (incf counter)))\n    counter))\n\n(defun RGB-Triplets (n s)\n    (let ((ans 0))\n        (incf ans (* (count-RGB s \"R\") (count-RGB s \"G\") (count-RGB s \"B\")))\n        (loop\n            :for i :from 0 :to (- n 3)\n            :do (loop\n                    :for j :from (+ i 2) :to (- n 1) :by 2\n                    :do (cond\n                            ((string= (char s i) (char s j)) ())\n                            ((string= (char s i) (char s (/ (+ i j) 2))) ())\n                            ((string= (char s j) (char s (/ (+ i j) 2))) ())\n                            (t (decf ans)))))\n        ans))\n\n(princ (RGB-Triplets (read) (read-line)))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 742, "cpu_time_ms": 528, "memory_kb": 77260}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s077758857", "group_id": "codeNet:p02714", "input_text": "(defun count-RGB (s c)\n  (let ((counter 0))\n    (loop :for i :across s\n          :do (if (string= i c) (incf counter)))\n    counter))\n\n(defun RGB-Triplets (n s)\n    (let ((ans 0))\n        (incf ans (* (* (count-RGB s \"R\") (count-RGB s \"G\") (count-RGB s \"B\"))))\n        (loop\n            :for i :from 0 :to (- n 2)\n            :do (loop\n                    :for j :from i :to (- n 1)\n                    :do (cond\n                            ((/= (mod (- j i) 2) 0) ())\n                            ((string= (char s i) (char s j)) ())\n                            ((string= (char s i) (char s (/ (+ i j) 2))) ())\n                            ((string= (char s j) (char s (/ (+ i j) 2))) ())\n                            (t (decf ans)))))\n        ans))\n\n(princ (RGB-Triplets (read) (read-line)))", "language": "Lisp", "metadata": {"date": 1586765201, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s077758857.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s077758857", "user_id": "u046178504"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun count-RGB (s c)\n  (let ((counter 0))\n    (loop :for i :across s\n          :do (if (string= i c) (incf counter)))\n    counter))\n\n(defun RGB-Triplets (n s)\n    (let ((ans 0))\n        (incf ans (* (* (count-RGB s \"R\") (count-RGB s \"G\") (count-RGB s \"B\"))))\n        (loop\n            :for i :from 0 :to (- n 2)\n            :do (loop\n                    :for j :from i :to (- n 1)\n                    :do (cond\n                            ((/= (mod (- j i) 2) 0) ())\n                            ((string= (char s i) (char s j)) ())\n                            ((string= (char s i) (char s (/ (+ i j) 2))) ())\n                            ((string= (char s j) (char s (/ (+ i j) 2))) ())\n                            (t (decf ans)))))\n        ans))\n\n(princ (RGB-Triplets (read) (read-line)))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 790, "cpu_time_ms": 556, "memory_kb": 77256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s327092291", "group_id": "codeNet:p02714", "input_text": "(defun RGB-Triplets (n s)\n    (let ((ans 0))\n        (loop\n            :for i :from 0 :to (- n 1)\n            :do (loop\n                    :for j :from i :to (- n 1)\n                    :do (loop\n                            :for k :from j :to (- n 1)\n                            :do (cond\n                                    ((> i j) ())\n                                    ((> j k) ())\n                                    ((= (- j i) (- k j))())\n                                    ((char= (char s i) (char s j)) ())\n                                    ((string= (char s j) (char s k)) ())\n                                    ((string= (char s k) (char s i)) ())\n                                    (t (incf ans))))))\n        ans))\n\n(princ (RGB-Triplets (read) (read-line)))", "language": "Lisp", "metadata": {"date": 1586763366, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s327092291.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s327092291", "user_id": "u046178504"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun RGB-Triplets (n s)\n    (let ((ans 0))\n        (loop\n            :for i :from 0 :to (- n 1)\n            :do (loop\n                    :for j :from i :to (- n 1)\n                    :do (loop\n                            :for k :from j :to (- n 1)\n                            :do (cond\n                                    ((> i j) ())\n                                    ((> j k) ())\n                                    ((= (- j i) (- k j))())\n                                    ((char= (char s i) (char s j)) ())\n                                    ((string= (char s j) (char s k)) ())\n                                    ((string= (char s k) (char s i)) ())\n                                    (t (incf ans))))))\n        ans))\n\n(princ (RGB-Triplets (read) (read-line)))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 776, "cpu_time_ms": 2207, "memory_kb": 77452}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s734997783", "group_id": "codeNet:p02714", "input_text": "(defun calc (n text)\n  (loop with r = 0\n        with g = 0\n        with b = 0\n        for i below n\n        do (case (schar text i)\n             (#\\R (incf r))\n             (#\\G (incf g))\n             (#\\B (incf b)))\n        finally (return (* r g b))))\n\n(defun minus (n text)\n  (loop with x = 0\n        for i below n\n        do (loop for j from (1+ i) below n\n                 if (< (- (* 2 j) i) \n                       n)\n                 do (if (and (not (equal (schar text i)\n                                         (schar text j)))\n                             (not (equal (schar text j)\n                                         (schar text (- (* 2 j) i))))\n                             (not (equal (schar text i)\n                                         (schar text (- (* 2 j) i)))))\n                        (incf x)))\n        finally (return x)))\n\n(let ((n (read))\n      (text (read-line)))\n     (format t \"~A\" (- (calc n text)\n                       (minus n text))))", "language": "Lisp", "metadata": {"date": 1586747152, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s734997783.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s734997783", "user_id": "u425317134"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun calc (n text)\n  (loop with r = 0\n        with g = 0\n        with b = 0\n        for i below n\n        do (case (schar text i)\n             (#\\R (incf r))\n             (#\\G (incf g))\n             (#\\B (incf b)))\n        finally (return (* r g b))))\n\n(defun minus (n text)\n  (loop with x = 0\n        for i below n\n        do (loop for j from (1+ i) below n\n                 if (< (- (* 2 j) i) \n                       n)\n                 do (if (and (not (equal (schar text i)\n                                         (schar text j)))\n                             (not (equal (schar text j)\n                                         (schar text (- (* 2 j) i))))\n                             (not (equal (schar text i)\n                                         (schar text (- (* 2 j) i)))))\n                        (incf x)))\n        finally (return x)))\n\n(let ((n (read))\n      (text (read-line)))\n     (format t \"~A\" (- (calc n text)\n                       (minus n text))))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 977, "cpu_time_ms": 161, "memory_kb": 24432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s381465063", "group_id": "codeNet:p02714", "input_text": "(defun main ()\n  (let* ((n (read))\n         (s (read-line))\n         (ans 0))\n     (dotimes (i n)\n      (dotimes (j (- n i))\n        (dotimes (k (- n i j))\n          (if (and (/= j  k)  (char/= (aref s i) (aref s (+ i j)) (aref s (+ i j k))))\n              (incf ans)))))\n    (format t \"~d~%\" ans)))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1586745602, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s381465063.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s381465063", "user_id": "u091381267"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (s (read-line))\n         (ans 0))\n     (dotimes (i n)\n      (dotimes (j (- n i))\n        (dotimes (k (- n i j))\n          (if (and (/= j  k)  (char/= (aref s i) (aref s (+ i j)) (aref s (+ i j k))))\n              (incf ans)))))\n    (format t \"~d~%\" ans)))\n\n(main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 308, "cpu_time_ms": 2206, "memory_kb": 24416}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s691110073", "group_id": "codeNet:p02714", "input_text": "(defun RGB-Triplets (n s)\n    (let ((ans 0))\n        (progn  \n            (loop\n                :for i :across s\n                :do (loop\n                        :for j :across s\n                        :do (loop\n                                :for k :across s\n                                :do (cond\n                                        ((> i j) ())\n                                        ((> j k) ())\n                                        ((= (- j i) (- k j))())\n                                        ((string= i j) ())\n                                        ((string= j k) ())\n                                        (t (incf ans))))))\n            ans)))\n\n(princ (RGB-Triplets (read) (read-line)))\n", "language": "Lisp", "metadata": {"date": 1586745595, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s691110073.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s691110073", "user_id": "u046178504"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun RGB-Triplets (n s)\n    (let ((ans 0))\n        (progn  \n            (loop\n                :for i :across s\n                :do (loop\n                        :for j :across s\n                        :do (loop\n                                :for k :across s\n                                :do (cond\n                                        ((> i j) ())\n                                        ((> j k) ())\n                                        ((= (- j i) (- k j))())\n                                        ((string= i j) ())\n                                        ((string= j k) ())\n                                        (t (incf ans))))))\n            ans)))\n\n(princ (RGB-Triplets (read) (read-line)))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 714, "cpu_time_ms": 99, "memory_kb": 26964}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s206235613", "group_id": "codeNet:p02714", "input_text": "(let* ((n (read))\n       (r nil)\n       (g nil)\n       (b nil))\n  (loop :for k :in (concatenate 'list (read-line))\n        :for j :from 1\n        :do(cond ((char= #\\R k) (push j r))\n                 ((char= #\\G k) (push j g))\n                 ((char= #\\B k) (push j b))))\n  (defun f (xx yy zz)\n    (loop :for x :in xx\n          :sum (loop :for y :in yy\n                     :sum (loop :for z :in zz\n                                  :if (and (not (cond ((< x y z) (= (- x y) (- y z)))\n                                                      ((< x z y) (= (- x z) (- z y)))\n                                                      ((< y x z) (= (- y x) (- x z)))\n                                                      ((< y z x) (= (- y z) (- z x)))\n                                                      ((< z x y) (= (- z x) (- x y)))\n                                                      ((< z y x) (= (- z y) (- y x))))))\n                                 :count t))))\n  (print (f r g b)))", "language": "Lisp", "metadata": {"date": 1586745421, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s206235613.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s206235613", "user_id": "u610490393"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(let* ((n (read))\n       (r nil)\n       (g nil)\n       (b nil))\n  (loop :for k :in (concatenate 'list (read-line))\n        :for j :from 1\n        :do(cond ((char= #\\R k) (push j r))\n                 ((char= #\\G k) (push j g))\n                 ((char= #\\B k) (push j b))))\n  (defun f (xx yy zz)\n    (loop :for x :in xx\n          :sum (loop :for y :in yy\n                     :sum (loop :for z :in zz\n                                  :if (and (not (cond ((< x y z) (= (- x y) (- y z)))\n                                                      ((< x z y) (= (- x z) (- z y)))\n                                                      ((< y x z) (= (- y x) (- x z)))\n                                                      ((< y z x) (= (- y z) (- z x)))\n                                                      ((< z x y) (= (- z x) (- x y)))\n                                                      ((< z y x) (= (- z y) (- y x))))))\n                                 :count t))))\n  (print (f r g b)))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 984, "cpu_time_ms": 2206, "memory_kb": 24508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s051333499", "group_id": "codeNet:p02714", "input_text": "(defun search-index (v x)\n  (declare (optimize (speed 3) (debug 0) (safety 0)))\n  (loop for i from 0 below (length v)\n        when (< x (aref v i))\n        do (return i)\n        finally (return (length v))))\n\n(defun solve ()\n  (declare (optimize (speed 3) (debug 0) (safety 0)))\n  (let* ((n (read))\n         (s (read-line))\n         (si (make-array n :element-type 'fixnum))\n         (count 0)\n         r-list g-list b-list)\n    (loop for i from 0 below n\n          for c = (char s i)\n          do (setf (aref si i)\n                   (case c\n                     (#\\R 1)\n                     (#\\G 2)\n                     (#\\B 4)))\n          do (case c\n               (#\\R (push i r-list))\n               (#\\G (push i g-list))\n               (#\\B (push i b-list))))\n    (let ((v (vector (coerce (nreverse r-list) 'vector)\n                     (coerce (nreverse g-list) 'vector)\n                     (coerce (nreverse b-list) 'vector))))\n      (labels ((get-index (c1 c2)\n                 (case (+ c1 c2)\n                   (3 2)\n                   (5 1)\n                   (6 0))))\n      (loop for i from 0 below n\n            do (loop for j from (+ i 1) below n\n                     for k = (+ j (- j i))\n                     when (/= (aref si i) (aref si j))\n                     do (let* ((rgbv (aref v (get-index (aref si i)\n                                                        (aref si j))))\n                               (index (search-index rgbv j)))\n                          (incf count (- (length rgbv) index)))\n                     do (when (and (< k n)\n                                   (/= (aref si i)\n                                       (aref si j)\n                                       (aref si k)))\n                          (decf count))))\n        (format t \"~a~%\" count)))))\n\n(solve)\n", "language": "Lisp", "metadata": {"date": 1586745186, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s051333499.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s051333499", "user_id": "u690263481"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun search-index (v x)\n  (declare (optimize (speed 3) (debug 0) (safety 0)))\n  (loop for i from 0 below (length v)\n        when (< x (aref v i))\n        do (return i)\n        finally (return (length v))))\n\n(defun solve ()\n  (declare (optimize (speed 3) (debug 0) (safety 0)))\n  (let* ((n (read))\n         (s (read-line))\n         (si (make-array n :element-type 'fixnum))\n         (count 0)\n         r-list g-list b-list)\n    (loop for i from 0 below n\n          for c = (char s i)\n          do (setf (aref si i)\n                   (case c\n                     (#\\R 1)\n                     (#\\G 2)\n                     (#\\B 4)))\n          do (case c\n               (#\\R (push i r-list))\n               (#\\G (push i g-list))\n               (#\\B (push i b-list))))\n    (let ((v (vector (coerce (nreverse r-list) 'vector)\n                     (coerce (nreverse g-list) 'vector)\n                     (coerce (nreverse b-list) 'vector))))\n      (labels ((get-index (c1 c2)\n                 (case (+ c1 c2)\n                   (3 2)\n                   (5 1)\n                   (6 0))))\n      (loop for i from 0 below n\n            do (loop for j from (+ i 1) below n\n                     for k = (+ j (- j i))\n                     when (/= (aref si i) (aref si j))\n                     do (let* ((rgbv (aref v (get-index (aref si i)\n                                                        (aref si j))))\n                               (index (search-index rgbv j)))\n                          (incf count (- (length rgbv) index)))\n                     do (when (and (< k n)\n                                   (/= (aref si i)\n                                       (aref si j)\n                                       (aref si k)))\n                          (decf count))))\n        (format t \"~a~%\" count)))))\n\n(solve)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1811, "cpu_time_ms": 2206, "memory_kb": 24500}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s853895119", "group_id": "codeNet:p02714", "input_text": "(defun main ()\n  (let* ((n (read))\n         (s (read-line))\n         (ans 0))\n    (dotimes (i n)\n      (dotimes (j (- n i))\n        (dotimes (k (- n i j))\n          (if (and (char/= (aref s i) (aref s (+ i j)) (aref s (+ i j k))) (/= (- (+ j i) i) (- (+ i j k) (+ j i))))\n              (incf ans)))))\n    (format t \"~d~%\" ans)))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1586743725, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s853895119.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s853895119", "user_id": "u091381267"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (s (read-line))\n         (ans 0))\n    (dotimes (i n)\n      (dotimes (j (- n i))\n        (dotimes (k (- n i j))\n          (if (and (char/= (aref s i) (aref s (+ i j)) (aref s (+ i j k))) (/= (- (+ j i) i) (- (+ i j k) (+ j i))))\n              (incf ans)))))\n    (format t \"~d~%\" ans)))\n\n(main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 337, "cpu_time_ms": 2206, "memory_kb": 24492}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s203149124", "group_id": "codeNet:p02714", "input_text": "(defun main ()\n  (let* ((n (read))\n         (s (read-line))\n         (ans 0))\n    (dotimes (i n)\n      (dotimes (j n)\n        (dotimes (k n)\n          (when (< i j k)\n            (if (and (char/= (aref s i) (aref s j) (aref s k)) (/= (- j i) (- k j)))\n                (incf ans))))))\n    (format t \"~d~%\" ans)))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1586742832, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s203149124.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s203149124", "user_id": "u091381267"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (s (read-line))\n         (ans 0))\n    (dotimes (i n)\n      (dotimes (j n)\n        (dotimes (k n)\n          (when (< i j k)\n            (if (and (char/= (aref s i) (aref s j) (aref s k)) (/= (- j i) (- k j)))\n                (incf ans))))))\n    (format t \"~d~%\" ans)))\n\n(main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 320, "cpu_time_ms": 2206, "memory_kb": 24368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s522207029", "group_id": "codeNet:p02714", "input_text": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(defun parse-data (n text)\n  (loop with x = 0\n        for i from 0 below (- n 2)\n        do (loop for j from (1+ i) below (1- n)\n                 do (loop for k from (1+ j) below n\n                          if (and (not (equal (schar text i)\n                                              (schar text j)))\n                                  (not (equal (schar text i)\n                                              (schar text k)))\n                                  (not (equal (schar text j)\n                                              (schar text k)))\n                                  (not (= (- j i)\n                                          (- k j))))\n                          do (incf x)))\n        finally (format t \"~A\" x)))\n\n(let ((n (read))\n      (data (read-line)))\n     (parse-data n data))", "language": "Lisp", "metadata": {"date": 1586742817, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s522207029.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s522207029", "user_id": "u425317134"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(defun parse-data (n text)\n  (loop with x = 0\n        for i from 0 below (- n 2)\n        do (loop for j from (1+ i) below (1- n)\n                 do (loop for k from (1+ j) below n\n                          if (and (not (equal (schar text i)\n                                              (schar text j)))\n                                  (not (equal (schar text i)\n                                              (schar text k)))\n                                  (not (equal (schar text j)\n                                              (schar text k)))\n                                  (not (= (- j i)\n                                          (- k j))))\n                          do (incf x)))\n        finally (format t \"~A\" x)))\n\n(let ((n (read))\n      (data (read-line)))\n     (parse-data n data))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 853, "cpu_time_ms": 2206, "memory_kb": 24404}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s592069585", "group_id": "codeNet:p02714", "input_text": "(defun solve ()\n  (declare (optimize (speed 3) (debug 0) (safety 0)))\n  (let ((n (read))\n        (s (read-line))\n        (count 0))\n    (declare (type simple-string s))\n    (flet ((check (i j k)\n             (declare (type fixnum i j k))\n             (and (/= (- j i) (- k j))\n                  (char/= (char s i)\n                          (char s j)\n                          (char s k)))))\n      (loop for i fixnum from 0 below n\n            do (loop for j from (+ i 1) below n\n                     when (char/= (char s i) (char s j))\n                     do (loop for k from (+ j 1) below n\n                              when (check i j k)\n                              do (incf count))))\n      (format t \"~a~%\" count))))\n\n(solve)\n", "language": "Lisp", "metadata": {"date": 1586742621, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s592069585.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s592069585", "user_id": "u690263481"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun solve ()\n  (declare (optimize (speed 3) (debug 0) (safety 0)))\n  (let ((n (read))\n        (s (read-line))\n        (count 0))\n    (declare (type simple-string s))\n    (flet ((check (i j k)\n             (declare (type fixnum i j k))\n             (and (/= (- j i) (- k j))\n                  (char/= (char s i)\n                          (char s j)\n                          (char s k)))))\n      (loop for i fixnum from 0 below n\n            do (loop for j from (+ i 1) below n\n                     when (char/= (char s i) (char s j))\n                     do (loop for k from (+ j 1) below n\n                              when (check i j k)\n                              do (incf count))))\n      (format t \"~a~%\" count))))\n\n(solve)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 734, "cpu_time_ms": 2206, "memory_kb": 24396}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s352482395", "group_id": "codeNet:p02714", "input_text": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(defun parse-data (text)\n  (loop with x = 0\n        for i from 0 below (- (length text) 2)\n        do (loop for j from (1+ i) below (1- (length text))\n                 do (loop for k from (1+ j) below (length text)\n                          if (and (not (equal (aref text i)\n                                              (aref text j)))\n                                  (not (equal (aref text i)\n                                              (aref text k)))\n                                  (not (equal (aref text j)\n                                              (aref text k)))\n                                  (not (= (- j i)\n                                          (- k j))))\n                          do (incf x)))\n        finally (format t \"~A\" x)))\n\n(let ((n (read))\n      (data (read-line)))\n     (parse-data data))\n     \n", "language": "Lisp", "metadata": {"date": 1586742444, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s352482395.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s352482395", "user_id": "u425317134"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(defun parse-data (text)\n  (loop with x = 0\n        for i from 0 below (- (length text) 2)\n        do (loop for j from (1+ i) below (1- (length text))\n                 do (loop for k from (1+ j) below (length text)\n                          if (and (not (equal (aref text i)\n                                              (aref text j)))\n                                  (not (equal (aref text i)\n                                              (aref text k)))\n                                  (not (equal (aref text j)\n                                              (aref text k)))\n                                  (not (= (- j i)\n                                          (- k j))))\n                          do (incf x)))\n        finally (format t \"~A\" x)))\n\n(let ((n (read))\n      (data (read-line)))\n     (parse-data data))\n     \n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 886, "cpu_time_ms": 2206, "memory_kb": 24452}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s780400854", "group_id": "codeNet:p02714", "input_text": "(let ((n (read))\n      (s (read-line))\n      (count 0))\n  (flet ((check (i j k)\n           (and (/= (- j i) (- k j))\n                (char/= (char s i)\n                        (char s j)\n                        (char s k)))))\n    (loop for i from 0 below n\n          do (loop for j from (+ i 1) below n\n                   do (loop for k from (+ j 1) below n\n                            when (check i j k)\n                            do (incf count))))\n    (format t \"~a~%\" count)))\n", "language": "Lisp", "metadata": {"date": 1586741248, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s780400854.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s780400854", "user_id": "u690263481"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(let ((n (read))\n      (s (read-line))\n      (count 0))\n  (flet ((check (i j k)\n           (and (/= (- j i) (- k j))\n                (char/= (char s i)\n                        (char s j)\n                        (char s k)))))\n    (loop for i from 0 below n\n          do (loop for j from (+ i 1) below n\n                   do (loop for k from (+ j 1) below n\n                            when (check i j k)\n                            do (incf count))))\n    (format t \"~a~%\" count)))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 482, "cpu_time_ms": 2206, "memory_kb": 24508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s079281656", "group_id": "codeNet:p02714", "input_text": "(defun parse-data (text)\n  (loop with x = 0\n        for i from 0 below (- (length text) 2)\n        do (loop for j from (1+ i) below (1- (length text))\n                 do (loop for k from (1+ j) below (length text)\n                          if (and (not (equal (aref text i)\n                                              (aref text j)))\n                                  (not (equal (aref text i)\n                                              (aref text k)))\n                                  (not (equal (aref text j)\n                                              (aref text k)))\n                                  (not (= (- j i)\n                                          (- k j))))\n                          do (incf x)))\n        finally (format t \"~A\" x)))\n\n(let ((n (read))\n      (data (read-line)))\n     (parse-data data))\n     ", "language": "Lisp", "metadata": {"date": 1586740777, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Lisp/s079281656.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s079281656", "user_id": "u425317134"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun parse-data (text)\n  (loop with x = 0\n        for i from 0 below (- (length text) 2)\n        do (loop for j from (1+ i) below (1- (length text))\n                 do (loop for k from (1+ j) below (length text)\n                          if (and (not (equal (aref text i)\n                                              (aref text j)))\n                                  (not (equal (aref text i)\n                                              (aref text k)))\n                                  (not (equal (aref text j)\n                                              (aref text k)))\n                                  (not (= (- j i)\n                                          (- k j))))\n                          do (incf x)))\n        finally (format t \"~A\" x)))\n\n(let ((n (read))\n      (data (read-line)))\n     (parse-data data))\n     ", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 833, "cpu_time_ms": 2206, "memory_kb": 24428}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s767567087", "group_id": "codeNet:p02717", "input_text": "(defun app ()\n    (let ((a (read))\n        (b (read))\n        (c (read)))\n    (format t \"~D ~D ~D~%\" c a b)\n    )\n)\n\n(app)", "language": "Lisp", "metadata": {"date": 1592594404, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lisp/s767567087.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s767567087", "user_id": "u136500538"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "(defun app ()\n    (let ((a (read))\n        (b (read))\n        (c (read)))\n    (format t \"~D ~D ~D~%\" c a b)\n    )\n)\n\n(app)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 122, "cpu_time_ms": 17, "memory_kb": 24256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s812865918", "group_id": "codeNet:p02717", "input_text": ";; A - ABC Swap\n\n(let ((x (read))\n      (y (read))\n      (z (read)))\n  (format t \"~{~a~^ ~}~%\" (list z x y)))\n", "language": "Lisp", "metadata": {"date": 1586096265, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lisp/s812865918.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s812865918", "user_id": "u227020436"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": ";; A - ABC Swap\n\n(let ((x (read))\n      (y (read))\n      (z (read)))\n  (format t \"~{~a~^ ~}~%\" (list z x y)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 110, "cpu_time_ms": 62, "memory_kb": 8548}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s568085787", "group_id": "codeNet:p02717", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((x (read))\n         (y (read))\n         (z (read)))\n    (rotatef x y)\n    (rotatef x z)\n    (format t \"~D ~D ~D~%\" x y z)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1 2 3\n\"\n    \"3 1 2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"100 100 100\n\"\n    \"100 100 100\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"41 59 31\n\"\n    \"31 41 59\n\")))\n", "language": "Lisp", "metadata": {"date": 1586064643, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lisp/s568085787.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s568085787", "user_id": "u352600849"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((x (read))\n         (y (read))\n         (z (read)))\n    (rotatef x y)\n    (rotatef x z)\n    (format t \"~D ~D ~D~%\" x y z)))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1 2 3\n\"\n    \"3 1 2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"100 100 100\n\"\n    \"100 100 100\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"41 59 31\n\"\n    \"31 41 59\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3766, "cpu_time_ms": 26, "memory_kb": 6624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s410186814", "group_id": "codeNet:p02717", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (a b c)\n  (format t \"~a ~a ~a~%\" c a b))\n\n(let ((a (read))\n      (b (read))\n      (c (read)))\n  (main a b c))\n", "language": "Lisp", "metadata": {"date": 1586056641, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lisp/s410186814.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s410186814", "user_id": "u493610446"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (a b c)\n  (format t \"~a ~a ~a~%\" c a b))\n\n(let ((a (read))\n      (b (read))\n      (c (read)))\n  (main a b c))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1162, "cpu_time_ms": 155, "memory_kb": 14772}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s074865502", "group_id": "codeNet:p02717", "input_text": "#include <bits/stdc++.h>\nusing namespace std；\n\nint a,b,c;\n\nint main(){\n\tcin>>a>>b>>c;\n\tswap(a,b);\n    swap(a,c);\n\tcout<<a<<' '<<b<<' '<<c;\n\treturn 0;\n} ", "language": "Lisp", "metadata": {"date": 1586049038, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lisp/s074865502.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s074865502", "user_id": "u979473360"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "#include <bits/stdc++.h>\nusing namespace std；\n\nint a,b,c;\n\nint main(){\n\tcin>>a>>b>>c;\n\tswap(a,b);\n    swap(a,c);\n\tcout<<a<<' '<<b<<' '<<c;\n\treturn 0;\n} ", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 154, "cpu_time_ms": 242, "memory_kb": 9700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s416005104", "group_id": "codeNet:p02717", "input_text": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint a,b,c;\n\tcin>>a>>b>>c;\n\tswap(a,b);\n\tswap(a,c);\n\tcout<<a<<' '<<b<<' '<<c;\n\treturn 0;\n} ", "language": "Lisp", "metadata": {"date": 1586048946, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lisp/s416005104.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s416005104", "user_id": "u979473360"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint a,b,c;\n\tcin>>a>>b>>c;\n\tswap(a,b);\n\tswap(a,c);\n\tcout<<a<<' '<<b<<' '<<c;\n\treturn 0;\n} ", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 149, "cpu_time_ms": 268, "memory_kb": 9700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s325572089", "group_id": "codeNet:p02717", "input_text": "(let ((A (read))\n      (B (read))\n      (C (read))\n      )\n  (format t \"~A ~A ~A~%\" C A B ))\n", "language": "Lisp", "metadata": {"date": 1586048653, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lisp/s325572089.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s325572089", "user_id": "u334552723"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "(let ((A (read))\n      (B (read))\n      (C (read))\n      )\n  (format t \"~A ~A ~A~%\" C A B ))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 93, "cpu_time_ms": 323, "memory_kb": 9568}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s232986460", "group_id": "codeNet:p02717", "input_text": "(let ((x (read))\n      (y (read))\n      (z (read)))\n  (format t \"~a ~a ~a~%\" z x y))\n", "language": "Lisp", "metadata": {"date": 1586048507, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lisp/s232986460.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s232986460", "user_id": "u690263481"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "(let ((x (read))\n      (y (read))\n      (z (read)))\n  (format t \"~a ~a ~a~%\" z x y))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 85, "cpu_time_ms": 402, "memory_kb": 9568}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s448931182", "group_id": "codeNet:p02717", "input_text": "(let ((a (read))\n      (b (read))\n      (c (read)))\n     (format t \"~A ~A ~A\" c a b))", "language": "Lisp", "metadata": {"date": 1586048465, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Lisp/s448931182.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s448931182", "user_id": "u425317134"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "(let ((a (read))\n      (b (read))\n      (c (read)))\n     (format t \"~A ~A ~A\" c a b))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 85, "cpu_time_ms": 288, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s522987784", "group_id": "codeNet:p02718", "input_text": "(defun app ()\n    (let* ((n (read))\n        (m (read))\n        (a (make-array n :initial-element 0))\n        (sum 0)\n        (ans \"Yes\"))\n        (dotimes (i n)\n            (setf (aref a i) (read))\n            (incf sum (aref a i))\n        )\n        (sort a '>)\n\n        (dotimes (i m)\n        (if (<= (aref a i) (/ sum (* 4 m)))\n            (setq ans \"No\")\n        )\n        )\n    (format t \"~A~%\" ans)\n    )\n)\n\n(app)", "language": "Lisp", "metadata": {"date": 1592595354, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Lisp/s522987784.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s522987784", "user_id": "u136500538"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun app ()\n    (let* ((n (read))\n        (m (read))\n        (a (make-array n :initial-element 0))\n        (sum 0)\n        (ans \"Yes\"))\n        (dotimes (i n)\n            (setf (aref a i) (read))\n            (incf sum (aref a i))\n        )\n        (sort a '>)\n\n        (dotimes (i m)\n        (if (<= (aref a i) (/ sum (* 4 m)))\n            (setq ans \"No\")\n        )\n        )\n    (format t \"~A~%\" ans)\n    )\n)\n\n(app)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 418, "cpu_time_ms": 21, "memory_kb": 23712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s338431704", "group_id": "codeNet:p02718", "input_text": ";; B - Popular Vote\n\n(defun can-choose (m a)\n  \"総得票数の1/(4*m)以上票を得た商品がm個以上あるか\"\n  (let* ((total (reduce #'+ a))\n         (thres (ceiling total (* 4 m)))\n         (npop  (count-if #'(lambda (x) (>= x thres)) a)))\n    (>= npop m)))\n\n(let* ((n (read))\n       (m (read))\n       (a (loop repeat n collect (read))))\n  (princ (if (can-choose m a) \"Yes\" \"No\")))\n", "language": "Lisp", "metadata": {"date": 1586096884, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Lisp/s338431704.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s338431704", "user_id": "u227020436"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": ";; B - Popular Vote\n\n(defun can-choose (m a)\n  \"総得票数の1/(4*m)以上票を得た商品がm個以上あるか\"\n  (let* ((total (reduce #'+ a))\n         (thres (ceiling total (* 4 m)))\n         (npop  (count-if #'(lambda (x) (>= x thres)) a)))\n    (>= npop m)))\n\n(let* ((n (read))\n       (m (read))\n       (a (loop repeat n collect (read))))\n  (princ (if (can-choose m a) \"Yes\" \"No\")))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 392, "cpu_time_ms": 131, "memory_kb": 15968}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s675530555", "group_id": "codeNet:p02718", "input_text": "(let* ((n (read))\n       (m (read))\n       (as (loop :repeat n :collect (read)))\n       (sum (loop :as i :in as :sum i)))\n    (if (<= m (length (remove-if (lambda (x) (< x (/ sum (* 4 m)))) as)))\n        (princ \"Yes\")\n        (princ \"No\")))\n", "language": "Lisp", "metadata": {"date": 1586049489, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Lisp/s675530555.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s675530555", "user_id": "u606976120"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (as (loop :repeat n :collect (read)))\n       (sum (loop :as i :in as :sum i)))\n    (if (<= m (length (remove-if (lambda (x) (< x (/ sum (* 4 m)))) as)))\n        (princ \"Yes\")\n        (princ \"No\")))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 241, "cpu_time_ms": 235, "memory_kb": 16104}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s234799107", "group_id": "codeNet:p02718", "input_text": "(let* ((n (read))\n       (m (read))\n       (as (loop :repeat n :collect (read)))\n       (sum (loop :as i :in as :sum i)))\n    (if (< m (length (remove-if (lambda (x) (< x (/ sum (* 4 m)))) as)))\n        (princ \"Yes\")\n        (princ \"No\")))", "language": "Lisp", "metadata": {"date": 1586048930, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Lisp/s234799107.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s234799107", "user_id": "u606976120"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (as (loop :repeat n :collect (read)))\n       (sum (loop :as i :in as :sum i)))\n    (if (< m (length (remove-if (lambda (x) (< x (/ sum (* 4 m)))) as)))\n        (princ \"Yes\")\n        (princ \"No\")))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 239, "cpu_time_ms": 366, "memory_kb": 13920}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s498273188", "group_id": "codeNet:p02727", "input_text": "(let* ((n (read))\n       (m (read))\n       (a (list (read) (read) (read)))\n       (lst (sort (concatenate 'list\n                               (loop :repeat (first a) :collect (cons (read) 1))\n                               (loop :repeat (second a) :collect (cons (read) 2))\n                               (loop :repeat (third a) :collect (cons (read) 0)))\n                  #'> :key #'car))\n       (stkcount 0)\n       (ans 0))\n  (loop :for (k . j) :in lst :if (= (+ n m) stkcount) :return 0 :end\n        :do(cond ((= j 1) (if (not (= 0 n))\n                              (decf n)))\n                 ((= j 2) (if (not (= 0 n))\n                              (decf m)))\n                 ((= j 0) (incf stkcount)))\n        :do(incf ans k))\n  (princ ans))", "language": "Lisp", "metadata": {"date": 1585448479, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lisp/s498273188.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s498273188", "user_id": "u610490393"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (a (list (read) (read) (read)))\n       (lst (sort (concatenate 'list\n                               (loop :repeat (first a) :collect (cons (read) 1))\n                               (loop :repeat (second a) :collect (cons (read) 2))\n                               (loop :repeat (third a) :collect (cons (read) 0)))\n                  #'> :key #'car))\n       (stkcount 0)\n       (ans 0))\n  (loop :for (k . j) :in lst :if (= (+ n m) stkcount) :return 0 :end\n        :do(cond ((= j 1) (if (not (= 0 n))\n                              (decf n)))\n                 ((= j 2) (if (not (= 0 n))\n                              (decf m)))\n                 ((= j 0) (incf stkcount)))\n        :do(incf ans k))\n  (princ ans))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 750, "cpu_time_ms": 961, "memory_kb": 72068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s723804532", "group_id": "codeNet:p02727", "input_text": "(defvar x (read))\n(defvar y (read))\n(defvar A (read))\n(defvar B (read))\n(defvar C (read))\n\n(defvar  p (loop repeat A collect (read)))\n(defvar  q (loop repeat B collect (read)))\n(defvar  r (loop repeat C collect (read)))\n\n(setf r (sort r #'>))\n\n(defvar pq (sort (nconc \n                  (nthcdr (- A x)  (sort p #'<))\n                  (nthcdr (- B y)  (sort q #'<))\n                  ) #'<))\n\n\n(princ (loop repeat (+ x y)\n             sum (max (or (car r) 0) (car pq))\n             do (setf  r (cdr r))\n             (setf  pq (cdr pq))\n            ))\n\n", "language": "Lisp", "metadata": {"date": 1585448062, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lisp/s723804532.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s723804532", "user_id": "u334552723"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "(defvar x (read))\n(defvar y (read))\n(defvar A (read))\n(defvar B (read))\n(defvar C (read))\n\n(defvar  p (loop repeat A collect (read)))\n(defvar  q (loop repeat B collect (read)))\n(defvar  r (loop repeat C collect (read)))\n\n(setf r (sort r #'>))\n\n(defvar pq (sort (nconc \n                  (nthcdr (- A x)  (sort p #'<))\n                  (nthcdr (- B y)  (sort q #'<))\n                  ) #'<))\n\n\n(princ (loop repeat (+ x y)\n             sum (max (or (car r) 0) (car pq))\n             do (setf  r (cdr r))\n             (setf  pq (cdr pq))\n            ))\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 553, "cpu_time_ms": 949, "memory_kb": 63912}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s754635196", "group_id": "codeNet:p02727", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(macrolet ((def (name fname)\n             `(define-modify-macro ,name (new-value) ,fname)))\n  (def minf min)\n  (def maxf max)\n  (def mulf *)\n  (def divf /)\n  (def iorf logior)\n  (def xorf logxor)\n  (def andf logand))\n\n;;;\n;;; Implicit treap\n;;; (treap with implicit key)\n;;;\n\n;; Note:\n;; - An empty treap is NIL.\n\n(declaim (inline op))\n(defun op (a b)\n  \"Is a binary operator comprising a monoid.\"\n  (declare (fixnum a b))\n  (+ a b))\n\n(defconstant +op-identity+ 0\n  \"identity element w.r.t. OP\")\n\n(defstruct (itreap (:constructor %make-itreap (value priority &key left right (count 1) (accumulator value)))\n                  (:copier nil)\n                  (:conc-name %itreap-))\n  (value +op-identity+ :type fixnum)\n  (accumulator +op-identity+ :type fixnum)\n  (priority 0 :type (integer 0 #.most-positive-fixnum))\n  (count 1 :type (integer 0 #.most-positive-fixnum)) ; size of (sub)treap\n  (left nil :type (or null itreap))\n  (right nil :type (or null itreap)))\n\n(declaim (inline itreap-count))\n(defun itreap-count (itreap)\n  \"Returns the number of the elements.\"\n  (declare ((or null itreap) itreap))\n  (if itreap\n      (%itreap-count itreap)\n      0))\n\n(declaim (inline itreap-accumulator))\n(defun itreap-accumulator (itreap)\n  \"Returns the sum (w.r.t. OP) of the whole ITREAP:\nITREAP[0]+ITREAP[1]+...+ITREAP[SIZE-1].\"\n  (declare ((or null itreap) itreap))\n  (if itreap\n      (%itreap-accumulator itreap)\n      +op-identity+))\n\n(declaim (inline update-count))\n(defun update-count (itreap)\n  (declare (itreap itreap))\n  (setf (%itreap-count itreap)\n        (+ 1\n           (itreap-count (%itreap-left itreap))\n           (itreap-count (%itreap-right itreap)))))\n\n(declaim (inline update-accumulator))\n(defun update-accumulator (itreap)\n  (declare (itreap itreap))\n  (setf (%itreap-accumulator itreap)\n        (if (%itreap-left itreap)\n            (if (%itreap-right itreap)\n                (let ((mid (op (%itreap-accumulator (%itreap-left itreap))\n                               (%itreap-value itreap))))\n                  (declare (dynamic-extent mid))\n                  (op mid (%itreap-accumulator (%itreap-right itreap))))\n                (op (%itreap-accumulator (%itreap-left itreap))\n                    (%itreap-value itreap)))\n            (if (%itreap-right itreap)\n                (op (%itreap-value itreap)\n                    (%itreap-accumulator (%itreap-right itreap)))\n                (%itreap-value itreap)))))\n\n(declaim (inline force-up))\n(defun force-up (itreap)\n  \"Propagates up the information from children.\"\n  (declare (itreap itreap))\n  (update-count itreap)\n  (update-accumulator itreap))\n\n(defun %heapify (top)\n  \"Properly swaps the priorities of the node and its two children.\"\n  (declare (optimize (speed 3) (safety 0)))\n  (when top\n    (let ((high-priority-node top))\n      (when (and (%itreap-left top)\n                 (> (%itreap-priority (%itreap-left top))\n                    (%itreap-priority high-priority-node)))\n        (setq high-priority-node (%itreap-left top)))\n      (when (and (%itreap-right top)\n                 (> (%itreap-priority (%itreap-right top))\n                    (%itreap-priority high-priority-node)))\n        (setq high-priority-node (%itreap-right top)))\n      (unless (eql high-priority-node top)\n        (rotatef (%itreap-priority high-priority-node)\n                 (%itreap-priority top))\n        (%heapify high-priority-node)))))\n\n(declaim (inline make-itreap))\n(defun make-itreap (size &key initial-contents)\n  \"Makes a treap of SIZE in O(SIZE) time. Its values are filled with the\nidentity element unless INITIAL-CONTENTS are supplied.\"\n  (declare ((or null vector) initial-contents))\n  (labels ((build (l r)\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (if (= l r)\n                 nil\n                 (let* ((mid (ash (+ l r) -1))\n                        (node (%make-itreap (if initial-contents\n                                                (aref initial-contents mid)\n                                                +op-identity+)\n                                           (random most-positive-fixnum))))\n                   (setf (%itreap-left node) (build l mid))\n                   (setf (%itreap-right node) (build (+ mid 1) r))\n                   (%heapify node)\n                   (force-up node)\n                   node))))\n    (build 0 size)))\n\n(define-condition invalid-itreap-index-error (type-error)\n  ((itreap :initarg :itreap :reader invalid-itreap-index-error-itreap)\n   (index :initarg :index :reader invalid-itreap-index-error-index))\n  (:report\n   (lambda (condition stream)\n     (let ((index (invalid-itreap-index-error-index condition)))\n       (if (consp index)\n           (format stream \"Invalid range [~W, ~W) for itreap ~W.\"\n                   (car index)\n                   (cdr index)\n                   (invalid-itreap-index-error-itreap condition))\n           (format stream \"Invalid index ~W for itreap ~W.\"\n                   index\n                   (invalid-itreap-index-error-itreap condition)))))))\n\n(defun itreap-split (itreap index)\n  \"Destructively splits the ITREAP into two nodes [0, INDEX) and [INDEX, N),\nwhere N is the number of the elements in ITREAP.\"\n  (declare (optimize (speed 3))\n           ((integer 0 #.most-positive-fixnum) index))\n  (unless (<= index (itreap-count itreap))\n    (error 'invalid-itreap-index-error :index index :itreap itreap))\n  (labels ((recur (itreap ikey)\n             (unless itreap\n               (return-from itreap-split (values nil nil)))\n             (let ((left-count (itreap-count (%itreap-left itreap))))\n               (if (<= ikey left-count)\n                   (multiple-value-bind (left right)\n                       (itreap-split (%itreap-left itreap) ikey)\n                     (setf (%itreap-left itreap) right)\n                     (force-up itreap)\n                     (values left itreap))\n                   (multiple-value-bind (left right)\n                       (itreap-split (%itreap-right itreap) (- ikey left-count 1))\n                     (setf (%itreap-right itreap) left)\n                     (force-up itreap)\n                     (values itreap right))))))\n    (recur itreap index)))\n\n(defun itreap-merge (left right)\n  \"Destructively concatenates two ITREAPs.\"\n  (declare (optimize (speed 3))\n           ((or null itreap) left right))\n  (cond ((null left) (when right (force-up right)) right)\n        ((null right) (when left (force-up left)) left)\n        (t (if (> (%itreap-priority left) (%itreap-priority right))\n               (progn\n                 (setf (%itreap-right left)\n                       (itreap-merge (%itreap-right left) right))\n                 (force-up left)\n                 left)\n               (progn\n                 (setf (%itreap-left right)\n                       (itreap-merge left (%itreap-left right)))\n                 (force-up right)\n                 right)))))\n\n(defun itreap-insert (itreap index obj)\n  \"Destructively inserts OBJ into ITREAP and returns the resultant treap.\n\nYou cannot rely on the side effect. Use the returned value.\"\n  (declare (optimize (speed 3))\n           ((or null itreap) itreap)\n           ((integer 0 #.most-positive-fixnum) index))\n  (unless (<= index (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index index))\n  (let ((node (%make-itreap obj (random most-positive-fixnum))))\n    (labels ((recur (itreap ikey)\n               (declare ((integer 0 #.most-positive-fixnum) ikey))\n               (unless itreap (return-from recur node))\n               (if (> (%itreap-priority node) (%itreap-priority itreap))\n                   (progn\n                     (setf (values (%itreap-left node) (%itreap-right node))\n                           (itreap-split itreap ikey))\n                     (force-up node)\n                     node)\n                   (let ((left-count (itreap-count (%itreap-left itreap))))\n                     (if (<= ikey left-count)\n                         (setf (%itreap-left itreap)\n                               (recur (%itreap-left itreap) ikey))\n                         (setf (%itreap-right itreap)\n                               (recur (%itreap-right itreap) (- ikey left-count 1))))\n                     (force-up itreap)\n                     itreap))))\n      (recur itreap index))))\n\n(defun itreap-delete (itreap index)\n  \"Destructively deletes the object at INDEX in ITREAP.\n\nYou cannot rely on the side effect. Use the returned value.\"\n  (declare (optimize (speed 3))\n           ((integer 0 #.most-positive-fixnum) index))\n  (unless (< index (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index index))\n  (labels ((recur (itreap ikey)\n             (declare ((integer 0 #.most-positive-fixnum) ikey))\n             (let ((left-count (itreap-count (%itreap-left itreap))))\n               (cond ((< ikey left-count)\n                      (setf (%itreap-left itreap)\n                            (recur (%itreap-left itreap) ikey))\n                      (force-up itreap)\n                      itreap)\n                     ((> ikey left-count)\n                      (setf (%itreap-right itreap)\n                            (recur (%itreap-right itreap) (- ikey left-count 1)))\n                      (force-up itreap)\n                      itreap)\n                     (t\n                      (itreap-merge (%itreap-left itreap) (%itreap-right itreap)))))))\n    (recur itreap index)))\n\n(defmacro itreap-push (obj itreap pos)\n  \"Pushes OBJ to ITREAP at POS.\"\n  `(setf ,itreap (itreap-insert ,itreap ,pos ,obj)))\n\n(defmacro itreap-pop (itreap pos)\n  \"Returns the object at POS and deletes it.\"\n  (let ((p (gensym)))\n    `(let ((,p ,pos))\n       (prog1 (itreap-ref ,itreap ,p)\n         (setf ,itreap (itreap-delete ,itreap ,p))))))\n\n(declaim (inline itreap-map))\n(defun itreap-map (function itreap)\n  \"Successively applies FUNCTION to ITREAP[0], ..., ITREAP[SIZE-1].\"\n  (declare (function function))\n  (labels ((recur (node)\n             (when node\n               (recur (%itreap-left node))\n               (funcall function (%itreap-value node))\n               (recur (%itreap-right node))\n               (force-up node))))\n    (recur itreap)))\n\n(defmethod print-object ((object itreap) stream)\n  (print-unreadable-object (object stream :type t)\n    (let ((init t))\n      (itreap-map (lambda (x)\n                    (if init\n                        (setq init nil)\n                        (write-char #\\  stream))\n                   (write x :stream stream))\n                 object))))\n\n(defmacro do-itreap ((var itreap &optional result) &body body)\n  \"Successively binds ITREAP[0], ..., ITREAP[SIZE-1] to VAR and executes BODY\neach time.\"\n  `(block nil\n     (itreap-map (lambda (,var) ,@body) ,itreap)\n     ,result))\n\n(defun itreap (&rest args)\n  ;; NOTE: This function takes O(nlog(n)) time. Use MAKE-ITREAP for efficiency.\n  (labels ((recur (list position itreap)\n             (declare ((integer 0 #.most-positive-fixnum) position))\n             (if (null list)\n                 itreap\n                 (recur (cdr list)\n                        (1+ position)\n                        (itreap-insert itreap position (car list))))))\n    (recur args 0 nil)))\n\n(declaim (inline itreap-ref))\n(defun itreap-ref (itreap index)\n  \"Returns the element ITREAP[INDEX].\"\n  (declare ((integer 0 #.most-positive-fixnum) index))\n  (unless (< index (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index index))\n  (labels ((%ref (itreap index)\n             (declare ((integer 0 #.most-positive-fixnum) index))\n             (prog1\n                 (let ((left-count (itreap-count (%itreap-left itreap))))\n                   (cond ((< index left-count)\n                          (%ref (%itreap-left itreap) index))\n                         ((> index left-count)\n                          (%ref (%itreap-right itreap) (- index left-count 1)))\n                         (t (%itreap-value itreap))))\n               (force-up itreap))))\n    (%ref itreap index)))\n\n(declaim (inline (setf itreap-ref)))\n(defun (setf itreap-ref) (new-value itreap index)\n  \"Sets ITREAP[INDEX] to the given value.\"\n  (declare ((integer 0 #.most-positive-fixnum) index))\n  (unless (< index (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index index))\n  (labels ((%set (itreap index)\n             (declare ((integer 0 #.most-positive-fixnum) index))\n             (prog1\n                 (let ((left-count (itreap-count (%itreap-left itreap))))\n                   (cond ((< index left-count)\n                          (%set (%itreap-left itreap) index))\n                         ((> index left-count)\n                          (%set (%itreap-right itreap) (- index left-count 1)))\n                         (t (setf (%itreap-value itreap) new-value))))\n               (force-up itreap))))\n    (%set itreap index)\n    new-value))\n\n(declaim (inline itreap-query))\n(defun itreap-query (itreap l r)\n  \"Queries the `sum' (w.r.t. OP) of the range ITREAP[L, R).\"\n  (declare ((integer 0 #.most-positive-fixnum) l r))\n  (unless (<= l r (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index (cons l r)))\n  (labels\n      ((recur (itreap l r)\n         (declare ((integer 0 #.most-positive-fixnum) l r))\n         (unless itreap\n           (return-from recur +op-identity+))\n         (prog1\n             (if (and (zerop l) (= r (%itreap-count itreap)))\n                 (itreap-accumulator itreap)\n                 (let ((left-count (itreap-count (%itreap-left itreap))))\n                   (if (<= l left-count)\n                       (if (< left-count r)\n                           ;; LEFT-COUNT is in [L, R)\n                           (op (op (recur (%itreap-left itreap) l (min r left-count))\n                                   (%itreap-value itreap))\n                               (recur (%itreap-right itreap) 0 (- r left-count 1)))\n                           ;; LEFT-COUNT is in [R, END)\n                           (recur (%itreap-left itreap) l (min r left-count)))\n                       ;; LEFT-COUNT is in [0, L)\n                       (recur (%itreap-right itreap) (- l left-count 1) (- r left-count 1)))))\n           (force-up itreap))))\n    (recur itreap l r)))\n\n;; FIXME: might be problematic when two priorities collide and START is not\n;; zero. (It will be negligible from the viewpoint of probability, however.)\n(declaim (inline itreap-range-bisect-left))\n(defun itreap-range-bisect-left (itreap value order &optional (start 0))\n  \"Returns the smallest index that satisfies ITREAP[START]+ ITREAP[START+1] +\n... + ITREAP[index] >= VALUE (if ORDER is #'<).\n\nNote:\n- This function handles a **closed** interval.\n- This function returns the length of ITREAP instead if ITREAP[START]+\n... +ITREAP[length-1] < VALUE.\n- The prefix sums of ITREAP, (ITREAP[START], ITREAP[START]+ITREAP[START+1], ...)\n  must be monotone w.r.t. ORDER.\n- ORDER must be a strict order\"\n  (declare ((integer 0 #.most-positive-fixnum) start))\n  (multiple-value-bind (itreap-prefix itreap)\n      (if (zerop start)\n          (values nil itreap)\n          (itreap-split itreap start))\n    (labels\n        ((recur (itreap offset prev-sum)\n           (declare ((integer 0 #.most-positive-fixnum) offset)\n                    #+sbcl (values (integer 0 #.most-positive-fixnum)))\n           (unless itreap\n             (return-from recur offset))\n           (let ((sum prev-sum))\n             (prog1\n                 (cond ((not (funcall order\n                                      (setq sum (op sum (itreap-accumulator (%itreap-left itreap))))\n                                      value))\n                        (recur (%itreap-left itreap) offset prev-sum))\n                       ((not (funcall order\n                                      (setq sum (op sum (%itreap-value itreap)))\n                                      value))\n                        (+ offset (itreap-count (%itreap-left itreap))))\n                       (t\n                        (recur (%itreap-right itreap)\n                               (+ offset (itreap-count (%itreap-left itreap)) 1)\n                               sum)))\n               (force-up itreap)))))\n      (prog1 (+ start (recur itreap 0 +op-identity+))\n        (itreap-merge itreap-prefix itreap)))))\n\n;; merge/split version of itreap-query (a bit slower but simpler)\n;; FIXME: might be problematic when two priorities collide.\n#|\n(declaim (inline itreap-query))\n(defun itreap-query (itreap l r)\n  \"Queries the `sum' (w.r.t. OP) of the interval [L, R).\"\n  (declare ((integer 0 #.most-positive-fixnum) l r))\n  (unless (<= l r (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index (cons l r)))\n  (if (= l r)\n      +op-identity+\n      (multiple-value-bind (itreap-0-l itreap-l-n)\n          (itreap-split itreap l)\n        (multiple-value-bind (itreap-l-r itreap-r-n)\n            (itreap-split itreap-l-n (- r l))\n          (prog1 (%itreap-accumulator itreap-l-r)\n            (itreap-merge itreap-0-l (itreap-merge itreap-l-r itreap-r-n)))))))\n;|#\n\n;; merge/split version of itreap-update (a bit slower but simpler)\n#|\n(declaim (inline itreap-update))\n(defun itreap-update (itreap operand l r)\n  \"Updates ITREAP[i] := (OP ITREAP[i] OPERAND) for all i in [l, r)\"\n  (declare ((integer 0 #.most-positive-fixnum) l r))\n  (unless (<= l r (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index (cons l r)))\n  (multiple-value-bind (itreap-0-l itreap-l-n)\n      (itreap-split itreap l)\n    (multiple-value-bind (itreap-l-r itreap-r-n)\n        (itreap-split itreap-l-n (- r l))\n      (when itreap-l-r\n        (setf (%itreap-lazy itreap-l-r)\n              (updater-op (%itreap-lazy itreap-l-r) operand)))\n      (itreap-merge itreap-0-l (itreap-merge itreap-l-r itreap-r-n)))))\n;|#\n\n;;;\n;;; Utilities for sorted treap\n;;;\n\n(declaim (inline itreap-bisect-left)\n         (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional)) itreap-bisect-left))\n(defun itreap-bisect-left (itreap threshold order)\n  \"Takes a **sorted** treap and returns the smallest index that satisfies\nITREAP[index] >= THRESHOLD, where >= is the complement of ORDER. Returns the\nsize of ITREAP if ITREAP[length-1] < THRESHOLD. The time complexity is\nO(log(n)).\"\n  (labels ((recur (count itreap)\n             (declare ((integer 0 #.most-positive-fixnum) count))\n             (cond ((null itreap) nil)\n                   ((funcall order (%itreap-value itreap) threshold)\n                    (recur count (%itreap-right itreap)))\n                   (t\n                    (let ((left-count (- count (itreap-count (%itreap-right itreap)) 1)))\n                      (or (recur left-count (%itreap-left itreap))\n                          left-count))))))\n    (or (recur (itreap-count itreap) itreap)\n        (itreap-count itreap))))\n\n(declaim (inline itreap-bisect-right)\n         (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional)) itreap-bisect-right))\n(defun itreap-bisect-right (itreap threshold order)\n  \"Takes a **sorted** treap and returns the smallest index that satisfies\nTHRESHOLD < ITREAP[index], where < is ORDER. Returns the size of ITREAP if\nITREAP[length-1] <= THRESHOLD. The time complexity is O(log(n)).\"\n  (labels ((recur (count itreap)\n             (declare ((integer 0 #.most-positive-fixnum) count))\n             (cond ((null itreap) nil)\n                   ((funcall order threshold (%itreap-value itreap))\n                    (let ((left-count (- count (itreap-count (%itreap-right itreap)) 1)))\n                      (or (recur left-count (%itreap-left itreap))\n                          left-count)))\n                   (t\n                    (recur count (%itreap-right itreap))))))\n    (or (recur (itreap-count itreap) itreap)\n        (itreap-count itreap))))\n\n(declaim (inline itreap-insort))\n(defun itreap-insort (itreap obj order)\n  \"Does insertion to the sorted treap.\"\n  (let ((pos (itreap-bisect-left itreap obj order)))\n    (itreap-insert itreap pos obj)))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun %sort (vec)\n  (declare ((simple-array uint32 (*)) vec)\n           (inline sort))\n  (sort vec #'>))\n\n(defun main ()\n  (let* ((x (read))\n         (y (read))\n         (a (read))\n         (b (read))\n         (c (read))\n         (ps (make-array a :element-type 'uint32))\n         (qs (make-array b :element-type 'uint32))\n         (rs (make-array c :element-type 'uint32)))\n    (dotimes (i a)\n      (setf (aref ps i) (read-fixnum)))\n    (dotimes (i b)\n      (setf (aref qs i) (read-fixnum)))\n    (dotimes (i c)\n      (setf (aref rs i) (read-fixnum)))\n    (setq ps (%sort ps)\n          qs (%sort qs)\n          rs (%sort rs))\n    (let ((cumuls-red (make-array (+ 1 a) :element-type 'uint62))\n          (cumuls-colorless (make-array (+ 1 c) :element-type 'uint62))\n          (dp (make-itreap b :initial-contents qs))\n          (res 0))\n      (dotimes (i a)\n        (setf (aref cumuls-red (+ i 1))\n              (+ (aref cumuls-red i) (aref ps i))))\n      (dotimes (i c)\n        (setf (aref cumuls-colorless (+ i 1))\n              (+ (aref cumuls-colorless i) (aref rs i))))\n      #>cumuls-red\n      #>cumuls-colorless\n      (loop for k from c downto 0\n            do (unless (= k c)\n                 (setq dp (itreap-insort dp (aref rs k) #'>)))\n               #>dp\n               (when (<= k x)\n                 ;; 先頭k個を赤に塗る。赤からは上位x-k個を選ぶ\n                 (maxf res (+ (aref cumuls-red (- x k))\n                              (aref cumuls-colorless k)\n                              #>(itreap-query dp 0 (min y (itreap-count dp)))))))\n      (println res))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1 2 2 2 1\n2 4\n5 1\n3\n\"\n    \"12\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 2 2 2 2\n8 6\n9 1\n2 1\n\"\n    \"25\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\"\n    \"74\n\")))\n", "language": "Lisp", "metadata": {"date": 1585445799, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Lisp/s754635196.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s754635196", "user_id": "u352600849"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(macrolet ((def (name fname)\n             `(define-modify-macro ,name (new-value) ,fname)))\n  (def minf min)\n  (def maxf max)\n  (def mulf *)\n  (def divf /)\n  (def iorf logior)\n  (def xorf logxor)\n  (def andf logand))\n\n;;;\n;;; Implicit treap\n;;; (treap with implicit key)\n;;;\n\n;; Note:\n;; - An empty treap is NIL.\n\n(declaim (inline op))\n(defun op (a b)\n  \"Is a binary operator comprising a monoid.\"\n  (declare (fixnum a b))\n  (+ a b))\n\n(defconstant +op-identity+ 0\n  \"identity element w.r.t. OP\")\n\n(defstruct (itreap (:constructor %make-itreap (value priority &key left right (count 1) (accumulator value)))\n                  (:copier nil)\n                  (:conc-name %itreap-))\n  (value +op-identity+ :type fixnum)\n  (accumulator +op-identity+ :type fixnum)\n  (priority 0 :type (integer 0 #.most-positive-fixnum))\n  (count 1 :type (integer 0 #.most-positive-fixnum)) ; size of (sub)treap\n  (left nil :type (or null itreap))\n  (right nil :type (or null itreap)))\n\n(declaim (inline itreap-count))\n(defun itreap-count (itreap)\n  \"Returns the number of the elements.\"\n  (declare ((or null itreap) itreap))\n  (if itreap\n      (%itreap-count itreap)\n      0))\n\n(declaim (inline itreap-accumulator))\n(defun itreap-accumulator (itreap)\n  \"Returns the sum (w.r.t. OP) of the whole ITREAP:\nITREAP[0]+ITREAP[1]+...+ITREAP[SIZE-1].\"\n  (declare ((or null itreap) itreap))\n  (if itreap\n      (%itreap-accumulator itreap)\n      +op-identity+))\n\n(declaim (inline update-count))\n(defun update-count (itreap)\n  (declare (itreap itreap))\n  (setf (%itreap-count itreap)\n        (+ 1\n           (itreap-count (%itreap-left itreap))\n           (itreap-count (%itreap-right itreap)))))\n\n(declaim (inline update-accumulator))\n(defun update-accumulator (itreap)\n  (declare (itreap itreap))\n  (setf (%itreap-accumulator itreap)\n        (if (%itreap-left itreap)\n            (if (%itreap-right itreap)\n                (let ((mid (op (%itreap-accumulator (%itreap-left itreap))\n                               (%itreap-value itreap))))\n                  (declare (dynamic-extent mid))\n                  (op mid (%itreap-accumulator (%itreap-right itreap))))\n                (op (%itreap-accumulator (%itreap-left itreap))\n                    (%itreap-value itreap)))\n            (if (%itreap-right itreap)\n                (op (%itreap-value itreap)\n                    (%itreap-accumulator (%itreap-right itreap)))\n                (%itreap-value itreap)))))\n\n(declaim (inline force-up))\n(defun force-up (itreap)\n  \"Propagates up the information from children.\"\n  (declare (itreap itreap))\n  (update-count itreap)\n  (update-accumulator itreap))\n\n(defun %heapify (top)\n  \"Properly swaps the priorities of the node and its two children.\"\n  (declare (optimize (speed 3) (safety 0)))\n  (when top\n    (let ((high-priority-node top))\n      (when (and (%itreap-left top)\n                 (> (%itreap-priority (%itreap-left top))\n                    (%itreap-priority high-priority-node)))\n        (setq high-priority-node (%itreap-left top)))\n      (when (and (%itreap-right top)\n                 (> (%itreap-priority (%itreap-right top))\n                    (%itreap-priority high-priority-node)))\n        (setq high-priority-node (%itreap-right top)))\n      (unless (eql high-priority-node top)\n        (rotatef (%itreap-priority high-priority-node)\n                 (%itreap-priority top))\n        (%heapify high-priority-node)))))\n\n(declaim (inline make-itreap))\n(defun make-itreap (size &key initial-contents)\n  \"Makes a treap of SIZE in O(SIZE) time. Its values are filled with the\nidentity element unless INITIAL-CONTENTS are supplied.\"\n  (declare ((or null vector) initial-contents))\n  (labels ((build (l r)\n             (declare ((integer 0 #.most-positive-fixnum) l r))\n             (if (= l r)\n                 nil\n                 (let* ((mid (ash (+ l r) -1))\n                        (node (%make-itreap (if initial-contents\n                                                (aref initial-contents mid)\n                                                +op-identity+)\n                                           (random most-positive-fixnum))))\n                   (setf (%itreap-left node) (build l mid))\n                   (setf (%itreap-right node) (build (+ mid 1) r))\n                   (%heapify node)\n                   (force-up node)\n                   node))))\n    (build 0 size)))\n\n(define-condition invalid-itreap-index-error (type-error)\n  ((itreap :initarg :itreap :reader invalid-itreap-index-error-itreap)\n   (index :initarg :index :reader invalid-itreap-index-error-index))\n  (:report\n   (lambda (condition stream)\n     (let ((index (invalid-itreap-index-error-index condition)))\n       (if (consp index)\n           (format stream \"Invalid range [~W, ~W) for itreap ~W.\"\n                   (car index)\n                   (cdr index)\n                   (invalid-itreap-index-error-itreap condition))\n           (format stream \"Invalid index ~W for itreap ~W.\"\n                   index\n                   (invalid-itreap-index-error-itreap condition)))))))\n\n(defun itreap-split (itreap index)\n  \"Destructively splits the ITREAP into two nodes [0, INDEX) and [INDEX, N),\nwhere N is the number of the elements in ITREAP.\"\n  (declare (optimize (speed 3))\n           ((integer 0 #.most-positive-fixnum) index))\n  (unless (<= index (itreap-count itreap))\n    (error 'invalid-itreap-index-error :index index :itreap itreap))\n  (labels ((recur (itreap ikey)\n             (unless itreap\n               (return-from itreap-split (values nil nil)))\n             (let ((left-count (itreap-count (%itreap-left itreap))))\n               (if (<= ikey left-count)\n                   (multiple-value-bind (left right)\n                       (itreap-split (%itreap-left itreap) ikey)\n                     (setf (%itreap-left itreap) right)\n                     (force-up itreap)\n                     (values left itreap))\n                   (multiple-value-bind (left right)\n                       (itreap-split (%itreap-right itreap) (- ikey left-count 1))\n                     (setf (%itreap-right itreap) left)\n                     (force-up itreap)\n                     (values itreap right))))))\n    (recur itreap index)))\n\n(defun itreap-merge (left right)\n  \"Destructively concatenates two ITREAPs.\"\n  (declare (optimize (speed 3))\n           ((or null itreap) left right))\n  (cond ((null left) (when right (force-up right)) right)\n        ((null right) (when left (force-up left)) left)\n        (t (if (> (%itreap-priority left) (%itreap-priority right))\n               (progn\n                 (setf (%itreap-right left)\n                       (itreap-merge (%itreap-right left) right))\n                 (force-up left)\n                 left)\n               (progn\n                 (setf (%itreap-left right)\n                       (itreap-merge left (%itreap-left right)))\n                 (force-up right)\n                 right)))))\n\n(defun itreap-insert (itreap index obj)\n  \"Destructively inserts OBJ into ITREAP and returns the resultant treap.\n\nYou cannot rely on the side effect. Use the returned value.\"\n  (declare (optimize (speed 3))\n           ((or null itreap) itreap)\n           ((integer 0 #.most-positive-fixnum) index))\n  (unless (<= index (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index index))\n  (let ((node (%make-itreap obj (random most-positive-fixnum))))\n    (labels ((recur (itreap ikey)\n               (declare ((integer 0 #.most-positive-fixnum) ikey))\n               (unless itreap (return-from recur node))\n               (if (> (%itreap-priority node) (%itreap-priority itreap))\n                   (progn\n                     (setf (values (%itreap-left node) (%itreap-right node))\n                           (itreap-split itreap ikey))\n                     (force-up node)\n                     node)\n                   (let ((left-count (itreap-count (%itreap-left itreap))))\n                     (if (<= ikey left-count)\n                         (setf (%itreap-left itreap)\n                               (recur (%itreap-left itreap) ikey))\n                         (setf (%itreap-right itreap)\n                               (recur (%itreap-right itreap) (- ikey left-count 1))))\n                     (force-up itreap)\n                     itreap))))\n      (recur itreap index))))\n\n(defun itreap-delete (itreap index)\n  \"Destructively deletes the object at INDEX in ITREAP.\n\nYou cannot rely on the side effect. Use the returned value.\"\n  (declare (optimize (speed 3))\n           ((integer 0 #.most-positive-fixnum) index))\n  (unless (< index (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index index))\n  (labels ((recur (itreap ikey)\n             (declare ((integer 0 #.most-positive-fixnum) ikey))\n             (let ((left-count (itreap-count (%itreap-left itreap))))\n               (cond ((< ikey left-count)\n                      (setf (%itreap-left itreap)\n                            (recur (%itreap-left itreap) ikey))\n                      (force-up itreap)\n                      itreap)\n                     ((> ikey left-count)\n                      (setf (%itreap-right itreap)\n                            (recur (%itreap-right itreap) (- ikey left-count 1)))\n                      (force-up itreap)\n                      itreap)\n                     (t\n                      (itreap-merge (%itreap-left itreap) (%itreap-right itreap)))))))\n    (recur itreap index)))\n\n(defmacro itreap-push (obj itreap pos)\n  \"Pushes OBJ to ITREAP at POS.\"\n  `(setf ,itreap (itreap-insert ,itreap ,pos ,obj)))\n\n(defmacro itreap-pop (itreap pos)\n  \"Returns the object at POS and deletes it.\"\n  (let ((p (gensym)))\n    `(let ((,p ,pos))\n       (prog1 (itreap-ref ,itreap ,p)\n         (setf ,itreap (itreap-delete ,itreap ,p))))))\n\n(declaim (inline itreap-map))\n(defun itreap-map (function itreap)\n  \"Successively applies FUNCTION to ITREAP[0], ..., ITREAP[SIZE-1].\"\n  (declare (function function))\n  (labels ((recur (node)\n             (when node\n               (recur (%itreap-left node))\n               (funcall function (%itreap-value node))\n               (recur (%itreap-right node))\n               (force-up node))))\n    (recur itreap)))\n\n(defmethod print-object ((object itreap) stream)\n  (print-unreadable-object (object stream :type t)\n    (let ((init t))\n      (itreap-map (lambda (x)\n                    (if init\n                        (setq init nil)\n                        (write-char #\\  stream))\n                   (write x :stream stream))\n                 object))))\n\n(defmacro do-itreap ((var itreap &optional result) &body body)\n  \"Successively binds ITREAP[0], ..., ITREAP[SIZE-1] to VAR and executes BODY\neach time.\"\n  `(block nil\n     (itreap-map (lambda (,var) ,@body) ,itreap)\n     ,result))\n\n(defun itreap (&rest args)\n  ;; NOTE: This function takes O(nlog(n)) time. Use MAKE-ITREAP for efficiency.\n  (labels ((recur (list position itreap)\n             (declare ((integer 0 #.most-positive-fixnum) position))\n             (if (null list)\n                 itreap\n                 (recur (cdr list)\n                        (1+ position)\n                        (itreap-insert itreap position (car list))))))\n    (recur args 0 nil)))\n\n(declaim (inline itreap-ref))\n(defun itreap-ref (itreap index)\n  \"Returns the element ITREAP[INDEX].\"\n  (declare ((integer 0 #.most-positive-fixnum) index))\n  (unless (< index (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index index))\n  (labels ((%ref (itreap index)\n             (declare ((integer 0 #.most-positive-fixnum) index))\n             (prog1\n                 (let ((left-count (itreap-count (%itreap-left itreap))))\n                   (cond ((< index left-count)\n                          (%ref (%itreap-left itreap) index))\n                         ((> index left-count)\n                          (%ref (%itreap-right itreap) (- index left-count 1)))\n                         (t (%itreap-value itreap))))\n               (force-up itreap))))\n    (%ref itreap index)))\n\n(declaim (inline (setf itreap-ref)))\n(defun (setf itreap-ref) (new-value itreap index)\n  \"Sets ITREAP[INDEX] to the given value.\"\n  (declare ((integer 0 #.most-positive-fixnum) index))\n  (unless (< index (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index index))\n  (labels ((%set (itreap index)\n             (declare ((integer 0 #.most-positive-fixnum) index))\n             (prog1\n                 (let ((left-count (itreap-count (%itreap-left itreap))))\n                   (cond ((< index left-count)\n                          (%set (%itreap-left itreap) index))\n                         ((> index left-count)\n                          (%set (%itreap-right itreap) (- index left-count 1)))\n                         (t (setf (%itreap-value itreap) new-value))))\n               (force-up itreap))))\n    (%set itreap index)\n    new-value))\n\n(declaim (inline itreap-query))\n(defun itreap-query (itreap l r)\n  \"Queries the `sum' (w.r.t. OP) of the range ITREAP[L, R).\"\n  (declare ((integer 0 #.most-positive-fixnum) l r))\n  (unless (<= l r (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index (cons l r)))\n  (labels\n      ((recur (itreap l r)\n         (declare ((integer 0 #.most-positive-fixnum) l r))\n         (unless itreap\n           (return-from recur +op-identity+))\n         (prog1\n             (if (and (zerop l) (= r (%itreap-count itreap)))\n                 (itreap-accumulator itreap)\n                 (let ((left-count (itreap-count (%itreap-left itreap))))\n                   (if (<= l left-count)\n                       (if (< left-count r)\n                           ;; LEFT-COUNT is in [L, R)\n                           (op (op (recur (%itreap-left itreap) l (min r left-count))\n                                   (%itreap-value itreap))\n                               (recur (%itreap-right itreap) 0 (- r left-count 1)))\n                           ;; LEFT-COUNT is in [R, END)\n                           (recur (%itreap-left itreap) l (min r left-count)))\n                       ;; LEFT-COUNT is in [0, L)\n                       (recur (%itreap-right itreap) (- l left-count 1) (- r left-count 1)))))\n           (force-up itreap))))\n    (recur itreap l r)))\n\n;; FIXME: might be problematic when two priorities collide and START is not\n;; zero. (It will be negligible from the viewpoint of probability, however.)\n(declaim (inline itreap-range-bisect-left))\n(defun itreap-range-bisect-left (itreap value order &optional (start 0))\n  \"Returns the smallest index that satisfies ITREAP[START]+ ITREAP[START+1] +\n... + ITREAP[index] >= VALUE (if ORDER is #'<).\n\nNote:\n- This function handles a **closed** interval.\n- This function returns the length of ITREAP instead if ITREAP[START]+\n... +ITREAP[length-1] < VALUE.\n- The prefix sums of ITREAP, (ITREAP[START], ITREAP[START]+ITREAP[START+1], ...)\n  must be monotone w.r.t. ORDER.\n- ORDER must be a strict order\"\n  (declare ((integer 0 #.most-positive-fixnum) start))\n  (multiple-value-bind (itreap-prefix itreap)\n      (if (zerop start)\n          (values nil itreap)\n          (itreap-split itreap start))\n    (labels\n        ((recur (itreap offset prev-sum)\n           (declare ((integer 0 #.most-positive-fixnum) offset)\n                    #+sbcl (values (integer 0 #.most-positive-fixnum)))\n           (unless itreap\n             (return-from recur offset))\n           (let ((sum prev-sum))\n             (prog1\n                 (cond ((not (funcall order\n                                      (setq sum (op sum (itreap-accumulator (%itreap-left itreap))))\n                                      value))\n                        (recur (%itreap-left itreap) offset prev-sum))\n                       ((not (funcall order\n                                      (setq sum (op sum (%itreap-value itreap)))\n                                      value))\n                        (+ offset (itreap-count (%itreap-left itreap))))\n                       (t\n                        (recur (%itreap-right itreap)\n                               (+ offset (itreap-count (%itreap-left itreap)) 1)\n                               sum)))\n               (force-up itreap)))))\n      (prog1 (+ start (recur itreap 0 +op-identity+))\n        (itreap-merge itreap-prefix itreap)))))\n\n;; merge/split version of itreap-query (a bit slower but simpler)\n;; FIXME: might be problematic when two priorities collide.\n#|\n(declaim (inline itreap-query))\n(defun itreap-query (itreap l r)\n  \"Queries the `sum' (w.r.t. OP) of the interval [L, R).\"\n  (declare ((integer 0 #.most-positive-fixnum) l r))\n  (unless (<= l r (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index (cons l r)))\n  (if (= l r)\n      +op-identity+\n      (multiple-value-bind (itreap-0-l itreap-l-n)\n          (itreap-split itreap l)\n        (multiple-value-bind (itreap-l-r itreap-r-n)\n            (itreap-split itreap-l-n (- r l))\n          (prog1 (%itreap-accumulator itreap-l-r)\n            (itreap-merge itreap-0-l (itreap-merge itreap-l-r itreap-r-n)))))))\n;|#\n\n;; merge/split version of itreap-update (a bit slower but simpler)\n#|\n(declaim (inline itreap-update))\n(defun itreap-update (itreap operand l r)\n  \"Updates ITREAP[i] := (OP ITREAP[i] OPERAND) for all i in [l, r)\"\n  (declare ((integer 0 #.most-positive-fixnum) l r))\n  (unless (<= l r (itreap-count itreap))\n    (error 'invalid-itreap-index-error :itreap itreap :index (cons l r)))\n  (multiple-value-bind (itreap-0-l itreap-l-n)\n      (itreap-split itreap l)\n    (multiple-value-bind (itreap-l-r itreap-r-n)\n        (itreap-split itreap-l-n (- r l))\n      (when itreap-l-r\n        (setf (%itreap-lazy itreap-l-r)\n              (updater-op (%itreap-lazy itreap-l-r) operand)))\n      (itreap-merge itreap-0-l (itreap-merge itreap-l-r itreap-r-n)))))\n;|#\n\n;;;\n;;; Utilities for sorted treap\n;;;\n\n(declaim (inline itreap-bisect-left)\n         (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional)) itreap-bisect-left))\n(defun itreap-bisect-left (itreap threshold order)\n  \"Takes a **sorted** treap and returns the smallest index that satisfies\nITREAP[index] >= THRESHOLD, where >= is the complement of ORDER. Returns the\nsize of ITREAP if ITREAP[length-1] < THRESHOLD. The time complexity is\nO(log(n)).\"\n  (labels ((recur (count itreap)\n             (declare ((integer 0 #.most-positive-fixnum) count))\n             (cond ((null itreap) nil)\n                   ((funcall order (%itreap-value itreap) threshold)\n                    (recur count (%itreap-right itreap)))\n                   (t\n                    (let ((left-count (- count (itreap-count (%itreap-right itreap)) 1)))\n                      (or (recur left-count (%itreap-left itreap))\n                          left-count))))))\n    (or (recur (itreap-count itreap) itreap)\n        (itreap-count itreap))))\n\n(declaim (inline itreap-bisect-right)\n         (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional)) itreap-bisect-right))\n(defun itreap-bisect-right (itreap threshold order)\n  \"Takes a **sorted** treap and returns the smallest index that satisfies\nTHRESHOLD < ITREAP[index], where < is ORDER. Returns the size of ITREAP if\nITREAP[length-1] <= THRESHOLD. The time complexity is O(log(n)).\"\n  (labels ((recur (count itreap)\n             (declare ((integer 0 #.most-positive-fixnum) count))\n             (cond ((null itreap) nil)\n                   ((funcall order threshold (%itreap-value itreap))\n                    (let ((left-count (- count (itreap-count (%itreap-right itreap)) 1)))\n                      (or (recur left-count (%itreap-left itreap))\n                          left-count)))\n                   (t\n                    (recur count (%itreap-right itreap))))))\n    (or (recur (itreap-count itreap) itreap)\n        (itreap-count itreap))))\n\n(declaim (inline itreap-insort))\n(defun itreap-insort (itreap obj order)\n  \"Does insertion to the sorted treap.\"\n  (let ((pos (itreap-bisect-left itreap obj order)))\n    (itreap-insert itreap pos obj)))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun %sort (vec)\n  (declare ((simple-array uint32 (*)) vec)\n           (inline sort))\n  (sort vec #'>))\n\n(defun main ()\n  (let* ((x (read))\n         (y (read))\n         (a (read))\n         (b (read))\n         (c (read))\n         (ps (make-array a :element-type 'uint32))\n         (qs (make-array b :element-type 'uint32))\n         (rs (make-array c :element-type 'uint32)))\n    (dotimes (i a)\n      (setf (aref ps i) (read-fixnum)))\n    (dotimes (i b)\n      (setf (aref qs i) (read-fixnum)))\n    (dotimes (i c)\n      (setf (aref rs i) (read-fixnum)))\n    (setq ps (%sort ps)\n          qs (%sort qs)\n          rs (%sort rs))\n    (let ((cumuls-red (make-array (+ 1 a) :element-type 'uint62))\n          (cumuls-colorless (make-array (+ 1 c) :element-type 'uint62))\n          (dp (make-itreap b :initial-contents qs))\n          (res 0))\n      (dotimes (i a)\n        (setf (aref cumuls-red (+ i 1))\n              (+ (aref cumuls-red i) (aref ps i))))\n      (dotimes (i c)\n        (setf (aref cumuls-colorless (+ i 1))\n              (+ (aref cumuls-colorless i) (aref rs i))))\n      #>cumuls-red\n      #>cumuls-colorless\n      (loop for k from c downto 0\n            do (unless (= k c)\n                 (setq dp (itreap-insort dp (aref rs k) #'>)))\n               #>dp\n               (when (<= k x)\n                 ;; 先頭k個を赤に塗る。赤からは上位x-k個を選ぶ\n                 (maxf res (+ (aref cumuls-red (- x k))\n                              (aref cumuls-colorless k)\n                              #>(itreap-query dp 0 (min y (itreap-count dp)))))))\n      (println res))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1 2 2 2 1\n2 4\n5 1\n3\n\"\n    \"12\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 2 2 2 2\n8 6\n9 1\n2 1\n\"\n    \"25\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\"\n    \"74\n\")))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 26484, "cpu_time_ms": 635, "memory_kb": 74340}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s466875994", "group_id": "codeNet:p02743", "input_text": "(let ((a (read))\n      (b (read))\n      (c (read)))\n  (if (and (< 0 (- c a b))\n           (< (* 4 a b) (expt (- c a b) 2)))              \n      (format t \"Yes~%\")\n      (format t \"No~%\")))\n", "language": "Lisp", "metadata": {"date": 1594258945, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s466875994.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s466875994", "user_id": "u608227593"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let ((a (read))\n      (b (read))\n      (c (read)))\n  (if (and (< 0 (- c a b))\n           (< (* 4 a b) (expt (- c a b) 2)))              \n      (format t \"Yes~%\")\n      (format t \"No~%\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 189, "cpu_time_ms": 16, "memory_kb": 23184}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s186804404", "group_id": "codeNet:p02743", "input_text": "(let* ((a (read))\n       (b (read))\n       (c (read))\n       (x (- c (+ a b))))\n  (if (and (< 0 x)\n           (< (* 4 a b) (expt x 2)))\n      (princ \"Yes\")\n      (princ \"No\")))", "language": "Lisp", "metadata": {"date": 1584245593, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s186804404.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s186804404", "user_id": "u606976120"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let* ((a (read))\n       (b (read))\n       (c (read))\n       (x (- c (+ a b))))\n  (if (and (< 0 x)\n           (< (* 4 a b) (expt x 2)))\n      (princ \"Yes\")\n      (princ \"No\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 176, "cpu_time_ms": 475, "memory_kb": 11876}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s182465659", "group_id": "codeNet:p02743", "input_text": "(let* ((a (read))\n       (b (read))\n       (c (read))\n       (x (- c (+ a b))))\n  (if (or (< 0 x)\n          (< (* 4 a b) (expt x 2)))\n      (princ \"Yes\")\n      (princ \"No\")))", "language": "Lisp", "metadata": {"date": 1584245529, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s182465659.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s182465659", "user_id": "u606976120"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let* ((a (read))\n       (b (read))\n       (c (read))\n       (x (- c (+ a b))))\n  (if (or (< 0 x)\n          (< (* 4 a b) (expt x 2)))\n      (princ \"Yes\")\n      (princ \"No\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 360, "memory_kb": 12004}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s008510136", "group_id": "codeNet:p02743", "input_text": "(let* ((a (read))\n       (b (read))\n       (c (read))\n       (x (- (+ a b) c)))\n  (if (and (< 0 x)\n           (< (expt x 2) (* 4 a b)))\n      (princ \"Yes\")\n      (princ \"No\")))\n", "language": "Lisp", "metadata": {"date": 1584245394, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s008510136.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s008510136", "user_id": "u606976120"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let* ((a (read))\n       (b (read))\n       (c (read))\n       (x (- (+ a b) c)))\n  (if (and (< 0 x)\n           (< (expt x 2) (* 4 a b)))\n      (princ \"Yes\")\n      (princ \"No\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 177, "cpu_time_ms": 14, "memory_kb": 3684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s081102425", "group_id": "codeNet:p02743", "input_text": "(let* ((a (read))\n       (b (read))\n       (c (read))\n       (x (- (+ a b) c)))\n  (if (or (< 0 x)\n          (< (expt x 2) (* 4 a b)))\n      (princ \"Yes\")\n      (princ \"No\")))", "language": "Lisp", "metadata": {"date": 1584245136, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s081102425.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s081102425", "user_id": "u606976120"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let* ((a (read))\n       (b (read))\n       (c (read))\n       (x (- (+ a b) c)))\n  (if (or (< 0 x)\n          (< (expt x 2) (* 4 a b)))\n      (princ \"Yes\")\n      (princ \"No\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 630, "memory_kb": 11876}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s046412271", "group_id": "codeNet:p02743", "input_text": "(defun sqrt-inequality ()\n  (let ((a (read))\n        (b (read))\n        (c (read))\n        (ans \"No\"))\n    (if (and (< 0 (- c a b)) (< (* 4 a b) (expt (- c a b) 2)))\n      (setf ans \"Yes\"))\n    ans))\n\n(format t \"~A~%\" (sqrt-inequality))", "language": "Lisp", "metadata": {"date": 1584242788, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s046412271.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s046412271", "user_id": "u091381267"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(defun sqrt-inequality ()\n  (let ((a (read))\n        (b (read))\n        (c (read))\n        (ans \"No\"))\n    (if (and (< 0 (- c a b)) (< (* 4 a b) (expt (- c a b) 2)))\n      (setf ans \"Yes\"))\n    ans))\n\n(format t \"~A~%\" (sqrt-inequality))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 236, "cpu_time_ms": 105, "memory_kb": 11876}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s424657800", "group_id": "codeNet:p02743", "input_text": "(let ((A (read))\n      (B (read))\n      (C (read)))\n  (format t \"~A\"\n\t  (if (> 0 (-(+ A B (* 2 (sqrt (* A B)))) C)) \"Yes\" \"No\")))", "language": "Lisp", "metadata": {"date": 1584239671, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s424657800.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s424657800", "user_id": "u334552723"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let ((A (read))\n      (B (read))\n      (C (read)))\n  (format t \"~A\"\n\t  (if (> 0 (-(+ A B (* 2 (sqrt (* A B)))) C)) \"Yes\" \"No\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 129, "cpu_time_ms": 356, "memory_kb": 12388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s559003363", "group_id": "codeNet:p02743", "input_text": "(format t \"~:[No~;Yes~]~%\"\n\t(let* ((a (read))\n\t       (b (read))\n\t       (c (read))\n\t       (d (- c a b)))\n\t  (and (plusp d)\n\t       (< (* 4 a b) (expt d 2)))))", "language": "Lisp", "metadata": {"date": 1584239598, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s559003363.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s559003363", "user_id": "u320993798"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(format t \"~:[No~;Yes~]~%\"\n\t(let* ((a (read))\n\t       (b (read))\n\t       (c (read))\n\t       (d (- c a b)))\n\t  (and (plusp d)\n\t       (< (* 4 a b) (expt d 2)))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 160, "cpu_time_ms": 126, "memory_kb": 12004}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s647269046", "group_id": "codeNet:p02743", "input_text": "(format t \"~:[No~;Yes~]~%\"\n\t(let ((a (read))\n\t      (b (read))\n\t      (c (read)))\n\t  (< (* 4 a b) (expt (- c a b) 2))))", "language": "Lisp", "metadata": {"date": 1584239185, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s647269046.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s647269046", "user_id": "u320993798"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(format t \"~:[No~;Yes~]~%\"\n\t(let ((a (read))\n\t      (b (read))\n\t      (c (read)))\n\t  (< (* 4 a b) (expt (- c a b) 2))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 119, "cpu_time_ms": 115, "memory_kb": 11744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s114499263", "group_id": "codeNet:p02743", "input_text": "(format t \"~A\"\n\t(if (> 0 (-(+ (sqrt (read)) (sqrt (read)))(sqrt (read)))) \"Yes\" \"No\"))", "language": "Lisp", "metadata": {"date": 1584238739, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s114499263.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s114499263", "user_id": "u334552723"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(format t \"~A\"\n\t(if (> 0 (-(+ (sqrt (read)) (sqrt (read)))(sqrt (read)))) \"Yes\" \"No\"))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 20, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s508167583", "group_id": "codeNet:p02743", "input_text": "(format t \"~A~%\"\n\t(if (> 0 (-(+ (sqrt (read)) (sqrt (read)))(sqrt (read)))) \"Yes\" \"No\"))", "language": "Lisp", "metadata": {"date": 1584236900, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s508167583.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s508167583", "user_id": "u334552723"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(format t \"~A~%\"\n\t(if (> 0 (-(+ (sqrt (read)) (sqrt (read)))(sqrt (read)))) \"Yes\" \"No\"))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 88, "cpu_time_ms": 16, "memory_kb": 3808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s054512040", "group_id": "codeNet:p02743", "input_text": "(defun sqrt-inequality ()\n  (let ((a (read))\n        (b (read))\n        (c (read))\n        (ans \"Yes\"))\n    (unless (< (+ (sqrt a) (sqrt b)) (sqrt c))\n      (setf ans \"No\"))\n    ans))\n\n(format t \"~A~%\" (sqrt-inequality))", "language": "Lisp", "metadata": {"date": 1584236569, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s054512040.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s054512040", "user_id": "u091381267"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(defun sqrt-inequality ()\n  (let ((a (read))\n        (b (read))\n        (c (read))\n        (ans \"Yes\"))\n    (unless (< (+ (sqrt a) (sqrt b)) (sqrt c))\n      (setf ans \"No\"))\n    ans))\n\n(format t \"~A~%\" (sqrt-inequality))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 220, "cpu_time_ms": 98, "memory_kb": 10720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s770643334", "group_id": "codeNet:p02743", "input_text": "(format t \"~:[No~;Yes~]~%\"\n\t(< (+ (sqrt (read)) (sqrt (read))) (sqrt (read))))", "language": "Lisp", "metadata": {"date": 1584235135, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s770643334.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s770643334", "user_id": "u320993798"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(format t \"~:[No~;Yes~]~%\"\n\t(< (+ (sqrt (read)) (sqrt (read))) (sqrt (read))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 78, "cpu_time_ms": 18, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s591069989", "group_id": "codeNet:p02743", "input_text": "(let ((a (read))\n      (b (read))\n      (c (read)))\n  (if (< (+ (sqrt a) (sqrt b)) (sqrt c))\n      (princ \"Yes\")\n      (princ \"No\")))", "language": "Lisp", "metadata": {"date": 1584234864, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s591069989.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s591069989", "user_id": "u606976120"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let ((a (read))\n      (b (read))\n      (c (read)))\n  (if (< (+ (sqrt a) (sqrt b)) (sqrt c))\n      (princ \"Yes\")\n      (princ \"No\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 133, "cpu_time_ms": 106, "memory_kb": 10336}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s540586793", "group_id": "codeNet:p02743", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((a (read))\n         (b (read))\n         (c (read)))\n    (write-line\n     (if (< (- c a b) 0)\n         \"No\"\n         (if (< (* 4 a b) (expt (- c a b) 2))\n             \"Yes\"\n             \"No\")))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 3 9\n\"\n    \"No\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 3 10\n\"\n    \"Yes\n\")))\n", "language": "Lisp", "metadata": {"date": 1584234446, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Lisp/s540586793.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s540586793", "user_id": "u352600849"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((a (read))\n         (b (read))\n         (c (read)))\n    (write-line\n     (if (< (- c a b) 0)\n         \"No\"\n         (if (< (* 4 a b) (expt (- c a b) 2))\n             \"Yes\"\n             \"No\")))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 3 9\n\"\n    \"No\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 3 10\n\"\n    \"Yes\n\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3739, "cpu_time_ms": 188, "memory_kb": 15712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s780345967", "group_id": "codeNet:p02761", "input_text": "(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (s (make-array `(,n) :element-type 'character :initial-element #\\0))\n         (c (make-array `(,(1+ n)) :initial-element nil)))\n    (if (/= n 1) (setf (aref s 0) #\\1))\n    (loop \n          :for i :from 1 :to m\n          :do (let ((x (read))\n                    (y (read)))\n                (when (and (aref c x) (/= (aref c x) y))\n                  (format t \"-1~%\")\n                  (return-from main))\n                (setf (aref c x) y)\n                (setf (aref s (1- x)) (code-char (+ y 48)))\n                (when (and (/= n 1) (= x 1) (= y 0))\n                  (format t \"-1~%\")\n                  (return-from main))))\n    (format t \"~A~%\" s)))\n(main)\n", "language": "Lisp", "metadata": {"date": 1593631338, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s780345967.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s780345967", "user_id": "u608227593"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (s (make-array `(,n) :element-type 'character :initial-element #\\0))\n         (c (make-array `(,(1+ n)) :initial-element nil)))\n    (if (/= n 1) (setf (aref s 0) #\\1))\n    (loop \n          :for i :from 1 :to m\n          :do (let ((x (read))\n                    (y (read)))\n                (when (and (aref c x) (/= (aref c x) y))\n                  (format t \"-1~%\")\n                  (return-from main))\n                (setf (aref c x) y)\n                (setf (aref s (1- x)) (code-char (+ y 48)))\n                (when (and (/= n 1) (= x 1) (= y 0))\n                  (format t \"-1~%\")\n                  (return-from main))))\n    (format t \"~A~%\" s)))\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 726, "cpu_time_ms": 18, "memory_kb": 23588}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s173501229", "group_id": "codeNet:p02761", "input_text": "(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (s (make-array `(,n) :element-type 'character :initial-element #\\0))\n         (c (make-array `(,(1+ n)) :initial-element nil)))\n    (setf (aref s 0) #\\1)\n    (loop \n          :for i :from 1 :to m\n          :do (let ((x (read))\n                    (y (read)))\n                (when (and (aref c x) (/= (aref c x) y))\n                  (format t \"-1~%\")\n                  (return-from main))\n                (setf (aref c x) y)\n                (setf (aref s (1- x)) (code-char (+ y 48)))\n                (when (and (/= n 1) (= x 1) (= y 0))\n                  (format t \"-1~%\")\n                  (return-from main))))\n    (format t \"~A~%\" s)))\n(main)\n", "language": "Lisp", "metadata": {"date": 1593631010, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s173501229.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s173501229", "user_id": "u608227593"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (s (make-array `(,n) :element-type 'character :initial-element #\\0))\n         (c (make-array `(,(1+ n)) :initial-element nil)))\n    (setf (aref s 0) #\\1)\n    (loop \n          :for i :from 1 :to m\n          :do (let ((x (read))\n                    (y (read)))\n                (when (and (aref c x) (/= (aref c x) y))\n                  (format t \"-1~%\")\n                  (return-from main))\n                (setf (aref c x) y)\n                (setf (aref s (1- x)) (code-char (+ y 48)))\n                (when (and (/= n 1) (= x 1) (= y 0))\n                  (format t \"-1~%\")\n                  (return-from main))))\n    (format t \"~A~%\" s)))\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 712, "cpu_time_ms": 19, "memory_kb": 23624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s944073986", "group_id": "codeNet:p02761", "input_text": "(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (s (make-array `(,n) :element-type 'character :initial-element #\\0))\n         (c (make-array `(,(1+ n)) :initial-element nil)))\n    (setf (aref s 0) #\\1)\n    (loop \n          :for i :from 1 :to m\n          :do (let ((x (read))\n                    (y (read)))\n                (when (and (aref c x) (/= (aref c x) y))\n                  (format t \"-1~%\")\n                  (return-from main))\n                (setf (aref c x) y)\n                (setf (aref s (1- x)) (code-char (+ y 48)))\n                (when (and (= x 1) (= y 0))\n                  (format t \"-1~%\")\n                  (return-from main))))\n    (format t \"~A~%\" s)))\n(main)\n", "language": "Lisp", "metadata": {"date": 1593630847, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s944073986.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s944073986", "user_id": "u608227593"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (s (make-array `(,n) :element-type 'character :initial-element #\\0))\n         (c (make-array `(,(1+ n)) :initial-element nil)))\n    (setf (aref s 0) #\\1)\n    (loop \n          :for i :from 1 :to m\n          :do (let ((x (read))\n                    (y (read)))\n                (when (and (aref c x) (/= (aref c x) y))\n                  (format t \"-1~%\")\n                  (return-from main))\n                (setf (aref c x) y)\n                (setf (aref s (1- x)) (code-char (+ y 48)))\n                (when (and (= x 1) (= y 0))\n                  (format t \"-1~%\")\n                  (return-from main))))\n    (format t \"~A~%\" s)))\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 703, "cpu_time_ms": 21, "memory_kb": 23680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s217766621", "group_id": "codeNet:p02761", "input_text": "(defstruct const s c)\n\n(defun solve (N M lst)\n  (loop named outer \n        for i from (if (= N 1) 0 (expt 10 (1- N)))\n        to (1- (expt 10 N)) do\n        (loop for x in lst\n              with vec = (concatenate 'vector (princ-to-string i))\n              unless (eq (aref vec (const-s x))\n                         (const-c x))\n              return nil\n              finally (return-from outer i))\n        finally (return-from outer -1)))\n\n\n(let ((N (read))\n      (M (read)))\n     (princ (solve N M\n                   (loop repeat M\n                         collect (make-const :s (1- (read)) :c (read-char))))))", "language": "Lisp", "metadata": {"date": 1588192801, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s217766621.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s217766621", "user_id": "u334552723"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defstruct const s c)\n\n(defun solve (N M lst)\n  (loop named outer \n        for i from (if (= N 1) 0 (expt 10 (1- N)))\n        to (1- (expt 10 N)) do\n        (loop for x in lst\n              with vec = (concatenate 'vector (princ-to-string i))\n              unless (eq (aref vec (const-s x))\n                         (const-c x))\n              return nil\n              finally (return-from outer i))\n        finally (return-from outer -1)))\n\n\n(let ((N (read))\n      (M (read)))\n     (princ (solve N M\n                   (loop repeat M\n                         collect (make-const :s (1- (read)) :c (read-char))))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 613, "cpu_time_ms": 32, "memory_kb": 8676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s056512181", "group_id": "codeNet:p02761", "input_text": "(defvar N)\n(defvar M)\n(defvar arr)\n(setf N (read)\n      M (read)\n      arr (make-array (1+ N)\n                      :initial-element nil)\n      (aref arr 0) 'dummy)\n\n(defun input ()\n  (loop with Si\n        and Ci\n        repeat M do\n        (setf Si (read)\n              Ci (read))\n        (if #1=(aref arr Si)\n            (if (/= #1# Ci)\n                (return nil))\n            (setf #1# Ci))\n        finally (return t)))\n     \n(defun output ()\n  (if (null #2=(aref arr 1)) (setf #2# 1))\n  (if (zerop #2#)\n      (princ -1)\n      (loop with x = 0\n            repeat N\n            do\n            (princ (or (aref arr (incf x)) \n                       0 )))))\n\n     \n\n(if (input) \n    (output) \n    (princ -1))", "language": "Lisp", "metadata": {"date": 1585326290, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s056512181.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s056512181", "user_id": "u334552723"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defvar N)\n(defvar M)\n(defvar arr)\n(setf N (read)\n      M (read)\n      arr (make-array (1+ N)\n                      :initial-element nil)\n      (aref arr 0) 'dummy)\n\n(defun input ()\n  (loop with Si\n        and Ci\n        repeat M do\n        (setf Si (read)\n              Ci (read))\n        (if #1=(aref arr Si)\n            (if (/= #1# Ci)\n                (return nil))\n            (setf #1# Ci))\n        finally (return t)))\n     \n(defun output ()\n  (if (null #2=(aref arr 1)) (setf #2# 1))\n  (if (zerop #2#)\n      (princ -1)\n      (loop with x = 0\n            repeat N\n            do\n            (princ (or (aref arr (incf x)) \n                       0 )))))\n\n     \n\n(if (input) \n    (output) \n    (princ -1))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 710, "cpu_time_ms": 27, "memory_kb": 6628}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s606801666", "group_id": "codeNet:p02761", "input_text": ";; C - Guess The Number\n\n(defun solve (n sc)\n  (let ((buf (make-array n :initial-element nil)))\n    (loop for (s . c) in sc\n          for prev = (aref buf (1- s))\n       do (setf (aref buf (1- s))\n                (if (and prev (/= prev c)) 'error c)))\n    (if (or (find 'error buf) (eql (aref buf 0) 0))\n        -1\n        (loop for i below n\n          unless (aref buf i)\n              do (setf (aref buf i) (if (and (= i 0) (> n 1)) 1 0))\n          finally (return (map 'string #'digit-char buf))))))\n\n(let* ((n  (read))\n       (m  (read))\n       (sc (loop repeat m collect (cons (read) (read)))))\n  (princ (solve n sc)))\n", "language": "Lisp", "metadata": {"date": 1584458471, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s606801666.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s606801666", "user_id": "u227020436"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": ";; C - Guess The Number\n\n(defun solve (n sc)\n  (let ((buf (make-array n :initial-element nil)))\n    (loop for (s . c) in sc\n          for prev = (aref buf (1- s))\n       do (setf (aref buf (1- s))\n                (if (and prev (/= prev c)) 'error c)))\n    (if (or (find 'error buf) (eql (aref buf 0) 0))\n        -1\n        (loop for i below n\n          unless (aref buf i)\n              do (setf (aref buf i) (if (and (= i 0) (> n 1)) 1 0))\n          finally (return (map 'string #'digit-char buf))))))\n\n(let* ((n  (read))\n       (m  (read))\n       (sc (loop repeat m collect (cons (read) (read)))))\n  (princ (solve n sc)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 624, "cpu_time_ms": 156, "memory_kb": 15328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s499512476", "group_id": "codeNet:p02761", "input_text": ";; C - Guess The Number\n\n(defun solve (n sc)\n  (loop for i from 0 below (expt 10 n)\n        for digits = (map 'vector #'digit-char-p (princ-to-string i))\n     when (and (= (length digits) n)\n               (zerop\n                 (loop for (s . c) in sc\n                   count (not (eql c (aref digits (1- s)))))))\n     do (return i)\n     finally (return -1)))\n\n(let* ((n  (read))\n       (m  (read))\n       (sc (loop repeat m collect (cons (read) (read)))))\n  (princ (solve n sc)))\n", "language": "Lisp", "metadata": {"date": 1584286297, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s499512476.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s499512476", "user_id": "u227020436"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": ";; C - Guess The Number\n\n(defun solve (n sc)\n  (loop for i from 0 below (expt 10 n)\n        for digits = (map 'vector #'digit-char-p (princ-to-string i))\n     when (and (= (length digits) n)\n               (zerop\n                 (loop for (s . c) in sc\n                   count (not (eql c (aref digits (1- s)))))))\n     do (return i)\n     finally (return -1)))\n\n(let* ((n  (read))\n       (m  (read))\n       (sc (loop repeat m collect (cons (read) (read)))))\n  (princ (solve n sc)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 484, "cpu_time_ms": 26, "memory_kb": 6884}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s554475555", "group_id": "codeNet:p02761", "input_text": ";; C - Guess The Number\n\n(defun solve (n sc)\n  (loop for i from 0 below (expt 10 n)\n        for digits = (map 'array #'digit-char-p (princ-to-string i))\n     when (and (= (length digits) n)\n               (zerop\n                 (loop for (s . c) in sc\n                   count (not (eql c (aref digits (1- s)))))))\n     do (return i)\n     finally (return -1)))\n\n(let* ((n  (read))\n       (m  (read))\n       (sc (loop repeat m collect (cons (read) (read)))))\n  (princ (solve n sc)))\n", "language": "Lisp", "metadata": {"date": 1584286241, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s554475555.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s554475555", "user_id": "u227020436"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": ";; C - Guess The Number\n\n(defun solve (n sc)\n  (loop for i from 0 below (expt 10 n)\n        for digits = (map 'array #'digit-char-p (princ-to-string i))\n     when (and (= (length digits) n)\n               (zerop\n                 (loop for (s . c) in sc\n                   count (not (eql c (aref digits (1- s)))))))\n     do (return i)\n     finally (return -1)))\n\n(let* ((n  (read))\n       (m  (read))\n       (sc (loop repeat m collect (cons (read) (read)))))\n  (princ (solve n sc)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 483, "cpu_time_ms": 57, "memory_kb": 9060}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s394960465", "group_id": "codeNet:p02761", "input_text": "(defun reads (num)\n  (loop as i \n        below num \n        collect (list (read) (read))))\n\n(defun set-num (n l ht)\n    (loop as point ; (rank value)\n          in l ; (list (rank value))\n          do (cond ((< n (car point)) (setf (gethash 'check ht) T)); nより大きい桁に入れようとするとアウト\n                   ((and (not (= n 1))\n                         (= 1 (car point))\n                         (= 0 (cadr point))) (setf (gethash 'check ht) T)); nに0を入れようとしたらアウト\n                   ((not (gethash (car point) ht)) (setf (gethash (car point) ht) (cadr point))); まだ入っていないのでOK\n                   ((not (= (gethash (car point) ht) (cadr point))) (setf (gethash 'check ht) T))))); 入っていて値が異なるのでアウト\n\n(defun get-number (n ht)\n  (loop as i\n        below n\n        collect (* (expt 10 (- n i 1))\n                   (if (gethash (+ i 1) ht)\n                       (gethash (+ i 1) ht)\n                       (if (= i 0) 1 0)))))\n\n\n(let ((n (read))\n      (c (reads (read)))\n      (ht (make-hash-table)))\n  (set-num n c ht)\n  (if (gethash 'check ht)\n      (princ (- 0 1))\n      (princ (reduce (lambda (m x) (+ m x)) (get-number n ht)))))\n", "language": "Lisp", "metadata": {"date": 1583982296, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s394960465.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s394960465", "user_id": "u606976120"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun reads (num)\n  (loop as i \n        below num \n        collect (list (read) (read))))\n\n(defun set-num (n l ht)\n    (loop as point ; (rank value)\n          in l ; (list (rank value))\n          do (cond ((< n (car point)) (setf (gethash 'check ht) T)); nより大きい桁に入れようとするとアウト\n                   ((and (not (= n 1))\n                         (= 1 (car point))\n                         (= 0 (cadr point))) (setf (gethash 'check ht) T)); nに0を入れようとしたらアウト\n                   ((not (gethash (car point) ht)) (setf (gethash (car point) ht) (cadr point))); まだ入っていないのでOK\n                   ((not (= (gethash (car point) ht) (cadr point))) (setf (gethash 'check ht) T))))); 入っていて値が異なるのでアウト\n\n(defun get-number (n ht)\n  (loop as i\n        below n\n        collect (* (expt 10 (- n i 1))\n                   (if (gethash (+ i 1) ht)\n                       (gethash (+ i 1) ht)\n                       (if (= i 0) 1 0)))))\n\n\n(let ((n (read))\n      (c (reads (read)))\n      (ht (make-hash-table)))\n  (set-num n c ht)\n  (if (gethash 'check ht)\n      (princ (- 0 1))\n      (princ (reduce (lambda (m x) (+ m x)) (get-number n ht)))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1224, "cpu_time_ms": 170, "memory_kb": 15844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s742131196", "group_id": "codeNet:p02761", "input_text": "(defun reads (num)\n  (loop as i \n        below num \n        collect (list (read) (read))))\n\n(defun set-num (n l ht)\n    (loop as point ; (rank value)\n          in l ; (list (rank value))\n          do (cond ((< n (car point)) (setf (gethash 'check ht) T)); nより大きい桁に入れようとするとアウト\n                   ((and (not (= n 1))\n                         (= n (car point))\n                         (= 0 (cadr point))) (setf (gethash 'check ht) T)); nに0を入れようとしたらアウト\n                   ((not (gethash (car point) ht)) (setf (gethash (car point) ht) (cadr point))); まだ入っていないのでOK\n                   ((not (= (gethash (car point) ht) (cadr point))) (setf (gethash 'check ht) T))))); 入っていて値が異なるのでアウト\n\n(defun get-number (n ht)\n  (loop as i\n        below n\n        collect (* (expt 10 (- n i 1))\n                   (if (gethash (+ i 1) ht)\n                       (gethash (+ i 1) ht)\n                       (if (= i 0) 1 0)))))\n\n\n(let ((n (read))\n      (c (reads (read)))\n      (ht (make-hash-table)))\n  (set-num n c ht)\n  (if (gethash 'check ht)\n      (princ (- 0 1))\n      (princ (reduce (lambda (m x) (+ m x)) (get-number n ht)))))\n", "language": "Lisp", "metadata": {"date": 1583981925, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s742131196.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s742131196", "user_id": "u606976120"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun reads (num)\n  (loop as i \n        below num \n        collect (list (read) (read))))\n\n(defun set-num (n l ht)\n    (loop as point ; (rank value)\n          in l ; (list (rank value))\n          do (cond ((< n (car point)) (setf (gethash 'check ht) T)); nより大きい桁に入れようとするとアウト\n                   ((and (not (= n 1))\n                         (= n (car point))\n                         (= 0 (cadr point))) (setf (gethash 'check ht) T)); nに0を入れようとしたらアウト\n                   ((not (gethash (car point) ht)) (setf (gethash (car point) ht) (cadr point))); まだ入っていないのでOK\n                   ((not (= (gethash (car point) ht) (cadr point))) (setf (gethash 'check ht) T))))); 入っていて値が異なるのでアウト\n\n(defun get-number (n ht)\n  (loop as i\n        below n\n        collect (* (expt 10 (- n i 1))\n                   (if (gethash (+ i 1) ht)\n                       (gethash (+ i 1) ht)\n                       (if (= i 0) 1 0)))))\n\n\n(let ((n (read))\n      (c (reads (read)))\n      (ht (make-hash-table)))\n  (set-num n c ht)\n  (if (gethash 'check ht)\n      (princ (- 0 1))\n      (princ (reduce (lambda (m x) (+ m x)) (get-number n ht)))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1224, "cpu_time_ms": 21, "memory_kb": 6504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s489607260", "group_id": "codeNet:p02761", "input_text": "(defun reads (num)\n  (loop as i \n        below num \n        collect (list (read) (read))))\n\n(defun set-num (n l ht)\n    (loop as point ; (rank value)\n          in l ; (list (rank value))\n          do (cond ((< n (car point)) (setf (gethash 'check ht) T)); nより大きい桁に入れようとするとアウト\n                   ((and (= n (car point))\n                         (= 0 (cadr point))) (setf (gethash 'check ht) T)); nに0を入れようとしたらアウト\n                   ((not (gethash (car point) ht)) (setf (gethash (car point) ht) (cadr point))); まだ入っていないのでOK\n                   ((not (= (gethash (car point) ht) (cadr point))) (setf (gethash 'check ht) T))))); 入っていて値が異なるのでアウト\n\n(defun get-number (n ht)\n  (loop as i\n        below n\n        collect (* (expt 10 (- n i 1))\n                   (if (gethash (+ i 1) ht)\n                       (gethash (+ i 1) ht)\n                       (if (= i 0) 1 0)))))\n\n\n(let ((n (read))\n      (c (reads (read)))\n      (ht (make-hash-table)))\n  (set-num n c ht)\n  (if (gethash 'check ht)\n      (princ (- 0 1))\n      (princ (reduce (lambda (m x) (+ m x)) (get-number n ht)))))\n", "language": "Lisp", "metadata": {"date": 1583981660, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s489607260.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s489607260", "user_id": "u606976120"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun reads (num)\n  (loop as i \n        below num \n        collect (list (read) (read))))\n\n(defun set-num (n l ht)\n    (loop as point ; (rank value)\n          in l ; (list (rank value))\n          do (cond ((< n (car point)) (setf (gethash 'check ht) T)); nより大きい桁に入れようとするとアウト\n                   ((and (= n (car point))\n                         (= 0 (cadr point))) (setf (gethash 'check ht) T)); nに0を入れようとしたらアウト\n                   ((not (gethash (car point) ht)) (setf (gethash (car point) ht) (cadr point))); まだ入っていないのでOK\n                   ((not (= (gethash (car point) ht) (cadr point))) (setf (gethash 'check ht) T))))); 入っていて値が異なるのでアウト\n\n(defun get-number (n ht)\n  (loop as i\n        below n\n        collect (* (expt 10 (- n i 1))\n                   (if (gethash (+ i 1) ht)\n                       (gethash (+ i 1) ht)\n                       (if (= i 0) 1 0)))))\n\n\n(let ((n (read))\n      (c (reads (read)))\n      (ht (make-hash-table)))\n  (set-num n c ht)\n  (if (gethash 'check ht)\n      (princ (- 0 1))\n      (princ (reduce (lambda (m x) (+ m x)) (get-number n ht)))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1185, "cpu_time_ms": 31, "memory_kb": 7008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s666511130", "group_id": "codeNet:p02761", "input_text": "(defun reads (num)\n  (loop as i \n        below num \n        collect (list (read) (read))))\n\n(let* ((n (read))\n       (m (read))\n       (c (reads m)))\n  (princ c))", "language": "Lisp", "metadata": {"date": 1583978325, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s666511130.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s666511130", "user_id": "u606976120"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun reads (num)\n  (loop as i \n        below num \n        collect (list (read) (read))))\n\n(let* ((n (read))\n       (m (read))\n       (c (reads m)))\n  (princ c))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 162, "cpu_time_ms": 44, "memory_kb": 6120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s176103947", "group_id": "codeNet:p02761", "input_text": "(let* ((n (read))\n       (m (read))\n       (lst (loop :repeat m :collect (cons (1- (read)) (read-char)))))\n  (if (= n 1)\n      (loop :for k :from 0 :upto 9\n            :do(print k)\n            :if (loop :for (x . y) :in lst\n                      :with j = (format nil \"~A\" k)\n                      :always (char= y (aref j x)))\n              :do (progn (princ k) (return))\n            :finally (princ -1))\n      (loop :for k :from (expt 10 (1- n)) :upto (1- (expt 10 n))\n            :do(print k)\n            :if (loop :for (x . y) :in lst\n                      :with j = (format nil \"~A\" k)\n                      :always (char= y (aref j x)))\n              :do (progn (princ k) (return))\n            :finally (princ -1))))", "language": "Lisp", "metadata": {"date": 1583795320, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s176103947.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s176103947", "user_id": "u610490393"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (lst (loop :repeat m :collect (cons (1- (read)) (read-char)))))\n  (if (= n 1)\n      (loop :for k :from 0 :upto 9\n            :do(print k)\n            :if (loop :for (x . y) :in lst\n                      :with j = (format nil \"~A\" k)\n                      :always (char= y (aref j x)))\n              :do (progn (princ k) (return))\n            :finally (princ -1))\n      (loop :for k :from (expt 10 (1- n)) :upto (1- (expt 10 n))\n            :do(print k)\n            :if (loop :for (x . y) :in lst\n                      :with j = (format nil \"~A\" k)\n                      :always (char= y (aref j x)))\n              :do (progn (princ k) (return))\n            :finally (princ -1))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 722, "cpu_time_ms": 172, "memory_kb": 17248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s056566663", "group_id": "codeNet:p02761", "input_text": "(let* ((n (read))\n       (m (read))\n       (lst (loop :repeat m :collect (cons (1- (read)) (read-char)))))\n  (loop :for k :from (expt 10 (1- n)) :upto (1- (expt 10 n))\n        :if (loop :for (x . y) :in lst\n                  :with j = (format nil \"~A\" k)\n                  :always (char= y (aref j x)))\n          :do (progn (princ k) (return))\n          :finally (princ -1)))", "language": "Lisp", "metadata": {"date": 1583795090, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s056566663.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s056566663", "user_id": "u610490393"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (lst (loop :repeat m :collect (cons (1- (read)) (read-char)))))\n  (loop :for k :from (expt 10 (1- n)) :upto (1- (expt 10 n))\n        :if (loop :for (x . y) :in lst\n                  :with j = (format nil \"~A\" k)\n                  :always (char= y (aref j x)))\n          :do (progn (princ k) (return))\n          :finally (princ -1)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 375, "cpu_time_ms": 129, "memory_kb": 16100}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s692052800", "group_id": "codeNet:p02761", "input_text": "(defun split (str)\n  (labels ((inner (rest-str-list stack-str-list temp-out)\n                  (if rest-str-list\n                      (let ((now-char (car rest-str-list)))\n                        (cond ((eq #\\space now-char) (inner (cdr rest-str-list)\n                                                            '()\n                                                            (cons (concatenate 'string (reverse stack-str-list))\n                                                                  temp-out)))\n                              (t (inner (cdr rest-str-list)\n                                        (cons now-char stack-str-list)\n                                        temp-out))))\n                      (reverse (cons (concatenate 'string (reverse stack-str-list))\n                                     temp-out)))))\n          (inner (concatenate 'list str)\n                 '()\n                 '())))\n\n(defun input-to-list (str)\n  (mapcar #'parse-integer (split str)))\n\n(defvar nm (input-to-list (read-line)))\n(defvar sc (loop for i from 1 to (cadr nm)\n                 collect (input-to-list (read-line))))\n\n(defun setnumlst (num-l index num)\n  (if (and (zerop num)\n           (eq 1 index)\n           (not (eq 1 (length num-l))))\n      nil\n      (if (nth (1- index) num-l)\n          (if (eq num (nth (1- index) num-l))\n              num-l\n              nil)\n          (concatenate 'list (subseq num-l 0 (1- index))\n                       `(,num)\n                       (subseq num-l (1+ (1- index)))))))\n\n\n(defun fill-first (num-l)\n  (if (car num-l)\n      num-l\n      (concatenate 'list '(,(if (eq 1 (length num-l)) 0 1)) (subseq num-l 1))))\n\n(defun fill-rest (num-l)\n  (loop for num in num-l\n        collect (if num\n                    num\n                    0)))\n\n(defun setup (num-l set-l)\n  (if set-l\n      (let ((next-num-l (setnumlst num-l (caar set-l) (cadar set-l))))\n        (if next-num-l\n            (setup next-num-l (cdr set-l))\n            nil))\n      num-l))\n\n(princ (let ((set-num-l (setup (loop for i from 1 to (car nm) collect nil) sc)))\n         (if set-num-l\n             (parse-integer (apply #'concatenate (cons 'string (loop for num in (fill-rest (fill-first set-num-l))\n                                                                     collect (princ-to-string num)))))\n             -1)))", "language": "Lisp", "metadata": {"date": 1583122097, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s692052800.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s692052800", "user_id": "u250100102"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun split (str)\n  (labels ((inner (rest-str-list stack-str-list temp-out)\n                  (if rest-str-list\n                      (let ((now-char (car rest-str-list)))\n                        (cond ((eq #\\space now-char) (inner (cdr rest-str-list)\n                                                            '()\n                                                            (cons (concatenate 'string (reverse stack-str-list))\n                                                                  temp-out)))\n                              (t (inner (cdr rest-str-list)\n                                        (cons now-char stack-str-list)\n                                        temp-out))))\n                      (reverse (cons (concatenate 'string (reverse stack-str-list))\n                                     temp-out)))))\n          (inner (concatenate 'list str)\n                 '()\n                 '())))\n\n(defun input-to-list (str)\n  (mapcar #'parse-integer (split str)))\n\n(defvar nm (input-to-list (read-line)))\n(defvar sc (loop for i from 1 to (cadr nm)\n                 collect (input-to-list (read-line))))\n\n(defun setnumlst (num-l index num)\n  (if (and (zerop num)\n           (eq 1 index)\n           (not (eq 1 (length num-l))))\n      nil\n      (if (nth (1- index) num-l)\n          (if (eq num (nth (1- index) num-l))\n              num-l\n              nil)\n          (concatenate 'list (subseq num-l 0 (1- index))\n                       `(,num)\n                       (subseq num-l (1+ (1- index)))))))\n\n\n(defun fill-first (num-l)\n  (if (car num-l)\n      num-l\n      (concatenate 'list '(,(if (eq 1 (length num-l)) 0 1)) (subseq num-l 1))))\n\n(defun fill-rest (num-l)\n  (loop for num in num-l\n        collect (if num\n                    num\n                    0)))\n\n(defun setup (num-l set-l)\n  (if set-l\n      (let ((next-num-l (setnumlst num-l (caar set-l) (cadar set-l))))\n        (if next-num-l\n            (setup next-num-l (cdr set-l))\n            nil))\n      num-l))\n\n(princ (let ((set-num-l (setup (loop for i from 1 to (car nm) collect nil) sc)))\n         (if set-num-l\n             (parse-integer (apply #'concatenate (cons 'string (loop for num in (fill-rest (fill-first set-num-l))\n                                                                     collect (princ-to-string num)))))\n             -1)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2329, "cpu_time_ms": 151, "memory_kb": 17768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s866767751", "group_id": "codeNet:p02761", "input_text": "(defun split (str)\n  (labels ((inner (rest-str-list stack-str-list temp-out)\n                  (if rest-str-list\n                      (let ((now-char (car rest-str-list)))\n                        (cond ((eq #\\space now-char) (inner (cdr rest-str-list)\n                                                            '()\n                                                            (cons (concatenate 'string (reverse stack-str-list))\n                                                                  temp-out)))\n                              (t (inner (cdr rest-str-list)\n                                        (cons now-char stack-str-list)\n                                        temp-out))))\n                      (reverse (cons (concatenate 'string (reverse stack-str-list))\n                                     temp-out)))))\n          (inner (concatenate 'list str)\n                 '()\n                 '())))\n\n(defun input-to-list (str)\n  (mapcar #'parse-integer (split str)))\n\n(defvar nm (input-to-list (read-line)))\n(defvar sc (loop for i from 1 to (cadr nm)\n                 collect (input-to-list (read-line))))\n\n(defun setnumlst (num-l index num)\n  (if (and (zerop num)\n           (eq 1 index))\n      nil\n      (if (nth (1- index) num-l)\n          (if (eq num (nth (1- index) num-l))\n              num-l\n              nil)\n          (concatenate 'list (subseq num-l 0 (1- index))\n                       `(,num)\n                       (subseq num-l (1+ (1- index)))))))\n\n\n(defun fill-first (num-l)\n  (if (car num-l)\n      num-l\n      (concatenate 'list '(1) (subseq num-l 1))))\n\n(defun fill-rest (num-l)\n  (loop for num in num-l\n        collect (if num\n                    num\n                    0)))\n\n(defun setup (num-l set-l)\n  (if set-l\n      (let ((next-num-l (setnumlst num-l (caar set-l) (cadar set-l))))\n        (if next-num-l\n            (setup next-num-l (cdr set-l))\n            nil))\n      num-l))\n\n(princ (let ((set-num-l (setup (loop for i from 1 to (car nm) collect nil) sc)))\n         (if set-num-l\n             (parse-integer (apply #'concatenate (cons 'string (loop for num in (fill-rest (fill-first set-num-l))\n                                                                     collect (princ-to-string num)))))\n             -1)))", "language": "Lisp", "metadata": {"date": 1583121552, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s866767751.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s866767751", "user_id": "u250100102"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun split (str)\n  (labels ((inner (rest-str-list stack-str-list temp-out)\n                  (if rest-str-list\n                      (let ((now-char (car rest-str-list)))\n                        (cond ((eq #\\space now-char) (inner (cdr rest-str-list)\n                                                            '()\n                                                            (cons (concatenate 'string (reverse stack-str-list))\n                                                                  temp-out)))\n                              (t (inner (cdr rest-str-list)\n                                        (cons now-char stack-str-list)\n                                        temp-out))))\n                      (reverse (cons (concatenate 'string (reverse stack-str-list))\n                                     temp-out)))))\n          (inner (concatenate 'list str)\n                 '()\n                 '())))\n\n(defun input-to-list (str)\n  (mapcar #'parse-integer (split str)))\n\n(defvar nm (input-to-list (read-line)))\n(defvar sc (loop for i from 1 to (cadr nm)\n                 collect (input-to-list (read-line))))\n\n(defun setnumlst (num-l index num)\n  (if (and (zerop num)\n           (eq 1 index))\n      nil\n      (if (nth (1- index) num-l)\n          (if (eq num (nth (1- index) num-l))\n              num-l\n              nil)\n          (concatenate 'list (subseq num-l 0 (1- index))\n                       `(,num)\n                       (subseq num-l (1+ (1- index)))))))\n\n\n(defun fill-first (num-l)\n  (if (car num-l)\n      num-l\n      (concatenate 'list '(1) (subseq num-l 1))))\n\n(defun fill-rest (num-l)\n  (loop for num in num-l\n        collect (if num\n                    num\n                    0)))\n\n(defun setup (num-l set-l)\n  (if set-l\n      (let ((next-num-l (setnumlst num-l (caar set-l) (cadar set-l))))\n        (if next-num-l\n            (setup next-num-l (cdr set-l))\n            nil))\n      num-l))\n\n(princ (let ((set-num-l (setup (loop for i from 1 to (car nm) collect nil) sc)))\n         (if set-num-l\n             (parse-integer (apply #'concatenate (cons 'string (loop for num in (fill-rest (fill-first set-num-l))\n                                                                     collect (princ-to-string num)))))\n             -1)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2260, "cpu_time_ms": 144, "memory_kb": 14432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s925449847", "group_id": "codeNet:p02761", "input_text": "(defun split (str)\n  (labels ((inner (rest-str-list stack-str-list temp-out)\n                  (if rest-str-list\n                      (let ((now-char (car rest-str-list)))\n                        (cond ((eq #\\space now-char) (inner (cdr rest-str-list)\n                                                            '()\n                                                            (cons (concatenate 'string (reverse stack-str-list))\n                                                                  temp-out)))\n                              (t (inner (cdr rest-str-list)\n                                        (cons now-char stack-str-list)\n                                        temp-out))))\n                      (reverse (cons (concatenate 'string (reverse stack-str-list))\n                                     temp-out)))))\n          (inner (concatenate 'list str)\n                 '()\n                 '())))\n\n(defun input-to-list (str)\n  (mapcar #'parse-integer (split str)))\n\n(defvar nm (input-to-list (read-line)))\n(defvar sc (loop for i from 1 to (cadr nm)\n                 collect (input-to-list (read-line))))\n\n(defun setnumlst (num-l index num)\n  (if (nth (1- index) num-l)\n      (if (eq num (nth (1- index) num-l))\n          num-l\n          nil)\n      (concatenate 'list (subseq num-l 0 (1- index))\n                   `(,num)\n                   (subseq num-l (1+ (1- index))))))\n\n\n(defun fill-first (num-l)\n  (if (car num-l)\n      num-l\n      (concatenate 'list '(1) (subseq num-l 1))))\n\n(defun fill-rest (num-l)\n  (loop for num in num-l\n        collect (if num\n                    num\n                    0)))\n\n(defun setup (num-l set-l)\n  (if set-l\n      (let ((next-num-l (setnumlst num-l (caar set-l) (cadar set-l))))\n        (if next-num-l\n            (setup next-num-l (cdr set-l))\n            nil))\n      num-l))\n\n(defun chk-first-num (num-l)\n  (if (zerop (car num-l))\n      nil\n      num-l))\n\n(princ (let ((set-num-l (chk-first-num (setup (loop for i from 1 to (car nm) collect nil) sc))))\n         (if set-num-l\n             (parse-integer (apply #'concatenate (cons 'string (loop for num in (fill-rest (fill-first set-num-l))\n                                                                    collect (princ-to-string num)))))\n             -1)))", "language": "Lisp", "metadata": {"date": 1583121235, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s925449847.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s925449847", "user_id": "u250100102"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun split (str)\n  (labels ((inner (rest-str-list stack-str-list temp-out)\n                  (if rest-str-list\n                      (let ((now-char (car rest-str-list)))\n                        (cond ((eq #\\space now-char) (inner (cdr rest-str-list)\n                                                            '()\n                                                            (cons (concatenate 'string (reverse stack-str-list))\n                                                                  temp-out)))\n                              (t (inner (cdr rest-str-list)\n                                        (cons now-char stack-str-list)\n                                        temp-out))))\n                      (reverse (cons (concatenate 'string (reverse stack-str-list))\n                                     temp-out)))))\n          (inner (concatenate 'list str)\n                 '()\n                 '())))\n\n(defun input-to-list (str)\n  (mapcar #'parse-integer (split str)))\n\n(defvar nm (input-to-list (read-line)))\n(defvar sc (loop for i from 1 to (cadr nm)\n                 collect (input-to-list (read-line))))\n\n(defun setnumlst (num-l index num)\n  (if (nth (1- index) num-l)\n      (if (eq num (nth (1- index) num-l))\n          num-l\n          nil)\n      (concatenate 'list (subseq num-l 0 (1- index))\n                   `(,num)\n                   (subseq num-l (1+ (1- index))))))\n\n\n(defun fill-first (num-l)\n  (if (car num-l)\n      num-l\n      (concatenate 'list '(1) (subseq num-l 1))))\n\n(defun fill-rest (num-l)\n  (loop for num in num-l\n        collect (if num\n                    num\n                    0)))\n\n(defun setup (num-l set-l)\n  (if set-l\n      (let ((next-num-l (setnumlst num-l (caar set-l) (cadar set-l))))\n        (if next-num-l\n            (setup next-num-l (cdr set-l))\n            nil))\n      num-l))\n\n(defun chk-first-num (num-l)\n  (if (zerop (car num-l))\n      nil\n      num-l))\n\n(princ (let ((set-num-l (chk-first-num (setup (loop for i from 1 to (car nm) collect nil) sc))))\n         (if set-num-l\n             (parse-integer (apply #'concatenate (cons 'string (loop for num in (fill-rest (fill-first set-num-l))\n                                                                    collect (princ-to-string num)))))\n             -1)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2268, "cpu_time_ms": 208, "memory_kb": 15456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s702660229", "group_id": "codeNet:p02761", "input_text": "(defun split (str)\n  (labels ((inner (rest-str-list stack-str-list temp-out)\n                  (if rest-str-list\n                      (let ((now-char (car rest-str-list)))\n                        (cond ((eq #\\space now-char) (inner (cdr rest-str-list)\n                                                            '()\n                                                            (cons (concatenate 'string (reverse stack-str-list))\n                                                                  temp-out)))\n                              (t (inner (cdr rest-str-list)\n                                        (cons now-char stack-str-list)\n                                        temp-out))))\n                      (reverse (cons (concatenate 'string (reverse stack-str-list))\n                                     temp-out)))))\n          (inner (concatenate 'list str)\n                 '()\n                 '())))\n\n(defun input-to-list (str)\n  (mapcar #'parse-integer (split str)))\n\n(defvar nm (input-to-list (read-line)))\n(defvar sc (loop for i from 1 to (cadr nm)\n                 collect (input-to-list (read-line))))\n\n(defun setnumlst (num-l index num)\n  (if (nth (1- index) num-l)\n      (if (eq num (nth (1- index) num-l))\n          num-l\n          nil)\n      (concatenate 'list (subseq num-l 0 (1- index))\n                   `(,num)\n                   (subseq num-l (1+ (1- index))))))\n\n\n(defun fill-first (num-l)\n  (if (car num-l)\n      num-l\n      (concatenate 'list '(1) (subseq num-l 1))))\n\n(defun fill-rest (num-l)\n  (loop for num in num-l\n        collect (if num\n                    num\n                    0)))\n\n(defun setup (num-l set-l)\n  (if set-l\n      (let ((next-num-l (setnumlst num-l (caar set-l) (cadar set-l))))\n        (if next-num-l\n            (setup next-num-l (cdr set-l))\n            nil))\n      num-l))\n\n(princ (let ((set-num-l (setup (loop for i from 1 to (car nm) collect nil) sc)))\n         (if set-num-l\n             (parse-integer (apply #'concatenate (cons 'string (loop for num in (fill-rest (fill-first set-num-l))\n                                                                    collect (princ-to-string num)))))\n             -1)))", "language": "Lisp", "metadata": {"date": 1583121081, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s702660229.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s702660229", "user_id": "u250100102"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun split (str)\n  (labels ((inner (rest-str-list stack-str-list temp-out)\n                  (if rest-str-list\n                      (let ((now-char (car rest-str-list)))\n                        (cond ((eq #\\space now-char) (inner (cdr rest-str-list)\n                                                            '()\n                                                            (cons (concatenate 'string (reverse stack-str-list))\n                                                                  temp-out)))\n                              (t (inner (cdr rest-str-list)\n                                        (cons now-char stack-str-list)\n                                        temp-out))))\n                      (reverse (cons (concatenate 'string (reverse stack-str-list))\n                                     temp-out)))))\n          (inner (concatenate 'list str)\n                 '()\n                 '())))\n\n(defun input-to-list (str)\n  (mapcar #'parse-integer (split str)))\n\n(defvar nm (input-to-list (read-line)))\n(defvar sc (loop for i from 1 to (cadr nm)\n                 collect (input-to-list (read-line))))\n\n(defun setnumlst (num-l index num)\n  (if (nth (1- index) num-l)\n      (if (eq num (nth (1- index) num-l))\n          num-l\n          nil)\n      (concatenate 'list (subseq num-l 0 (1- index))\n                   `(,num)\n                   (subseq num-l (1+ (1- index))))))\n\n\n(defun fill-first (num-l)\n  (if (car num-l)\n      num-l\n      (concatenate 'list '(1) (subseq num-l 1))))\n\n(defun fill-rest (num-l)\n  (loop for num in num-l\n        collect (if num\n                    num\n                    0)))\n\n(defun setup (num-l set-l)\n  (if set-l\n      (let ((next-num-l (setnumlst num-l (caar set-l) (cadar set-l))))\n        (if next-num-l\n            (setup next-num-l (cdr set-l))\n            nil))\n      num-l))\n\n(princ (let ((set-num-l (setup (loop for i from 1 to (car nm) collect nil) sc)))\n         (if set-num-l\n             (parse-integer (apply #'concatenate (cons 'string (loop for num in (fill-rest (fill-first set-num-l))\n                                                                    collect (princ-to-string num)))))\n             -1)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2172, "cpu_time_ms": 136, "memory_kb": 15336}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s023125811", "group_id": "codeNet:p02761", "input_text": "(defun get-input-array2 (n m)\n  (let ((rst (make-array (list n m))))\n    (loop for x from 0 to (- n 1)\n          do (loop for y from 0 to (- m 1)\n                   ;do (format t \"~A ~A ~%\" x y)\n                   do (setf (aref rst x y) (read))))\n    rst))\n\n\n(defun main (n m)\n  (let* ((input-array (get-input-array2 m 2))\n         (rst-array (make-array n :initial-element 0))\n         (rst 0))\n    (loop for x from 0 to (- m 1)\n          for si =  (- (aref input-array x 0) 1)\n          for ci = (aref input-array x 1)\n          if (or (and (not (equal (aref rst-array si) 0)) (not (equal ci (aref rst-array si))))\n                 (and (equal si 0) (equal ci 0) (not (equal n 1))))\n          do (progn (setf rst -1)\n               (return))\n          do (setf (aref rst-array si) ci)\n          ;do (format t \"1: ~A ~A ~A~%\" x si ci)\n          finally (if (and (not (equal n 1)) (equal (aref rst-array 0) 0))\n                      (setf (aref rst-array 0) 1)))\n    (loop for x downfrom (- n 1) downto 0\n          for y from 0 to n\n          for z = (aref rst-array y)\n          if (equal rst -1)\n          do (return)\n          ;do (format t \"2: ~A ~A ~A ~%\" x y z)\n          do (setf rst (+ rst (* z (expt 10 x)))))\n    rst))\n\n          \n    \n\n(format t \"~A~%\" (main (read) (read)))\n\n", "language": "Lisp", "metadata": {"date": 1583119752, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s023125811.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s023125811", "user_id": "u237057875"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun get-input-array2 (n m)\n  (let ((rst (make-array (list n m))))\n    (loop for x from 0 to (- n 1)\n          do (loop for y from 0 to (- m 1)\n                   ;do (format t \"~A ~A ~%\" x y)\n                   do (setf (aref rst x y) (read))))\n    rst))\n\n\n(defun main (n m)\n  (let* ((input-array (get-input-array2 m 2))\n         (rst-array (make-array n :initial-element 0))\n         (rst 0))\n    (loop for x from 0 to (- m 1)\n          for si =  (- (aref input-array x 0) 1)\n          for ci = (aref input-array x 1)\n          if (or (and (not (equal (aref rst-array si) 0)) (not (equal ci (aref rst-array si))))\n                 (and (equal si 0) (equal ci 0) (not (equal n 1))))\n          do (progn (setf rst -1)\n               (return))\n          do (setf (aref rst-array si) ci)\n          ;do (format t \"1: ~A ~A ~A~%\" x si ci)\n          finally (if (and (not (equal n 1)) (equal (aref rst-array 0) 0))\n                      (setf (aref rst-array 0) 1)))\n    (loop for x downfrom (- n 1) downto 0\n          for y from 0 to n\n          for z = (aref rst-array y)\n          if (equal rst -1)\n          do (return)\n          ;do (format t \"2: ~A ~A ~A ~%\" x y z)\n          do (setf rst (+ rst (* z (expt 10 x)))))\n    rst))\n\n          \n    \n\n(format t \"~A~%\" (main (read) (read)))\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1288, "cpu_time_ms": 152, "memory_kb": 18912}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s062628648", "group_id": "codeNet:p02761", "input_text": "(defun splitat (c line)\n  (labels ((rec (line acc)\n\t\t\t\t(let ((pos (position-if (lambda(cc) (char= c cc)) line)))\n\t\t\t\t  (if pos\n\t\t\t\t\t  (rec (subseq line (1+ pos)) (cons (subseq line 0 pos) acc))\n\t\t\t\t\t(nreverse (cons line acc))))))\n\t(rec line nil)))\n(defun f(n m lst notfoundcallback foundcallback)\n  (let ((num (loop for i from 1 to n collect 0)))\n    (labels ((rec (num lst)\n                  (if (null lst)\n                    (funcall foundcallback (reduce #'+ (mapcar #'* num (loop for i from 1 to n collect (expt 10 (- n i))))))\n                    (if (or (zerop (nth (1- (car (car lst))) num))\n                            (= (nth (1- (car (car lst))) num) (cadr (car lst))))\n                      (progn\n                        (setf (nth (1- (car (car lst))) num) (cadr (car lst)))\n                        (rec num (cdr lst)))\n                      (funcall notfoundcallback))\n                      )))\n      (rec num lst))))\n(let* ((nm (mapcar #'parse-integer (splitat #\\space (read-line nil nil))))\n       (lst nil))\n  (dotimes (i (cadr nm))\n    (setq lst (cons (mapcar #'parse-integer (splitat #\\space (read-line nil nil))) lst)))\n  (f (car nm) (cadr nm) lst (lambda() (format t \"-1~%\")) (lambda(n) (format t \"~A~%\" n))))\n", "language": "Lisp", "metadata": {"date": 1583118070, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s062628648.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s062628648", "user_id": "u254205055"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun splitat (c line)\n  (labels ((rec (line acc)\n\t\t\t\t(let ((pos (position-if (lambda(cc) (char= c cc)) line)))\n\t\t\t\t  (if pos\n\t\t\t\t\t  (rec (subseq line (1+ pos)) (cons (subseq line 0 pos) acc))\n\t\t\t\t\t(nreverse (cons line acc))))))\n\t(rec line nil)))\n(defun f(n m lst notfoundcallback foundcallback)\n  (let ((num (loop for i from 1 to n collect 0)))\n    (labels ((rec (num lst)\n                  (if (null lst)\n                    (funcall foundcallback (reduce #'+ (mapcar #'* num (loop for i from 1 to n collect (expt 10 (- n i))))))\n                    (if (or (zerop (nth (1- (car (car lst))) num))\n                            (= (nth (1- (car (car lst))) num) (cadr (car lst))))\n                      (progn\n                        (setf (nth (1- (car (car lst))) num) (cadr (car lst)))\n                        (rec num (cdr lst)))\n                      (funcall notfoundcallback))\n                      )))\n      (rec num lst))))\n(let* ((nm (mapcar #'parse-integer (splitat #\\space (read-line nil nil))))\n       (lst nil))\n  (dotimes (i (cadr nm))\n    (setq lst (cons (mapcar #'parse-integer (splitat #\\space (read-line nil nil))) lst)))\n  (f (car nm) (cadr nm) lst (lambda() (format t \"-1~%\")) (lambda(n) (format t \"~A~%\" n))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1232, "cpu_time_ms": 149, "memory_kb": 16356}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s319392207", "group_id": "codeNet:p02761", "input_text": "(let* ((n (read))\n       (m (read))\n       (cs (loop repeat m\n                 collect (cons (read) (read))))\n       (dig (make-array n :initial-element -1))\n       (valid t)\n       (result))\n  (loop for (s . c) in cs\n        do (progn\n             (when (and (<= 0 (aref dig (- s 1)))\n                        (/= c (aref dig (- s 1))))\n               (setf valid nil)\n               (loop-finish))\n             (setf (aref dig (- s 1)) c)))\n  (loop for i from 0 below n\n        with ldig = nil\n        for d = (aref dig i)\n        do (push (if (<= 0 d)\n                     (progn\n                       (setf ldig t)\n                       d)\n                     (if (or (not (zerop i)) ldig)\n                         0 1))\n                 result))\n  (setf result (nreverse result))\n  (when (and (zerop (car result))\n             (cdr result))\n    (setf valid nil))\n  (if valid\n      (format t \"~{~a~}~%\" result)\n      (format t \"-1~%\")))\n", "language": "Lisp", "metadata": {"date": 1583117981, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s319392207.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s319392207", "user_id": "u690263481"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (cs (loop repeat m\n                 collect (cons (read) (read))))\n       (dig (make-array n :initial-element -1))\n       (valid t)\n       (result))\n  (loop for (s . c) in cs\n        do (progn\n             (when (and (<= 0 (aref dig (- s 1)))\n                        (/= c (aref dig (- s 1))))\n               (setf valid nil)\n               (loop-finish))\n             (setf (aref dig (- s 1)) c)))\n  (loop for i from 0 below n\n        with ldig = nil\n        for d = (aref dig i)\n        do (push (if (<= 0 d)\n                     (progn\n                       (setf ldig t)\n                       d)\n                     (if (or (not (zerop i)) ldig)\n                         0 1))\n                 result))\n  (setf result (nreverse result))\n  (when (and (zerop (car result))\n             (cdr result))\n    (setf valid nil))\n  (if valid\n      (format t \"~{~a~}~%\" result)\n      (format t \"-1~%\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 943, "cpu_time_ms": 51, "memory_kb": 9828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s252004324", "group_id": "codeNet:p02761", "input_text": "(defun num-to-char (num)\n  (code-char (+ num (char-code #\\0))))\n\n(defun solve (n m pairs)\n  (let ((num (make-array n :element-type 'character :initial-element #\\-)))\n    (loop for (s . c) in pairs\n          if (char= #\\- (aref num (1- s)))\n          do (setf (aref num (1- s)) (num-to-char c))\n          else if (char/= (aref num (1- s)) (num-to-char c))\n          do (return-from solve -1))\n    (when (char= (aref num 0) #\\-)\n      (setf (aref num 0) #\\1))\n    (loop for i from 0\n          for n across num\n          if (char= n #\\-)\n          do (setf (aref num i) #\\0))\n    (if (and (< 1 n)\n             (char= (aref num 0) #\\0))\n        -1\n        (read-from-string num))))\n\n#-swank\n(let* ((n (read))\n       (m (read))\n       (pairs (loop repeat m collect (cons (read) (read)))))\n  (format t \"~A~%\" (solve n m pairs)))\n", "language": "Lisp", "metadata": {"date": 1583115768, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s252004324.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s252004324", "user_id": "u202886318"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun num-to-char (num)\n  (code-char (+ num (char-code #\\0))))\n\n(defun solve (n m pairs)\n  (let ((num (make-array n :element-type 'character :initial-element #\\-)))\n    (loop for (s . c) in pairs\n          if (char= #\\- (aref num (1- s)))\n          do (setf (aref num (1- s)) (num-to-char c))\n          else if (char/= (aref num (1- s)) (num-to-char c))\n          do (return-from solve -1))\n    (when (char= (aref num 0) #\\-)\n      (setf (aref num 0) #\\1))\n    (loop for i from 0\n          for n across num\n          if (char= n #\\-)\n          do (setf (aref num i) #\\0))\n    (if (and (< 1 n)\n             (char= (aref num 0) #\\0))\n        -1\n        (read-from-string num))))\n\n#-swank\n(let* ((n (read))\n       (m (read))\n       (pairs (loop repeat m collect (cons (read) (read)))))\n  (format t \"~A~%\" (solve n m pairs)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 823, "cpu_time_ms": 187, "memory_kb": 20708}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s844966639", "group_id": "codeNet:p02761", "input_text": "(defun num-to-char (num)\n  (code-char (+ num (char-code #\\0))))\n\n(defun solve (n m pairs)\n  (let ((num (make-array n :element-type 'character :initial-element #\\-)))\n    (loop for (s . c) in pairs\n          if (char= #\\- (aref num (1- s)))\n          do (setf (aref num (1- s)) (num-to-char c))\n          else if (char/= (aref num (1- s)) (num-to-char c))\n          do (return-from solve -1))\n    (loop for i from 0\n          for n across num\n          if (char= n #\\-)\n          do (setf (aref num i) #\\0))\n    (when (char= (aref num 0) #\\-)\n      (setf (aref num 0) #\\1))\n    (if (char= (aref num 0) #\\0)\n        -1\n        (read-from-string num))))\n\n#-swank\n(let* ((n (read))\n       (m (read))\n       (pairs (loop repeat m collect (cons (read) (read)))))\n  (format t \"~A~%\" (solve n m pairs)))\n", "language": "Lisp", "metadata": {"date": 1583115543, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Lisp/s844966639.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s844966639", "user_id": "u202886318"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "(defun num-to-char (num)\n  (code-char (+ num (char-code #\\0))))\n\n(defun solve (n m pairs)\n  (let ((num (make-array n :element-type 'character :initial-element #\\-)))\n    (loop for (s . c) in pairs\n          if (char= #\\- (aref num (1- s)))\n          do (setf (aref num (1- s)) (num-to-char c))\n          else if (char/= (aref num (1- s)) (num-to-char c))\n          do (return-from solve -1))\n    (loop for i from 0\n          for n across num\n          if (char= n #\\-)\n          do (setf (aref num i) #\\0))\n    (when (char= (aref num 0) #\\-)\n      (setf (aref num 0) #\\1))\n    (if (char= (aref num 0) #\\0)\n        -1\n        (read-from-string num))))\n\n#-swank\n(let* ((n (read))\n       (m (read))\n       (pairs (loop repeat m collect (cons (read) (read)))))\n  (format t \"~A~%\" (solve n m pairs)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 796, "cpu_time_ms": 193, "memory_kb": 20452}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s615719837", "group_id": "codeNet:p02774", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (vector-push a (if (>= a 0) as+ as-))))\n    (let* ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n           (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n           (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n           (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as+> as-< as->))\n      (labels ((calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (when (>= threshold 0)\n                     (let ((end 0))\n                       (sb-int:dovector (a as+>)\n                         (loop until (or (= end (length as+<))\n                                         (< threshold (* a (aref as+< end))))\n                               do (incf end)\n                               finally (incf res end)))))\n                   (if (>= threshold 0)\n                       (incf res (the uint62 (* (length as+<) (length as-<))))\n                       (let ((end 0))\n                         (sb-int:dovector (a as+<)\n                           (loop until (or (= end (length as-<))\n                                           (< threshold (* a (aref as-< end))))\n                                 do (incf end)\n                                 finally (incf res end)))))\n                   (if (>= threshold 0)\n                       (incf res (the uint62 (* (length as+<) (length as-<))))\n                       (let ((end 0))\n                         (sb-int:dovector (a as->)\n                           (loop until (or (= end (length as+>))\n                                           (< threshold (* a (aref as+> end))))\n                                 do (incf end)\n                                 finally (incf res end)))))\n                   (when (>= threshold 0)\n                     (let ((end 0))\n                       (sb-int:dovector (a as-<)\n                         (loop until (or (= end (length as->))\n                                         (< threshold (* a (aref as-> end))))\n                               do (incf end)\n                               finally (incf res end)))))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "language": "Lisp", "metadata": {"date": 1594688689, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lisp/s615719837.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s615719837", "user_id": "u352600849"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (vector-push a (if (>= a 0) as+ as-))))\n    (let* ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n           (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n           (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n           (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as+> as-< as->))\n      (labels ((calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (when (>= threshold 0)\n                     (let ((end 0))\n                       (sb-int:dovector (a as+>)\n                         (loop until (or (= end (length as+<))\n                                         (< threshold (* a (aref as+< end))))\n                               do (incf end)\n                               finally (incf res end)))))\n                   (if (>= threshold 0)\n                       (incf res (the uint62 (* (length as+<) (length as-<))))\n                       (let ((end 0))\n                         (sb-int:dovector (a as+<)\n                           (loop until (or (= end (length as-<))\n                                           (< threshold (* a (aref as-< end))))\n                                 do (incf end)\n                                 finally (incf res end)))))\n                   (if (>= threshold 0)\n                       (incf res (the uint62 (* (length as+<) (length as-<))))\n                       (let ((end 0))\n                         (sb-int:dovector (a as->)\n                           (loop until (or (= end (length as+>))\n                                           (< threshold (* a (aref as+> end))))\n                                 do (incf end)\n                                 finally (incf res end)))))\n                   (when (>= threshold 0)\n                     (let ((end 0))\n                       (sb-int:dovector (a as-<)\n                         (loop until (or (= end (length as->))\n                                         (< threshold (* a (aref as-> end))))\n                               do (incf end)\n                               finally (incf res end)))))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8440, "cpu_time_ms": 218, "memory_kb": 28004}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s259664201", "group_id": "codeNet:p02774", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (ftype (function * (values uint31 &optional)) bisect-right))\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)))\n    (let ((as< (sort< (copy-seq as)))\n          (as> (sort> (copy-seq as))))\n      (declare ((simple-array int32 (*)) as< as>))\n      (labels ((calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (bisect-right (if (>= a 0) as< as>)\n                                             threshold\n                                             a)))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "language": "Lisp", "metadata": {"date": 1594688620, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lisp/s259664201.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s259664201", "user_id": "u352600849"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (ftype (function * (values uint31 &optional)) bisect-right))\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)))\n    (let ((as< (sort< (copy-seq as)))\n          (as> (sort> (copy-seq as))))\n      (declare ((simple-array int32 (*)) as< as>))\n      (labels ((calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (bisect-right (if (>= a 0) as< as>)\n                                             threshold\n                                             a)))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7235, "cpu_time_ms": 1344, "memory_kb": 27264}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s466867346", "group_id": "codeNet:p02774", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (vector-push a (if (>= a 0) as+ as-))))\n    (let* ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n           (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n           (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n           (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as+> as-< as->))\n      (labels ((calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (when (>= threshold 0)\n                     (let ((end 0))\n                       (sb-int:dovector (a as+>)\n                         (loop until (or (= end (length as+<))\n                                         (< threshold (* a (aref as+< end))))\n                               do (incf end)\n                               finally (incf res end)))))\n                   (if (>= threshold 0)\n                       (incf res (the uint62 (* (length as+<) (length as-<))))\n                       (let ((end 0))\n                         (sb-int:dovector (a as+<)\n                           (loop until (or (= end (length as-<))\n                                           (< threshold (* a (aref as-< end))))\n                                 do (incf end)\n                                 finally (incf res end)))))\n                   (if (>= threshold 0)\n                       (incf res (the uint62 (* (length as+<) (length as-<))))\n                       (let ((end 0))\n                         (sb-int:dovector (a as->)\n                           (loop until (or (= end (length as+>))\n                                           (< threshold (* a (aref as+> end))))\n                                 do (incf end)\n                                 finally (incf res end)))))\n                   (when (>= threshold 0)\n                     (let ((end 0))\n                       (sb-int:dovector (a as-<)\n                         (loop until (or (= end (length as->))\n                                         (< threshold (* a (aref as-> end))))\n                               do (incf end)\n                               finally (incf res end)))))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "language": "Lisp", "metadata": {"date": 1582480959, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lisp/s466867346.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s466867346", "user_id": "u352600849"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (vector-push a (if (>= a 0) as+ as-))))\n    (let* ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n           (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n           (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n           (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as+> as-< as->))\n      (labels ((calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (when (>= threshold 0)\n                     (let ((end 0))\n                       (sb-int:dovector (a as+>)\n                         (loop until (or (= end (length as+<))\n                                         (< threshold (* a (aref as+< end))))\n                               do (incf end)\n                               finally (incf res end)))))\n                   (if (>= threshold 0)\n                       (incf res (the uint62 (* (length as+<) (length as-<))))\n                       (let ((end 0))\n                         (sb-int:dovector (a as+<)\n                           (loop until (or (= end (length as-<))\n                                           (< threshold (* a (aref as-< end))))\n                                 do (incf end)\n                                 finally (incf res end)))))\n                   (if (>= threshold 0)\n                       (incf res (the uint62 (* (length as+<) (length as-<))))\n                       (let ((end 0))\n                         (sb-int:dovector (a as->)\n                           (loop until (or (= end (length as+>))\n                                           (< threshold (* a (aref as+> end))))\n                                 do (incf end)\n                                 finally (incf res end)))))\n                   (when (>= threshold 0)\n                     (let ((end 0))\n                       (sb-int:dovector (a as-<)\n                         (loop until (or (= end (length as->))\n                                         (< threshold (* a (aref as-> end))))\n                               do (incf end)\n                               finally (incf res end)))))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8440, "cpu_time_ms": 421, "memory_kb": 35432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s041332278", "group_id": "codeNet:p02774", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (ftype (function * (values uint31 &optional)) bisect-right))\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (vector-push a (if (>= a 0) as+ as-))))\n    (let ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n          (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n          (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n          (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as+> as-< as->))\n      #>as+<\n      #>as+>\n      (labels ((calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (let ((end 0))\n                     (sb-int:dovector (a as+>)\n                       (loop until (or (= end (length as+<))\n                                       (< threshold (* a (aref as+< end))))\n                             do (incf end)\n                             finally (dbg a end)\n                                     (incf res end))))\n                   (let ((end 0))\n                     (sb-int:dovector (a as+>)\n                       (loop until (or (= end (length as->))\n                                       (< threshold (* a (aref as-> end))))\n                             do (incf end)\n                             finally (dbg a end)\n                                     (incf res end))))\n                   (let ((end 0))\n                     (sb-int:dovector (a as->)\n                       (loop until (or (= end (length as+>))\n                                       (< threshold (* a (aref as+> end))))\n                             do (incf end)\n                             finally (dbg a end)\n                                     (incf res end))))\n                   (let ((end 0))\n                     (sb-int:dovector (a as-<)\n                       (loop until (or (= end (length as->))\n                                       (< threshold (* a (aref as-> end))))\n                             do (incf end)\n                             finally (dbg a end)\n                                     (incf res end))))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "language": "Lisp", "metadata": {"date": 1582476345, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lisp/s041332278.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s041332278", "user_id": "u352600849"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (ftype (function * (values uint31 &optional)) bisect-right))\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (vector-push a (if (>= a 0) as+ as-))))\n    (let ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n          (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n          (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n          (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as+> as-< as->))\n      #>as+<\n      #>as+>\n      (labels ((calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (let ((end 0))\n                     (sb-int:dovector (a as+>)\n                       (loop until (or (= end (length as+<))\n                                       (< threshold (* a (aref as+< end))))\n                             do (incf end)\n                             finally (dbg a end)\n                                     (incf res end))))\n                   (let ((end 0))\n                     (sb-int:dovector (a as+>)\n                       (loop until (or (= end (length as->))\n                                       (< threshold (* a (aref as-> end))))\n                             do (incf end)\n                             finally (dbg a end)\n                                     (incf res end))))\n                   (let ((end 0))\n                     (sb-int:dovector (a as->)\n                       (loop until (or (= end (length as+>))\n                                       (< threshold (* a (aref as+> end))))\n                             do (incf end)\n                             finally (dbg a end)\n                                     (incf res end))))\n                   (let ((end 0))\n                     (sb-int:dovector (a as-<)\n                       (loop until (or (= end (length as->))\n                                       (< threshold (* a (aref as-> end))))\n                             do (incf end)\n                             finally (dbg a end)\n                                     (incf res end))))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8900, "cpu_time_ms": 436, "memory_kb": 43368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s889977172", "group_id": "codeNet:p02774", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (ftype (function * (values uint31 &optional)) bisect-right))\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)))\n    (let ((as< (sort< (copy-seq as)))\n          (as> (sort> (copy-seq as))))\n      (declare ((simple-array int32 (*)) as< as>))\n      (labels ((calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (bisect-right (if (>= a 0) as< as>)\n                                             threshold\n                                             a)))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "language": "Lisp", "metadata": {"date": 1582464187, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lisp/s889977172.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s889977172", "user_id": "u352600849"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(declaim (ftype (function * (values uint31 &optional)) bisect-right))\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)))\n    (let ((as< (sort< (copy-seq as)))\n          (as> (sort> (copy-seq as))))\n      (declare ((simple-array int32 (*)) as< as>))\n      (labels ((calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (bisect-right (if (>= a 0) as< as>)\n                                             threshold\n                                             a)))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7235, "cpu_time_ms": 1761, "memory_kb": 35940}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s514498991", "group_id": "codeNet:p02774", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (cond ((>= a 0)\n               (vector-push a as+))\n              ((< a 0)\n               (vector-push a as-)))))\n    (let ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n          (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n          (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n          (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as-< as+> as->))\n      (labels ((calc (pivot threshold)\n                 (declare (int32 pivot)\n                          (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (cond ((= pivot 0)\n                          (incf res (if (>= threshold 0) n 0)))\n                         ((and (> pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as+< threshold pivot)))\n                          (incf res (length as->)))\n                         ((and (> pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as-< threshold pivot))))\n                         ((and (< pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as-> threshold pivot)))\n                          (incf res (length as+>)))\n                         ((and (< pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as+> threshold pivot)))))\n                   ;; (dbg pivot threshold res)\n                   res))\n               (calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (calc a threshold)))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   ;; (dbg res threshold)\n                   res)))\n        ;; #>(calc-count 0)\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))\n        ))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "language": "Lisp", "metadata": {"date": 1581906037, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lisp/s514498991.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s514498991", "user_id": "u352600849"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (cond ((>= a 0)\n               (vector-push a as+))\n              ((< a 0)\n               (vector-push a as-)))))\n    (let ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n          (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n          (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n          (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as-< as+> as->))\n      (labels ((calc (pivot threshold)\n                 (declare (int32 pivot)\n                          (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (cond ((= pivot 0)\n                          (incf res (if (>= threshold 0) n 0)))\n                         ((and (> pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as+< threshold pivot)))\n                          (incf res (length as->)))\n                         ((and (> pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as-< threshold pivot))))\n                         ((and (< pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as-> threshold pivot)))\n                          (incf res (length as+>)))\n                         ((and (< pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as+> threshold pivot)))))\n                   ;; (dbg pivot threshold res)\n                   res))\n               (calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (calc a threshold)))\n                   (sb-int:dovector (a as)\n                     (when (<= (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   ;; (dbg res threshold)\n                   res)))\n        ;; #>(calc-count 0)\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))\n        ))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8659, "cpu_time_ms": 1683, "memory_kb": 41316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s055182077", "group_id": "codeNet:p02774", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (cond ((>= a 0)\n               (vector-push a as+))\n              ((< a 0)\n               (vector-push a as-)))))\n    (let ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n          (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n          (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n          (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as-< as+> as->))\n      (labels ((calc (pivot threshold)\n                 (declare (int32 pivot)\n                          (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (cond ((= pivot 0)\n                          (incf res (if (> threshold 0) n 0)))\n                         ((and (> pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as+< threshold pivot)))\n                          (incf res (length as->)))\n                         ((and (> pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as-< threshold pivot))))\n                         ((and (< pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as-> threshold pivot)))\n                          (incf res (length as+>)))\n                         ((and (< pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as+> threshold pivot)))))\n                   res))\n               (calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (calc a threshold)))\n                   (sb-int:dovector (a as)\n                     (when (< (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "language": "Lisp", "metadata": {"date": 1581905249, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lisp/s055182077.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s055182077", "user_id": "u352600849"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (cond ((>= a 0)\n               (vector-push a as+))\n              ((< a 0)\n               (vector-push a as-)))))\n    (let ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n          (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n          (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n          (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as-< as+> as->))\n      (labels ((calc (pivot threshold)\n                 (declare (int32 pivot)\n                          (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (cond ((= pivot 0)\n                          (incf res (if (> threshold 0) n 0)))\n                         ((and (> pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as+< threshold pivot)))\n                          (incf res (length as->)))\n                         ((and (> pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as-< threshold pivot))))\n                         ((and (< pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as-> threshold pivot)))\n                          (incf res (length as+>)))\n                         ((and (< pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as+> threshold pivot)))))\n                   res))\n               (calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (calc a threshold)))\n                   (sb-int:dovector (a as)\n                     (when (< (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(+ 1 (expt 10 18))))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8530, "cpu_time_ms": 1680, "memory_kb": 41312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s090442245", "group_id": "codeNet:p02774", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int31 pivot)\n           (fixnum value)\n           ((simple-array int31 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int31 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int31 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int31))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int31))\n         (as- (make-array n :fill-pointer 0 :element-type 'int31)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (if (>= a 0)\n            (vector-push a as+)\n            (vector-push a as-))))\n    (let ((as+< (sort< (coerce as+ '(simple-array int31 (*)))))\n          (as-< (sort< (coerce as- '(simple-array int31 (*)))))\n          (as+> (sort> (coerce as+ '(simple-array int31 (*)))))\n          (as-> (sort> (coerce as- '(simple-array int31 (*))))))\n      (declare ((simple-array int31 (*)) as+< as-< as+> as->))\n      (labels ((calc (pivot threshold)\n                 (declare (int31 pivot)\n                          (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (cond ((and (>= pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as+< threshold pivot)))\n                          (incf res (length as->)))\n                         ((and (>= pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as-< threshold pivot))))\n                         ((and (< pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as-> threshold pivot)))\n                          (incf res (length as+>)))\n                         ((and (< pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as+> threshold pivot)))))\n                   res))\n               (calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (calc a threshold)))\n                   (sb-int:dovector (a as)\n                     (when (< (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng most-negative-fixnum) (ok most-positive-fixnum))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "language": "Lisp", "metadata": {"date": 1581899238, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lisp/s090442245.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s090442245", "user_id": "u352600849"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int31 pivot)\n           (fixnum value)\n           ((simple-array int31 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int31 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int31 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int31))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int31))\n         (as- (make-array n :fill-pointer 0 :element-type 'int31)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (if (>= a 0)\n            (vector-push a as+)\n            (vector-push a as-))))\n    (let ((as+< (sort< (coerce as+ '(simple-array int31 (*)))))\n          (as-< (sort< (coerce as- '(simple-array int31 (*)))))\n          (as+> (sort> (coerce as+ '(simple-array int31 (*)))))\n          (as-> (sort> (coerce as- '(simple-array int31 (*))))))\n      (declare ((simple-array int31 (*)) as+< as-< as+> as->))\n      (labels ((calc (pivot threshold)\n                 (declare (int31 pivot)\n                          (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (cond ((and (>= pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as+< threshold pivot)))\n                          (incf res (length as->)))\n                         ((and (>= pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as-< threshold pivot))))\n                         ((and (< pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as-> threshold pivot)))\n                          (incf res (length as+>)))\n                         ((and (< pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as+> threshold pivot)))))\n                   res))\n               (calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (calc a threshold)))\n                   (sb-int:dovector (a as)\n                     (when (< (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng most-negative-fixnum) (ok most-positive-fixnum))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8399, "cpu_time_ms": 1889, "memory_kb": 35432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s219774342", "group_id": "codeNet:p02774", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (if (>= a 0)\n            (vector-push a as+)\n            (vector-push a as-))))\n    (let ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n          (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n          (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n          (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as-< as+> as->))\n      (labels ((calc (pivot threshold)\n                 (declare (int32 pivot)\n                          (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (cond ((and (>= pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as+< threshold pivot)))\n                          (incf res (length as->)))\n                         ((and (>= pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as-< threshold pivot))))\n                         ((and (< pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as-> threshold pivot)))\n                          (incf res (length as+>)))\n                         ((and (< pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as+> threshold pivot)))))\n                   res))\n               (calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (calc a threshold)))\n                   (sb-int:dovector (a as)\n                     (when (< (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng most-negative-fixnum) (ok most-positive-fixnum))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "language": "Lisp", "metadata": {"date": 1581890145, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lisp/s219774342.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s219774342", "user_id": "u352600849"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun bisect-right (target value pivot)\n  (declare #.OPT\n           (int32 pivot)\n           (fixnum value)\n           ((simple-array int32 (*)) target))\n  (sb-int:named-let bisect ((left 0) (ok (length target)))\n    (declare ((integer 0 #.most-positive-fixnum) left ok))\n    (let ((mid (ash (+ left ok) -1)))\n      (if (= mid left)\n          (if (< value (the fixnum (* pivot (aref target left))))\n              left\n              ok)\n          (if (< value (the fixnum (* pivot (aref target mid))))\n              (bisect left mid)\n              (bisect mid ok))))))\n\n(defun sort< (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'<))\n\n(defun sort> (as)\n  (declare #.OPT\n           (inline sort)\n           ((simple-array int32 (*)) as))\n  (sort as #'>))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (declare (uint31 n k))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (if (>= a 0)\n            (vector-push a as+)\n            (vector-push a as-))))\n    (let ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))\n          (as-< (sort< (coerce as- '(simple-array int32 (*)))))\n          (as+> (sort> (coerce as+ '(simple-array int32 (*)))))\n          (as-> (sort> (coerce as- '(simple-array int32 (*))))))\n      (declare ((simple-array int32 (*)) as+< as-< as+> as->))\n      (labels ((calc (pivot threshold)\n                 (declare (int32 pivot)\n                          (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (cond ((and (>= pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as+< threshold pivot)))\n                          (incf res (length as->)))\n                         ((and (>= pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as-< threshold pivot))))\n                         ((and (< pivot 0) (>= threshold 0))\n                          (incf res (the uint31 (bisect-right as-> threshold pivot)))\n                          (incf res (length as+>)))\n                         ((and (< pivot 0) (< threshold 0))\n                          (incf res (the uint31 (bisect-right as+> threshold pivot)))))\n                   res))\n               (calc-count (threshold)\n                 (declare (fixnum threshold))\n                 (let ((res 0))\n                   (declare (uint62 res))\n                   (sb-int:dovector (a as)\n                     (incf res (calc a threshold)))\n                   (sb-int:dovector (a as)\n                     (when (< (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng most-negative-fixnum) (ok most-positive-fixnum))\n          (declare (fixnum ng ok))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8399, "cpu_time_ms": 1758, "memory_kb": 41316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s593467835", "group_id": "codeNet:p02774", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(progn\n            (assert (<= start end))\n            (if (= start end) end\n                (labels\n                    ((%bisect-left (left ok)\n                       ;; TARGET[OK] >= VALUE always holds (assuming\n                       ;; TARGET[END] = +infinity)\n                       ,@(when declaration (list declaration))\n                       (let ((mid (ash (+ left ok) -1)))\n                         (if (= mid left)\n                             (if (funcall order (funcall key (,accessor target left)) value)\n                                 ok\n                                 left)\n                             (if (funcall order (funcall key (,accessor target mid)) value)\n                                 (%bisect-left mid ok)\n                                 (%bisect-left left mid))))))\n                  (%bisect-left start end))))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer 0 #.most-positive-fixnum) left ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(progn\n            (assert (<= start end))\n            (if (= start end)\n                end\n                (labels\n                    ((%bisect-right (left ok)\n                       ;; TARGET[OK] > VALUE always holds (assuming\n                       ;; TARGET[END] = +infinity)\n                       ,@(when declaration (list declaration))\n                       (let ((mid (ash (+ left ok) -1)))\n                         (if (= mid left)\n                             (if (funcall order value (funcall key (,accessor target left)))\n                                 left\n                                 ok)\n                             (if (funcall order value (funcall key (,accessor target mid)))\n                                 (%bisect-right left mid)\n                                 (%bisect-right mid ok))))))\n                  \n                  (%bisect-right start end))))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer 0 #.most-positive-fixnum) left ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (if (>= a 0)\n            (vector-push a as+)\n            (vector-push a as-))))\n    (let ((as+< (sort (coerce as+ '(simple-array int32 (*))) #'<))\n          (as-< (sort (coerce as- '(simple-array int32 (*))) #'<))\n          (as+> (sort (coerce as+ '(simple-array int32 (*))) #'>))\n          (as-> (sort (coerce as- '(simple-array int32 (*))) #'>)))\n      (declare ((simple-array int32 (*)) as+< as-< as+> as->))\n      (labels ((calc (pivot threshold)\n                 (declare (int32 pivot)\n                          (fixnum threshold))\n                 (let ((res 0))\n                   (cond ((and (>= pivot 0) (>= threshold 0))\n                          (incf res (bisect-right as+< threshold\n                                                  :key (lambda (a) (* (the int32 a) pivot))))\n                          (incf res (length as->)))\n                         ((and (>= pivot 0) (< threshold 0))\n                          (incf res (bisect-right as-< threshold\n                                                  :key (lambda (a) (* (the int32 a) pivot)))))\n                         ((and (< pivot 0) (>= threshold 0))\n                          (incf res (bisect-right as-> threshold\n                                                  :key (lambda (a) (* (the int32 a) pivot))))\n                          (incf res (length as+>)))\n                         ((and (< pivot 0) (< threshold 0))\n                          (incf res (bisect-right as+> threshold\n                                                  :key (lambda (a) (* (the int32 a) pivot))))))\n                   ;; (dbg pivot threshold res)\n                   res))\n               (calc-count (threshold)\n                 #>threshold\n                 (let ((res 0))\n                   (sb-int:dovector (a as)\n                     (incf res (calc a threshold)))\n                   (sb-int:dovector (a as)\n                     (when (< (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng most-negative-fixnum) (ok most-positive-fixnum))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))\n        ))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "language": "Lisp", "metadata": {"date": 1581886350, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Lisp/s593467835.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s593467835", "user_id": "u352600849"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline bisect-left))\n(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of lower_bound() of C++ or bisect_left() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the\ncomplement of ORDER. In other words, this function returns the leftmost index at\nwhich VALUE can be inserted with keeping the order. Therefore, TARGET must be\nmonotonically non-decreasing with respect to ORDER.\n\n- This function returns END if VALUE exceeds TARGET[END-1]. \n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(progn\n            (assert (<= start end))\n            (if (= start end) end\n                (labels\n                    ((%bisect-left (left ok)\n                       ;; TARGET[OK] >= VALUE always holds (assuming\n                       ;; TARGET[END] = +infinity)\n                       ,@(when declaration (list declaration))\n                       (let ((mid (ash (+ left ok) -1)))\n                         (if (= mid left)\n                             (if (funcall order (funcall key (,accessor target left)) value)\n                                 ok\n                                 left)\n                             (if (funcall order (funcall key (,accessor target mid)) value)\n                                 (%bisect-left mid ok)\n                                 (%bisect-left left mid))))))\n                  (%bisect-left start end))))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer 0 #.most-positive-fixnum) left ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (inline bisect-right))\n(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))\n  \"TARGET := vector | function (taking an integer argument)\nORDER := strict order\n\nAnalogue of upper_bound() of C++ or bisect_right() of Python: Returns the\nsmallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,\nthis function returns the rightmost index at which VALUE can be inserted with\nkeeping the order. Therefore, TARGET must be monotonically non-decreasing with\nrespect to ORDER.\n\n- This function returns END if VALUE >= TARGET[END-1].\n- The range [START, END) is half-open.\n- END must be explicitly specified if TARGET is function.\n- KEY is applied to each element of TARGET before comparison.\"\n  (declare (function key order)\n           (integer start)\n           ((or null integer) end))\n  (macrolet\n      ((frob (accessor &optional declaration)\n         `(progn\n            (assert (<= start end))\n            (if (= start end)\n                end\n                (labels\n                    ((%bisect-right (left ok)\n                       ;; TARGET[OK] > VALUE always holds (assuming\n                       ;; TARGET[END] = +infinity)\n                       ,@(when declaration (list declaration))\n                       (let ((mid (ash (+ left ok) -1)))\n                         (if (= mid left)\n                             (if (funcall order value (funcall key (,accessor target left)))\n                                 left\n                                 ok)\n                             (if (funcall order value (funcall key (,accessor target mid)))\n                                 (%bisect-right left mid)\n                                 (%bisect-right mid ok))))))\n                  \n                  (%bisect-right start end))))))\n    (etypecase target\n      (vector\n       (let ((end (or end (length target))))\n         (frob aref (declare ((integer 0 #.most-positive-fixnum) left ok)))))\n      (function\n       (assert end () \"Requires END argument if TARGET is a function.\")\n       (frob funcall)))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (as (make-array n :element-type 'int32))\n         (as+ (make-array n :fill-pointer 0 :element-type 'int32))\n         (as- (make-array n :fill-pointer 0 :element-type 'int32)))\n    (dotimes (i n)\n      (let ((a (read-fixnum)))\n        (setf (aref as i) a)\n        (if (>= a 0)\n            (vector-push a as+)\n            (vector-push a as-))))\n    (let ((as+< (sort (coerce as+ '(simple-array int32 (*))) #'<))\n          (as-< (sort (coerce as- '(simple-array int32 (*))) #'<))\n          (as+> (sort (coerce as+ '(simple-array int32 (*))) #'>))\n          (as-> (sort (coerce as- '(simple-array int32 (*))) #'>)))\n      (declare ((simple-array int32 (*)) as+< as-< as+> as->))\n      (labels ((calc (pivot threshold)\n                 (declare (int32 pivot)\n                          (fixnum threshold))\n                 (let ((res 0))\n                   (cond ((and (>= pivot 0) (>= threshold 0))\n                          (incf res (bisect-right as+< threshold\n                                                  :key (lambda (a) (* (the int32 a) pivot))))\n                          (incf res (length as->)))\n                         ((and (>= pivot 0) (< threshold 0))\n                          (incf res (bisect-right as-< threshold\n                                                  :key (lambda (a) (* (the int32 a) pivot)))))\n                         ((and (< pivot 0) (>= threshold 0))\n                          (incf res (bisect-right as-> threshold\n                                                  :key (lambda (a) (* (the int32 a) pivot))))\n                          (incf res (length as+>)))\n                         ((and (< pivot 0) (< threshold 0))\n                          (incf res (bisect-right as+> threshold\n                                                  :key (lambda (a) (* (the int32 a) pivot))))))\n                   ;; (dbg pivot threshold res)\n                   res))\n               (calc-count (threshold)\n                 #>threshold\n                 (let ((res 0))\n                   (sb-int:dovector (a as)\n                     (incf res (calc a threshold)))\n                   (sb-int:dovector (a as)\n                     (when (< (* a a) threshold)\n                       (decf res)))\n                   (setq res (ash res -1))\n                   res)))\n        (sb-int:named-let bisect ((ng most-negative-fixnum) (ok most-positive-fixnum))\n          (if (<= (- ok ng) 1)\n              (println ok)\n              (let ((mid (floor (+ ng ok) 2)))\n                (if (>= (calc-count mid) k)\n                    (bisect ng mid)\n                    (bisect mid ok)))))\n        ))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 3\n3 3 -4 -2\n\"\n    \"-6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"10 40\n5 4 3 2 -1 0 0 0 0 0\n\"\n    \"6\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\"\n    \"448283280358331064\n\")))\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 11891, "cpu_time_ms": 2104, "memory_kb": 45928}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s029353976", "group_id": "codeNet:p02879", "input_text": "(let ((a (read))\n      (b (read)))\n  (if (or (< 9 a) (< 9 b))\n    (format t \"-1~&\")\n    (format t \"~a~&\" (* a b))))", "language": "Lisp", "metadata": {"date": 1600893351, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s029353976.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s029353976", "user_id": "u074996057"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "(let ((a (read))\n      (b (read)))\n  (if (or (< 9 a) (< 9 b))\n    (format t \"-1~&\")\n    (format t \"~a~&\" (* a b))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 19, "memory_kb": 23956}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s250173158", "group_id": "codeNet:p02879", "input_text": "(let ((a (read))\n    (b (read)))\n    (if (and (<= a 9) (<= b 9))\n        (princ (* a b))\n        (princ -1)\n    )\n)", "language": "Lisp", "metadata": {"date": 1594077979, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s250173158.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s250173158", "user_id": "u136500538"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "(let ((a (read))\n    (b (read)))\n    (if (and (<= a 9) (<= b 9))\n        (princ (* a b))\n        (princ -1)\n    )\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 15, "memory_kb": 24240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s171640443", "group_id": "codeNet:p02879", "input_text": "(let ((a (read))\n      (b (read)))\n  (cond ((or (< 9 a) (< 9 b)) (princ \"-1\"))\n        (T (princ (* a b)))))", "language": "Lisp", "metadata": {"date": 1583772115, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s171640443.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s171640443", "user_id": "u606976120"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "(let ((a (read))\n      (b (read)))\n  (cond ((or (< 9 a) (< 9 b)) (princ \"-1\"))\n        (T (princ (* a b)))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 108, "cpu_time_ms": 93, "memory_kb": 10464}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s541251486", "group_id": "codeNet:p02879", "input_text": "\n(defun prob-a (lst)\n  (if (and (< (car lst) 10)\n           (< (cadr lst) 10))\n      (* (car lst)\n         (cadr lst))\n      -1))\n\n(format t \"~a~%\" (prob-a (list (read) (read))))\n\n\n\n\n\n\n", "language": "Lisp", "metadata": {"date": 1573917157, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s541251486.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s541251486", "user_id": "u301893320"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "\n(defun prob-a (lst)\n  (if (and (< (car lst) 10)\n           (< (cadr lst) 10))\n      (* (car lst)\n         (cadr lst))\n      -1))\n\n(format t \"~a~%\" (prob-a (list (read) (read))))\n\n\n\n\n\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 185, "cpu_time_ms": 139, "memory_kb": 10856}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s890776759", "group_id": "codeNet:p02879", "input_text": " (defun main (a b)\n        (if (or (> a 9) (> b 9) (< a 1) (< b 1))\n                -1\n                (* a b)))\n\n(format t \"~A~%\" (main (read) (read)))", "language": "Lisp", "metadata": {"date": 1573104481, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s890776759.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s890776759", "user_id": "u258808501"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": " (defun main (a b)\n        (if (or (> a 9) (> b 9) (< a 1) (< b 1))\n                -1\n                (* a b)))\n\n(format t \"~A~%\" (main (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 94, "memory_kb": 8676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s305562358", "group_id": "codeNet:p02879", "input_text": "(defvar A (read))\n(defvar B (read))\n\n(defun compare (v)\n  (if (and (> v 0) (< v 10))\n      t\n      nil))\n\n(if (and (compare A) (compare B))\n    (princ (* A B))\n    (princ -1))\n", "language": "Lisp", "metadata": {"date": 1572815429, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s305562358.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s305562358", "user_id": "u631655863"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "(defvar A (read))\n(defvar B (read))\n\n(defun compare (v)\n  (if (and (> v 0) (< v 10))\n      t\n      nil))\n\n(if (and (compare A) (compare B))\n    (princ (* A B))\n    (princ -1))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 176, "cpu_time_ms": 92, "memory_kb": 9828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s890485887", "group_id": "codeNet:p02879", "input_text": "(let ((a (read))\n      (b (read)))\n  (format t \"~a~%\"\n\t  (if (and (<= 1 a 9) (<= 1 b 9))\n\t      (* a b)\n\t    -1)))\n", "language": "Lisp", "metadata": {"date": 1572316971, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s890485887.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s890485887", "user_id": "u756033787"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "(let ((a (read))\n      (b (read)))\n  (format t \"~a~%\"\n\t  (if (and (<= 1 a 9) (<= 1 b 9))\n\t      (* a b)\n\t    -1)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 19, "memory_kb": 4072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s813010879", "group_id": "codeNet:p02879", "input_text": "#!/usr/local/Cellar/sbcl/1.5.7/libexec/bin/sbcl --script\n# FASL\n  compiled from \"test.lisp\"\n  using SBCL version 1.5.7\n�\u0006���X86-64N�������\u0005���1.5.7.���(GENCGC SB-PACKAGE-LOCKS SB-THREAD SB-UNICODE)M\tREAD7�\u0001\u0004�7�\u0001M\nFORMAT\u0003e\u0004~a~%\u0005M\u0005<=&\u0004\u0001#\t7\u0003\u0007\u0003\u0004\u0005&\u0004\u0002#\t7\u0003\b\u0006\u0004\n\u0003\u0002\b\n\u0004\t\u0007\u0001M\u0003*\u0004\u0001\u0004\u00027\u0002\b\u0006\u0002\n\u0001(\b\n\u0002\t8\u0003?>\u0007@", "language": "Lisp", "metadata": {"date": 1572316915, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s813010879.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s813010879", "user_id": "u756033787"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#!/usr/local/Cellar/sbcl/1.5.7/libexec/bin/sbcl --script\n# FASL\n  compiled from \"test.lisp\"\n  using SBCL version 1.5.7\n�\u0006���X86-64N�������\u0005���1.5.7.���(GENCGC SB-PACKAGE-LOCKS SB-THREAD SB-UNICODE)M\tREAD7�\u0001\u0004�7�\u0001M\nFORMAT\u0003e\u0004~a~%\u0005M\u0005<=&\u0004\u0001#\t7\u0003\u0007\u0003\u0004\u0005&\u0004\u0002#\t7\u0003\b\u0006\u0004\n\u0003\u0002\b\n\u0004\t\u0007\u0001M\u0003*\u0004\u0001\u0004\u00027\u0002\b\u0006\u0002\n\u0001(\b\n\u0002\t8\u0003?>\u0007@", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 326, "cpu_time_ms": 96, "memory_kb": 10344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s561943318", "group_id": "codeNet:p02879", "input_text": "(let* ((a (read))\n       (b (read)))\n  (cond ((and (<= 1 a 9) (<= 1 b 9)) (princ (* a b)))\n        (t (princ -1))))", "language": "Lisp", "metadata": {"date": 1572283444, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s561943318.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s561943318", "user_id": "u610490393"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "(let* ((a (read))\n       (b (read)))\n  (cond ((and (<= 1 a 9) (<= 1 b 9)) (princ (* a b)))\n        (t (princ -1))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 16, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s307228710", "group_id": "codeNet:p02879", "input_text": "(defun kake ()\n  (let* ((a (read))\n        (b (read))\n        (c (* a b)))\n    (if (or (> a 9) (> b 9))\n        (setf c -1))\n    (format t \"~d\" c)))\n\n(kake)\n", "language": "Lisp", "metadata": {"date": 1572224818, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s307228710.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s307228710", "user_id": "u845695466"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "(defun kake ()\n  (let* ((a (read))\n        (b (read))\n        (c (* a b)))\n    (if (or (> a 9) (> b 9))\n        (setf c -1))\n    (format t \"~d\" c)))\n\n(kake)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 157, "cpu_time_ms": 296, "memory_kb": 11872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s779059535", "group_id": "codeNet:p02879", "input_text": "(defun main ()\n  (let* ((a (read))\n         (b (read)))\n    (if (and (<= a 9) (<= b 9))\n      (format t \"~a~%\" (* a b))\n      (format t \"~a~%\" -1))))\n(main)", "language": "Lisp", "metadata": {"date": 1572224642, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s779059535.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s779059535", "user_id": "u652695471"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "(defun main ()\n  (let* ((a (read))\n         (b (read)))\n    (if (and (<= a 9) (<= b 9))\n      (format t \"~a~%\" (* a b))\n      (format t \"~a~%\" -1))))\n(main)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 156, "cpu_time_ms": 368, "memory_kb": 12256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s732164601", "group_id": "codeNet:p02879", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((a (read))\n         (b (read)))\n    (if (and (<= 1 a 9) (<= 1 b 9))\n        (println (* a b))\n        (println -1))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 5\n\"\n    \"10\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 10\n\"\n    \"-1\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"9 9\n\"\n    \"81\n\")))\n", "language": "Lisp", "metadata": {"date": 1572224560, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Lisp/s732164601.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s732164601", "user_id": "u352600849"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((a (read))\n         (b (read)))\n    (if (and (<= 1 a 9) (<= 1 b 9))\n        (println (* a b))\n        (println -1))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 5\n\"\n    \"10\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 10\n\"\n    \"-1\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"9 9\n\"\n    \"81\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3652, "cpu_time_ms": 426, "memory_kb": 15336}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s884537459", "group_id": "codeNet:p02891", "input_text": "(let* ((s (read-line))\n       (k (read))\n       (x (make-array (list (length s)) :adjustable t :fill-pointer 0)))\n  ;;\n  (loop :with d := #\\*\n        :for c :across s\n        :if (char/= c d)\n        :do (progn\n              (vector-push-extend 1 x)\n              (setf d c))\n        :else\n        :do (incf (aref x (1- (length x)))))\n  (cond ((= (length x) 1)\n         (format t \"~A~%\" (floor (* k (aref x 0)) 2)))\n        ((char/= (aref s 0) (aref s (1- (length s))))\n         (format t \"~A~%\" (loop :for n :across x\n                                :sum (* k (floor n 2)))))\n        (t\n         (format t \"~A~%\" (+ (loop :for i :from 1 :to (- (length x) 2)\n                                   :sum (* k (floor (aref x i) 2)))\n                             (floor (aref x 0) 2)\n                             (floor (aref x (1- (length x))) 2)\n                             (* (1- k) (floor (+ (aref x 0) (aref x (1- (length x)))) 2)))))))\n", "language": "Lisp", "metadata": {"date": 1595685186, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s884537459.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s884537459", "user_id": "u608227593"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(let* ((s (read-line))\n       (k (read))\n       (x (make-array (list (length s)) :adjustable t :fill-pointer 0)))\n  ;;\n  (loop :with d := #\\*\n        :for c :across s\n        :if (char/= c d)\n        :do (progn\n              (vector-push-extend 1 x)\n              (setf d c))\n        :else\n        :do (incf (aref x (1- (length x)))))\n  (cond ((= (length x) 1)\n         (format t \"~A~%\" (floor (* k (aref x 0)) 2)))\n        ((char/= (aref s 0) (aref s (1- (length s))))\n         (format t \"~A~%\" (loop :for n :across x\n                                :sum (* k (floor n 2)))))\n        (t\n         (format t \"~A~%\" (+ (loop :for i :from 1 :to (- (length x) 2)\n                                   :sum (* k (floor (aref x i) 2)))\n                             (floor (aref x 0) 2)\n                             (floor (aref x (1- (length x))) 2)\n                             (* (1- k) (floor (+ (aref x 0) (aref x (1- (length x)))) 2)))))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 936, "cpu_time_ms": 19, "memory_kb": 24532}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s962083970", "group_id": "codeNet:p02891", "input_text": "(defun cnt-string (s)\n  \"入力文字列に対し必要な置換操作の回数を返す\"\n  (let ((cnt 1)\n        (okikae 0)\n        (hanei nil)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (if (char= (elt s (1- i)) (elt s i)) \n              (incf cnt)\n              (progn \n                (setf hanei t)\n                (incf okikae (floor cnt 2)) \n                (setf cnt 1)))))\n    (when (> cnt 1) (incf okikae (floor cnt 2)))\n    (cond\n      ((= (length s) 1) 0)\n      (hanei okikae)\n      (t (floor cnt 2)))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (do ((l 1 (1+ l)))\n        ((or (>= l (length s)) (char/= (elt s (1- l)) (elt s l))) (setf start l)))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (* k (length s)) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" (floor k 2)))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1570677786, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s962083970.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s962083970", "user_id": "u845695466"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun cnt-string (s)\n  \"入力文字列に対し必要な置換操作の回数を返す\"\n  (let ((cnt 1)\n        (okikae 0)\n        (hanei nil)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (if (char= (elt s (1- i)) (elt s i)) \n              (incf cnt)\n              (progn \n                (setf hanei t)\n                (incf okikae (floor cnt 2)) \n                (setf cnt 1)))))\n    (when (> cnt 1) (incf okikae (floor cnt 2)))\n    (cond\n      ((= (length s) 1) 0)\n      (hanei okikae)\n      (t (floor cnt 2)))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (do ((l 1 (1+ l)))\n        ((or (>= l (length s)) (char/= (elt s (1- l)) (elt s l))) (setf start l)))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (* k (length s)) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" (floor k 2)))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1402, "cpu_time_ms": 219, "memory_kb": 21216}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s114814287", "group_id": "codeNet:p02891", "input_text": "(defun cnt-string (s)\n  \"入力文字列に対し必要な置換操作の回数を返す\"\n  (let ((cnt 1)\n        (okikae 0)\n        (hanei nil)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (if (char= (elt s (1- i)) (elt s i)) \n              (incf cnt)\n              (progn \n                (setf hanei t)\n                (incf okikae (floor cnt 2)) \n                (setf cnt 1)))))\n    (cond\n      ((= (length s) 1) 1)\n      (hanei okikae)\n      (t (floor cnt 2)))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (do ((l 1 (1+ l)))\n        ((or (>= l (length s)) (char/= (elt s (1- l)) (elt s l))) (setf start l)))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (* k (length s)) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" (floor k 2)))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1570676127, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s114814287.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s114814287", "user_id": "u845695466"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun cnt-string (s)\n  \"入力文字列に対し必要な置換操作の回数を返す\"\n  (let ((cnt 1)\n        (okikae 0)\n        (hanei nil)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (if (char= (elt s (1- i)) (elt s i)) \n              (incf cnt)\n              (progn \n                (setf hanei t)\n                (incf okikae (floor cnt 2)) \n                (setf cnt 1)))))\n    (cond\n      ((= (length s) 1) 1)\n      (hanei okikae)\n      (t (floor cnt 2)))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (do ((l 1 (1+ l)))\n        ((or (>= l (length s)) (char/= (elt s (1- l)) (elt s l))) (setf start l)))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (* k (length s)) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" (floor k 2)))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1353, "cpu_time_ms": 227, "memory_kb": 21216}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s182830939", "group_id": "codeNet:p02891", "input_text": "    (cond\n      ((= (length s) 1) 1)\n      (hanei okikae)\n      (t (floor cnt 2)))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (do ((l 1 (1+ l)))\n        ((or (>= l (length s)) (char/= (elt s (1- l)) (elt s l))) (setf start l)))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (* k (length s)) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" (floor k 2)))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1570675977, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s182830939.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s182830939", "user_id": "u845695466"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "    (cond\n      ((= (length s) 1) 1)\n      (hanei okikae)\n      (t (floor cnt 2)))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (do ((l 1 (1+ l)))\n        ((or (>= l (length s)) (char/= (elt s (1- l)) (elt s l))) (setf start l)))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (* k (length s)) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" (floor k 2)))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 955, "cpu_time_ms": 88, "memory_kb": 8164}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s718180243", "group_id": "codeNet:p02891", "input_text": "(defun cnt-string (s)\n  \"入力文字列に対し必要な置換操作の回数を返す\"\n  (let ((cnt 1)\n        (okikae 0)\n        (hanei nil)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (if (char= (elt s (1- i)) (elt s i)) \n              (incf cnt)\n              (progn \n                (setf hanei t)\n                (incf okikae (floor cnt 2)) \n                (setf cnt 1)))))\n    (if hanei\n        okikae\n        (floor cnt 2))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (when (char/= (elt s (1- i)) (elt s i)) (setf start i) (return))))\n    (do ((l 0 (1+ l)))\n        (((>= l (length s)) (setf start l))\n         ((char/= (elt s (1- l)) (elt s l)) (setf start l))))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (length s) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" (floor k 2)))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1570671096, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s718180243.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s718180243", "user_id": "u845695466"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun cnt-string (s)\n  \"入力文字列に対し必要な置換操作の回数を返す\"\n  (let ((cnt 1)\n        (okikae 0)\n        (hanei nil)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (if (char= (elt s (1- i)) (elt s i)) \n              (incf cnt)\n              (progn \n                (setf hanei t)\n                (incf okikae (floor cnt 2)) \n                (setf cnt 1)))))\n    (if hanei\n        okikae\n        (floor cnt 2))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (when (char/= (elt s (1- i)) (elt s i)) (setf start i) (return))))\n    (do ((l 0 (1+ l)))\n        (((>= l (length s)) (setf start l))\n         ((char/= (elt s (1- l)) (elt s l)) (setf start l))))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (length s) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" (floor k 2)))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1464, "cpu_time_ms": 171, "memory_kb": 20064}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s959119395", "group_id": "codeNet:p02891", "input_text": "(defun cnt-string (s)\n  \"入力文字列に対し必要な置換操作の回数を返す\"\n  (let ((cnt 1)\n        (okikae 0)\n        (hanei nil)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (if (char= (elt s (1- i)) (elt s i)) \n              (incf cnt)\n              (progn \n                (setf hanei t)\n                (incf okikae (floor cnt 2)) \n                (setf cnt 1)))))\n    (if hanei\n        okikae\n        (floor cnt 2))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (when (char/= (elt s (1- i)) (elt s i)) (setf start i) (return))))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (length s) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" (floor k 2)))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1570668341, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s959119395.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s959119395", "user_id": "u845695466"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun cnt-string (s)\n  \"入力文字列に対し必要な置換操作の回数を返す\"\n  (let ((cnt 1)\n        (okikae 0)\n        (hanei nil)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (if (char= (elt s (1- i)) (elt s i)) \n              (incf cnt)\n              (progn \n                (setf hanei t)\n                (incf okikae (floor cnt 2)) \n                (setf cnt 1)))))\n    (if hanei\n        okikae\n        (floor cnt 2))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (when (char/= (elt s (1- i)) (elt s i)) (setf start i) (return))))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (length s) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" (floor k 2)))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1335, "cpu_time_ms": 40, "memory_kb": 8552}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s472636444", "group_id": "codeNet:p02891", "input_text": "(defun cnt-string (s)\n  \"入力文字列に対し必要な置換操作の回数を返す\"\n  (let ((cnt 1)\n        (okikae 0)\n        (hanei nil)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (if (char= (elt s (1- i)) (elt s i)) \n              (incf cnt)\n              (progn \n                (setf hanei t)\n                (incf okikae (floor cnt 2)) \n                (setf cnt 1)))))\n    (if hanei\n        okikae\n        (floor cnt 2))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (when (char/= (elt s (1- i)) (elt s i)) (setf start i) (return))))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (length s) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" 0))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1570668061, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s472636444.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s472636444", "user_id": "u845695466"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun cnt-string (s)\n  \"入力文字列に対し必要な置換操作の回数を返す\"\n  (let ((cnt 1)\n        (okikae 0)\n        (hanei nil)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (if (char= (elt s (1- i)) (elt s i)) \n              (incf cnt)\n              (progn \n                (setf hanei t)\n                (incf okikae (floor cnt 2)) \n                (setf cnt 1)))))\n    (if hanei\n        okikae\n        (floor cnt 2))))\n\n(defun same-string (s k)\n  \"入力文字列の両端が同じ場合\"\n  (let ((start 0)\n        (end 0)) \n    (dotimes (i (length s))\n      (if (> i 0) \n          (when (char/= (elt s (1- i)) (elt s i)) (setf start i) (return))))\n    (setf end \n          (if (>= start (length s)) \n              -1\n              (do ((j (1- (length s)) (1- j)))\n               ((or (< j 1) (char/= (elt s (1- j)) (elt s j)) ) j))))\n    (if (= end -1) \n        (floor (length s) 2) \n        (+ (floor start 2) (floor (- (length s) end) 2) (* k (cnt-string (subseq s start end))) (* (1- k) (floor (+ start (- (length s) end)) 2))))))\n\n(defun main ()\n  (let ((s (string (read)))\n        (k (read)))\n    (if (= (length s) 1) (format t \"~a\" 0))\n    (if (char= (elt s 0) (elt s (1- (length s))))\n        (format t \"~a\" (same-string s k)) \n        (format t \"~a\" (* (cnt-string s) k)))))\n\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1325, "cpu_time_ms": 172, "memory_kb": 19296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s717871166", "group_id": "codeNet:p02891", "input_text": "(defparameter *s* (read-line))\n(defparameter *k* (read))\n\n(setf *s* (concatenate 'string *s* *s*))\n\n(defun hoge (s cur cum flag)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (and (equal (char s cur) (char s (1+ cur))) flag)\n      (hoge s (1+ cur) (1+ cum) nil)\n      (hoge s (1+ cur) cum t))))\n\n(defun piyo (s cur cum)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (not (equal (char s cur) (char s (1+ cur)))) nil (piyo s (1+ cur) t))))\n\n(if (piyo *s* 0 t)\n  (format t \"~a~%\" (floor (/ (* *k* (length *s*)) 4)))\n  (format t \"~a~%\" (min (floor (/ (* *k* (hoge *s* 0 0 t)) 2)) (floor (/ (* *k* (hoge (reverse *s*) 0 0 t)) 2)))))\n", "language": "Lisp", "metadata": {"date": 1570329554, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s717871166.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s717871166", "user_id": "u358554431"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defparameter *s* (read-line))\n(defparameter *k* (read))\n\n(setf *s* (concatenate 'string *s* *s*))\n\n(defun hoge (s cur cum flag)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (and (equal (char s cur) (char s (1+ cur))) flag)\n      (hoge s (1+ cur) (1+ cum) nil)\n      (hoge s (1+ cur) cum t))))\n\n(defun piyo (s cur cum)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (not (equal (char s cur) (char s (1+ cur)))) nil (piyo s (1+ cur) t))))\n\n(if (piyo *s* 0 t)\n  (format t \"~a~%\" (floor (/ (* *k* (length *s*)) 4)))\n  (format t \"~a~%\" (min (floor (/ (* *k* (hoge *s* 0 0 t)) 2)) (floor (/ (* *k* (hoge (reverse *s*) 0 0 t)) 2)))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 630, "cpu_time_ms": 109, "memory_kb": 13028}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s616614307", "group_id": "codeNet:p02891", "input_text": "(defparameter *s* (read-line))\n(defparameter *k* (read))\n\n(setf *s* (concatenate 'string *s* *s*))\n\n(defun hoge (s cur cum flag)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (and (equal (char s cur) (char s (1+ cur))) flag)\n      (hoge s (1+ cur) (1+ cum) nil)\n      (hoge s (1+ cur) cum t))))\n\n(defun piyo (s cur cum)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (not (equal (char s cur) (char s (1+ cur)))) nil (piyo s (1+ cur) t))))\n\n(if (piyo *s* 0 t)\n  (format t \"~a~%\" (floor (/ (* *k* (length *s*)) 2)))\n  (format t \"~a~%\" (min (floor (/ (* *k* (hoge *s* 0 0 t)) 2)) (floor (/ (* *k* (hoge (reverse *s*) 0 0 t)) 2)))))\n", "language": "Lisp", "metadata": {"date": 1570329471, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s616614307.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s616614307", "user_id": "u358554431"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defparameter *s* (read-line))\n(defparameter *k* (read))\n\n(setf *s* (concatenate 'string *s* *s*))\n\n(defun hoge (s cur cum flag)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (and (equal (char s cur) (char s (1+ cur))) flag)\n      (hoge s (1+ cur) (1+ cum) nil)\n      (hoge s (1+ cur) cum t))))\n\n(defun piyo (s cur cum)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (not (equal (char s cur) (char s (1+ cur)))) nil (piyo s (1+ cur) t))))\n\n(if (piyo *s* 0 t)\n  (format t \"~a~%\" (floor (/ (* *k* (length *s*)) 2)))\n  (format t \"~a~%\" (min (floor (/ (* *k* (hoge *s* 0 0 t)) 2)) (floor (/ (* *k* (hoge (reverse *s*) 0 0 t)) 2)))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 630, "cpu_time_ms": 18, "memory_kb": 4324}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s336155105", "group_id": "codeNet:p02891", "input_text": "(defparameter *s* (read-line))\n(defparameter *k* (read))\n\n(setf *s* (concatenate 'string *s* *s*))\n\n(defun hoge (s cur cum flag)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (and (equal (char s cur) (char s (1+ cur))) flag)\n      (hoge s (1+ cur) (1+ cum) nil)\n      (hoge s (1+ cur) cum t))))\n\n(defun piyo (s cur cum)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (not (equal (char s cur) (char s (1+ cur)))) nil (piyo s (1+ cur) t))))\n\n(if (or (equal (length *s*) 1) (piyo *s* 0 t))\n  (format t \"~a~%\" (floor (/ (* *k* (length *s*)) 4)))\n  (format t \"~a~%\" (floor (/ (* *k* (hoge *s* 0 0 t)) 2))))\n", "language": "Lisp", "metadata": {"date": 1570328577, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s336155105.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s336155105", "user_id": "u358554431"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defparameter *s* (read-line))\n(defparameter *k* (read))\n\n(setf *s* (concatenate 'string *s* *s*))\n\n(defun hoge (s cur cum flag)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (and (equal (char s cur) (char s (1+ cur))) flag)\n      (hoge s (1+ cur) (1+ cum) nil)\n      (hoge s (1+ cur) cum t))))\n\n(defun piyo (s cur cum)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (not (equal (char s cur) (char s (1+ cur)))) nil (piyo s (1+ cur) t))))\n\n(if (or (equal (length *s*) 1) (piyo *s* 0 t))\n  (format t \"~a~%\" (floor (/ (* *k* (length *s*)) 4)))\n  (format t \"~a~%\" (floor (/ (* *k* (hoge *s* 0 0 t)) 2))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 603, "cpu_time_ms": 155, "memory_kb": 13156}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s556454198", "group_id": "codeNet:p02891", "input_text": "(defparameter *s* (read-line))\n(defparameter *k* (read))\n\n(defun hoge (s cur cum flag)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (and (equal (char s cur) (char s (1+ cur))) flag)\n      (hoge s (1+ cur) (1+ cum) nil)\n      (hoge s (1+ cur) cum 1))))\n\n(defun huga (s)\n  (if (and (equal (char s 0) (char s (1- (length s)))))\n    (if (not (equal (char s (- (length s) 2)) (char s (1- (length s))))) 1 0)\n    0))\n\n(if (equal (length *s*) 1)\n  (format t \"~a~%\" (floor (/ *k* 2)))\n  (format t \"~a~%\" (+ (* *k* (hoge *s* 0 0 1)) (* (1- *k*) (huga *s*)))))\n", "language": "Lisp", "metadata": {"date": 1570326145, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s556454198.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s556454198", "user_id": "u358554431"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defparameter *s* (read-line))\n(defparameter *k* (read))\n\n(defun hoge (s cur cum flag)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (and (equal (char s cur) (char s (1+ cur))) flag)\n      (hoge s (1+ cur) (1+ cum) nil)\n      (hoge s (1+ cur) cum 1))))\n\n(defun huga (s)\n  (if (and (equal (char s 0) (char s (1- (length s)))))\n    (if (not (equal (char s (- (length s) 2)) (char s (1- (length s))))) 1 0)\n    0))\n\n(if (equal (length *s*) 1)\n  (format t \"~a~%\" (floor (/ *k* 2)))\n  (format t \"~a~%\" (+ (* *k* (hoge *s* 0 0 1)) (* (1- *k*) (huga *s*)))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 553, "cpu_time_ms": 106, "memory_kb": 13152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s081147422", "group_id": "codeNet:p02891", "input_text": "(defparameter *s* (read-line))\n(defparameter *k* (read))\n\n(defun hoge (s cur cum flag)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (and (equal (char s cur) (char s (1+ cur))) flag)\n      (hoge s (1+ cur) (1+ cum) nil)\n      (hoge s (1+ cur) cum 1))))\n\n(defun huga (s)\n  (if (and (equal (char s 0) (char s (1- (length s)))))\n    (if (not (equal (char s (- (length s) 2)) (char s (1- (length s))))) 1 0)\n    0))\n(format t \"~a~%\" (+ (* *k* (hoge *s* 0 0 1)) (* (1- *k*) (huga *s*))))", "language": "Lisp", "metadata": {"date": 1570325695, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s081147422.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s081147422", "user_id": "u358554431"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defparameter *s* (read-line))\n(defparameter *k* (read))\n\n(defun hoge (s cur cum flag)\n  (if (>= (1+ cur) (length s))\n    cum\n    (if (and (equal (char s cur) (char s (1+ cur))) flag)\n      (hoge s (1+ cur) (1+ cum) nil)\n      (hoge s (1+ cur) cum 1))))\n\n(defun huga (s)\n  (if (and (equal (char s 0) (char s (1- (length s)))))\n    (if (not (equal (char s (- (length s) 2)) (char s (1- (length s))))) 1 0)\n    0))\n(format t \"~a~%\" (+ (* *k* (hoge *s* 0 0 1)) (* (1- *k*) (huga *s*))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 483, "cpu_time_ms": 152, "memory_kb": 13156}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s870370145", "group_id": "codeNet:p02891", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defun map-run-length (function seq &key (test #'eql))\n  \"Applies FUNCTION to each equal successive element of SEQ. FUNCTION must take\ntwo arguments: the first one receives an element in SEQ and the second one\nreceives the number of the successive elements equal to the first.\n\nExample: (map-run-length (lambda (x c) (format t \\\"~D ~D~%\\\" x c)) #(1 1 1 2 2 1 3))\n1 3\n2 2\n1 1\n3 1\n\"\n  (declare (sequence seq)\n           (function test function))\n  (etypecase seq\n    (vector\n     (unless (zerop (length seq))\n       (let ((prev (aref seq 0))\n             (start 0))\n         (loop for pos from 1 below (length seq)\n               unless (funcall test prev (aref seq pos))\n               do (funcall function prev (- pos start))\n                  (setf prev (aref seq pos)\n                        start pos)\n               finally (funcall function prev (- pos start))))))\n    (list\n     (when (cdr seq)\n       (labels ((recur (lst prev count)\n                  (declare ((integer 0 #.most-positive-fixnum) count))\n                  (cond ((null lst)\n                         (funcall function prev count))\n                        ((funcall test prev (car lst))\n                         (recur (cdr lst) prev (+ 1 count)))\n                        (t (funcall function prev count)\n                           (recur (cdr lst) (car lst) 1)))))\n         (recur (cdr seq) (car seq) 1))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((s (read-line))\n         (n (length s))\n         (k (read)))\n    (when (= n (count (aref s 0) s))\n      (println (floor (* n k) 2))\n      (return-from main))\n    (let ((seq (make-array 0 :fill-pointer 0)))\n      (map-run-length (lambda (c len)\n                        (vector-push-extend (cons c len) seq))\n                      s)\n      (if (char= (aref s 0) (aref s (- n 1)))\n          (let ((sum 0)\n                (delta 0))\n            (loop for i from 1 below (- (length seq) 1)\n                  for (c . len) = (aref seq i)\n                  do (incf delta (floor len 2)))\n            (incf sum (* delta k))\n            (let ((prefix-len (cdr (aref seq 0)))\n                  (suffix-len (cdr (aref seq (- (length seq) 1)))))\n              (incf sum (floor prefix-len 2))\n              (incf sum (floor suffix-len 2))\n              (incf sum (* (- k 1) (floor (+ prefix-len suffix-len) 2)))\n              (println sum)))\n          (let ((delta 0))\n            (loop for (c . len) across seq\n                  do (incf delta (floor len 2)))\n            (println (* delta k)))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"issii\n2\n\"\n    \"4\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"qq\n81\n\"\n    \"81\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"cooooooooonteeeeeeeeeest\n999993333\n\"\n    \"8999939997\n\")))\n", "language": "Lisp", "metadata": {"date": 1570324206, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Lisp/s870370145.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s870370145", "user_id": "u352600849"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defun map-run-length (function seq &key (test #'eql))\n  \"Applies FUNCTION to each equal successive element of SEQ. FUNCTION must take\ntwo arguments: the first one receives an element in SEQ and the second one\nreceives the number of the successive elements equal to the first.\n\nExample: (map-run-length (lambda (x c) (format t \\\"~D ~D~%\\\" x c)) #(1 1 1 2 2 1 3))\n1 3\n2 2\n1 1\n3 1\n\"\n  (declare (sequence seq)\n           (function test function))\n  (etypecase seq\n    (vector\n     (unless (zerop (length seq))\n       (let ((prev (aref seq 0))\n             (start 0))\n         (loop for pos from 1 below (length seq)\n               unless (funcall test prev (aref seq pos))\n               do (funcall function prev (- pos start))\n                  (setf prev (aref seq pos)\n                        start pos)\n               finally (funcall function prev (- pos start))))))\n    (list\n     (when (cdr seq)\n       (labels ((recur (lst prev count)\n                  (declare ((integer 0 #.most-positive-fixnum) count))\n                  (cond ((null lst)\n                         (funcall function prev count))\n                        ((funcall test prev (car lst))\n                         (recur (cdr lst) prev (+ 1 count)))\n                        (t (funcall function prev count)\n                           (recur (cdr lst) (car lst) 1)))))\n         (recur (cdr seq) (car seq) 1))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((s (read-line))\n         (n (length s))\n         (k (read)))\n    (when (= n (count (aref s 0) s))\n      (println (floor (* n k) 2))\n      (return-from main))\n    (let ((seq (make-array 0 :fill-pointer 0)))\n      (map-run-length (lambda (c len)\n                        (vector-push-extend (cons c len) seq))\n                      s)\n      (if (char= (aref s 0) (aref s (- n 1)))\n          (let ((sum 0)\n                (delta 0))\n            (loop for i from 1 below (- (length seq) 1)\n                  for (c . len) = (aref seq i)\n                  do (incf delta (floor len 2)))\n            (incf sum (* delta k))\n            (let ((prefix-len (cdr (aref seq 0)))\n                  (suffix-len (cdr (aref seq (- (length seq) 1)))))\n              (incf sum (floor prefix-len 2))\n              (incf sum (floor suffix-len 2))\n              (incf sum (* (- k 1) (floor (+ prefix-len suffix-len) 2)))\n              (println sum)))\n          (let ((delta 0))\n            (loop for (c . len) across seq\n                  do (incf delta (floor len 2)))\n            (println (* delta k)))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"issii\n2\n\"\n    \"4\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"qq\n81\n\"\n    \"81\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"cooooooooonteeeeeeeeeest\n999993333\n\"\n    \"8999939997\n\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6047, "cpu_time_ms": 183, "memory_kb": 23400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s727662071", "group_id": "codeNet:p02912", "input_text": "(defvar N (read))\n(defvar M (read))\n\n(defvar A (loop repeat N collect (read)))\n\n(defvar discount \n  (loop for x in A with lst = nil do\n        (loop if (zerop x) return nil do\n              (push (ceiling x 2) lst)\n              (setf x (floor x 2)))\n        finally (return (sort lst #'>))))\n\n(princ (- (reduce #'+ A)\n          (loop for x in discount\n                for i below M\n                sum x)))", "language": "Lisp", "metadata": {"date": 1587997635, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lisp/s727662071.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s727662071", "user_id": "u334552723"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(defvar N (read))\n(defvar M (read))\n\n(defvar A (loop repeat N collect (read)))\n\n(defvar discount \n  (loop for x in A with lst = nil do\n        (loop if (zerop x) return nil do\n              (push (ceiling x 2) lst)\n              (setf x (floor x 2)))\n        finally (return (sort lst #'>))))\n\n(princ (- (reduce #'+ A)\n          (loop for x in discount\n                for i below M\n                sum x)))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 407, "cpu_time_ms": 1601, "memory_kb": 94564}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s825274015", "group_id": "codeNet:p02912", "input_text": "(let* ((n (read))\n       (m (read))\n       (lst (loop :repeat n :collect (read))))\n  (defun list-int-max (ll)\n    (let* ((l 0))\n      (loop :for k :from 0 :upto (1- (length ll)) :do(if (< (elt ll l)\n                                                            (elt ll k))\n                                                         (setf l k)))\n      l))\n  (defun f ()\n    (let* ((x (list-int-max lst)))\n      (setf (elt lst x) (floor (elt lst x) 2))))\n  (loop :repeat m :do(f))\n  (princ (reduce #'+ lst)))", "language": "Lisp", "metadata": {"date": 1568681851, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lisp/s825274015.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s825274015", "user_id": "u610490393"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (lst (loop :repeat n :collect (read))))\n  (defun list-int-max (ll)\n    (let* ((l 0))\n      (loop :for k :from 0 :upto (1- (length ll)) :do(if (< (elt ll l)\n                                                            (elt ll k))\n                                                         (setf l k)))\n      l))\n  (defun f ()\n    (let* ((x (list-int-max lst)))\n      (setf (elt lst x) (floor (elt lst x) 2))))\n  (loop :repeat m :do(f))\n  (princ (reduce #'+ lst)))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 502, "cpu_time_ms": 2104, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s035214867", "group_id": "codeNet:p02912", "input_text": "(let* ((n (read))\n       (m (read))\n       (lst (loop :repeat n :collect (read))))\n  (defun list-int-max (ll)\n    (let* ((l 0))\n      (loop :for k :from 0 :upto (1- (length ll)) :do(if (< (elt ll l)\n                                                            (elt ll k))\n                                                         (setf l k)))\n      l))\n  (defun f ()\n    (let* ((x (list-int-max lst)))\n      (setf (elt lst x) (floor (elt lst x) 2))))\n  (loop :repeat m :do(f))\n  (princ lst)\n  (princ (reduce #'+ lst)))", "language": "Lisp", "metadata": {"date": 1568681573, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lisp/s035214867.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s035214867", "user_id": "u610490393"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (lst (loop :repeat n :collect (read))))\n  (defun list-int-max (ll)\n    (let* ((l 0))\n      (loop :for k :from 0 :upto (1- (length ll)) :do(if (< (elt ll l)\n                                                            (elt ll k))\n                                                         (setf l k)))\n      l))\n  (defun f ()\n    (let* ((x (list-int-max lst)))\n      (setf (elt lst x) (floor (elt lst x) 2))))\n  (loop :repeat m :do(f))\n  (princ lst)\n  (princ (reduce #'+ lst)))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 516, "cpu_time_ms": 2104, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s523242408", "group_id": "codeNet:p02912", "input_text": "(let* ((n (read))\n       (m (read))\n       (a (sort (loop for i from 1 to n collect (read)) #'>)))\n  (loop for i from 1 to m\n        do (setf a\n                 (merge 'list (list (floor (/ (car a) 2))) (cdr a) #'>)))\n  (format t \"~A~%\" (apply #'+ a)))\n", "language": "Lisp", "metadata": {"date": 1568602899, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Lisp/s523242408.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s523242408", "user_id": "u608227593"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (a (sort (loop for i from 1 to n collect (read)) #'>)))\n  (loop for i from 1 to m\n        do (setf a\n                 (merge 'list (list (floor (/ (car a) 2))) (cdr a) #'>)))\n  (format t \"~A~%\" (apply #'+ a)))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 253, "cpu_time_ms": 2104, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s645764854", "group_id": "codeNet:p02913", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in)) ; declaring (sb-kernel:ansi-stream in) will be faster\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n;;;\n;;; Rolling hash (32-bit)\n;;; NOTE: 32-bit doesn't suffice especially when the strong collision resistance\n;;; is required. Better to use 62-bit version instead.\n;;;\n\n(defconstant +modulus+ 4294967291)\n(defconstant +base+ 2095716802)\n\n(defstruct (rhash (:constructor %make-rhash (cumul powers)))\n  (cumul nil :type (simple-array (unsigned-byte 32) (*)))\n  (powers nil :type (simple-array (unsigned-byte 32) (*))))\n\n(defun make-rhash (vector)\n  (declare #.OPT\n           (simple-base-string vector))\n  (let* ((size (length vector))\n         (cumul (make-array (+ 1 size) :element-type '(unsigned-byte 32)))\n         (powers (make-array (+ 1 size) :element-type '(unsigned-byte 32))))\n    (setf (aref powers 0) 1)\n    (dotimes (i size)\n      (setf (aref powers (+ i 1))\n            (mod (* (aref powers i) +base+) +modulus+))\n      (let ((sum (+ (mod (* (aref cumul i) +base+) +modulus+)\n                    (the (unsigned-byte 32) (char-code (aref vector i))))))\n        (setf (aref cumul (+ i 1))\n              (if (> sum +modulus+)\n                  (- sum +modulus+)\n                  sum))))\n    (%make-rhash cumul powers)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res)\n             (uint31 n))\n    (read-line-into s)\n    (let* ((rhash (make-rhash s))\n           (cumul (rhash-cumul rhash))\n           (powers (rhash-powers rhash)))\n      (dotimes (i1 n)\n        (loop for i2 from (+ i1 1) below n\n              for len = (min (- i2 i1)\n                             (let ((ok 0)\n                                   (ng (+ 1 (min (- n i1) (- n i2)))))\n                               (declare (uint31 ok ng))\n                               (loop\n                                 (if (<= (- ng ok) 1)\n                                     (return ok)\n                                     (let ((mid (ash (+ ng ok) -1)))\n                                       (declare (uint31 mid))\n                                       (if (= (let ((res (+ (aref cumul (+ i1 mid))\n                                                            (- +modulus+ (mod (* (aref cumul i1) (aref powers mid)) +modulus+)))))\n                                                (if (> res +modulus+)\n                                                    (- res +modulus+)\n                                                    res))\n                                              (let ((res (+ (aref cumul (+ i2 mid))\n                                                            (- +modulus+ (mod (* (aref cumul i2) (aref powers mid)) +modulus+)))))\n                                                (if (> res +modulus+)\n                                                    (- res +modulus+)\n                                                    res)))\n                                           (setq ok mid)\n                                           (setq ng mid)))))))\n              do (setq res (max res len))))\n      (println res))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1575019571, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lisp/s645764854.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s645764854", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in)) ; declaring (sb-kernel:ansi-stream in) will be faster\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n;;;\n;;; Rolling hash (32-bit)\n;;; NOTE: 32-bit doesn't suffice especially when the strong collision resistance\n;;; is required. Better to use 62-bit version instead.\n;;;\n\n(defconstant +modulus+ 4294967291)\n(defconstant +base+ 2095716802)\n\n(defstruct (rhash (:constructor %make-rhash (cumul powers)))\n  (cumul nil :type (simple-array (unsigned-byte 32) (*)))\n  (powers nil :type (simple-array (unsigned-byte 32) (*))))\n\n(defun make-rhash (vector)\n  (declare #.OPT\n           (simple-base-string vector))\n  (let* ((size (length vector))\n         (cumul (make-array (+ 1 size) :element-type '(unsigned-byte 32)))\n         (powers (make-array (+ 1 size) :element-type '(unsigned-byte 32))))\n    (setf (aref powers 0) 1)\n    (dotimes (i size)\n      (setf (aref powers (+ i 1))\n            (mod (* (aref powers i) +base+) +modulus+))\n      (let ((sum (+ (mod (* (aref cumul i) +base+) +modulus+)\n                    (the (unsigned-byte 32) (char-code (aref vector i))))))\n        (setf (aref cumul (+ i 1))\n              (if (> sum +modulus+)\n                  (- sum +modulus+)\n                  sum))))\n    (%make-rhash cumul powers)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res)\n             (uint31 n))\n    (read-line-into s)\n    (let* ((rhash (make-rhash s))\n           (cumul (rhash-cumul rhash))\n           (powers (rhash-powers rhash)))\n      (dotimes (i1 n)\n        (loop for i2 from (+ i1 1) below n\n              for len = (min (- i2 i1)\n                             (let ((ok 0)\n                                   (ng (+ 1 (min (- n i1) (- n i2)))))\n                               (declare (uint31 ok ng))\n                               (loop\n                                 (if (<= (- ng ok) 1)\n                                     (return ok)\n                                     (let ((mid (ash (+ ng ok) -1)))\n                                       (declare (uint31 mid))\n                                       (if (= (let ((res (+ (aref cumul (+ i1 mid))\n                                                            (- +modulus+ (mod (* (aref cumul i1) (aref powers mid)) +modulus+)))))\n                                                (if (> res +modulus+)\n                                                    (- res +modulus+)\n                                                    res))\n                                              (let ((res (+ (aref cumul (+ i2 mid))\n                                                            (- +modulus+ (mod (* (aref cumul i2) (aref powers mid)) +modulus+)))))\n                                                (if (> res +modulus+)\n                                                    (- res +modulus+)\n                                                    res)))\n                                           (setq ok mid)\n                                           (setq ng mid)))))))\n              do (setq res (max res len))))\n      (println res))))\n\n#-swank (main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5235, "cpu_time_ms": 2104, "memory_kb": 32352}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s418673363", "group_id": "codeNet:p02913", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in)) ; declaring (sb-kernel:ansi-stream in) will be faster\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n;;;\n;;; Rolling hash (32-bit)\n;;; NOTE: 32-bit doesn't suffice especially when the strong collision resistance\n;;; is required. Better to use 62-bit version instead.\n;;;\n\n(defconstant +modulus+ 4294967291)\n(defconstant +base+ 2095716802)\n\n(defstruct (rhash (:constructor %make-rhash (cumul powers)))\n  (cumul nil :type (simple-array (unsigned-byte 32) (*)))\n  (powers nil :type (simple-array (unsigned-byte 32) (*))))\n\n(defun make-rhash (vector)\n  (declare #.OPT\n           (simple-base-string vector))\n  (let* ((size (length vector))\n         (cumul (make-array (+ 1 size) :element-type '(unsigned-byte 32)))\n         (powers (make-array (+ 1 size) :element-type '(unsigned-byte 32))))\n    (setf (aref powers 0) 1)\n    (dotimes (i size)\n      (setf (aref powers (+ i 1))\n            (mod (* (aref powers i) +base+) +modulus+))\n      (let ((sum (+ (mod (* (aref cumul i) +base+) +modulus+)\n                    (the (unsigned-byte 32) (char-code (aref vector i))))))\n        (setf (aref cumul (+ i 1))\n              (if (> sum +modulus+)\n                  (- sum +modulus+)\n                  sum))))\n    (%make-rhash cumul powers)))\n\n(declaim (ftype (function * (values (unsigned-byte 32) &optional)) rhash-get-lcp))\n(defun rhash-get-lcp (rhash start1 start2)\n  (declare #.OPT\n           ((mod #.most-positive-fixnum) start1 start2))\n  (let* ((cumul (rhash-cumul rhash))\n         (powers (rhash-powers rhash))\n         (max-length (min (- (length cumul) start1 1)\n                          (- (length cumul) start2 1))))\n    (labels ((bisect (ok ng)\n               (declare ((integer 0 #.most-positive-fixnum) ok ng))\n               (if (<= (- ng ok) 1)\n                   ok\n                   (let ((mid (ash (+ ng ok) -1)))\n                     (if (= (let ((res (+ (aref cumul (+ start1 mid))\n                                          (- +modulus+ (mod (* (aref cumul start1) (aref powers mid)) +modulus+)))))\n                              (if (> res +modulus+)\n                                  (- res +modulus+)\n                                  res))\n                            (let ((res (+ (aref cumul (+ start2 mid))\n                                          (- +modulus+ (mod (* (aref cumul start2) (aref powers mid)) +modulus+)))))\n                              (if (> res +modulus+)\n                                  (- res +modulus+)\n                                  res)))\n                         (bisect mid ng)\n                         (bisect ok mid))))))\n      (bisect 0 (+ 1 max-length)))))\n\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res)\n             (uint31 n))\n    (read-line-into s)\n    (let ((rhash (make-rhash s)))\n      (dotimes (i1 n)\n        (loop for i2 from (+ i1 1) below n\n              for len = (min (- i2 i1) (rhash-get-lcp rhash i1 i2))\n              do (setq res (max res len))))\n      (println res))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1575019286, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lisp/s418673363.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s418673363", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in)) ; declaring (sb-kernel:ansi-stream in) will be faster\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n;;;\n;;; Rolling hash (32-bit)\n;;; NOTE: 32-bit doesn't suffice especially when the strong collision resistance\n;;; is required. Better to use 62-bit version instead.\n;;;\n\n(defconstant +modulus+ 4294967291)\n(defconstant +base+ 2095716802)\n\n(defstruct (rhash (:constructor %make-rhash (cumul powers)))\n  (cumul nil :type (simple-array (unsigned-byte 32) (*)))\n  (powers nil :type (simple-array (unsigned-byte 32) (*))))\n\n(defun make-rhash (vector)\n  (declare #.OPT\n           (simple-base-string vector))\n  (let* ((size (length vector))\n         (cumul (make-array (+ 1 size) :element-type '(unsigned-byte 32)))\n         (powers (make-array (+ 1 size) :element-type '(unsigned-byte 32))))\n    (setf (aref powers 0) 1)\n    (dotimes (i size)\n      (setf (aref powers (+ i 1))\n            (mod (* (aref powers i) +base+) +modulus+))\n      (let ((sum (+ (mod (* (aref cumul i) +base+) +modulus+)\n                    (the (unsigned-byte 32) (char-code (aref vector i))))))\n        (setf (aref cumul (+ i 1))\n              (if (> sum +modulus+)\n                  (- sum +modulus+)\n                  sum))))\n    (%make-rhash cumul powers)))\n\n(declaim (ftype (function * (values (unsigned-byte 32) &optional)) rhash-get-lcp))\n(defun rhash-get-lcp (rhash start1 start2)\n  (declare #.OPT\n           ((mod #.most-positive-fixnum) start1 start2))\n  (let* ((cumul (rhash-cumul rhash))\n         (powers (rhash-powers rhash))\n         (max-length (min (- (length cumul) start1 1)\n                          (- (length cumul) start2 1))))\n    (labels ((bisect (ok ng)\n               (declare ((integer 0 #.most-positive-fixnum) ok ng))\n               (if (<= (- ng ok) 1)\n                   ok\n                   (let ((mid (ash (+ ng ok) -1)))\n                     (if (= (let ((res (+ (aref cumul (+ start1 mid))\n                                          (- +modulus+ (mod (* (aref cumul start1) (aref powers mid)) +modulus+)))))\n                              (if (> res +modulus+)\n                                  (- res +modulus+)\n                                  res))\n                            (let ((res (+ (aref cumul (+ start2 mid))\n                                          (- +modulus+ (mod (* (aref cumul start2) (aref powers mid)) +modulus+)))))\n                              (if (> res +modulus+)\n                                  (- res +modulus+)\n                                  res)))\n                         (bisect mid ng)\n                         (bisect ok mid))))))\n      (bisect 0 (+ 1 max-length)))))\n\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res)\n             (uint31 n))\n    (read-line-into s)\n    (let ((rhash (make-rhash s)))\n      (dotimes (i1 n)\n        (loop for i2 from (+ i1 1) below n\n              for len = (min (- i2 i1) (rhash-get-lcp rhash i1 i2))\n              do (setq res (max res len))))\n      (println res))))\n\n#-swank (main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5178, "cpu_time_ms": 2104, "memory_kb": 31972}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s724638238", "group_id": "codeNet:p02913", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Z-algorithm\n;;;\n\n(declaim (inline make-z-array))\n(defun make-z-array (vector &key (test #'eql))\n  \"Returns a vector Z of the same length as VECTOR. An element Z[i] is the\nlength of the longest substring starting from i which is also a prefix of\nVECTOR.\"\n  (declare (vector vector))\n  (let* ((size (length vector))\n         (base 0)\n         (res (make-array size\n                          :element-type '(unsigned-byte 16)\n                          :initial-element 0)))\n    (declare ((integer 0 #.most-positive-fixnum) base))\n    (loop for i from 1 below size\n          do (if (< (+ i (aref res (- i base)))\n                    (+ base (aref res base)))\n                 (setf (aref res i)\n                       (aref res (- i base)))\n                 (let ((delta (max 0 (- (+ base (aref res base)) i))))\n                   (declare ((integer 0 #.most-positive-fixnum) delta))\n                   (loop while (and (< (+ i delta) size)\n                                    (funcall test\n                                             (aref vector delta)\n                                             (aref vector (+ i delta))))\n                         do (incf delta))\n                   (setf (aref res i) delta\n                         base i))))\n    (unless (zerop size)\n      (setf (aref res 0) size))\n    res))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res)\n             (base-string s))\n    (read-line-into s)\n    (dotimes (start n)\n      (let* ((s (subseq s start))\n             (z-array (make-z-array s)))\n        (declare (simple-base-string s))\n        (loop for j from 1 below (length z-array)\n              do (setq res (max res (min j (aref z-array j)))))))\n    (println res)))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1568670960, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lisp/s724638238.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s724638238", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Z-algorithm\n;;;\n\n(declaim (inline make-z-array))\n(defun make-z-array (vector &key (test #'eql))\n  \"Returns a vector Z of the same length as VECTOR. An element Z[i] is the\nlength of the longest substring starting from i which is also a prefix of\nVECTOR.\"\n  (declare (vector vector))\n  (let* ((size (length vector))\n         (base 0)\n         (res (make-array size\n                          :element-type '(unsigned-byte 16)\n                          :initial-element 0)))\n    (declare ((integer 0 #.most-positive-fixnum) base))\n    (loop for i from 1 below size\n          do (if (< (+ i (aref res (- i base)))\n                    (+ base (aref res base)))\n                 (setf (aref res i)\n                       (aref res (- i base)))\n                 (let ((delta (max 0 (- (+ base (aref res base)) i))))\n                   (declare ((integer 0 #.most-positive-fixnum) delta))\n                   (loop while (and (< (+ i delta) size)\n                                    (funcall test\n                                             (aref vector delta)\n                                             (aref vector (+ i delta))))\n                         do (incf delta))\n                   (setf (aref res i) delta\n                         base i))))\n    (unless (zerop size)\n      (setf (aref res 0) size))\n    res))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res)\n             (base-string s))\n    (read-line-into s)\n    (dotimes (start n)\n      (let* ((s (subseq s start))\n             (z-array (make-z-array s)))\n        (declare (simple-base-string s))\n        (loop for j from 1 below (length z-array)\n              do (setq res (max res (min j (aref z-array j)))))))\n    (println res)))\n\n#-swank (main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3978, "cpu_time_ms": 237, "memory_kb": 59880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s555996590", "group_id": "codeNet:p02913", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline displace))\n(defun displace (vector &optional (start 0) end)\n  \"displaced subseq\"\n  (declare (vector vector)\n           ((integer 0 #.array-total-size-limit) start)\n           ((or null (integer 0 #.array-total-size-limit)) end))\n  (let ((end (or end (length vector))))\n    (make-array (- end start)\n                :element-type (array-element-type vector)\n                :displaced-to vector\n                :displaced-index-offset start)))\n\n;;;\n;;; Z-algorithm\n;;;\n\n(declaim (inline make-z-array))\n(defun make-z-array (vector &key (test #'eql))\n  \"Returns a vector Z of the same length as VECTOR. An element Z[i] is the\nlength of the longest substring starting from i which is also a prefix of\nVECTOR.\"\n  (declare (vector vector))\n  (let* ((size (length vector))\n         (base 0)\n         (res (make-array size\n                          :element-type '(integer 0 #.most-positive-fixnum)\n                          :initial-element 0)))\n    (declare ((integer 0 #.most-positive-fixnum) base))\n    (loop for i from 1 below size\n          do (if (< (+ i (aref res (- i base)))\n                    (+ base (aref res base)))\n                 (setf (aref res i)\n                       (aref res (- i base)))\n                 (let ((delta (max 0 (- (+ base (aref res base)) i))))\n                   (declare ((integer 0 #.most-positive-fixnum) delta))\n                   (loop while (and (< (+ i delta) size)\n                                    (funcall test\n                                             (aref vector delta)\n                                             (aref vector (+ i delta))))\n                         do (incf delta))\n                   (setf (aref res i) delta\n                         base i))))\n    (unless (zerop size)\n      (setf (aref res 0) size))\n    res))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res)\n             (base-string s))\n    (read-line-into s)\n    (dotimes (start n)\n      (let* ((s (displace s start))\n             (z-array (make-z-array s)))\n        (declare (base-string s))\n        (loop for j from 1 below (length z-array)\n              do (setq res (max res (min j (aref z-array j)))))))\n    (println res)))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1568665550, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lisp/s555996590.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s555996590", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline displace))\n(defun displace (vector &optional (start 0) end)\n  \"displaced subseq\"\n  (declare (vector vector)\n           ((integer 0 #.array-total-size-limit) start)\n           ((or null (integer 0 #.array-total-size-limit)) end))\n  (let ((end (or end (length vector))))\n    (make-array (- end start)\n                :element-type (array-element-type vector)\n                :displaced-to vector\n                :displaced-index-offset start)))\n\n;;;\n;;; Z-algorithm\n;;;\n\n(declaim (inline make-z-array))\n(defun make-z-array (vector &key (test #'eql))\n  \"Returns a vector Z of the same length as VECTOR. An element Z[i] is the\nlength of the longest substring starting from i which is also a prefix of\nVECTOR.\"\n  (declare (vector vector))\n  (let* ((size (length vector))\n         (base 0)\n         (res (make-array size\n                          :element-type '(integer 0 #.most-positive-fixnum)\n                          :initial-element 0)))\n    (declare ((integer 0 #.most-positive-fixnum) base))\n    (loop for i from 1 below size\n          do (if (< (+ i (aref res (- i base)))\n                    (+ base (aref res base)))\n                 (setf (aref res i)\n                       (aref res (- i base)))\n                 (let ((delta (max 0 (- (+ base (aref res base)) i))))\n                   (declare ((integer 0 #.most-positive-fixnum) delta))\n                   (loop while (and (< (+ i delta) size)\n                                    (funcall test\n                                             (aref vector delta)\n                                             (aref vector (+ i delta))))\n                         do (incf delta))\n                   (setf (aref res i) delta\n                         base i))))\n    (unless (zerop size)\n      (setf (aref res 0) size))\n    res))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res)\n             (base-string s))\n    (read-line-into s)\n    (dotimes (start n)\n      (let* ((s (displace s start))\n             (z-array (make-z-array s)))\n        (declare (base-string s))\n        (loop for j from 1 below (length z-array)\n              do (setq res (max res (min j (aref z-array j)))))))\n    (println res)))\n\n#-swank (main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4450, "cpu_time_ms": 939, "memory_kb": 86624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s275166814", "group_id": "codeNet:p02913", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline displace))\n(defun displace (vector &optional (start 0) end)\n  \"displaced subseq\"\n  (declare (vector vector)\n           ((integer 0 #.array-total-size-limit) start)\n           ((or null (integer 0 #.array-total-size-limit)) end))\n  (let ((end (or end (length vector))))\n    (make-array (- end start)\n                :element-type (array-element-type vector)\n                :displaced-to vector\n                :displaced-index-offset start)))\n\n;;;\n;;; Z-algorithm\n;;;\n\n(declaim (inline make-z-array))\n(defun make-z-array (vector &key (test #'eql))\n  \"Returns a vector Z of the same length as VECTOR. An element Z[i] is the\nlength of the longest substring starting from i which is also a prefix of\nVECTOR.\"\n  (declare (vector vector))\n  (let* ((size (length vector))\n         (base 0)\n         (res (make-array size\n                          :element-type '(integer 0 #.most-positive-fixnum)\n                          :initial-element 0)))\n    (declare ((integer 0 #.most-positive-fixnum) base))\n    (loop for i from 1 below size\n          do (if (< (+ i (aref res (- i base)))\n                    (+ base (aref res base)))\n                 (setf (aref res i)\n                       (aref res (- i base)))\n                 (let ((delta (max 0 (- (+ base (aref res base)) i))))\n                   (declare ((integer 0 #.most-positive-fixnum) delta))\n                   (loop while (and (< (+ i delta) size)\n                                    (funcall test\n                                             (aref vector delta)\n                                             (aref vector (+ i delta))))\n                         do (incf delta))\n                   (setf (aref res i) delta))))\n    (unless (zerop size)\n      (setf (aref res 0) size))\n    res))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res)\n             (base-string s))\n    (read-line-into s)\n    (dotimes (start n)\n      (let* ((s (subseq s start))\n             (z-array (make-z-array s)))\n        (declare (simple-base-string s))\n        (loop for j from 1 below (length z-array)\n              do (setq res (max res (min j (aref z-array j)))))))\n    (println res)))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1568665252, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lisp/s275166814.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s275166814", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline displace))\n(defun displace (vector &optional (start 0) end)\n  \"displaced subseq\"\n  (declare (vector vector)\n           ((integer 0 #.array-total-size-limit) start)\n           ((or null (integer 0 #.array-total-size-limit)) end))\n  (let ((end (or end (length vector))))\n    (make-array (- end start)\n                :element-type (array-element-type vector)\n                :displaced-to vector\n                :displaced-index-offset start)))\n\n;;;\n;;; Z-algorithm\n;;;\n\n(declaim (inline make-z-array))\n(defun make-z-array (vector &key (test #'eql))\n  \"Returns a vector Z of the same length as VECTOR. An element Z[i] is the\nlength of the longest substring starting from i which is also a prefix of\nVECTOR.\"\n  (declare (vector vector))\n  (let* ((size (length vector))\n         (base 0)\n         (res (make-array size\n                          :element-type '(integer 0 #.most-positive-fixnum)\n                          :initial-element 0)))\n    (declare ((integer 0 #.most-positive-fixnum) base))\n    (loop for i from 1 below size\n          do (if (< (+ i (aref res (- i base)))\n                    (+ base (aref res base)))\n                 (setf (aref res i)\n                       (aref res (- i base)))\n                 (let ((delta (max 0 (- (+ base (aref res base)) i))))\n                   (declare ((integer 0 #.most-positive-fixnum) delta))\n                   (loop while (and (< (+ i delta) size)\n                                    (funcall test\n                                             (aref vector delta)\n                                             (aref vector (+ i delta))))\n                         do (incf delta))\n                   (setf (aref res i) delta))))\n    (unless (zerop size)\n      (setf (aref res 0) size))\n    res))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res)\n             (base-string s))\n    (read-line-into s)\n    (dotimes (start n)\n      (let* ((s (subseq s start))\n             (z-array (make-z-array s)))\n        (declare (simple-base-string s))\n        (loop for j from 1 below (length z-array)\n              do (setq res (max res (min j (aref z-array j)))))))\n    (println res)))\n\n#-swank (main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4423, "cpu_time_ms": 2104, "memory_kb": 88552}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s039941437", "group_id": "codeNet:p02913", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Rolling hash (32-bit)\n;;; NOTE: 32-bit doesn't suffice especially when the strong collision resistance\n;;; is required. Better to use 62-bit version instead.\n;;;\n\n(defconstant +modulus+ 4294967291)\n(defconstant +base+ 2095716802)\n\n(defstruct (rhash (:constructor %make-rhash (cumul powers)))\n  (cumul nil :type (simple-array (unsigned-byte 32) (*)))\n  (powers nil :type (simple-array (unsigned-byte 32) (*))))\n\n(declaim (inline make-rhash))\n(defun make-rhash (vector &key (key #'char-code))\n  (declare (vector vector)\n           (function key))\n  (let* ((size (length vector))\n         (cumul (make-array (+ 1 size) :element-type '(unsigned-byte 32)))\n         (powers (make-array (+ 1 size) :element-type '(unsigned-byte 32))))\n    (setf (aref powers 0) 1)\n    (dotimes (i size)\n      (setf (aref powers (+ i 1))\n            (mod (* (aref powers i) +base+) +modulus+))\n      (let ((sum (+ (mod (* (aref cumul i) +base+) +modulus+)\n                    (mod (the fixnum (funcall key (aref vector i))) +modulus+))))\n        (setf (aref cumul (+ i 1))\n              (if (> sum +modulus+)\n                  (- sum +modulus+)\n                  sum))))\n    (%make-rhash cumul powers)))\n\n(declaim (inline rhash-get-lcp)\n         (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional)) rhsah-get-lcp))\n(defun rhash-get-lcp (rhash start1 start2)\n  (declare #.OPT\n           ((mod #.most-positive-fixnum) start1 start2))\n  (let ((max-length (min (- (length (rhash-cumul rhash)) start1 1)\n                         (- (length (rhash-cumul rhash)) start2 1)))\n        (cumul (rhash-cumul rhash))\n        (powers (rhash-powers rhash)))\n    (declare (optimize (safety 0)))\n    (labels ((bisect (ok ng)\n               (declare ((unsigned-byte 32) ok ng))\n               (if (<= (- ng ok) 1)\n                   ok\n                   (let ((mid (ash (+ ng ok) -1)))\n                     (if (let ((res1 (+ (aref cumul (+ start1 mid))\n                                        (- +modulus+ (nth-value 1 (floor (* (aref cumul start1) (aref powers mid)) +modulus+)))))\n                               (res2 (+ (aref cumul (+ start2 mid))\n                                        (- +modulus+ (nth-value 1 (floor (* (aref cumul start2) (aref powers mid)) +modulus+))))))\n                           (= (if (> res1 +modulus+)\n                                  (- res1 +modulus+)\n                                  res1)\n                              (if (> res2 +modulus+)\n                                  (- res2 +modulus+)\n                                  res2)))\n                         (bisect mid ng)\n                         (bisect ok mid))))))\n      (bisect 0 (+ 1 max-length)))))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res))\n    (read-line-into s)\n    (let ((rhash (make-rhash s)))\n      (dotimes (i1 n)\n        (loop for i2 from (+ i1 1) below n\n              for len = (min (- i2 i1) (rhash-get-lcp rhash i1 i2))\n              do (setq res (max res len))))\n      (println res))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1568659284, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lisp/s039941437.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s039941437", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Rolling hash (32-bit)\n;;; NOTE: 32-bit doesn't suffice especially when the strong collision resistance\n;;; is required. Better to use 62-bit version instead.\n;;;\n\n(defconstant +modulus+ 4294967291)\n(defconstant +base+ 2095716802)\n\n(defstruct (rhash (:constructor %make-rhash (cumul powers)))\n  (cumul nil :type (simple-array (unsigned-byte 32) (*)))\n  (powers nil :type (simple-array (unsigned-byte 32) (*))))\n\n(declaim (inline make-rhash))\n(defun make-rhash (vector &key (key #'char-code))\n  (declare (vector vector)\n           (function key))\n  (let* ((size (length vector))\n         (cumul (make-array (+ 1 size) :element-type '(unsigned-byte 32)))\n         (powers (make-array (+ 1 size) :element-type '(unsigned-byte 32))))\n    (setf (aref powers 0) 1)\n    (dotimes (i size)\n      (setf (aref powers (+ i 1))\n            (mod (* (aref powers i) +base+) +modulus+))\n      (let ((sum (+ (mod (* (aref cumul i) +base+) +modulus+)\n                    (mod (the fixnum (funcall key (aref vector i))) +modulus+))))\n        (setf (aref cumul (+ i 1))\n              (if (> sum +modulus+)\n                  (- sum +modulus+)\n                  sum))))\n    (%make-rhash cumul powers)))\n\n(declaim (inline rhash-get-lcp)\n         (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional)) rhsah-get-lcp))\n(defun rhash-get-lcp (rhash start1 start2)\n  (declare #.OPT\n           ((mod #.most-positive-fixnum) start1 start2))\n  (let ((max-length (min (- (length (rhash-cumul rhash)) start1 1)\n                         (- (length (rhash-cumul rhash)) start2 1)))\n        (cumul (rhash-cumul rhash))\n        (powers (rhash-powers rhash)))\n    (declare (optimize (safety 0)))\n    (labels ((bisect (ok ng)\n               (declare ((unsigned-byte 32) ok ng))\n               (if (<= (- ng ok) 1)\n                   ok\n                   (let ((mid (ash (+ ng ok) -1)))\n                     (if (let ((res1 (+ (aref cumul (+ start1 mid))\n                                        (- +modulus+ (nth-value 1 (floor (* (aref cumul start1) (aref powers mid)) +modulus+)))))\n                               (res2 (+ (aref cumul (+ start2 mid))\n                                        (- +modulus+ (nth-value 1 (floor (* (aref cumul start2) (aref powers mid)) +modulus+))))))\n                           (= (if (> res1 +modulus+)\n                                  (- res1 +modulus+)\n                                  res1)\n                              (if (> res2 +modulus+)\n                                  (- res2 +modulus+)\n                                  res2)))\n                         (bisect mid ng)\n                         (bisect ok mid))))))\n      (bisect 0 (+ 1 max-length)))))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char))\n         (res 0))\n    (declare (uint62 res))\n    (read-line-into s)\n    (let ((rhash (make-rhash s)))\n      (dotimes (i1 n)\n        (loop for i2 from (+ i1 1) below n\n              for len = (min (- i2 i1) (rhash-get-lcp rhash i1 i2))\n              do (setq res (max res len))))\n      (println res))))\n\n#-swank (main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5275, "cpu_time_ms": 2104, "memory_kb": 38372}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s258605315", "group_id": "codeNet:p02913", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Rolling hash (62-bit)\n;;;\n\n;; Reference:\n;; https://www.mii.lt/olympiads_in_informatics/pdf/INFOL119.pdf\n;; https://ei1333.github.io/luzhiled/snippets/string/rolling-hash.html\n\n(defstruct (rhash (:constructor %make-rhash (mod1 base1 cumul1 powers1 mod2 base2 cumul2 powers2)))\n  ;; lower 31-bit value\n  (mod1 2147483647 :type (unsigned-byte 31))\n  (base1 1059428526 :type (unsigned-byte 31))\n  (cumul1 nil :type (simple-array (unsigned-byte 31) (*)))\n  (powers1 nil :type (simple-array (unsigned-byte 31) (*)))\n  ;; upper 31-bit value\n  (mod2 2147483629 :type (unsigned-byte 31))\n  (base2 2090066834 :type (unsigned-byte 31))\n  (cumul2 nil :type (simple-array (unsigned-byte 31) (*)))\n  (powers2 nil :type (simple-array (unsigned-byte 31) (*))))\n\n;; This table consists of pairs of primes less than 2^31 and the random\n;; primitive roots modulo them larger than 10^9. We randomly choose a pair and\n;; adopt the prime as modulus and the primitive root as base.\n(declaim ((simple-array (unsigned-byte 31) (100)) *moduli-table* *base-table*))\n(defparameter *moduli-table*\n  (make-array 100 :element-type '(unsigned-byte 31)\n                  :initial-contents '(2147483647 2147483629 2147483587 2147483579 2147483563 2147483549 2147483543\n 2147483497 2147483489 2147483477 2147483423 2147483399 2147483353 2147483323\n 2147483269 2147483249 2147483237 2147483179 2147483171 2147483137 2147483123\n 2147483077 2147483069 2147483059 2147483053 2147483033 2147483029 2147482951\n 2147482949 2147482943 2147482937 2147482921 2147482877 2147482873 2147482867\n 2147482859 2147482819 2147482817 2147482811 2147482801 2147482763 2147482739\n 2147482697 2147482693 2147482681 2147482663 2147482661 2147482621 2147482591\n 2147482583 2147482577 2147482507 2147482501 2147482481 2147482417 2147482409\n 2147482367 2147482361 2147482349 2147482343 2147482327 2147482291 2147482273\n 2147482237 2147482231 2147482223 2147482121 2147482093 2147482091 2147482081\n 2147482063 2147482021 2147481997 2147481967 2147481949 2147481937 2147481907\n 2147481901 2147481899 2147481893 2147481883 2147481863 2147481827 2147481811\n 2147481797 2147481793 2147481673 2147481629 2147481571 2147481563 2147481529\n 2147481509 2147481499 2147481491 2147481487 2147481373 2147481367 2147481359\n 2147481353 2147481337)))\n(defparameter *base-table*\n  (make-array 100 :element-type '(unsigned-byte 31)\n                  :initial-contents '(1059428526 2090066834 1772913519 1695158082 1516083910 1622025757 1248368302\n 1894391153 2094976878 1193495823 1783230399 1520742486 1748395380 1703688443\n 2138630366 1942049269 2066548889 1890950855 1480056952 1792721876 1092797280\n 1204851872 1035383130 1002272185 1319736653 1980774767 1748793187 1866963602\n 1200445534 1732959733 1214706585 1957228822 1479411729 1323155655 1052714514\n 1989821027 1163834549 1095622874 2087901566 1670886084 1191975321 2091468260\n 1429690292 1116037844 1420457779 1937649612 1552519679 1328604092 2090326292\n 1397132095 1316705322 1664351025 1391513321 1851038917 1556301575 1928956735\n 1764506480 1449537491 2119470570 1793768237 1831208371 1723755364 1643456516\n 1993819805 1419297891 1755252963 1775153034 1388979165 2144586633 1501222238\n 1872274033 1143076711 1229125474 1483974015 1997206147 1593231852 1632083893\n 1601537043 2012194627 1299923971 1566635240 1814404069 1619988648 2072686565\n 2014361572 1213868607 1166967329 1009325840 1306167671 1915239658 1223190075\n 1821151471 2037700892 1646950698 1517859810 1099233635 1004913731 1653443892\n 1782112665 1018916580)))\n\n(defun %choose-moduli (mod1 mod2 base1 base2 rhash)\n  \"Chooses two appropriate pairs of moduli and bases.\"\n  (declare ((or null (unsigned-byte 31)) mod1 mod2 base1 base2))\n  (when rhash\n    (return-from %choose-moduli\n      (values (rhash-mod1 rhash)\n              (rhash-mod2 rhash)\n              (rhash-base1 rhash)\n              (rhash-base2 rhash))))\n  (let* ((rand1 (random (length *moduli-table*)))\n         (rand2 (loop (let ((tmp (random (length *moduli-table*))))\n                        (unless (= tmp rand1)\n                          (return tmp))))))\n    (if mod1\n        (progn\n          #+sbcl (assert (sb-int:positive-primep mod1))\n          (setq base1 (or base1 (+ 1 (random (- mod1 1))))))\n        (progn\n          (setq mod1 (or mod1 (aref *moduli-table* rand1)))\n          (if base1\n              (assert (<= 1 base1 (- mod1 1)))\n              (setq base1 (aref *base-table* rand1)))))\n    (if mod2\n        (progn\n          #+sbcl (assert (sb-int:positive-primep mod2))\n          (setq base2 (or base2 (+ 1 (random (- mod2 1))))))\n        (progn\n          (setq mod2 (or mod2 (aref *moduli-table* rand2)))\n          (if base2\n              (assert (<= 1 base2 (- mod2 1)))\n              (setq base2 (aref *base-table* rand2))))))\n  (values mod1 mod2 base1 base2))\n\n(defun make-rhash (vector &key (key #'char-code) mod1 mod2 base1 base2 rhash)\n  \"Returns the table of rolling-hash of VECTOR modulo MOD1 and MOD2. KEY is\napplied to each element of VECTOR prior to computing the hash value. If moduli\nand bases are NIL, this function randomly chooses them. If RHASH is specified,\nthe same moduli and bases as RHASH is adopted.\n\nMOD[1|2] := NIL | unsigned 31-bit prime number\nBASE1 := NIL | 1 | 2 | ... | MOD1 - 1\nBASE2 := NIL | 1 | 2 | ... | MOD2 - 1\nKEY := FUNCTION returning FIXNUM\nRHASH := NIL | RHASH\"\n  (declare (optimize (speed 3))\n           (vector vector)\n           ((or null (unsigned-byte 31)) mod1 mod2 base1 base2)\n           (function key))\n  (multiple-value-bind (mod1 mod2 base1 base2) (%choose-moduli mod1 mod2 base1 base2 rhash)\n    (declare ((unsigned-byte 31) mod1 mod2 base1 base2))\n    (let* ((size (length vector))\n           (cumul1 (make-array (+ 1 size) :element-type '(unsigned-byte 31)))\n           (powers1 (make-array (+ 1 size) :element-type '(unsigned-byte 31)))\n           (cumul2 (make-array (+ 1 size) :element-type '(unsigned-byte 31)))\n           (powers2 (make-array (+ 1 size) :element-type '(unsigned-byte 31))))\n      (setf (aref powers1 0) 1\n            (aref powers2 0) 1)\n      (dotimes (i size)\n        (setf (aref powers1 (+ i 1))\n              (mod (* (aref powers1 i) base1) mod1)\n              (aref powers2 (+ i 1))\n              (mod (* (aref powers2 i) base2) mod2))\n        (let ((sum1 (+ (mod (* base1 (aref cumul1 i)) mod1)\n                       (mod (the fixnum (funcall key (aref vector i))) mod1)))\n              (sum2 (+ (mod (* base2 (aref cumul2 i)) mod2)\n                       (mod (the fixnum (funcall key (aref vector i))) mod2))))\n          (setf (aref cumul1 (+ i 1)) (if (> sum1 mod1)\n                                          (- sum1 mod1)\n                                          sum1)\n                (aref cumul2 (+ i 1)) (if (> sum2 mod2)\n                                          (- sum2 mod2)\n                                          sum2))))\n      (%make-rhash mod1 base1 cumul1 powers1 mod2 base2 cumul2 powers2))))\n\n(declaim (ftype (function * (values (unsigned-byte 62) &optional)) rhash-vector-hash)\n         (inline rhash-vector-hash))\n(defun rhash-vector-hash (rhash vector &key (key #'char-code))\n  \"Returns the hash code of VECTOR w.r.t. the moduli and bases of RHASH.\"\n  (declare (optimize (speed 3))\n           (vector vector)\n           (function key))\n  (let* ((mod1 (rhash-mod1 rhash))\n         (mod2 (rhash-mod2 rhash))\n         (base1 (rhash-base1 rhash))\n         (base2 (rhash-base2 rhash))\n         (size (length vector))\n         (lower 0)\n         (upper 0))\n    (declare ((unsigned-byte 31) lower upper))\n    (dotimes (i size)\n      (setf lower (mod (+ (* base1 lower)\n                          (mod (the fixnum (funcall key (aref vector i))) mod1))\n                       mod1))\n      (setf upper (mod (+ (* base2 upper)\n                          (mod (the fixnum (funcall key (aref vector i))) mod2))\n                       mod2)))\n    (dpb upper (byte 31 31) lower)))\n\n(declaim (inline rhash-query)\n         (ftype (function * (values (unsigned-byte 62) &optional)) rhash-query))\n(defun rhash-query (rhash l r)\n  \"Returns the hash value of the interval [L, R).\"\n  (declare ((integer 0 #.most-positive-fixnum) l r))\n  (assert (<= l r))\n  (let ((cumul1 (rhash-cumul1 rhash))\n        (powers1 (rhash-powers1 rhash))\n        (mod1 (rhash-mod1 rhash))\n        (cumul2 (rhash-cumul2 rhash))\n        (powers2 (rhash-powers2 rhash))\n        (mod2 (rhash-mod2 rhash)))\n    (let ((lower (+ (aref cumul1 r)\n                    (- mod1 (mod (* (aref cumul1 l) (aref powers1 (- r l))) mod1))))\n          (upper (+ (aref cumul2 r)\n                    (- mod2 (mod (* (aref cumul2 l) (aref powers2 (- r l))) mod2)))))\n      (let ((lower (if (> lower mod1) (- lower mod1) lower))\n            (upper (if (> upper mod2) (- upper mod2) upper)))\n        (declare ((unsigned-byte 31) lower upper))\n        (dpb upper (byte 31 31) lower)))))\n\n(declaim (inline rhash-concat))\n(defun rhash-concat (rhash hash1 hash2 length2)\n  \"Returns the hash value of the concatenated sequence.\n\nHASH1 := hash value of the first sequence\nHASH2 := hash value of the second sequence\nLENGTH2 := length of the second sequence.\"\n  (declare ((unsigned-byte 62) hash1 hash2)\n           ((integer 0 #.most-positive-fixnum) length2))\n  (let* ((hash1-lower (ldb (byte 31 0) hash1))\n         (hash1-upper (ldb (byte 31 31) hash1))\n         (hash2-lower (ldb (byte 31 0) hash2))\n         (hash2-upper (ldb (byte 31 31) hash2))\n         (mod1 (rhash-mod1 rhash))\n         (mod2 (rhash-mod2 rhash))\n         (res-lower (mod (+ hash2-lower\n                            (* hash1-lower\n                               (aref (rhash-powers1 rhash) length2)))\n                         mod1))\n         (res-upper (mod (+ hash2-upper\n                            (* hash1-upper\n                               (aref (rhash-powers2 rhash) length2)))\n                         mod2)))\n    (declare ((unsigned-byte 31) res-lower res-upper))\n    (dpb res-upper (byte 31 31) res-lower)))\n\n(declaim (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional)) rhash-get-lcp))\n(defun rhash-get-lcp (rhash1 start1 rhash2 start2)\n  \"Returns the length of the longest common prefix of two suffixes which begin\nat START1 and START2.\"\n  (declare (optimize (speed 3))\n           ((mod #.most-positive-fixnum) start1 start2))\n  (assert (and (= (rhash-mod1 rhash1) (rhash-mod1 rhash2))\n               (= (rhash-mod2 rhash1) (rhash-mod2 rhash2))))\n  (assert (and (< start1 (length (rhash-cumul1 rhash1)))\n               (< start2 (length (rhash-cumul1 rhash2)))))\n  (let ((max-length (min (- (length (rhash-cumul1 rhash1)) start1 1)\n                         (- (length (rhash-cumul1 rhash2)) start2 1))))\n    (declare (optimize (safety 0)))\n    (labels ((bisect (ok ng)\n               (declare ((integer 0 #.most-positive-fixnum) ok ng))\n               (if (<= (- ng ok) 1)\n                   ok\n                   (let ((mid (ash (+ ng ok) -1)))\n                     (if (= (rhash-query rhash1 start1 (+ start1 mid))\n                            (rhash-query rhash2 start2 (+ start2 mid)))\n                         (bisect mid ng)\n                         (bisect ok mid))))))\n      (bisect 0 (+ 1 max-length)))))\n\n(defun map-prefix-hash (rhash vector function &key (start 0) end)\n  \"Applies FUNCTION to the hash value of each prefix of VECTOR (in ascending\norder, including null prefix).\"\n  (declare (vector vector)\n           (function function)\n           ((integer 0 #.most-positive-fixnum) start)\n           ((or null (integer 0 #.most-positive-fixnum)) end))\n  (let* ((end (or end (length vector)))\n         (mod1 (rhash-mod1 rhash))\n         (mod2 (rhash-mod2 rhash))\n         (base1 (rhash-base1 rhash))\n         (base2 (rhash-base2 rhash))\n         (lower 0)\n         (upper 0))\n    (loop for i from start below end\n          do (funcall function (dpb upper (byte 31 31) lower))\n             (setq lower (mod (* lower base1) mod1)\n                   upper (mod (* upper base2) mod2)))))\n\n;;;\n;;; double-ended queue (ring buffer)\n;;;\n\n(define-condition deque-empty-error (simple-error)\n  ((queue :initarg :queue :reader deque-empty-error-queue))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Attempted to pop empty deque ~W\" (deque-empty-error-queue condition)))))\n\n(define-condition deque-full-error (simple-error)\n  ((queue :initarg :queue :reader deque-full-error-queue)\n   (item :initarg :item :reader deque-full-error-item))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Attempted to push item ~W to full deque ~W\"\n             (deque-full-error-item condition)\n             (deque-full-error-queue condition)))))\n\n(define-condition deque-invalid-index-error (simple-error)\n  ((queue :initarg :queue :reader deque-invalid-index-error-queue)\n   (index :initarg :index :reader deque-invalid-index-error-index))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Invalid index ~W for ~W.\"\n             (deque-invalid-index-error-index condition)\n             (deque-invalid-index-error-queue condition)))))\n\n;; TODO: detailed documentation\n(defmacro define-deque (name &key (element-type 'fixnum))\n  \"Defines deque for given ELEMENT-TYPE.\n\nconstructor: MAKE-<NAME>.\nbasic operations: <NAME>-PUSH-FRONT, <NAME>-PUSH-BACK, <NAME>-POP-FRONT,\n<NAME>-POP-BACK.\naccessor: <NAME>-REF.\nutilities: <NAME>-EMPTY-P, <NAME>-REINITIALIZE.\n\"\n  (let ((push-front (intern (format nil \"~A-PUSH-FRONT\" name)))\n        (push-back (intern (format nil \"~A-PUSH-BACK\" name)))\n        (pop-front (intern (format nil \"~A-POP-FRONT\" name)))\n        (pop-back (intern (format nil \"~A-POP-BACK\" name)))\n        (empty-p (intern (format nil \"~A-EMPTY-P\" name)))\n        (constructor (intern (format nil \"MAKE-~A\" name)))\n        (reinitializer (intern (format nil \"~A-REINITIALIZE\" name)))\n        (reffer (intern (format nil \"~A-REF\" name)))\n        (data-getter (intern (format nil \"~A-DATA\" name)))\n        (front-getter (intern (format nil \"~A-FRONT\" name)))\n        (count-getter (intern (format nil \"~A-COUNT\" name))))\n    `(progn\n       (defstruct (,name (:constructor ,constructor\n                             (size &aux\n                                   (data (progn\n                                           (check-type size (integer 0))\n                                           (make-array (+ 1 size) :element-type ',element-type)))))\n                         (:copier nil)\n                         (:predicate nil))\n         (data nil :type (simple-array ,element-type (*)))\n         (front 0 :type (integer 0 #.most-positive-fixnum))\n         (count 0 :type (integer 0 #.most-positive-fixnum)))\n\n       (declaim (inline ,push-front))\n       (defun ,push-front (obj ,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (next (- front 1)))\n             (declare ((integer -1 #.most-positive-fixnum) next))\n             (when (< next 0) (incf next length))\n             (when (= (+ 1 count) length)\n               (error 'deque-full-error :item obj :queue ,name))\n             (setf (aref data front) obj)\n             (setq front next)\n             (incf count)\n             ,name)))\n\n       (declaim (inline ,pop-front))\n       (defun ,pop-front (,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (next (+ front 1)))\n             (declare ((integer 0 #.most-positive-fixnum) next))\n             (when (= next length) (decf next length))\n             (when (zerop count)\n               (error 'deque-empty-error :queue ,name))\n             (setq front next)\n             (decf count)\n             (aref data next))))\n\n       (declaim (inline ,push-back))\n       (defun ,push-back (obj ,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (pos (+ front count 1)))\n             (declare ((integer 0 #.most-positive-fixnum) pos))\n             (when (>= pos length) (decf pos length))\n             (when (= (+ 1 count) length)\n               (error 'deque-full-error :item obj :queue ,name))\n             (setf (aref data pos) obj)\n             (incf count)\n             ,name)))\n\n       (declaim (inline ,pop-back))\n       (defun ,pop-back (,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (pos (+ front count)))\n             (declare ((integer 0 #.most-positive-fixnum) pos))\n             (when (>= pos length) (decf pos length))\n             (when (zerop count)\n               (error 'deque-empty-error :queue ,name))\n             (prog1 (aref data pos)\n               (decf count)))))\n\n       (declaim (inline ,empty-p))\n       (defun ,empty-p (,name)\n         (zerop (,count-getter ,name)))\n\n       (declaim (inline ,reinitializer))\n       (defun ,reinitializer (,name)\n         (setf (,count-getter ,name) 0))\n\n       (declaim (inline ,reffer))\n       (defun ,reffer (,name index)\n         \"Returns the INDEX-th element from the top. (0-based)\"\n         (declare ((integer 0 #.most-positive-fixnum) index))\n         (let* ((data (,data-getter ,name))\n                (count (,count-getter ,name))\n                (front (,front-getter ,name))\n                (length (length data))\n                (pos (+ front index 1)))\n           (declare ((integer 0 #.most-positive-fixnum) pos))\n           (when (>= pos length) (decf pos length))\n           (when (>= index count)\n             (error 'deque-invalid-index-error :index index :queue ,name))\n           (aref data pos))))))\n\n(define-deque deque :element-type fixnum)\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)) ; declaring (sb-kernel:ansi-stream in) will be faster\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char)))\n    (read-line-into s)\n    (let ((rhash (make-rhash s)))\n      (labels ((feasible-p (len)\n                 (declare (uint62 len))\n                 (let ((q (make-deque (+ len 1)))\n                       (table (make-hash-table :test #'eq)))\n                   (loop for start from 0 to (- n len)\n                         for value = (rhash-query rhash start (+ start len))\n                         do (deque-push-back value q)\n                            (when (> (deque-count q) len)\n                              (setf (gethash (deque-pop-front q) table) t))\n                            (when (gethash value table)\n                              (return-from feasible-p t))\n                         finally (return nil)))))\n        (sb-int:named-let bisect ((ok 0) (ng n))\n          (if (<= (- ng ok) 1)\n              (println ok)\n              (let ((mid (ash (+ ok ng) -1)))\n                (if (feasible-p mid)\n                    (bisect mid ng)\n                    (bisect ok mid)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5\nababa\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\nxy\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"13\nstrangeorange\n\"\n    \"5\n\")))\n", "language": "Lisp", "metadata": {"date": 1568598143, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lisp/s258605315.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s258605315", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; Rolling hash (62-bit)\n;;;\n\n;; Reference:\n;; https://www.mii.lt/olympiads_in_informatics/pdf/INFOL119.pdf\n;; https://ei1333.github.io/luzhiled/snippets/string/rolling-hash.html\n\n(defstruct (rhash (:constructor %make-rhash (mod1 base1 cumul1 powers1 mod2 base2 cumul2 powers2)))\n  ;; lower 31-bit value\n  (mod1 2147483647 :type (unsigned-byte 31))\n  (base1 1059428526 :type (unsigned-byte 31))\n  (cumul1 nil :type (simple-array (unsigned-byte 31) (*)))\n  (powers1 nil :type (simple-array (unsigned-byte 31) (*)))\n  ;; upper 31-bit value\n  (mod2 2147483629 :type (unsigned-byte 31))\n  (base2 2090066834 :type (unsigned-byte 31))\n  (cumul2 nil :type (simple-array (unsigned-byte 31) (*)))\n  (powers2 nil :type (simple-array (unsigned-byte 31) (*))))\n\n;; This table consists of pairs of primes less than 2^31 and the random\n;; primitive roots modulo them larger than 10^9. We randomly choose a pair and\n;; adopt the prime as modulus and the primitive root as base.\n(declaim ((simple-array (unsigned-byte 31) (100)) *moduli-table* *base-table*))\n(defparameter *moduli-table*\n  (make-array 100 :element-type '(unsigned-byte 31)\n                  :initial-contents '(2147483647 2147483629 2147483587 2147483579 2147483563 2147483549 2147483543\n 2147483497 2147483489 2147483477 2147483423 2147483399 2147483353 2147483323\n 2147483269 2147483249 2147483237 2147483179 2147483171 2147483137 2147483123\n 2147483077 2147483069 2147483059 2147483053 2147483033 2147483029 2147482951\n 2147482949 2147482943 2147482937 2147482921 2147482877 2147482873 2147482867\n 2147482859 2147482819 2147482817 2147482811 2147482801 2147482763 2147482739\n 2147482697 2147482693 2147482681 2147482663 2147482661 2147482621 2147482591\n 2147482583 2147482577 2147482507 2147482501 2147482481 2147482417 2147482409\n 2147482367 2147482361 2147482349 2147482343 2147482327 2147482291 2147482273\n 2147482237 2147482231 2147482223 2147482121 2147482093 2147482091 2147482081\n 2147482063 2147482021 2147481997 2147481967 2147481949 2147481937 2147481907\n 2147481901 2147481899 2147481893 2147481883 2147481863 2147481827 2147481811\n 2147481797 2147481793 2147481673 2147481629 2147481571 2147481563 2147481529\n 2147481509 2147481499 2147481491 2147481487 2147481373 2147481367 2147481359\n 2147481353 2147481337)))\n(defparameter *base-table*\n  (make-array 100 :element-type '(unsigned-byte 31)\n                  :initial-contents '(1059428526 2090066834 1772913519 1695158082 1516083910 1622025757 1248368302\n 1894391153 2094976878 1193495823 1783230399 1520742486 1748395380 1703688443\n 2138630366 1942049269 2066548889 1890950855 1480056952 1792721876 1092797280\n 1204851872 1035383130 1002272185 1319736653 1980774767 1748793187 1866963602\n 1200445534 1732959733 1214706585 1957228822 1479411729 1323155655 1052714514\n 1989821027 1163834549 1095622874 2087901566 1670886084 1191975321 2091468260\n 1429690292 1116037844 1420457779 1937649612 1552519679 1328604092 2090326292\n 1397132095 1316705322 1664351025 1391513321 1851038917 1556301575 1928956735\n 1764506480 1449537491 2119470570 1793768237 1831208371 1723755364 1643456516\n 1993819805 1419297891 1755252963 1775153034 1388979165 2144586633 1501222238\n 1872274033 1143076711 1229125474 1483974015 1997206147 1593231852 1632083893\n 1601537043 2012194627 1299923971 1566635240 1814404069 1619988648 2072686565\n 2014361572 1213868607 1166967329 1009325840 1306167671 1915239658 1223190075\n 1821151471 2037700892 1646950698 1517859810 1099233635 1004913731 1653443892\n 1782112665 1018916580)))\n\n(defun %choose-moduli (mod1 mod2 base1 base2 rhash)\n  \"Chooses two appropriate pairs of moduli and bases.\"\n  (declare ((or null (unsigned-byte 31)) mod1 mod2 base1 base2))\n  (when rhash\n    (return-from %choose-moduli\n      (values (rhash-mod1 rhash)\n              (rhash-mod2 rhash)\n              (rhash-base1 rhash)\n              (rhash-base2 rhash))))\n  (let* ((rand1 (random (length *moduli-table*)))\n         (rand2 (loop (let ((tmp (random (length *moduli-table*))))\n                        (unless (= tmp rand1)\n                          (return tmp))))))\n    (if mod1\n        (progn\n          #+sbcl (assert (sb-int:positive-primep mod1))\n          (setq base1 (or base1 (+ 1 (random (- mod1 1))))))\n        (progn\n          (setq mod1 (or mod1 (aref *moduli-table* rand1)))\n          (if base1\n              (assert (<= 1 base1 (- mod1 1)))\n              (setq base1 (aref *base-table* rand1)))))\n    (if mod2\n        (progn\n          #+sbcl (assert (sb-int:positive-primep mod2))\n          (setq base2 (or base2 (+ 1 (random (- mod2 1))))))\n        (progn\n          (setq mod2 (or mod2 (aref *moduli-table* rand2)))\n          (if base2\n              (assert (<= 1 base2 (- mod2 1)))\n              (setq base2 (aref *base-table* rand2))))))\n  (values mod1 mod2 base1 base2))\n\n(defun make-rhash (vector &key (key #'char-code) mod1 mod2 base1 base2 rhash)\n  \"Returns the table of rolling-hash of VECTOR modulo MOD1 and MOD2. KEY is\napplied to each element of VECTOR prior to computing the hash value. If moduli\nand bases are NIL, this function randomly chooses them. If RHASH is specified,\nthe same moduli and bases as RHASH is adopted.\n\nMOD[1|2] := NIL | unsigned 31-bit prime number\nBASE1 := NIL | 1 | 2 | ... | MOD1 - 1\nBASE2 := NIL | 1 | 2 | ... | MOD2 - 1\nKEY := FUNCTION returning FIXNUM\nRHASH := NIL | RHASH\"\n  (declare (optimize (speed 3))\n           (vector vector)\n           ((or null (unsigned-byte 31)) mod1 mod2 base1 base2)\n           (function key))\n  (multiple-value-bind (mod1 mod2 base1 base2) (%choose-moduli mod1 mod2 base1 base2 rhash)\n    (declare ((unsigned-byte 31) mod1 mod2 base1 base2))\n    (let* ((size (length vector))\n           (cumul1 (make-array (+ 1 size) :element-type '(unsigned-byte 31)))\n           (powers1 (make-array (+ 1 size) :element-type '(unsigned-byte 31)))\n           (cumul2 (make-array (+ 1 size) :element-type '(unsigned-byte 31)))\n           (powers2 (make-array (+ 1 size) :element-type '(unsigned-byte 31))))\n      (setf (aref powers1 0) 1\n            (aref powers2 0) 1)\n      (dotimes (i size)\n        (setf (aref powers1 (+ i 1))\n              (mod (* (aref powers1 i) base1) mod1)\n              (aref powers2 (+ i 1))\n              (mod (* (aref powers2 i) base2) mod2))\n        (let ((sum1 (+ (mod (* base1 (aref cumul1 i)) mod1)\n                       (mod (the fixnum (funcall key (aref vector i))) mod1)))\n              (sum2 (+ (mod (* base2 (aref cumul2 i)) mod2)\n                       (mod (the fixnum (funcall key (aref vector i))) mod2))))\n          (setf (aref cumul1 (+ i 1)) (if (> sum1 mod1)\n                                          (- sum1 mod1)\n                                          sum1)\n                (aref cumul2 (+ i 1)) (if (> sum2 mod2)\n                                          (- sum2 mod2)\n                                          sum2))))\n      (%make-rhash mod1 base1 cumul1 powers1 mod2 base2 cumul2 powers2))))\n\n(declaim (ftype (function * (values (unsigned-byte 62) &optional)) rhash-vector-hash)\n         (inline rhash-vector-hash))\n(defun rhash-vector-hash (rhash vector &key (key #'char-code))\n  \"Returns the hash code of VECTOR w.r.t. the moduli and bases of RHASH.\"\n  (declare (optimize (speed 3))\n           (vector vector)\n           (function key))\n  (let* ((mod1 (rhash-mod1 rhash))\n         (mod2 (rhash-mod2 rhash))\n         (base1 (rhash-base1 rhash))\n         (base2 (rhash-base2 rhash))\n         (size (length vector))\n         (lower 0)\n         (upper 0))\n    (declare ((unsigned-byte 31) lower upper))\n    (dotimes (i size)\n      (setf lower (mod (+ (* base1 lower)\n                          (mod (the fixnum (funcall key (aref vector i))) mod1))\n                       mod1))\n      (setf upper (mod (+ (* base2 upper)\n                          (mod (the fixnum (funcall key (aref vector i))) mod2))\n                       mod2)))\n    (dpb upper (byte 31 31) lower)))\n\n(declaim (inline rhash-query)\n         (ftype (function * (values (unsigned-byte 62) &optional)) rhash-query))\n(defun rhash-query (rhash l r)\n  \"Returns the hash value of the interval [L, R).\"\n  (declare ((integer 0 #.most-positive-fixnum) l r))\n  (assert (<= l r))\n  (let ((cumul1 (rhash-cumul1 rhash))\n        (powers1 (rhash-powers1 rhash))\n        (mod1 (rhash-mod1 rhash))\n        (cumul2 (rhash-cumul2 rhash))\n        (powers2 (rhash-powers2 rhash))\n        (mod2 (rhash-mod2 rhash)))\n    (let ((lower (+ (aref cumul1 r)\n                    (- mod1 (mod (* (aref cumul1 l) (aref powers1 (- r l))) mod1))))\n          (upper (+ (aref cumul2 r)\n                    (- mod2 (mod (* (aref cumul2 l) (aref powers2 (- r l))) mod2)))))\n      (let ((lower (if (> lower mod1) (- lower mod1) lower))\n            (upper (if (> upper mod2) (- upper mod2) upper)))\n        (declare ((unsigned-byte 31) lower upper))\n        (dpb upper (byte 31 31) lower)))))\n\n(declaim (inline rhash-concat))\n(defun rhash-concat (rhash hash1 hash2 length2)\n  \"Returns the hash value of the concatenated sequence.\n\nHASH1 := hash value of the first sequence\nHASH2 := hash value of the second sequence\nLENGTH2 := length of the second sequence.\"\n  (declare ((unsigned-byte 62) hash1 hash2)\n           ((integer 0 #.most-positive-fixnum) length2))\n  (let* ((hash1-lower (ldb (byte 31 0) hash1))\n         (hash1-upper (ldb (byte 31 31) hash1))\n         (hash2-lower (ldb (byte 31 0) hash2))\n         (hash2-upper (ldb (byte 31 31) hash2))\n         (mod1 (rhash-mod1 rhash))\n         (mod2 (rhash-mod2 rhash))\n         (res-lower (mod (+ hash2-lower\n                            (* hash1-lower\n                               (aref (rhash-powers1 rhash) length2)))\n                         mod1))\n         (res-upper (mod (+ hash2-upper\n                            (* hash1-upper\n                               (aref (rhash-powers2 rhash) length2)))\n                         mod2)))\n    (declare ((unsigned-byte 31) res-lower res-upper))\n    (dpb res-upper (byte 31 31) res-lower)))\n\n(declaim (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional)) rhash-get-lcp))\n(defun rhash-get-lcp (rhash1 start1 rhash2 start2)\n  \"Returns the length of the longest common prefix of two suffixes which begin\nat START1 and START2.\"\n  (declare (optimize (speed 3))\n           ((mod #.most-positive-fixnum) start1 start2))\n  (assert (and (= (rhash-mod1 rhash1) (rhash-mod1 rhash2))\n               (= (rhash-mod2 rhash1) (rhash-mod2 rhash2))))\n  (assert (and (< start1 (length (rhash-cumul1 rhash1)))\n               (< start2 (length (rhash-cumul1 rhash2)))))\n  (let ((max-length (min (- (length (rhash-cumul1 rhash1)) start1 1)\n                         (- (length (rhash-cumul1 rhash2)) start2 1))))\n    (declare (optimize (safety 0)))\n    (labels ((bisect (ok ng)\n               (declare ((integer 0 #.most-positive-fixnum) ok ng))\n               (if (<= (- ng ok) 1)\n                   ok\n                   (let ((mid (ash (+ ng ok) -1)))\n                     (if (= (rhash-query rhash1 start1 (+ start1 mid))\n                            (rhash-query rhash2 start2 (+ start2 mid)))\n                         (bisect mid ng)\n                         (bisect ok mid))))))\n      (bisect 0 (+ 1 max-length)))))\n\n(defun map-prefix-hash (rhash vector function &key (start 0) end)\n  \"Applies FUNCTION to the hash value of each prefix of VECTOR (in ascending\norder, including null prefix).\"\n  (declare (vector vector)\n           (function function)\n           ((integer 0 #.most-positive-fixnum) start)\n           ((or null (integer 0 #.most-positive-fixnum)) end))\n  (let* ((end (or end (length vector)))\n         (mod1 (rhash-mod1 rhash))\n         (mod2 (rhash-mod2 rhash))\n         (base1 (rhash-base1 rhash))\n         (base2 (rhash-base2 rhash))\n         (lower 0)\n         (upper 0))\n    (loop for i from start below end\n          do (funcall function (dpb upper (byte 31 31) lower))\n             (setq lower (mod (* lower base1) mod1)\n                   upper (mod (* upper base2) mod2)))))\n\n;;;\n;;; double-ended queue (ring buffer)\n;;;\n\n(define-condition deque-empty-error (simple-error)\n  ((queue :initarg :queue :reader deque-empty-error-queue))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Attempted to pop empty deque ~W\" (deque-empty-error-queue condition)))))\n\n(define-condition deque-full-error (simple-error)\n  ((queue :initarg :queue :reader deque-full-error-queue)\n   (item :initarg :item :reader deque-full-error-item))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Attempted to push item ~W to full deque ~W\"\n             (deque-full-error-item condition)\n             (deque-full-error-queue condition)))))\n\n(define-condition deque-invalid-index-error (simple-error)\n  ((queue :initarg :queue :reader deque-invalid-index-error-queue)\n   (index :initarg :index :reader deque-invalid-index-error-index))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Invalid index ~W for ~W.\"\n             (deque-invalid-index-error-index condition)\n             (deque-invalid-index-error-queue condition)))))\n\n;; TODO: detailed documentation\n(defmacro define-deque (name &key (element-type 'fixnum))\n  \"Defines deque for given ELEMENT-TYPE.\n\nconstructor: MAKE-<NAME>.\nbasic operations: <NAME>-PUSH-FRONT, <NAME>-PUSH-BACK, <NAME>-POP-FRONT,\n<NAME>-POP-BACK.\naccessor: <NAME>-REF.\nutilities: <NAME>-EMPTY-P, <NAME>-REINITIALIZE.\n\"\n  (let ((push-front (intern (format nil \"~A-PUSH-FRONT\" name)))\n        (push-back (intern (format nil \"~A-PUSH-BACK\" name)))\n        (pop-front (intern (format nil \"~A-POP-FRONT\" name)))\n        (pop-back (intern (format nil \"~A-POP-BACK\" name)))\n        (empty-p (intern (format nil \"~A-EMPTY-P\" name)))\n        (constructor (intern (format nil \"MAKE-~A\" name)))\n        (reinitializer (intern (format nil \"~A-REINITIALIZE\" name)))\n        (reffer (intern (format nil \"~A-REF\" name)))\n        (data-getter (intern (format nil \"~A-DATA\" name)))\n        (front-getter (intern (format nil \"~A-FRONT\" name)))\n        (count-getter (intern (format nil \"~A-COUNT\" name))))\n    `(progn\n       (defstruct (,name (:constructor ,constructor\n                             (size &aux\n                                   (data (progn\n                                           (check-type size (integer 0))\n                                           (make-array (+ 1 size) :element-type ',element-type)))))\n                         (:copier nil)\n                         (:predicate nil))\n         (data nil :type (simple-array ,element-type (*)))\n         (front 0 :type (integer 0 #.most-positive-fixnum))\n         (count 0 :type (integer 0 #.most-positive-fixnum)))\n\n       (declaim (inline ,push-front))\n       (defun ,push-front (obj ,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (next (- front 1)))\n             (declare ((integer -1 #.most-positive-fixnum) next))\n             (when (< next 0) (incf next length))\n             (when (= (+ 1 count) length)\n               (error 'deque-full-error :item obj :queue ,name))\n             (setf (aref data front) obj)\n             (setq front next)\n             (incf count)\n             ,name)))\n\n       (declaim (inline ,pop-front))\n       (defun ,pop-front (,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (next (+ front 1)))\n             (declare ((integer 0 #.most-positive-fixnum) next))\n             (when (= next length) (decf next length))\n             (when (zerop count)\n               (error 'deque-empty-error :queue ,name))\n             (setq front next)\n             (decf count)\n             (aref data next))))\n\n       (declaim (inline ,push-back))\n       (defun ,push-back (obj ,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (pos (+ front count 1)))\n             (declare ((integer 0 #.most-positive-fixnum) pos))\n             (when (>= pos length) (decf pos length))\n             (when (= (+ 1 count) length)\n               (error 'deque-full-error :item obj :queue ,name))\n             (setf (aref data pos) obj)\n             (incf count)\n             ,name)))\n\n       (declaim (inline ,pop-back))\n       (defun ,pop-back (,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (pos (+ front count)))\n             (declare ((integer 0 #.most-positive-fixnum) pos))\n             (when (>= pos length) (decf pos length))\n             (when (zerop count)\n               (error 'deque-empty-error :queue ,name))\n             (prog1 (aref data pos)\n               (decf count)))))\n\n       (declaim (inline ,empty-p))\n       (defun ,empty-p (,name)\n         (zerop (,count-getter ,name)))\n\n       (declaim (inline ,reinitializer))\n       (defun ,reinitializer (,name)\n         (setf (,count-getter ,name) 0))\n\n       (declaim (inline ,reffer))\n       (defun ,reffer (,name index)\n         \"Returns the INDEX-th element from the top. (0-based)\"\n         (declare ((integer 0 #.most-positive-fixnum) index))\n         (let* ((data (,data-getter ,name))\n                (count (,count-getter ,name))\n                (front (,front-getter ,name))\n                (length (length data))\n                (pos (+ front index 1)))\n           (declare ((integer 0 #.most-positive-fixnum) pos))\n           (when (>= pos length) (decf pos length))\n           (when (>= index count)\n             (error 'deque-invalid-index-error :index index :queue ,name))\n           (aref data pos))))))\n\n(define-deque deque :element-type fixnum)\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)) ; declaring (sb-kernel:ansi-stream in) will be faster\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char)))\n    (read-line-into s)\n    (let ((rhash (make-rhash s)))\n      (labels ((feasible-p (len)\n                 (declare (uint62 len))\n                 (let ((q (make-deque (+ len 1)))\n                       (table (make-hash-table :test #'eq)))\n                   (loop for start from 0 to (- n len)\n                         for value = (rhash-query rhash start (+ start len))\n                         do (deque-push-back value q)\n                            (when (> (deque-count q) len)\n                              (setf (gethash (deque-pop-front q) table) t))\n                            (when (gethash value table)\n                              (return-from feasible-p t))\n                         finally (return nil)))))\n        (sb-int:named-let bisect ((ok 0) (ng n))\n          (if (<= (- ng ok) 1)\n              (println ok)\n              (let ((mid (ash (+ ok ng) -1)))\n                (if (feasible-p mid)\n                    (bisect mid ng)\n                    (bisect ok mid)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5\nababa\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\nxy\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"13\nstrangeorange\n\"\n    \"5\n\")))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 23514, "cpu_time_ms": 492, "memory_kb": 74340}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s404451650", "group_id": "codeNet:p02913", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; double-ended queue (ring buffer)\n;;;\n\n(define-condition deque-empty-error (simple-error)\n  ((queue :initarg :queue :reader deque-empty-error-queue))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Attempted to pop empty deque ~W\" (deque-empty-error-queue condition)))))\n\n(define-condition deque-full-error (simple-error)\n  ((queue :initarg :queue :reader deque-full-error-queue)\n   (item :initarg :item :reader deque-full-error-item))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Attempted to push item ~W to full deque ~W\"\n             (deque-full-error-item condition)\n             (deque-full-error-queue condition)))))\n\n(define-condition deque-invalid-index-error (simple-error)\n  ((queue :initarg :queue :reader deque-invalid-index-error-queue)\n   (index :initarg :index :reader deque-invalid-index-error-index))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Invalid index ~W for ~W.\"\n             (deque-invalid-index-error-index condition)\n             (deque-invalid-index-error-queue condition)))))\n\n;; TODO: detailed documentation\n(defmacro define-deque (name &key (element-type 'fixnum))\n  \"Defines deque for given ELEMENT-TYPE.\n\nconstructor: MAKE-<NAME>.\nbasic operations: <NAME>-PUSH-FRONT, <NAME>-PUSH-BACK, <NAME>-POP-FRONT,\n<NAME>-POP-BACK.\naccessor: <NAME>-REF.\nutilities: <NAME>-EMPTY-P, <NAME>-REINITIALIZE.\n\"\n  (let ((push-front (intern (format nil \"~A-PUSH-FRONT\" name)))\n        (push-back (intern (format nil \"~A-PUSH-BACK\" name)))\n        (pop-front (intern (format nil \"~A-POP-FRONT\" name)))\n        (pop-back (intern (format nil \"~A-POP-BACK\" name)))\n        (empty-p (intern (format nil \"~A-EMPTY-P\" name)))\n        (constructor (intern (format nil \"MAKE-~A\" name)))\n        (reinitializer (intern (format nil \"~A-REINITIALIZE\" name)))\n        (reffer (intern (format nil \"~A-REF\" name)))\n        (data-getter (intern (format nil \"~A-DATA\" name)))\n        (front-getter (intern (format nil \"~A-FRONT\" name)))\n        (count-getter (intern (format nil \"~A-COUNT\" name))))\n    `(progn\n       (defstruct (,name (:constructor ,constructor\n                             (size &aux\n                                   (data (progn\n                                           (check-type size (integer 0))\n                                           (make-array (+ 1 size) :element-type ',element-type)))))\n                         (:copier nil)\n                         (:predicate nil))\n         (data nil :type (simple-array ,element-type (*)))\n         (front 0 :type (integer 0 #.most-positive-fixnum))\n         (count 0 :type (integer 0 #.most-positive-fixnum)))\n\n       (declaim (inline ,push-front))\n       (defun ,push-front (obj ,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (next (- front 1)))\n             (declare ((integer -1 #.most-positive-fixnum) next))\n             (when (< next 0) (incf next length))\n             (when (= (+ 1 count) length)\n               (error 'deque-full-error :item obj :queue ,name))\n             (setf (aref data front) obj)\n             (setq front next)\n             (incf count)\n             ,name)))\n\n       (declaim (inline ,pop-front))\n       (defun ,pop-front (,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (next (+ front 1)))\n             (declare ((integer 0 #.most-positive-fixnum) next))\n             (when (= next length) (decf next length))\n             (when (zerop count)\n               (error 'deque-empty-error :queue ,name))\n             (setq front next)\n             (decf count)\n             (aref data next))))\n\n       (declaim (inline ,push-back))\n       (defun ,push-back (obj ,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (pos (+ front count 1)))\n             (declare ((integer 0 #.most-positive-fixnum) pos))\n             (when (>= pos length) (decf pos length))\n             (when (= (+ 1 count) length)\n               (error 'deque-full-error :item obj :queue ,name))\n             (setf (aref data pos) obj)\n             (incf count)\n             ,name)))\n\n       (declaim (inline ,pop-back))\n       (defun ,pop-back (,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (pos (+ front count)))\n             (declare ((integer 0 #.most-positive-fixnum) pos))\n             (when (>= pos length) (decf pos length))\n             (when (zerop count)\n               (error 'deque-empty-error :queue ,name))\n             (prog1 (aref data pos)\n               (decf count)))))\n\n       (declaim (inline ,empty-p))\n       (defun ,empty-p (,name)\n         (zerop (,count-getter ,name)))\n\n       (declaim (inline ,reinitializer))\n       (defun ,reinitializer (,name)\n         (setf (,count-getter ,name) 0))\n\n       (declaim (inline ,reffer))\n       (defun ,reffer (,name index)\n         \"Returns the INDEX-th element from the top. (0-based)\"\n         (declare ((integer 0 #.most-positive-fixnum) index))\n         (let* ((data (,data-getter ,name))\n                (count (,count-getter ,name))\n                (front (,front-getter ,name))\n                (length (length data))\n                (pos (+ front index 1)))\n           (declare ((integer 0 #.most-positive-fixnum) pos))\n           (when (>= pos length) (decf pos length))\n           (when (>= index count)\n             (error 'deque-invalid-index-error :index index :queue ,name))\n           (aref data pos))))))\n\n(define-deque deque :element-type fixnum)\n\n;;;\n;;; Rolling hash (32-bit)\n;;; NOTE: 32-bit doesn't suffice especially when the strong collision resistance\n;;; is required. Better to use 62-bit version instead.\n;;;\n\n(defstruct (rhash (:constructor %make-rhash (modulus base cumul powers)))\n  (modulus 4294967291 :type (unsigned-byte 32))\n  (base 2095716802 :type (unsigned-byte 32))\n  (cumul nil :type (simple-array (unsigned-byte 32) (*)))\n  (powers nil :type (simple-array (unsigned-byte 32) (*))))\n\n(declaim (inline make-rhash))\n(defun make-rhash (vector modulus &key (key #'char-code) base)\n  \"Returns the table of rolling-hash of VECTOR modulo MODULUS. KEY is applied to\n  each element of VECTOR prior to computing the hash value.\n\nMODULUS := unsigned 32-bit prime number\nBASE := 1 | 2 | ... | MODULUS - 1\nKEY := function returning FIXNUM\"\n  (declare (vector vector)\n           ((unsigned-byte 32) modulus)\n           ((or null (unsigned-byte 32)) base)\n           (function key))\n  #+sbcl (assert (sb-int:positive-primep modulus))\n  (let* ((base (or base (+ 1 (random (- modulus 1)))))\n         (size (length vector))\n         (cumul (make-array (+ 1 size) :element-type '(unsigned-byte 32)))\n         (powers (make-array (+ 1 size) :element-type '(unsigned-byte 32))))\n    (assert (<= 1 base (- modulus 1)))\n    (setf (aref powers 0) 1)\n    (dotimes (i size)\n      (setf (aref powers (+ i 1))\n            (mod (* (aref powers i) base) modulus))\n      (let ((sum (+ (mod (* (aref cumul i) base) modulus)\n                    (mod (the fixnum (funcall key (aref vector i))) modulus))))\n        (setf (aref cumul (+ i 1))\n              (if (> sum modulus)\n                  (- sum modulus)\n                  sum))))\n    (%make-rhash modulus base cumul powers)))\n\n(declaim (inline rhash-query)\n         (ftype (function * (values (unsigned-byte 32) &optional)) rhash-query))\n(defun rhash-query (rhash l r)\n  \"Returns the hash value of the interval [L, R).\"\n  (declare ((integer 0 #.most-positive-fixnum) l r))\n  (let ((cumul (rhash-cumul rhash))\n        (powers (rhash-powers rhash))\n        (modulus (rhash-modulus rhash)))\n    (let ((res (+ (aref cumul r)\n                  (- modulus (mod (* (aref cumul l) (aref powers (- r l))) modulus)))))\n      (if (> res modulus)\n          (- res modulus)\n          res))))\n\n(declaim (inline rhash-concat))\n(defun rhash-concat (rhash hash1 hash2 hash2-length)\n  (declare ((unsigned-byte 32) hash1 hash2)\n           ((integer 0 #.most-positive-fixnum) hash2-length))\n  (let* ((modulus (rhash-modulus rhash)))\n    (mod (+ hash2\n            (* hash1 (aref (rhash-powers rhash) hash2-length)))\n         modulus)))\n\n(declaim (ftype (function * (values (unsigned-byte 32) &optional)) rhash-vector-hash)\n         (inline rhash-vector-hash))\n(defun rhash-vector-hash (rhash vector &key (key #'char-code))\n  \"Returns the hash code of VECTOR w.r.t. the moduli and bases of RHASH.\"\n  (declare (vector vector))\n  (let* ((mod (rhash-modulus rhash))\n         (base (rhash-base rhash))\n         (size (length vector))\n         (result 0))\n    (declare ((unsigned-byte 32) result))\n    (dotimes (i size)\n      ;; (2^32-1) * (2^32-1) + (2^32-1) < 2^64\n      (setq result (mod (+ (* base result)\n                           (the (unsigned-byte 32)\n                                (mod (the fixnum (funcall key (aref vector i))) mod)))\n                        mod)))\n    result))\n\n(defun rhash-get-lcp (rhash1 start1 rhash2 start2)\n  (declare #.OPT\n           ((mod #.most-positive-fixnum) start1 start2))\n  (let ((max-length (min (- (length (rhash-cumul rhash1)) start1 1)\n                         (- (length (rhash-cumul rhash2)) start2 1))))\n    (declare (optimize (safety 0)))\n    (labels ((bisect (ok ng)\n               (declare ((integer 0 #.most-positive-fixnum) ok ng))\n               (if (<= (- ng ok) 1)\n                   ok\n                   (let ((mid (ash (+ ng ok) -1)))\n                     (if (= (rhash-query rhash1 start1 (+ start1 mid))\n                            (rhash-query rhash2 start2 (+ start2 mid)))\n                         (bisect mid ng)\n                         (bisect ok mid))))))\n      (bisect 0 (+ 1 max-length)))))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)) ; declaring (sb-kernel:ansi-stream in) will be faster\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char)))\n    (read-line-into s)\n    (let ((rhash (make-rhash s 4294967291 :base 2095716802)))\n      (labels ((feasible-p (len)\n                 (declare (uint62 len))\n                 (let ((q (make-deque (+ len 1)))\n                       (table (make-hash-table :test #'eq)))\n                   (loop for start from 0 to (- n len)\n                         for value = (rhash-query rhash start (+ start len))\n                         do (deque-push-back value q)\n                            (when (> (deque-count q) len)\n                              (setf (gethash (deque-pop-front q) table) t))\n                            (when (gethash value table)\n                              (return-from feasible-p t))\n                         finally (return nil)))))\n        (sb-int:named-let bisect ((ok 0) (ng n))\n          (if (<= (- ng ok) 1)\n              (println ok)\n              (let ((mid (ash (+ ok ng) -1)))\n                (if (feasible-p mid)\n                    (bisect mid ng)\n                    (bisect ok mid)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5\nababa\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\nxy\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"13\nstrangeorange\n\"\n    \"5\n\")))\n", "language": "Lisp", "metadata": {"date": 1568598013, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Lisp/s404451650.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s404451650", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n;;;\n;;; double-ended queue (ring buffer)\n;;;\n\n(define-condition deque-empty-error (simple-error)\n  ((queue :initarg :queue :reader deque-empty-error-queue))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Attempted to pop empty deque ~W\" (deque-empty-error-queue condition)))))\n\n(define-condition deque-full-error (simple-error)\n  ((queue :initarg :queue :reader deque-full-error-queue)\n   (item :initarg :item :reader deque-full-error-item))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Attempted to push item ~W to full deque ~W\"\n             (deque-full-error-item condition)\n             (deque-full-error-queue condition)))))\n\n(define-condition deque-invalid-index-error (simple-error)\n  ((queue :initarg :queue :reader deque-invalid-index-error-queue)\n   (index :initarg :index :reader deque-invalid-index-error-index))\n  (:report\n   (lambda (condition stream)\n     (format stream \"Invalid index ~W for ~W.\"\n             (deque-invalid-index-error-index condition)\n             (deque-invalid-index-error-queue condition)))))\n\n;; TODO: detailed documentation\n(defmacro define-deque (name &key (element-type 'fixnum))\n  \"Defines deque for given ELEMENT-TYPE.\n\nconstructor: MAKE-<NAME>.\nbasic operations: <NAME>-PUSH-FRONT, <NAME>-PUSH-BACK, <NAME>-POP-FRONT,\n<NAME>-POP-BACK.\naccessor: <NAME>-REF.\nutilities: <NAME>-EMPTY-P, <NAME>-REINITIALIZE.\n\"\n  (let ((push-front (intern (format nil \"~A-PUSH-FRONT\" name)))\n        (push-back (intern (format nil \"~A-PUSH-BACK\" name)))\n        (pop-front (intern (format nil \"~A-POP-FRONT\" name)))\n        (pop-back (intern (format nil \"~A-POP-BACK\" name)))\n        (empty-p (intern (format nil \"~A-EMPTY-P\" name)))\n        (constructor (intern (format nil \"MAKE-~A\" name)))\n        (reinitializer (intern (format nil \"~A-REINITIALIZE\" name)))\n        (reffer (intern (format nil \"~A-REF\" name)))\n        (data-getter (intern (format nil \"~A-DATA\" name)))\n        (front-getter (intern (format nil \"~A-FRONT\" name)))\n        (count-getter (intern (format nil \"~A-COUNT\" name))))\n    `(progn\n       (defstruct (,name (:constructor ,constructor\n                             (size &aux\n                                   (data (progn\n                                           (check-type size (integer 0))\n                                           (make-array (+ 1 size) :element-type ',element-type)))))\n                         (:copier nil)\n                         (:predicate nil))\n         (data nil :type (simple-array ,element-type (*)))\n         (front 0 :type (integer 0 #.most-positive-fixnum))\n         (count 0 :type (integer 0 #.most-positive-fixnum)))\n\n       (declaim (inline ,push-front))\n       (defun ,push-front (obj ,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (next (- front 1)))\n             (declare ((integer -1 #.most-positive-fixnum) next))\n             (when (< next 0) (incf next length))\n             (when (= (+ 1 count) length)\n               (error 'deque-full-error :item obj :queue ,name))\n             (setf (aref data front) obj)\n             (setq front next)\n             (incf count)\n             ,name)))\n\n       (declaim (inline ,pop-front))\n       (defun ,pop-front (,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (next (+ front 1)))\n             (declare ((integer 0 #.most-positive-fixnum) next))\n             (when (= next length) (decf next length))\n             (when (zerop count)\n               (error 'deque-empty-error :queue ,name))\n             (setq front next)\n             (decf count)\n             (aref data next))))\n\n       (declaim (inline ,push-back))\n       (defun ,push-back (obj ,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (pos (+ front count 1)))\n             (declare ((integer 0 #.most-positive-fixnum) pos))\n             (when (>= pos length) (decf pos length))\n             (when (= (+ 1 count) length)\n               (error 'deque-full-error :item obj :queue ,name))\n             (setf (aref data pos) obj)\n             (incf count)\n             ,name)))\n\n       (declaim (inline ,pop-back))\n       (defun ,pop-back (,name)\n         (symbol-macrolet ((front (,front-getter ,name))\n                           (count (,count-getter ,name)))\n           (let* ((data (,data-getter ,name))\n                  (length (length data))\n                  (pos (+ front count)))\n             (declare ((integer 0 #.most-positive-fixnum) pos))\n             (when (>= pos length) (decf pos length))\n             (when (zerop count)\n               (error 'deque-empty-error :queue ,name))\n             (prog1 (aref data pos)\n               (decf count)))))\n\n       (declaim (inline ,empty-p))\n       (defun ,empty-p (,name)\n         (zerop (,count-getter ,name)))\n\n       (declaim (inline ,reinitializer))\n       (defun ,reinitializer (,name)\n         (setf (,count-getter ,name) 0))\n\n       (declaim (inline ,reffer))\n       (defun ,reffer (,name index)\n         \"Returns the INDEX-th element from the top. (0-based)\"\n         (declare ((integer 0 #.most-positive-fixnum) index))\n         (let* ((data (,data-getter ,name))\n                (count (,count-getter ,name))\n                (front (,front-getter ,name))\n                (length (length data))\n                (pos (+ front index 1)))\n           (declare ((integer 0 #.most-positive-fixnum) pos))\n           (when (>= pos length) (decf pos length))\n           (when (>= index count)\n             (error 'deque-invalid-index-error :index index :queue ,name))\n           (aref data pos))))))\n\n(define-deque deque :element-type fixnum)\n\n;;;\n;;; Rolling hash (32-bit)\n;;; NOTE: 32-bit doesn't suffice especially when the strong collision resistance\n;;; is required. Better to use 62-bit version instead.\n;;;\n\n(defstruct (rhash (:constructor %make-rhash (modulus base cumul powers)))\n  (modulus 4294967291 :type (unsigned-byte 32))\n  (base 2095716802 :type (unsigned-byte 32))\n  (cumul nil :type (simple-array (unsigned-byte 32) (*)))\n  (powers nil :type (simple-array (unsigned-byte 32) (*))))\n\n(declaim (inline make-rhash))\n(defun make-rhash (vector modulus &key (key #'char-code) base)\n  \"Returns the table of rolling-hash of VECTOR modulo MODULUS. KEY is applied to\n  each element of VECTOR prior to computing the hash value.\n\nMODULUS := unsigned 32-bit prime number\nBASE := 1 | 2 | ... | MODULUS - 1\nKEY := function returning FIXNUM\"\n  (declare (vector vector)\n           ((unsigned-byte 32) modulus)\n           ((or null (unsigned-byte 32)) base)\n           (function key))\n  #+sbcl (assert (sb-int:positive-primep modulus))\n  (let* ((base (or base (+ 1 (random (- modulus 1)))))\n         (size (length vector))\n         (cumul (make-array (+ 1 size) :element-type '(unsigned-byte 32)))\n         (powers (make-array (+ 1 size) :element-type '(unsigned-byte 32))))\n    (assert (<= 1 base (- modulus 1)))\n    (setf (aref powers 0) 1)\n    (dotimes (i size)\n      (setf (aref powers (+ i 1))\n            (mod (* (aref powers i) base) modulus))\n      (let ((sum (+ (mod (* (aref cumul i) base) modulus)\n                    (mod (the fixnum (funcall key (aref vector i))) modulus))))\n        (setf (aref cumul (+ i 1))\n              (if (> sum modulus)\n                  (- sum modulus)\n                  sum))))\n    (%make-rhash modulus base cumul powers)))\n\n(declaim (inline rhash-query)\n         (ftype (function * (values (unsigned-byte 32) &optional)) rhash-query))\n(defun rhash-query (rhash l r)\n  \"Returns the hash value of the interval [L, R).\"\n  (declare ((integer 0 #.most-positive-fixnum) l r))\n  (let ((cumul (rhash-cumul rhash))\n        (powers (rhash-powers rhash))\n        (modulus (rhash-modulus rhash)))\n    (let ((res (+ (aref cumul r)\n                  (- modulus (mod (* (aref cumul l) (aref powers (- r l))) modulus)))))\n      (if (> res modulus)\n          (- res modulus)\n          res))))\n\n(declaim (inline rhash-concat))\n(defun rhash-concat (rhash hash1 hash2 hash2-length)\n  (declare ((unsigned-byte 32) hash1 hash2)\n           ((integer 0 #.most-positive-fixnum) hash2-length))\n  (let* ((modulus (rhash-modulus rhash)))\n    (mod (+ hash2\n            (* hash1 (aref (rhash-powers rhash) hash2-length)))\n         modulus)))\n\n(declaim (ftype (function * (values (unsigned-byte 32) &optional)) rhash-vector-hash)\n         (inline rhash-vector-hash))\n(defun rhash-vector-hash (rhash vector &key (key #'char-code))\n  \"Returns the hash code of VECTOR w.r.t. the moduli and bases of RHASH.\"\n  (declare (vector vector))\n  (let* ((mod (rhash-modulus rhash))\n         (base (rhash-base rhash))\n         (size (length vector))\n         (result 0))\n    (declare ((unsigned-byte 32) result))\n    (dotimes (i size)\n      ;; (2^32-1) * (2^32-1) + (2^32-1) < 2^64\n      (setq result (mod (+ (* base result)\n                           (the (unsigned-byte 32)\n                                (mod (the fixnum (funcall key (aref vector i))) mod)))\n                        mod)))\n    result))\n\n(defun rhash-get-lcp (rhash1 start1 rhash2 start2)\n  (declare #.OPT\n           ((mod #.most-positive-fixnum) start1 start2))\n  (let ((max-length (min (- (length (rhash-cumul rhash1)) start1 1)\n                         (- (length (rhash-cumul rhash2)) start2 1))))\n    (declare (optimize (safety 0)))\n    (labels ((bisect (ok ng)\n               (declare ((integer 0 #.most-positive-fixnum) ok ng))\n               (if (<= (- ng ok) 1)\n                   ok\n                   (let ((mid (ash (+ ng ok) -1)))\n                     (if (= (rhash-query rhash1 start1 (+ start1 mid))\n                            (rhash-query rhash2 start2 (+ start2 mid)))\n                         (bisect mid ng)\n                         (bisect ok mid))))))\n      (bisect 0 (+ 1 max-length)))))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (term-char #\\Space))\n  \"Receives ASCII inputs and returns multiple values: the string and the end\nposition.\n\nThis function calls READ-BYTE to read characters though it calls READ-CHAR\ninstead on SLIME because SLIME's IO is not bivalent.\"\n  (declare (inline read-byte)) ; declaring (sb-kernel:ansi-stream in) will be faster\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (char buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (char buffer-string idx) term-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (s (make-string n :element-type 'base-char)))\n    (read-line-into s)\n    (let ((rhash (make-rhash s 4294967291 :base 2095716802)))\n      (labels ((feasible-p (len)\n                 (declare (uint62 len))\n                 (let ((q (make-deque (+ len 1)))\n                       (table (make-hash-table :test #'eq)))\n                   (loop for start from 0 to (- n len)\n                         for value = (rhash-query rhash start (+ start len))\n                         do (deque-push-back value q)\n                            (when (> (deque-count q) len)\n                              (setf (gethash (deque-pop-front q) table) t))\n                            (when (gethash value table)\n                              (return-from feasible-p t))\n                         finally (return nil)))))\n        (sb-int:named-let bisect ((ok 0) (ng n))\n          (if (<= (- ng ok) 1)\n              (println ok)\n              (let ((mid (ash (+ ok ng) -1)))\n                (if (feasible-p mid)\n                    (bisect mid ng)\n                    (bisect ok mid)))))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5\nababa\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\nxy\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"13\nstrangeorange\n\"\n    \"5\n\")))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 15707, "cpu_time_ms": 481, "memory_kb": 61796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s503174227", "group_id": "codeNet:p02933", "input_text": "(let ((a (read))\n      (s (read-line)))\n  (format t \"~A~%\" (if (<= 3200 a) s \"red\")))\n", "language": "Lisp", "metadata": {"date": 1598137638, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lisp/s503174227.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s503174227", "user_id": "u608227593"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "(let ((a (read))\n      (s (read-line)))\n  (format t \"~A~%\" (if (<= 3200 a) s \"red\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 16, "memory_kb": 24120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s438715878", "group_id": "codeNet:p02933", "input_text": "(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(setq *n* (read))\n(setq *ai* (mapcar #'parse-integer (split \" \" (read-line))))\n\n(print (float (/ 1 (apply #'+ (mapcar #'(lambda (a) (/ 1 a)) *ai*)))))", "language": "Lisp", "metadata": {"date": 1569545136, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lisp/s438715878.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s438715878", "user_id": "u358554431"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(setq *n* (read))\n(setq *ai* (mapcar #'parse-integer (split \" \" (read-line))))\n\n(print (float (/ 1 (apply #'+ (mapcar #'(lambda (a) (/ 1 a)) *ai*)))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 24, "memory_kb": 4708}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s244051972", "group_id": "codeNet:p02933", "input_text": "(defun ans (a s)\n  (if (< a 3200)\n      \"red\"\n      s))\n\n(format t \"~a~%\" (ans (read) (read-line)))", "language": "Lisp", "metadata": {"date": 1569010063, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lisp/s244051972.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s244051972", "user_id": "u358554431"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "(defun ans (a s)\n  (if (< a 3200)\n      \"red\"\n      s))\n\n(format t \"~a~%\" (ans (read) (read-line)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 99, "cpu_time_ms": 8, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s857487154", "group_id": "codeNet:p02933", "input_text": "(princ (if (< (read) 3200) \"red\" (read-line)))", "language": "Lisp", "metadata": {"date": 1567134743, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lisp/s857487154.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s857487154", "user_id": "u610490393"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "(princ (if (< (read) 3200) \"red\" (read-line)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 46, "cpu_time_ms": 18, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s005955481", "group_id": "codeNet:p02933", "input_text": "(princ (if (< (read) 3200) \"red\" (read)))", "language": "Lisp", "metadata": {"date": 1567134658, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lisp/s005955481.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s005955481", "user_id": "u610490393"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "(princ (if (< (read) 3200) \"red\" (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 41, "cpu_time_ms": 24, "memory_kb": 4068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s175446173", "group_id": "codeNet:p02933", "input_text": "(princ (if (< (read) 3200)) \"red\" (read))", "language": "Lisp", "metadata": {"date": 1567134610, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lisp/s175446173.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s175446173", "user_id": "u610490393"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "(princ (if (< (read) 3200)) \"red\" (read))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 41, "cpu_time_ms": 57, "memory_kb": 7396}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s082569737", "group_id": "codeNet:p02933", "input_text": "(let ((a (read))\n      (s (read-line)))\n  (if (>= a 3200)\n      (format t \"~A~%\" s)\n      (format t \"red~%\")))\n", "language": "Lisp", "metadata": {"date": 1566238546, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lisp/s082569737.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s082569737", "user_id": "u631655863"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "(let ((a (read))\n      (s (read-line)))\n  (if (>= a 3200)\n      (format t \"~A~%\" s)\n      (format t \"red~%\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 111, "cpu_time_ms": 105, "memory_kb": 11104}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s307961809", "group_id": "codeNet:p02933", "input_text": "(let ((a (read))\n      (s (read-line)))\n  (if (>= a 3200)\n      (print s)\n      (print \"red\")))\n", "language": "Lisp", "metadata": {"date": 1566238458, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lisp/s307961809.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s307961809", "user_id": "u631655863"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "(let ((a (read))\n      (s (read-line)))\n  (if (>= a 3200)\n      (print s)\n      (print \"red\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 86, "memory_kb": 9448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s538528458", "group_id": "codeNet:p02933", "input_text": "(let ((a (read))\n      (s (read-line)))\n  (princ (if (<= 3200 a) s \"red\")))\n", "language": "Lisp", "metadata": {"date": 1566176548, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lisp/s538528458.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s538528458", "user_id": "u994767958"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "(let ((a (read))\n      (s (read-line)))\n  (princ (if (<= 3200 a) s \"red\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 76, "cpu_time_ms": 182, "memory_kb": 9572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s187854235", "group_id": "codeNet:p02933", "input_text": "(princ (if (<= 3200 (read)) \"red\" (read-line)))\n", "language": "Lisp", "metadata": {"date": 1566176460, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Lisp/s187854235.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s187854235", "user_id": "u994767958"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "(princ (if (<= 3200 (read)) \"red\" (read-line)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 48, "cpu_time_ms": 17, "memory_kb": 3684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s959628831", "group_id": "codeNet:p02936", "input_text": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (q (read)))\n    (declare (uint32 n q))\n    (let ((edges (make-array n :element-type 'list :adjustable nil :initial-element nil))\n          (res (make-array n :element-type 'fixnum :adjustable nil :initial-element 0)))\n      (declare ((array list 1) edges)\n               ((array fixnum 1) res))\n      (loop repeat (1- n) do\n           (let ((a (1- (read-fixnum)))\n                 (b (1- (read-fixnum))))\n             (declare (uint32 a b))\n             (push a (aref edges b))\n             (push b (aref edges a))))\n      (loop repeat q do\n           (let ((p (1- (read-fixnum)))\n                 (x (read-fixnum)))\n             (declare (uint32 p x))\n             (incf (aref res p) x)))\n      (labels ((recursive-incf (node parent)\n                 (declare (uint32 q)\n                          (integer parent))\n                 (unless (= parent -1)\n                   (incf (aref res node)\n                         (aref res parent)))\n                 (mapc (lambda (child)\n                         (unless (= child parent)\n                           (recursive-incf child node)))\n                       (aref edges node))))\n        (recursive-incf 0 -1)\n        (princ (unwrap (map 'list #'identity res)))\n        (fresh-line)))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600731238, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lisp/s959628831.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s959628831", "user_id": "u425762225"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (q (read)))\n    (declare (uint32 n q))\n    (let ((edges (make-array n :element-type 'list :adjustable nil :initial-element nil))\n          (res (make-array n :element-type 'fixnum :adjustable nil :initial-element 0)))\n      (declare ((array list 1) edges)\n               ((array fixnum 1) res))\n      (loop repeat (1- n) do\n           (let ((a (1- (read-fixnum)))\n                 (b (1- (read-fixnum))))\n             (declare (uint32 a b))\n             (push a (aref edges b))\n             (push b (aref edges a))))\n      (loop repeat q do\n           (let ((p (1- (read-fixnum)))\n                 (x (read-fixnum)))\n             (declare (uint32 p x))\n             (incf (aref res p) x)))\n      (labels ((recursive-incf (node parent)\n                 (declare (uint32 q)\n                          (integer parent))\n                 (unless (= parent -1)\n                   (incf (aref res node)\n                         (aref res parent)))\n                 (mapc (lambda (child)\n                         (unless (= child parent)\n                           (recursive-incf child node)))\n                       (aref edges node))))\n        (recursive-incf 0 -1)\n        (princ (unwrap (map 'list #'identity res)))\n        (fresh-line)))))\n\n#-swank (main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8922, "cpu_time_ms": 203, "memory_kb": 63748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s792608034", "group_id": "codeNet:p02936", "input_text": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (q (read)))\n    (declare (uint32 n q))\n    (let ((edges (make-array n :element-type t :initial-element nil))\n          (res (make-array n :element-type 'fixnum :initial-element 0)))\n      (declare ((array t 1) edges)\n               ((array fixnum 1) res))\n      (loop repeat (1- n) do\n           (let ((a (1- (read)))\n                 (b (1- (read))))\n             (declare (uint32 a b))\n             (push a (aref edges b))\n             (push b (aref edges a))))\n      (loop repeat q do\n           (let ((p (1- (read)))\n                 (x (read)))\n             (declare (uint32 p x))\n             (incf (aref res p) x)))\n      (labels ((recursive-incf (node parent)\n                 (declare (uint32 q)\n                          (integer parent))\n                 (unless (= parent -1)\n                   (incf (aref res node)\n                         (aref res parent)))\n                 (mapc (lambda (child)\n                         (unless (= child parent)\n                           (recursive-incf child node)))\n                       (aref edges node))))\n        (recursive-incf 0 -1)\n        (princ (unwrap (map 'list #'identity res)))\n        (fresh-line)))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600730809, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lisp/s792608034.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s792608034", "user_id": "u425762225"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (q (read)))\n    (declare (uint32 n q))\n    (let ((edges (make-array n :element-type t :initial-element nil))\n          (res (make-array n :element-type 'fixnum :initial-element 0)))\n      (declare ((array t 1) edges)\n               ((array fixnum 1) res))\n      (loop repeat (1- n) do\n           (let ((a (1- (read)))\n                 (b (1- (read))))\n             (declare (uint32 a b))\n             (push a (aref edges b))\n             (push b (aref edges a))))\n      (loop repeat q do\n           (let ((p (1- (read)))\n                 (x (read)))\n             (declare (uint32 p x))\n             (incf (aref res p) x)))\n      (labels ((recursive-incf (node parent)\n                 (declare (uint32 q)\n                          (integer parent))\n                 (unless (= parent -1)\n                   (incf (aref res node)\n                         (aref res parent)))\n                 (mapc (lambda (child)\n                         (unless (= child parent)\n                           (recursive-incf child node)))\n                       (aref edges node))))\n        (recursive-incf 0 -1)\n        (princ (unwrap (map 'list #'identity res)))\n        (fresh-line)))))\n\n#-swank (main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8855, "cpu_time_ms": 802, "memory_kb": 102540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s011612186", "group_id": "codeNet:p02936", "input_text": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (q (read)))\n    (let ((edges (make-array n :initial-element nil))\n          (res (make-array n :initial-element 0)))\n      (loop repeat (1- n) do\n           (let ((a (1- (read)))\n                 (b (1- (read))))\n             (push a (aref edges b))\n             (push b (aref edges a))))\n      (loop repeat q do\n           (let ((p (1- (read)))\n                 (x (read)))\n             (incf (aref res p) x)))\n      (labels ((recursive-incf (node parent)\n                 (unless (= parent -1)\n                   (incf (aref res node)\n                         (aref res parent)))\n                 (mapc (lambda (child)\n                         (unless (= child parent)\n                           (recursive-incf child node)))\n                       (aref edges node))))\n        (recursive-incf 0 -1)\n        (princ (unwrap (map 'list #'identity res)))\n        (fresh-line)))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600730245, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lisp/s011612186.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s011612186", "user_id": "u425762225"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (q (read)))\n    (let ((edges (make-array n :initial-element nil))\n          (res (make-array n :initial-element 0)))\n      (loop repeat (1- n) do\n           (let ((a (1- (read)))\n                 (b (1- (read))))\n             (push a (aref edges b))\n             (push b (aref edges a))))\n      (loop repeat q do\n           (let ((p (1- (read)))\n                 (x (read)))\n             (incf (aref res p) x)))\n      (labels ((recursive-incf (node parent)\n                 (unless (= parent -1)\n                   (incf (aref res node)\n                         (aref res parent)))\n                 (mapc (lambda (child)\n                         (unless (= child parent)\n                           (recursive-incf child node)))\n                       (aref edges node))))\n        (recursive-incf 0 -1)\n        (princ (unwrap (map 'list #'identity res)))\n        (fresh-line)))))\n\n#-swank (main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8563, "cpu_time_ms": 795, "memory_kb": 102540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s313328688", "group_id": "codeNet:p02936", "input_text": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n\n(defun solve (n q edges queries)\n  (let ((memo (make-array n :initial-element 0))\n        (children (make-array n :initial-element nil)))\n    (mapc (lambda (query)\n            (incf (aref memo (car query))\n                  (cdr query)))\n          queries)\n    (mapc (lambda (edge)\n            (let ((a (car edge))\n                  (b (cdr edge)))\n              (when (> a b)\n                (rotatef a b))\n              (push b (aref children a))))\n          edges)\n    (labels ((increment-for-children (node val)\n               (when (aref children node)\n                 (mapc (lambda (child)\n                         (incf (aref memo child) val)\n                         (increment-for-children child (aref memo child)))\n                       (aref children node)))))\n      (increment-for-children 0 (aref memo 0))\n      memo)))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (q (read)))\n    (let ((edges (loop repeat (1- n) collect (cons (1- (read))\n                                              (1- (read)))))\n          (queries (loop repeat q collect (cons (1- (read))\n                                                (read)))))\n      (princ (unwrap (coerce (solve n q edges queries) 'list)))\n      (fresh-line))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600728955, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lisp/s313328688.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s313328688", "user_id": "u425762225"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read-fixnum)))\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n\n(defun solve (n q edges queries)\n  (let ((memo (make-array n :initial-element 0))\n        (children (make-array n :initial-element nil)))\n    (mapc (lambda (query)\n            (incf (aref memo (car query))\n                  (cdr query)))\n          queries)\n    (mapc (lambda (edge)\n            (let ((a (car edge))\n                  (b (cdr edge)))\n              (when (> a b)\n                (rotatef a b))\n              (push b (aref children a))))\n          edges)\n    (labels ((increment-for-children (node val)\n               (when (aref children node)\n                 (mapc (lambda (child)\n                         (incf (aref memo child) val)\n                         (increment-for-children child (aref memo child)))\n                       (aref children node)))))\n      (increment-for-children 0 (aref memo 0))\n      memo)))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (q (read)))\n    (let ((edges (loop repeat (1- n) collect (cons (1- (read))\n                                              (1- (read)))))\n          (queries (loop repeat q collect (cons (1- (read))\n                                                (read)))))\n      (princ (unwrap (coerce (solve n q edges queries) 'list)))\n      (fresh-line))))\n\n#-swank (main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8862, "cpu_time_ms": 785, "memory_kb": 109948}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s014540515", "group_id": "codeNet:p02936", "input_text": ";;;; queue\n(defstruct queue\n  (entrance nil)\n  (exit nil))\n\n(defun enqueue (item queue)\n  (let ((cell (list item)))\n    (if (queue-entrance queue)\n        (setf (cdr (queue-entrance queue)) cell)\n        (setf (queue-exit queue) cell))\n    (setf (queue-entrance queue) cell)))\n\n(defun dequeue (queue)\n  (when (queue-exit queue)\n    (prog1 (pop (queue-exit queue))\n      (unless (queue-exit queue)\n        (setf (queue-entrance queue) nil)))))\n\n;;;; main\n(let* ((n (read))\n       (q (read))\n       (e (make-array (list (1+ n)) :initial-element nil))\n       (chk (make-array (list (1+ n)) :initial-element nil))\n       (ans (make-array (list (1+ n)) :initial-element 0)))\n  (loop :for i :from 1 :to (1- n)\n        :for a := (read)\n        :for b := (read)\n        :do (push b (aref e a))\n        :do (push a (aref e b)))\n  (loop :for j :from 1 :to q\n        :for p := (read)\n        :for x := (read)\n        :do (incf (aref ans p) x))\n  ;\n  (let ((q (make-queue)))\n    (enqueue 1 q)\n    (loop :while (queue-exit q)\n          :for x := (dequeue q)\n          :do (unless (aref chk x)\n                (setf (aref chk x) t)\n                (loop :for y :in (aref e x)\n                      :do (unless (aref chk y)\n                            (incf (aref ans y) (aref ans x))\n                            (enqueue y q))))))\n  (loop :for i :from 1 :to (1- n)\n        :do (format t \"~A \" (aref ans i)))\n  (format t \"~A~%\" (aref ans n)))\n", "language": "Lisp", "metadata": {"date": 1599884955, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lisp/s014540515.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s014540515", "user_id": "u608227593"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": ";;;; queue\n(defstruct queue\n  (entrance nil)\n  (exit nil))\n\n(defun enqueue (item queue)\n  (let ((cell (list item)))\n    (if (queue-entrance queue)\n        (setf (cdr (queue-entrance queue)) cell)\n        (setf (queue-exit queue) cell))\n    (setf (queue-entrance queue) cell)))\n\n(defun dequeue (queue)\n  (when (queue-exit queue)\n    (prog1 (pop (queue-exit queue))\n      (unless (queue-exit queue)\n        (setf (queue-entrance queue) nil)))))\n\n;;;; main\n(let* ((n (read))\n       (q (read))\n       (e (make-array (list (1+ n)) :initial-element nil))\n       (chk (make-array (list (1+ n)) :initial-element nil))\n       (ans (make-array (list (1+ n)) :initial-element 0)))\n  (loop :for i :from 1 :to (1- n)\n        :for a := (read)\n        :for b := (read)\n        :do (push b (aref e a))\n        :do (push a (aref e b)))\n  (loop :for j :from 1 :to q\n        :for p := (read)\n        :for x := (read)\n        :do (incf (aref ans p) x))\n  ;\n  (let ((q (make-queue)))\n    (enqueue 1 q)\n    (loop :while (queue-exit q)\n          :for x := (dequeue q)\n          :do (unless (aref chk x)\n                (setf (aref chk x) t)\n                (loop :for y :in (aref e x)\n                      :do (unless (aref chk y)\n                            (incf (aref ans y) (aref ans x))\n                            (enqueue y q))))))\n  (loop :for i :from 1 :to (1- n)\n        :do (format t \"~A \" (aref ans i)))\n  (format t \"~A~%\" (aref ans n)))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1428, "cpu_time_ms": 805, "memory_kb": 89524}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s977813447", "group_id": "codeNet:p02936", "input_text": "(let* ((n (read))\n       (q (read))\n       (graph (make-array n :element-type 'list :initial-element nil))\n       (qval (make-array n :initial-element 0))\n       (ans (make-array n :initial-element 0)))\n  (dotimes (i (1- n))\n    (let ((a (1- (read)))\n          (b (1- (read))))\n      (push b (aref graph a))\n      (push a (aref graph b))))\n  (dotimes (i q)\n    (let ((p (1- (read)))\n          (x (read)))\n      (incf (aref qval p) x)))\n  (labels\n    ((dfs (x val parent)\n       (setf (aref ans x) (+ (aref qval x) val))\n       (dolist (child (aref graph x))\n         (unless (= child parent)\n           (dfs child (aref ans x) x)))))\n    (dfs 0 0 -1))\n  (dotimes (i n)\n    (format t \"~A \" (aref ans i)))\n  (fresh-line))", "language": "Lisp", "metadata": {"date": 1577002728, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lisp/s977813447.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s977813447", "user_id": "u672956630"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "(let* ((n (read))\n       (q (read))\n       (graph (make-array n :element-type 'list :initial-element nil))\n       (qval (make-array n :initial-element 0))\n       (ans (make-array n :initial-element 0)))\n  (dotimes (i (1- n))\n    (let ((a (1- (read)))\n          (b (1- (read))))\n      (push b (aref graph a))\n      (push a (aref graph b))))\n  (dotimes (i q)\n    (let ((p (1- (read)))\n          (x (read)))\n      (incf (aref qval p) x)))\n  (labels\n    ((dfs (x val parent)\n       (setf (aref ans x) (+ (aref qval x) val))\n       (dolist (child (aref graph x))\n         (unless (= child parent)\n           (dfs child (aref ans x) x)))))\n    (dfs 0 0 -1))\n  (dotimes (i n)\n    (format t \"~A \" (aref ans i)))\n  (fresh-line))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 719, "cpu_time_ms": 1833, "memory_kb": 76580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s326859999", "group_id": "codeNet:p02936", "input_text": "(defun f (graph a s parent visited)\n  (setf (aref visited s) t)\n  (setf (aref a s) (+ (aref a s) (aref a parent)))\n  (mapc (lambda (x) (unless (aref visited x)\n                      (f graph a x s visited)))\n        (gethash s graph)))\n(let* ((n (read))\n       (q (read))\n       (a (make-array (1+ n)))\n       (graph (make-hash-table)))\n  (loop for i from 1 below n\n        do (let ((a (read)) (b (read)))\n             (setf (gethash a graph) (cons b (gethash a graph)))\n             (setf (gethash b graph) (cons a (gethash b graph)))))\n  (loop for i below q\n        do (let ((p (read)) (x (read)))\n             (setf (aref a p) (+ x (aref a p)))))\n  (let ((visited (make-array (1+ n) :initial-element nil)))\n    (f graph a 1 0 visited))\n  (loop for i from 1 to n\n        do (format t \"~A \" (aref a i)))\n  (terpri))", "language": "Lisp", "metadata": {"date": 1573792599, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lisp/s326859999.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s326859999", "user_id": "u672956630"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "(defun f (graph a s parent visited)\n  (setf (aref visited s) t)\n  (setf (aref a s) (+ (aref a s) (aref a parent)))\n  (mapc (lambda (x) (unless (aref visited x)\n                      (f graph a x s visited)))\n        (gethash s graph)))\n(let* ((n (read))\n       (q (read))\n       (a (make-array (1+ n)))\n       (graph (make-hash-table)))\n  (loop for i from 1 below n\n        do (let ((a (read)) (b (read)))\n             (setf (gethash a graph) (cons b (gethash a graph)))\n             (setf (gethash b graph) (cons a (gethash b graph)))))\n  (loop for i below q\n        do (let ((p (read)) (x (read)))\n             (setf (aref a p) (+ x (aref a p)))))\n  (let ((visited (make-array (1+ n) :initial-element nil)))\n    (f graph a 1 0 visited))\n  (loop for i from 1 to n\n        do (format t \"~A \" (aref a i)))\n  (terpri))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 816, "cpu_time_ms": 2106, "memory_kb": 82344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s651336279", "group_id": "codeNet:p02936", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n;; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\")))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return result)))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n;; Should we do this with UNWIND-PROTECT?\n(defmacro with-buffered-stdout (&body body)\n  \"Buffers all outputs to *STANDARD-OUTPUT* in BODY and flushes them to\n*STANDARD-OUTPUT* after BODY has been done (without error). Note that only\nBASE-CHAR is allowed.\"\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (q (read))\n         (graph (make-array n :element-type 'list :initial-element nil))\n         (qtable (make-array n :element-type 'uint32 :initial-element 0))\n         (res (make-array n :element-type 'uint32 :initial-element 0)))\n    (declare (uint31 n q))\n    (dotimes (i (- n 1))\n      (let ((a (- (read-fixnum) 1))\n            (b (- (read-fixnum) 1)))\n        (push a (aref graph b))\n        (push b (aref graph a))))\n    (dotimes (i q)\n      (let ((p (- (read-fixnum) 1))\n            (x (read-fixnum)))\n        (incf (aref qtable p) x)))\n    (sb-int:named-let dfs ((v 0) (parent n) (sum 0))\n      (declare (uint62 v parent sum))\n      (let ((new-sum (the uint62 (+ sum (aref qtable v)))))\n        (setf (aref res v) new-sum)\n        (dolist (neighbor (aref graph v))\n          (unless (= parent (the uint31 neighbor))\n            (dfs neighbor v new-sum)))))\n    (with-buffered-stdout\n      (loop with init = t\n            for x across res\n            do (if init (setq init nil) (write-char #\\ ))\n               (princ x)))\n    (terpri)))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1566198895, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Lisp/s651336279.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s651336279", "user_id": "u352600849"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n;; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\")))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return result)))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n;; Should we do this with UNWIND-PROTECT?\n(defmacro with-buffered-stdout (&body body)\n  \"Buffers all outputs to *STANDARD-OUTPUT* in BODY and flushes them to\n*STANDARD-OUTPUT* after BODY has been done (without error). Note that only\nBASE-CHAR is allowed.\"\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (q (read))\n         (graph (make-array n :element-type 'list :initial-element nil))\n         (qtable (make-array n :element-type 'uint32 :initial-element 0))\n         (res (make-array n :element-type 'uint32 :initial-element 0)))\n    (declare (uint31 n q))\n    (dotimes (i (- n 1))\n      (let ((a (- (read-fixnum) 1))\n            (b (- (read-fixnum) 1)))\n        (push a (aref graph b))\n        (push b (aref graph a))))\n    (dotimes (i q)\n      (let ((p (- (read-fixnum) 1))\n            (x (read-fixnum)))\n        (incf (aref qtable p) x)))\n    (sb-int:named-let dfs ((v 0) (parent n) (sum 0))\n      (declare (uint62 v parent sum))\n      (let ((new-sum (the uint62 (+ sum (aref qtable v)))))\n        (setf (aref res v) new-sum)\n        (dolist (neighbor (aref graph v))\n          (unless (= parent (the uint31 neighbor))\n            (dfs neighbor v new-sum)))))\n    (with-buffered-stdout\n      (loop with init = t\n            for x across res\n            do (if init (setq init nil) (write-char #\\ ))\n               (princ x)))\n    (terpri)))\n\n#-swank (main)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4315, "cpu_time_ms": 290, "memory_kb": 56504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s573282392", "group_id": "codeNet:p02949", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (p (read))\n         (graph (make-array n :element-type 'list :initial-element nil))\n         (revgraph (make-array n :element-type 'list :initial-element nil))\n         (dp (make-array n :element-type 'fixnum :initial-element most-positive-fixnum)))\n    (declare (uint32 n m p))\n    (dotimes (i m)\n      (let ((a (- (read-fixnum) 1))\n            (b (- (read-fixnum) 1))\n            (c (read-fixnum)))\n        (push (cons b (- p c)) (aref graph a))\n        (push a (aref revgraph b))))\n    (setf (aref dp 0) 0)\n    (dotimes (_ n)\n      (dotimes (v n)\n        (unless (= (aref dp v) most-positive-fixnum)\n          (dolist (node (aref graph v))\n            (let ((dest (car node))\n                  (cost (cdr node)))\n              (declare (fixnum dest cost))\n              (setf (aref dp dest)\n                    (min (aref dp dest)\n                         (+ (aref dp v) cost))))))))\n    (let ((cands (make-hash-table)))\n      (dotimes (v n)\n        (unless (= (aref dp v) most-positive-fixnum)\n          (dolist (node (aref graph v))\n            (let ((dest (car node))\n                  (cost (cdr node)))\n              (declare (fixnum dest cost))\n              (when (> (aref dp dest) (+ (aref dp v) cost))\n                (setf (gethash dest cands) t))))))\n      (let ((visited (make-array n :element-type 'bit :initial-element 0)))\n        (sb-int:named-let recur ((v (- n 1)))\n          (setf (aref visited v) 1)\n          (when (gethash v cands)\n            (println -1)\n            (return-from main cands))\n          (dolist (neighbor (aref revgraph v))\n            (when (zerop (aref visited neighbor))\n              (recur neighbor)))))\n      (println (max 0 (- (aref dp (- n 1))))))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1565498801, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lisp/s573282392.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s573282392", "user_id": "u352600849"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (p (read))\n         (graph (make-array n :element-type 'list :initial-element nil))\n         (revgraph (make-array n :element-type 'list :initial-element nil))\n         (dp (make-array n :element-type 'fixnum :initial-element most-positive-fixnum)))\n    (declare (uint32 n m p))\n    (dotimes (i m)\n      (let ((a (- (read-fixnum) 1))\n            (b (- (read-fixnum) 1))\n            (c (read-fixnum)))\n        (push (cons b (- p c)) (aref graph a))\n        (push a (aref revgraph b))))\n    (setf (aref dp 0) 0)\n    (dotimes (_ n)\n      (dotimes (v n)\n        (unless (= (aref dp v) most-positive-fixnum)\n          (dolist (node (aref graph v))\n            (let ((dest (car node))\n                  (cost (cdr node)))\n              (declare (fixnum dest cost))\n              (setf (aref dp dest)\n                    (min (aref dp dest)\n                         (+ (aref dp v) cost))))))))\n    (let ((cands (make-hash-table)))\n      (dotimes (v n)\n        (unless (= (aref dp v) most-positive-fixnum)\n          (dolist (node (aref graph v))\n            (let ((dest (car node))\n                  (cost (cdr node)))\n              (declare (fixnum dest cost))\n              (when (> (aref dp dest) (+ (aref dp v) cost))\n                (setf (gethash dest cands) t))))))\n      (let ((visited (make-array n :element-type 'bit :initial-element 0)))\n        (sb-int:named-let recur ((v (- n 1)))\n          (setf (aref visited v) 1)\n          (when (gethash v cands)\n            (println -1)\n            (return-from main cands))\n          (dolist (neighbor (aref revgraph v))\n            (when (zerop (aref visited neighbor))\n              (recur neighbor)))))\n      (println (max 0 (- (aref dp (- n 1))))))))\n\n#-swank (main)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4128, "cpu_time_ms": 233, "memory_kb": 27236}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s328627115", "group_id": "codeNet:p02949", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (p (read))\n         (graph (make-array n :element-type 'list :initial-element nil))\n         (dp (make-array n :element-type 'fixnum :initial-element most-positive-fixnum)))\n    (declare (uint32 n m p))\n    (dotimes (i m)\n      (let ((a (- (read-fixnum) 1))\n            (b (- (read-fixnum) 1))\n            (c (read-fixnum)))\n        (push (cons b (- p c)) (aref graph a))))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (dotimes (v n)\n        (unless (= (aref dp v) most-positive-fixnum)\n          (dolist (node (aref graph v))\n            (let ((dest (car node))\n                  (cost (cdr node)))\n              (declare (fixnum dest cost))\n              (setf (aref dp dest)\n                    (min (aref dp dest)\n                         (+ (aref dp v) cost))))))))\n    (let ((tmp-res (aref dp (- n 1))))\n      (dotimes (i n)\n        (dotimes (v n)\n          (unless (= (aref dp v) most-positive-fixnum)\n            (dolist (node (aref graph v))\n              (let ((dest (car node))\n                    (cost (cdr node)))\n                (declare (fixnum dest cost))\n                (setf (aref dp dest)\n                      (min (aref dp dest)\n                           (+ (aref dp v) cost))))))))\n      (if (= tmp-res (aref dp (- n 1)))\n          (println (max 0 (- tmp-res)))\n          (println -1)))))\n\n#-swank (main)\n\n\n;; For Test\n#+swank\n(defun io-equal (in-string out-string &key (target #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes TARGET, and returns true if the\nstring output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall target)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input;\nstring: run #'MAIN using the string as input;\nsymbol: alias of FIVEAM:RUN!;\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3 3 10\n1 2 20\n2 3 30\n1 3 45\n\"\n    \"35\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 2 10\n1 2 100\n2 2 100\n\"\n    \"-1\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\"\n    \"0\n\")))\n", "language": "Lisp", "metadata": {"date": 1565487589, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Lisp/s328627115.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s328627115", "user_id": "u352600849"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (p (read))\n         (graph (make-array n :element-type 'list :initial-element nil))\n         (dp (make-array n :element-type 'fixnum :initial-element most-positive-fixnum)))\n    (declare (uint32 n m p))\n    (dotimes (i m)\n      (let ((a (- (read-fixnum) 1))\n            (b (- (read-fixnum) 1))\n            (c (read-fixnum)))\n        (push (cons b (- p c)) (aref graph a))))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (dotimes (v n)\n        (unless (= (aref dp v) most-positive-fixnum)\n          (dolist (node (aref graph v))\n            (let ((dest (car node))\n                  (cost (cdr node)))\n              (declare (fixnum dest cost))\n              (setf (aref dp dest)\n                    (min (aref dp dest)\n                         (+ (aref dp v) cost))))))))\n    (let ((tmp-res (aref dp (- n 1))))\n      (dotimes (i n)\n        (dotimes (v n)\n          (unless (= (aref dp v) most-positive-fixnum)\n            (dolist (node (aref graph v))\n              (let ((dest (car node))\n                    (cost (cdr node)))\n                (declare (fixnum dest cost))\n                (setf (aref dp dest)\n                      (min (aref dp dest)\n                           (+ (aref dp v) cost))))))))\n      (if (= tmp-res (aref dp (- n 1)))\n          (println (max 0 (- tmp-res)))\n          (println -1)))))\n\n#-swank (main)\n\n\n;; For Test\n#+swank\n(defun io-equal (in-string out-string &key (target #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes TARGET, and returns true if the\nstring output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall target)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input;\nstring: run #'MAIN using the string as input;\nsymbol: alias of FIVEAM:RUN!;\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3 3 10\n1 2 20\n2 3 30\n1 3 45\n\"\n    \"35\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 2 10\n1 2 100\n2 2 100\n\"\n    \"-1\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\"\n    \"0\n\")))\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5973, "cpu_time_ms": 311, "memory_kb": 24548}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s660800114", "group_id": "codeNet:p02953", "input_text": "(let ((n (read))\n      (h nil))\n  (loop :for i :from 1 :to n\n        :do (push (read) h))\n  ;\n  (loop :named main\n        :with p := (car h)\n        :for x :in (cdr h)\n        :do (cond ((= x (1+ p))\n                   (setf p p))\n                  ((<= x p)\n                   (setf p x))\n                  (t\n                   (format t \"No~%\")\n                   (return-from main)))\n        :finally (format t \"Yes~%\")))\n", "language": "Lisp", "metadata": {"date": 1598140344, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s660800114.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s660800114", "user_id": "u608227593"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(let ((n (read))\n      (h nil))\n  (loop :for i :from 1 :to n\n        :do (push (read) h))\n  ;\n  (loop :named main\n        :with p := (car h)\n        :for x :in (cdr h)\n        :do (cond ((= x (1+ p))\n                   (setf p p))\n                  ((<= x p)\n                   (setf p x))\n                  (t\n                   (format t \"No~%\")\n                   (return-from main)))\n        :finally (format t \"Yes~%\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 426, "cpu_time_ms": 148, "memory_kb": 77752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s006987404", "group_id": "codeNet:p02953", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n\n(defun main (line)\n  (labels ((f (last lst)\n             (when (null lst)\n               (return-from f t))\n             (when (> last (car lst))\n               (return-from f nil))\n             (f (max last (1- (car lst))) (cdr lst))))\n    (if (f -1000000000 line) \"Yes\" \"No\")))\n\n(let* ((n (read))\n       (line (loop repeat n collect (read))))\n  (princ (main line)))\n", "language": "Lisp", "metadata": {"date": 1585801125, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s006987404.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s006987404", "user_id": "u493610446"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n\n(defun main (line)\n  (labels ((f (last lst)\n             (when (null lst)\n               (return-from f t))\n             (when (> last (car lst))\n               (return-from f nil))\n             (f (max last (1- (car lst))) (cdr lst))))\n    (if (f -1000000000 line) \"Yes\" \"No\")))\n\n(let* ((n (read))\n       (line (loop repeat n collect (read))))\n  (princ (main line)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1271, "cpu_time_ms": 323, "memory_kb": 62524}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s323903387", "group_id": "codeNet:p02953", "input_text": "(let* ((n (read))\n       (lst (make-array n :initial-contents (reverse (loop :repeat n :collect (read))))))\n  (loop :for k :from 1 :upto (- (length lst) 1)\n        :do(if (= (aref lst k) (1+ (aref lst (1- k))))\n               (decf (aref lst k))))\n  (if (or (= n 1)\n          (loop :for k :from 0 :upto (- n 2)\n                :always (>= (aref lst k) (aref lst (1+ k)))))\n      (princ \"Yes\")\n      (princ \"No\")))", "language": "Lisp", "metadata": {"date": 1581895740, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s323903387.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s323903387", "user_id": "u610490393"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(let* ((n (read))\n       (lst (make-array n :initial-contents (reverse (loop :repeat n :collect (read))))))\n  (loop :for k :from 1 :upto (- (length lst) 1)\n        :do(if (= (aref lst k) (1+ (aref lst (1- k))))\n               (decf (aref lst k))))\n  (if (or (= n 1)\n          (loop :for k :from 0 :upto (- n 2)\n                :always (>= (aref lst k) (aref lst (1+ k)))))\n      (princ \"Yes\")\n      (princ \"No\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 413, "cpu_time_ms": 326, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s427926693", "group_id": "codeNet:p02953", "input_text": "(defun and-list (function list)\n  (if (cdr list)\n      (if (funcall function (first list) (second list))\n          (and-list function (cdr list))\n          nil)\n      t))\n(let* ((n (read))\n       (lst (reverse (loop :repeat n :collect (read)))))\n  (loop :for k :from 1 :upto (- (length lst) 1)\n        :do(if (= (elt lst k) (1+ (elt lst (1- k))))\n               (decf (elt lst k))))\n  (if (or (not (cdr lst))\n          (and-list #'>= lst))\n      (princ \"Yes\")\n      (princ \"No\")))\n", "language": "Lisp", "metadata": {"date": 1581895540, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s427926693.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s427926693", "user_id": "u610490393"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun and-list (function list)\n  (if (cdr list)\n      (if (funcall function (first list) (second list))\n          (and-list function (cdr list))\n          nil)\n      t))\n(let* ((n (read))\n       (lst (reverse (loop :repeat n :collect (read)))))\n  (loop :for k :from 1 :upto (- (length lst) 1)\n        :do(if (= (elt lst k) (1+ (elt lst (1- k))))\n               (decf (elt lst k))))\n  (if (or (not (cdr lst))\n          (and-list #'>= lst))\n      (princ \"Yes\")\n      (princ \"No\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 481, "cpu_time_ms": 2104, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s893903957", "group_id": "codeNet:p02953", "input_text": "(defun solve (n heights)\n  (loop with decreasing = nil\n        for i from 0 below (1- n)\n        for j = (1+ i)\n        do (if (< (aref heights j) (aref heights i))\n               (if (or (< 1 (- (aref heights i) (aref heights j))) decreasing)\n                   (return nil)\n                   (setf decreasing t))\n               (setf decreasing nil))\n        finally (return t)))\n\n#-swank\n(let* ((n (read))\n       (heights (make-array n :element-type 'fixnum)))\n  (loop for i from 0 below n\n        do (setf (aref heights i) (read)))\n  (format t \"~:[No~;Yes~]~%\" (solve n heights)))\n", "language": "Lisp", "metadata": {"date": 1580788268, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s893903957.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s893903957", "user_id": "u202886318"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun solve (n heights)\n  (loop with decreasing = nil\n        for i from 0 below (1- n)\n        for j = (1+ i)\n        do (if (< (aref heights j) (aref heights i))\n               (if (or (< 1 (- (aref heights i) (aref heights j))) decreasing)\n                   (return nil)\n                   (setf decreasing t))\n               (setf decreasing nil))\n        finally (return t)))\n\n#-swank\n(let* ((n (read))\n       (heights (make-array n :element-type 'fixnum)))\n  (loop for i from 0 below n\n        do (setf (aref heights i) (read)))\n  (format t \"~:[No~;Yes~]~%\" (solve n heights)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 586, "cpu_time_ms": 313, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s283913121", "group_id": "codeNet:p02953", "input_text": "(defun solve (n heights)\n  (loop with decreasing = nil\n        for i from 0 below (1- n)\n        for j = (1+ i)\n        do (if (< (aref heights j) (aref heights i))\n               (if decreasing\n                   (return nil)\n                   (setf decreasing t))\n               (setf decreasing nil))\n        finally (return t)))\n\n#-swank\n(let* ((n (read))\n       (heights (make-array n :element-type 'fixnum)))\n  (loop for i from 0 below n\n        do (setf (aref heights i) (read)))\n  (format t \"~:[No~;Yes~]~%\" (solve n heights)))\n", "language": "Lisp", "metadata": {"date": 1580787981, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s283913121.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s283913121", "user_id": "u202886318"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun solve (n heights)\n  (loop with decreasing = nil\n        for i from 0 below (1- n)\n        for j = (1+ i)\n        do (if (< (aref heights j) (aref heights i))\n               (if decreasing\n                   (return nil)\n                   (setf decreasing t))\n               (setf decreasing nil))\n        finally (return t)))\n\n#-swank\n(let* ((n (read))\n       (heights (make-array n :element-type 'fixnum)))\n  (loop for i from 0 below n\n        do (setf (aref heights i) (read)))\n  (format t \"~:[No~;Yes~]~%\" (solve n heights)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 537, "cpu_time_ms": 314, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s961478273", "group_id": "codeNet:p02953", "input_text": "(let ((n (read))\n      (pre 0)\n      (flg T)\n      temp)\n     (loop repeat n\n           do (setf temp (read))\n              (cond ((> pre temp) (setf flg nil))\n                    ((< pre (1- temp)) (setf pre (1- temp)))))\n     (princ (if flg \"Yes\" \"No\")))", "language": "Lisp", "metadata": {"date": 1566096130, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s961478273.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s961478273", "user_id": "u994767958"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(let ((n (read))\n      (pre 0)\n      (flg T)\n      temp)\n     (loop repeat n\n           do (setf temp (read))\n              (cond ((> pre temp) (setf flg nil))\n                    ((< pre (1- temp)) (setf pre (1- temp)))))\n     (princ (if flg \"Yes\" \"No\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 256, "cpu_time_ms": 305, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s518076133", "group_id": "codeNet:p02953", "input_text": "(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n \n(defparameter N (read))\n(defparameter hs (make-array N :initial-contents\n                             (mapcar #'parse-integer\n                                     (split \" \" (read-line)))))\n\n(defun walk (lst)\n  (loop for i from (- (length lst) 2) downto 0\n        if (<= (aref lst i) (aref lst (1+ i)))\n        collect 1 into result\n        else if (= (1- (aref lst i)) (aref lst (1+ i)))\n        collect (progn (decf (aref lst i) 1) 1) into result\n        else collect 0 into result\n        finally (return (reduce #'* result))))\n\n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 1 (walk lst))\n          (format t \"Yes\")\n          (format t \"No\"))))\n \n(answer hs)", "language": "Lisp", "metadata": {"date": 1565066143, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s518076133.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s518076133", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n \n(defparameter N (read))\n(defparameter hs (make-array N :initial-contents\n                             (mapcar #'parse-integer\n                                     (split \" \" (read-line)))))\n\n(defun walk (lst)\n  (loop for i from (- (length lst) 2) downto 0\n        if (<= (aref lst i) (aref lst (1+ i)))\n        collect 1 into result\n        else if (= (1- (aref lst i)) (aref lst (1+ i)))\n        collect (progn (decf (aref lst i) 1) 1) into result\n        else collect 0 into result\n        finally (return (reduce #'* result))))\n\n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 1 (walk lst))\n          (format t \"Yes\")\n          (format t \"No\"))))\n \n(answer hs)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 887, "cpu_time_ms": 2107, "memory_kb": 1008640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s322992396", "group_id": "codeNet:p02953", "input_text": "(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n \n(defparameter N (read))\n(defparameter hs (make-array N :initial-contents\n                             (mapcar #'parse-integer\n                                     (split \" \" (read-line)))))\n \n(defun compare (s1 s2)\n  (let ((diff (- s1 s2)))\n       (if (< 1 diff)\n           0\n           1)))\n\n(defun walk (lst)\n  (loop for i from (- (length lst) 2) downto 0\n        if (<= (aref lst i) (aref lst (1+ i)))\n        collect 1 into result\n        else if (= (1- (aref lst i)) (aref lst (1+ i)))\n        collect (progn (decf (aref lst i) 1) 1) into result\n        else collect 0 into result\n        finally (return (reduce #'* result))))\n\n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))\n \n(answer hs)", "language": "Lisp", "metadata": {"date": 1565065676, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s322992396.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s322992396", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n \n(defparameter N (read))\n(defparameter hs (make-array N :initial-contents\n                             (mapcar #'parse-integer\n                                     (split \" \" (read-line)))))\n \n(defun compare (s1 s2)\n  (let ((diff (- s1 s2)))\n       (if (< 1 diff)\n           0\n           1)))\n\n(defun walk (lst)\n  (loop for i from (- (length lst) 2) downto 0\n        if (<= (aref lst i) (aref lst (1+ i)))\n        collect 1 into result\n        else if (= (1- (aref lst i)) (aref lst (1+ i)))\n        collect (progn (decf (aref lst i) 1) 1) into result\n        else collect 0 into result\n        finally (return (reduce #'* result))))\n\n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))\n \n(answer hs)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1107, "cpu_time_ms": 2107, "memory_kb": 1008472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s181216742", "group_id": "codeNet:p02953", "input_text": "(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n \n(defparameter N (read))\n(defparameter hs (make-array N :initial-contents\n                             (mapcar #'parse-integer\n                                     (split \" \" (read-line)))))\n\n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))\n \n(answer hs)", "language": "Lisp", "metadata": {"date": 1565064196, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s181216742.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s181216742", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n \n(defparameter N (read))\n(defparameter hs (make-array N :initial-contents\n                             (mapcar #'parse-integer\n                                     (split \" \" (read-line)))))\n\n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))\n \n(answer hs)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1031, "cpu_time_ms": 2112, "memory_kb": 1008036}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s583683442", "group_id": "codeNet:p02953", "input_text": "(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defparameter N (read))\n(defparameter hs (split \" \" (read-line)))\n  \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))\n \n(answer hs)\n(defparameter N (read))\n(defparameter hs (make-array N :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'list (read-line))))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))\n \n(answer hs)\n", "language": "Lisp", "metadata": {"date": 1565063984, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s583683442.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s583683442", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defparameter N (read))\n(defparameter hs (split \" \" (read-line)))\n  \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))\n \n(answer hs)\n(defparameter N (read))\n(defparameter hs (make-array N :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'list (read-line))))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))\n \n(answer hs)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1846, "cpu_time_ms": 2107, "memory_kb": 1008192}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s546166146", "group_id": "codeNet:p02953", "input_text": "(defparameter N (read))\n(defparameter hs (make-array N :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'list (read-line))))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))\n \n(answer hs)\n", "language": "Lisp", "metadata": {"date": 1565063631, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s546166146.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s546166146", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter hs (make-array N :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'list (read-line))))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))\n \n(answer hs)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 937, "cpu_time_ms": 1111, "memory_kb": 180704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s713686704", "group_id": "codeNet:p02953", "input_text": "(defparameter N (read))\n(defparameter hs (make-array :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'list (read-line))))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return(reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\"))))))\n \n(answer hs)\n(defparameter N (read))\n(defparameter hs (make-array :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'list (read-line)))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return(reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\"))))))\n\n(answer hs)\n", "language": "Lisp", "metadata": {"date": 1565063362, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s713686704.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s713686704", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter hs (make-array :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'list (read-line))))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return(reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\"))))))\n \n(answer hs)\n(defparameter N (read))\n(defparameter hs (make-array :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'list (read-line)))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return(reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\"))))))\n\n(answer hs)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1868, "cpu_time_ms": 1103, "memory_kb": 178660}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s250422176", "group_id": "codeNet:p02953", "input_text": "(defparameter N (read))\n(defparameter hs (make-array :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'list (read-line)))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return(reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\"))))))\n\n(answer hs)", "language": "Lisp", "metadata": {"date": 1565063282, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s250422176.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s250422176", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter hs (make-array :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'list (read-line)))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return(reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\"))))))\n\n(answer hs)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 932, "cpu_time_ms": 109, "memory_kb": 10088}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s935236006", "group_id": "codeNet:p02953", "input_text": "(defparameter N (read))\n(defparameter hs (make-array :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'array (read-line)))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return(reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))", "language": "Lisp", "metadata": {"date": 1565063224, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s935236006.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s935236006", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter hs (make-array :initial-contents\n                             (mapcar #'digit-char-p \n                                     (remove-if #'(lambda (x) (eq x #\\ )) \n                                                (concatenate 'array (read-line)))))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return(reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 919, "cpu_time_ms": 27, "memory_kb": 4576}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s998665911", "group_id": "codeNet:p02953", "input_text": "(defparameter N (read))\n(defparameter hs (make-array N))\n(loop for i from 0 to (1- N) do\n  (setf (aref hs i) (read)))\n\n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n\n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return(reduce #'* result))))\n\n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))", "language": "Lisp", "metadata": {"date": 1565062370, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s998665911.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s998665911", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter hs (make-array N))\n(loop for i from 0 to (1- N) do\n  (setf (aref hs i) (read)))\n\n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n\n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return(reduce #'* result))))\n\n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n              (format t \"Yes\")\n              (format t \"No\")))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 751, "cpu_time_ms": 318, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s392459349", "group_id": "codeNet:p02953", "input_text": "(defparameter N (read))\n(defparameter hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref hs i) (read)))\n\n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n\n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n\n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n                  (format t \"Yes\")\n                  (format t \"No\")))))", "language": "Lisp", "metadata": {"date": 1565062047, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s392459349.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s392459349", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref hs i) (read)))\n\n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n\n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n\n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\"))\n          (if (= 1 (walk hs))\n                  (format t \"Yes\")\n                  (format t \"No\")))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 764, "cpu_time_ms": 335, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s594860217", "group_id": "codeNet:p02953", "input_text": "(defparameter N (read))\n(defparameter hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref hs i) (read)))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\")\n              (if (= 1 (walk hs))\n                  (format t \"Yes\")\n                  (format t \"No\"))))))\n \n(answer hs)", "language": "Lisp", "metadata": {"date": 1565061720, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s594860217.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s594860217", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref hs i) (read)))\n \n(defun check (s0 s1 s2)\n  (if (and (<= (1- s0) s1)\n           (<= (1- s0) s2)\n           (<= (1- s1) s2))\n      1\n      0))\n \n(defun walk (lst)\n  (loop for i from 1 to (- (length lst) 2)\n        collect (check (aref lst (1- i))\n                       (aref lst i)\n                       (aref lst (1+ i))) into result\n        finally (return (reduce #'* result))))\n \n(defun answer (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (if (= 2 (length lst))\n          (if (<= (aref lst 0) (aref lst 1))\n              (format t \"Yes\")\n              (if (= 1 (walk hs))\n                  (format t \"Yes\")\n                  (format t \"No\"))))))\n \n(answer hs)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 785, "cpu_time_ms": 332, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s010063479", "group_id": "codeNet:p02953", "input_text": "(defparameter N (read))\n(defparameter Hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref Hs i) (read)))\n \n(defun check (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (loop for i from 0 to (- (length lst) 2) do\n            (if (< (aref lst i)\n                   (aref lst (1+ i)))\n                (setf (aref lst (1+ i))\n                      (1- (aref lst (1+ i))))\n                (if (> (aref lst i)\n                       (aref lst (1+ i)))\n                    finally (format t \"No\")))\n            finally (format t \"Yes\"))))\n\n(check Hs)", "language": "Lisp", "metadata": {"date": 1564970873, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s010063479.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s010063479", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter Hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref Hs i) (read)))\n \n(defun check (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (loop for i from 0 to (- (length lst) 2) do\n            (if (< (aref lst i)\n                   (aref lst (1+ i)))\n                (setf (aref lst (1+ i))\n                      (1- (aref lst (1+ i))))\n                (if (> (aref lst i)\n                       (aref lst (1+ i)))\n                    finally (format t \"No\")))\n            finally (format t \"Yes\"))))\n\n(check Hs)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 572, "cpu_time_ms": 469, "memory_kb": 57956}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s606452232", "group_id": "codeNet:p02953", "input_text": "(defparameter N (read))\n(defparameter Hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref Hs i) (read)))\n \n(if (= N 1)\n    (format t \"Yes\")\n\t(loop for i from 0 to (- N 2) do\n          (if (> (- (aref Hs i) (aref Hs (1+ i)))\n                 1)\n              finally (format t \"No\")\n              (setf (aref Hs (1+ i))\n                    (1- (aref Hs (1+ i)))))\n          finally (format t \"Yes\")))\n\n              ", "language": "Lisp", "metadata": {"date": 1564970076, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s606452232.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s606452232", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter Hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref Hs i) (read)))\n \n(if (= N 1)\n    (format t \"Yes\")\n\t(loop for i from 0 to (- N 2) do\n          (if (> (- (aref Hs i) (aref Hs (1+ i)))\n                 1)\n              finally (format t \"No\")\n              (setf (aref Hs (1+ i))\n                    (1- (aref Hs (1+ i)))))\n          finally (format t \"Yes\")))\n\n              ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 432, "cpu_time_ms": 311, "memory_kb": 57832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s292092076", "group_id": "codeNet:p02953", "input_text": "(defparameter N (read))\n(defparameter Hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref Hs i) (read)))\n\n(defun check (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (loop for i from 0 to (- (length lst) 2) do\n            (when (> 1 (1- (aref lst i)\n                           (aref lst (1+ i))))\n              (format t \"No\"))\n            finally (format t \"Yes\"))))\n\n(check Hs)", "language": "Lisp", "metadata": {"date": 1564969554, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s292092076.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s292092076", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter Hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref Hs i) (read)))\n\n(defun check (lst)\n  (if (= 1 (length lst))\n      (format t \"Yes\")\n      (loop for i from 0 to (- (length lst) 2) do\n            (when (> 1 (1- (aref lst i)\n                           (aref lst (1+ i))))\n              (format t \"No\"))\n            finally (format t \"Yes\"))))\n\n(check Hs)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 409, "cpu_time_ms": 495, "memory_kb": 57828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s767153267", "group_id": "codeNet:p02953", "input_text": "(let* ((n (read))\n       (lst (reverse (loop :repeat n :collect (read)))))\n  (if (cond ((= (length lst) 1) t)\n            ((= (length lst) 2) (<= (1- (first lst)) (second lst)))\n            (t (not (find t (mapcar #'< lst (cdr lst) (cddr lst))))))\n      (princ \"Yes\")\n      (princ \"No\")))", "language": "Lisp", "metadata": {"date": 1564969337, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s767153267.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s767153267", "user_id": "u610490393"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(let* ((n (read))\n       (lst (reverse (loop :repeat n :collect (read)))))\n  (if (cond ((= (length lst) 1) t)\n            ((= (length lst) 2) (<= (1- (first lst)) (second lst)))\n            (t (not (find t (mapcar #'< lst (cdr lst) (cddr lst))))))\n      (princ \"Yes\")\n      (princ \"No\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 288, "cpu_time_ms": 318, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s695730917", "group_id": "codeNet:p02953", "input_text": "(defparameter N (read))\n(defparameter Hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref Hs i) (read)))\n\n(if (= N 1)\n    (format t \"Yes\")\n\t(loop for i from 0 to (- N 2) do\n          (when (< 1 (- (aref Hs i)\n                        (aref Hs (1+ i))))\n              (format t \"No\"))\n          finally (format t \"Yes\")))", "language": "Lisp", "metadata": {"date": 1564969086, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s695730917.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s695730917", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter Hs (make-array N))\n(loop for i from 0 to (1- N) do\n      (setf (aref Hs i) (read)))\n\n(if (= N 1)\n    (format t \"Yes\")\n\t(loop for i from 0 to (- N 2) do\n          (when (< 1 (- (aref Hs i)\n                        (aref Hs (1+ i))))\n              (format t \"No\"))\n          finally (format t \"Yes\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 336, "cpu_time_ms": 337, "memory_kb": 57956}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s673572967", "group_id": "codeNet:p02953", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((n (read))\n         (hs (make-array n :element-type 'uint32)))\n    (dotimes (i n) (setf (aref hs i) (read-fixnum)))\n    (decf (aref hs 0))\n    (loop for i from 1 below n\n          do (cond ((< (aref hs (- i 1)) (aref hs i))\n                    (decf (aref hs i)))\n                   ((= (aref hs (- i 1)) (aref hs i)))\n                   (t (write-line \"No\")\n                      (return-from main))))\n    #>hs\n    (write-line \"Yes\")))\n\n#-swank (main)\n\n\n;; For Test\n#+swank\n(defun io-equal (in-string out-string &optional (func #'main))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNC, and returns true if the\nstring output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (equal (ensure-last-lf out-string)\n           (with-output-to-string (out)\n             (let ((*standard-output* out))\n               (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                 (funcall func)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null ; Runs #'MAIN with the string on clipboard\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname ; Runs #'MAIN with the string in a text file\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample)\n", "language": "Lisp", "metadata": {"date": 1564967301, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Lisp/s673572967.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s673572967", "user_id": "u352600849"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((n (read))\n         (hs (make-array n :element-type 'uint32)))\n    (dotimes (i n) (setf (aref hs i) (read-fixnum)))\n    (decf (aref hs 0))\n    (loop for i from 1 below n\n          do (cond ((< (aref hs (- i 1)) (aref hs i))\n                    (decf (aref hs i)))\n                   ((= (aref hs (- i 1)) (aref hs i)))\n                   (t (write-line \"No\")\n                      (return-from main))))\n    #>hs\n    (write-line \"Yes\")))\n\n#-swank (main)\n\n\n;; For Test\n#+swank\n(defun io-equal (in-string out-string &optional (func #'main))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNC, and returns true if the\nstring output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (equal (ensure-last-lf out-string)\n           (with-output-to-string (out)\n             (let ((*standard-output* out))\n               (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                 (funcall func)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null ; Runs #'MAIN with the string on clipboard\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname ; Runs #'MAIN with the string in a text file\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4573, "cpu_time_ms": 231, "memory_kb": 24420}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s120738969", "group_id": "codeNet:p02983", "input_text": "(defun solve (L R)\n  (if (< 671 (- R L)) 0\n      (loop for i from L to (1- R)\n            minimize (loop for j from (1+ i) to R \n                           minimize (mod (* i j) 2019)))))\n\n(princ (solve (read) (read)))", "language": "Lisp", "metadata": {"date": 1588166066, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lisp/s120738969.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s120738969", "user_id": "u334552723"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun solve (L R)\n  (if (< 671 (- R L)) 0\n      (loop for i from L to (1- R)\n            minimize (loop for j from (1+ i) to R \n                           minimize (mod (* i j) 2019)))))\n\n(princ (solve (read) (read)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 218, "cpu_time_ms": 19, "memory_kb": 4456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s734122755", "group_id": "codeNet:p02983", "input_text": "(defun solve (l r)\n  (loop for i from l below r\n        minimize\n        (loop for j from (1+ i) to r\n              for x = (mod (* i j) 2019)\n              when (= x 0)\n              do (return-from solve 0)\n              minimize x)))\n(princ (solve (read) (read)))", "language": "Lisp", "metadata": {"date": 1577077698, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lisp/s734122755.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s734122755", "user_id": "u672956630"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun solve (l r)\n  (loop for i from l below r\n        minimize\n        (loop for j from (1+ i) to r\n              for x = (mod (* i j) 2019)\n              when (= x 0)\n              do (return-from solve 0)\n              minimize x)))\n(princ (solve (read) (read)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 266, "cpu_time_ms": 148, "memory_kb": 15456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s172137052", "group_id": "codeNet:p02983", "input_text": "(defun solve (l r)\n  (setf l (mod l 2019))\n  (setf r (mod r 2019))\n  (if (> l r)\n    0\n    (* l (1+ l))))\n(princ (solve (read) (read)))", "language": "Lisp", "metadata": {"date": 1577075269, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lisp/s172137052.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s172137052", "user_id": "u672956630"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun solve (l r)\n  (setf l (mod l 2019))\n  (setf r (mod r 2019))\n  (if (> l r)\n    0\n    (* l (1+ l))))\n(princ (solve (read) (read)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 135, "cpu_time_ms": 129, "memory_kb": 12768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s928080446", "group_id": "codeNet:p02983", "input_text": "(let ((L (read))\n      (R (read))\n      (arr (make-array 0 :element-type 'integer\n                         :adjustable t\n                         :fill-pointer 0))\n      (ans 10000))\n     (loop for i from L upto (min R (+ L 4040))\n           do (vector-push-extend (rem i 2019) arr))\n     (setf arr (sort arr #'<))\n     (loop for i from 0 below (1- (min (1+ (- R L)) 4040))\n           do (loop for j from (1+ i) below (min (1+ (- R L)) 4040) while (not (zerop ans))\n                    do (setf ans (min ans (rem (* (aref arr i) (aref arr j)) 2019)))))\n     (princ ans))", "language": "Lisp", "metadata": {"date": 1562605807, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lisp/s928080446.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s928080446", "user_id": "u994767958"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let ((L (read))\n      (R (read))\n      (arr (make-array 0 :element-type 'integer\n                         :adjustable t\n                         :fill-pointer 0))\n      (ans 10000))\n     (loop for i from L upto (min R (+ L 4040))\n           do (vector-push-extend (rem i 2019) arr))\n     (setf arr (sort arr #'<))\n     (loop for i from 0 below (1- (min (1+ (- R L)) 4040))\n           do (loop for j from (1+ i) below (min (1+ (- R L)) 4040) while (not (zerop ans))\n                    do (setf ans (min ans (rem (* (aref arr i) (aref arr j)) 2019)))))\n     (princ ans))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 570, "cpu_time_ms": 172, "memory_kb": 16484}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s834479796", "group_id": "codeNet:p02983", "input_text": "(let ((L (read))\n      (R (read))\n      (arr (make-array 0 :element-type 'integer\n                         :adjustable t\n                         :fill-pointer 0)))\n     (loop for i from L upto (min R (+ L 2020))\n           do (vector-push-extend (rem i 2019) arr))\n     (setf arr (sort arr #'<))\n     (princ (* (aref arr 0) (aref arr 1))))", "language": "Lisp", "metadata": {"date": 1562604975, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lisp/s834479796.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s834479796", "user_id": "u994767958"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let ((L (read))\n      (R (read))\n      (arr (make-array 0 :element-type 'integer\n                         :adjustable t\n                         :fill-pointer 0)))\n     (loop for i from L upto (min R (+ L 2020))\n           do (vector-push-extend (rem i 2019) arr))\n     (setf arr (sort arr #'<))\n     (princ (* (aref arr 0) (aref arr 1))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 142, "memory_kb": 13664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s945336955", "group_id": "codeNet:p02983", "input_text": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(let* ((n (read))\n       (m (read))\n       (ans 2019))\n  (loop :named p-loop :for p :from n :upto (1- m)\n        :do(loop :for q :from (1+ p) :upto m :do(if (= 0 (mod (* p q) 2019))\n                                                    (progn (setf ans 0) (return-from p-loop))\n                                                    (if (< (mod (* p q) 2019) ans)\n                                                        (setf ans (mod (* p q) 2019))) )))\n  (princ ans))", "language": "Lisp", "metadata": {"date": 1562598792, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lisp/s945336955.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s945336955", "user_id": "u610490393"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(let* ((n (read))\n       (m (read))\n       (ans 2019))\n  (loop :named p-loop :for p :from n :upto (1- m)\n        :do(loop :for q :from (1+ p) :upto m :do(if (= 0 (mod (* p q) 2019))\n                                                    (progn (setf ans 0) (return-from p-loop))\n                                                    (if (< (mod (* p q) 2019) ans)\n                                                        (setf ans (mod (* p q) 2019))) )))\n  (princ ans))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 516, "cpu_time_ms": 137, "memory_kb": 15080}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s696252567", "group_id": "codeNet:p02983", "input_text": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(let* ((n (read))\n       (m (read))\n       (x (loop :for k :from 1 :thereis(if (> (* k 2019) n) (1- k)))))\n  (cond ((= n 0) (princ 0))\n    ((= x 0) (princ (loop :for p :from n :upto (1- m) :minimize(loop :for q :from (1+ p) :upto m :minimize (mod (* p q) 2019)))))\n        ((<= n (* 2019 x) m) (princ 0))\n        (t (princ (loop :for p :from n :upto (1- m) :minimize(loop :for q :from (1+ p) :upto m :minimize (mod (* p q) 2019)))))))\n", "language": "Lisp", "metadata": {"date": 1562597235, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lisp/s696252567.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s696252567", "user_id": "u610490393"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(let* ((n (read))\n       (m (read))\n       (x (loop :for k :from 1 :thereis(if (> (* k 2019) n) (1- k)))))\n  (cond ((= n 0) (princ 0))\n    ((= x 0) (princ (loop :for p :from n :upto (1- m) :minimize(loop :for q :from (1+ p) :upto m :minimize (mod (* p q) 2019)))))\n        ((<= n (* 2019 x) m) (princ 0))\n        (t (princ (loop :for p :from n :upto (1- m) :minimize(loop :for q :from (1+ p) :upto m :minimize (mod (* p q) 2019)))))))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 487, "cpu_time_ms": 2104, "memory_kb": 17508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s652437246", "group_id": "codeNet:p02983", "input_text": "(let* ((n (read))\n       (m (read))\n       (x (loop :for k :from 1 :thereis(if (> (* k 2019) n) (1- k)))))\n  (cond ((= x 0) (princ (* n (1+ n))))\n        ((<= n (* 2019 x) m) (princ 0))\n        (t (princ (* (mod n 2019) (mod (1+ n) 2019))))))", "language": "Lisp", "metadata": {"date": 1562550111, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lisp/s652437246.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s652437246", "user_id": "u610490393"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (x (loop :for k :from 1 :thereis(if (> (* k 2019) n) (1- k)))))\n  (cond ((= x 0) (princ (* n (1+ n))))\n        ((<= n (* 2019 x) m) (princ 0))\n        (t (princ (* (mod n 2019) (mod (1+ n) 2019))))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 242, "cpu_time_ms": 135, "memory_kb": 16100}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s144489475", "group_id": "codeNet:p02983", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((l (read))\n         (r (read))\n         (mod-table (make-array 2019 :element-type 'bit :initial-element 0)))\n    (when (>= (- r l) 2019)\n      (println 0)\n      (return-from main))\n    (loop for i from l to r\n          do (setf (aref mod-table (mod i 2019)) 1))\n    (let ((res #xffffffff))\n      (dotimes (i 2019)\n        (loop for j from (+ i 1) below 2019\n              do (when (= 1 (aref mod-table i) (aref mod-table j))\n                   (setf res (min res (mod (* i j) 2019))))))\n      (println res))))\n\n#-swank(main)\n\n\n;; For Test\n#+swank\n(defun io-equal (in-string out-string &optional (func #'main))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNC, and returns true if the\nstring output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (and (> (length s) 0)\n                      (eql (char s (- (length s) 1)) #\\Linefeed))\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (equal (ensure-last-lf out-string)\n           (with-output-to-string (out)\n             (let ((*standard-output* out))\n               (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                 (funcall func)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null ; Runs #'MAIN with the string on clipboard\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname ; Runs #'MAIN with the string in a text file\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2020 2040\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 5\n\"\n    \"20\n\")))\n", "language": "Lisp", "metadata": {"date": 1562548262, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Lisp/s144489475.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s144489475", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((l (read))\n         (r (read))\n         (mod-table (make-array 2019 :element-type 'bit :initial-element 0)))\n    (when (>= (- r l) 2019)\n      (println 0)\n      (return-from main))\n    (loop for i from l to r\n          do (setf (aref mod-table (mod i 2019)) 1))\n    (let ((res #xffffffff))\n      (dotimes (i 2019)\n        (loop for j from (+ i 1) below 2019\n              do (when (= 1 (aref mod-table i) (aref mod-table j))\n                   (setf res (min res (mod (* i j) 2019))))))\n      (println res))))\n\n#-swank(main)\n\n\n;; For Test\n#+swank\n(defun io-equal (in-string out-string &optional (func #'main))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNC, and returns true if the\nstring output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (and (> (length s) 0)\n                      (eql (char s (- (length s) 1)) #\\Linefeed))\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (equal (ensure-last-lf out-string)\n           (with-output-to-string (out)\n             (let ((*standard-output* out))\n               (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                 (funcall func)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null ; Runs #'MAIN with the string on clipboard\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname ; Runs #'MAIN with the string in a text file\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2020 2040\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 5\n\"\n    \"20\n\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3770, "cpu_time_ms": 201, "memory_kb": 20320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s773725952", "group_id": "codeNet:p03018", "input_text": "(defparameter s (read-line))\n \n(defun cut (text)\n  (if (equal \"BC\" (subseq text 0 2))\n      (cut (subseq text 2))\n      (if (or (equal \"C\" (subseq text 0 1))\n              (equal \"B\" (subseq text 0 1)))\n          (cut (subseq text 1))\n          text)))\n \n(let ((counter 0))\n     (defun answer (text)\n       (let ((pos (search \"ABC\" text)))\n            (if pos\n                (progn\n                  (incf counter)\n                  (answer (subseq text (+ pos 2))))\n                counter))))\n \n(print (answer (cur s)))", "language": "Lisp", "metadata": {"date": 1559529341, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lisp/s773725952.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s773725952", "user_id": "u425317134"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defparameter s (read-line))\n \n(defun cut (text)\n  (if (equal \"BC\" (subseq text 0 2))\n      (cut (subseq text 2))\n      (if (or (equal \"C\" (subseq text 0 1))\n              (equal \"B\" (subseq text 0 1)))\n          (cut (subseq text 1))\n          text)))\n \n(let ((counter 0))\n     (defun answer (text)\n       (let ((pos (search \"ABC\" text)))\n            (if pos\n                (progn\n                  (incf counter)\n                  (answer (subseq text (+ pos 2))))\n                counter))))\n \n(print (answer (cur s)))", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 522, "cpu_time_ms": 120, "memory_kb": 13024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s768313319", "group_id": "codeNet:p03018", "input_text": "(defparameter s (read-line))\n \n(defun cut (text)\n  (if (equal \"BC\" (subseq text 0 2))\n      (cut (subseq text 2))\n      (if (or (equal \"C\" (subseq text 0 1))\n              (equal \"B\" (subseq text 0 1)))\n          (cut (subseq text 1))\n          text)))\n \n(let ((counter 0))\n     (defun answer (text)\n       (let* ((new-text (cut text))\n              (pos (search \"ABC\" text)))\n             (if pos\n                (progn\n                  (setf (subseq new-text pos (+ pos 3)) \"BCA\")\n                  (incf counter)\n                  (answer new-text))\n                counter))))\n \n(print (answer s))\n", "language": "Lisp", "metadata": {"date": 1559528882, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lisp/s768313319.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s768313319", "user_id": "u425317134"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defparameter s (read-line))\n \n(defun cut (text)\n  (if (equal \"BC\" (subseq text 0 2))\n      (cut (subseq text 2))\n      (if (or (equal \"C\" (subseq text 0 1))\n              (equal \"B\" (subseq text 0 1)))\n          (cut (subseq text 1))\n          text)))\n \n(let ((counter 0))\n     (defun answer (text)\n       (let* ((new-text (cut text))\n              (pos (search \"ABC\" text)))\n             (if pos\n                (progn\n                  (setf (subseq new-text pos (+ pos 3)) \"BCA\")\n                  (incf counter)\n                  (answer new-text))\n                counter))))\n \n(print (answer s))\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 603, "cpu_time_ms": 2105, "memory_kb": 77156}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s017988946", "group_id": "codeNet:p03018", "input_text": "(defparameter s (read))\n\n(let ((counter 0))\n     (defun answer (text)\n       (let ((pos (search \"ABC\" text)))\n            (if pos\n                (progn\n                  (setf (subseq text pos (+ pos 3)) \"BCA\")\n                  (setf counter (1+ counter))\n                  (answer text))\n                counter))))\n\n(print (answer s))", "language": "Lisp", "metadata": {"date": 1559527070, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Lisp/s017988946.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s017988946", "user_id": "u425317134"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(defparameter s (read))\n\n(let ((counter 0))\n     (defun answer (text)\n       (let ((pos (search \"ABC\" text)))\n            (if pos\n                (progn\n                  (setf (subseq text pos (+ pos 3)) \"BCA\")\n                  (setf counter (1+ counter))\n                  (answer text))\n                counter))))\n\n(print (answer s))", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 338, "cpu_time_ms": 130, "memory_kb": 12388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s707649744", "group_id": "codeNet:p03053", "input_text": "(declaim (optimize (debug 0) (safety 0) (speed 3)))\n(defun blacken (grid queue1 queue2 cnt)\n  (loop while (< 0 (length queue1)) do\n        (loop\n          with i = (vector-pop queue1)\n          with j = (vector-pop queue1)\n          for (a b) in '((0 1) (0 -1) (1 0) (-1 0)) do\n            (if (< (1+ cnt) (aref grid (+ i a) (+ j b)))\n              (progn\n                (setf (aref grid (+ i a) (+ j b)) (1+ cnt))\n                (vector-push-extend (+ i a) queue2)\n                (vector-push-extend (+ j b) queue2)))))\n  (if (= 0 (length queue2))\n    cnt\n    (blacken grid queue2 queue1 (1+ cnt))))\n\n(defun main ()\n  (let* ((h (read))\n         (w (read))\n         (grid (make-array (list (+ h 2) (+ w 2))\n                           :initial-element 0))\n         (queue (make-array 0 :fill-pointer 0 :adjustable t)))\n    (loop for i from 1 to h do\n          (loop for j from 1 to w\n                for c in (concatenate 'list (read-line)) do\n                (if (equal c #\\.)\n                  (setf (aref grid i j) 9999999)\n                  (progn\n                    (setf (aref grid i j) 0)\n                    (vector-push-extend i queue)\n                    (vector-push-extend j queue)))))\n    (format t \"~a~%\" \n      (blacken grid\n               queue\n               (make-array 0 :fill-pointer 0 :adjustable t)\n               0))))\n(main)", "language": "Lisp", "metadata": {"date": 1570919082, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s707649744.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s707649744", "user_id": "u652695471"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(declaim (optimize (debug 0) (safety 0) (speed 3)))\n(defun blacken (grid queue1 queue2 cnt)\n  (loop while (< 0 (length queue1)) do\n        (loop\n          with i = (vector-pop queue1)\n          with j = (vector-pop queue1)\n          for (a b) in '((0 1) (0 -1) (1 0) (-1 0)) do\n            (if (< (1+ cnt) (aref grid (+ i a) (+ j b)))\n              (progn\n                (setf (aref grid (+ i a) (+ j b)) (1+ cnt))\n                (vector-push-extend (+ i a) queue2)\n                (vector-push-extend (+ j b) queue2)))))\n  (if (= 0 (length queue2))\n    cnt\n    (blacken grid queue2 queue1 (1+ cnt))))\n\n(defun main ()\n  (let* ((h (read))\n         (w (read))\n         (grid (make-array (list (+ h 2) (+ w 2))\n                           :initial-element 0))\n         (queue (make-array 0 :fill-pointer 0 :adjustable t)))\n    (loop for i from 1 to h do\n          (loop for j from 1 to w\n                for c in (concatenate 'list (read-line)) do\n                (if (equal c #\\.)\n                  (setf (aref grid i j) 9999999)\n                  (progn\n                    (setf (aref grid i j) 0)\n                    (vector-push-extend i queue)\n                    (vector-push-extend j queue)))))\n    (format t \"~a~%\" \n      (blacken grid\n               queue\n               (make-array 0 :fill-pointer 0 :adjustable t)\n               0))))\n(main)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1351, "cpu_time_ms": 447, "memory_kb": 76516}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s214772932", "group_id": "codeNet:p03053", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline fast-read-char))\n(defun fast-read-char (stream)\n  (declare #-swank (sb-kernel:ansi-stream stream)\n           (inline read-byte))\n  #+swank (read-char stream nil #\\Newline) ; on SLIME\n  #-swank (code-char (read-byte stream nil #.(char-code #\\Newline))))\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array '(1002 1002) :element-type 'uint16 :initial-element 0))\n         ;; i|j\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (loop for i from 1 to h\n          do (loop for j from 1 to w\n                   do (if (char= #\\# (fast-read-char *standard-input*))\n                          (enqueue (logxor i (ash j 16)) q)\n                          (setf (aref plan i j) #xffff)))\n             (fast-read-char *standard-input*))\n    (labels ((frob (next-d next-i next-j)\n               (declare (uint32 next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (logxor next-i (ash next-j 16)) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint32 = (dequeue q)\n            for i = (logand #.(ldb (byte 16 0) -1) node)\n            for j = (ash node -16)\n            for d = (aref plan i j)\n            do (frob (+ 1 d) (- i 1) j)\n               (frob (+ 1 d) (+ i 1) j)\n               (frob (+ 1 d) i (- j 1))\n               (frob (+ 1 d) i (+ j 1))))\n    (println (loop for x across (array-storage-vector plan) maximize x))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1566539719, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s214772932.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s214772932", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline fast-read-char))\n(defun fast-read-char (stream)\n  (declare #-swank (sb-kernel:ansi-stream stream)\n           (inline read-byte))\n  #+swank (read-char stream nil #\\Newline) ; on SLIME\n  #-swank (code-char (read-byte stream nil #.(char-code #\\Newline))))\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array '(1002 1002) :element-type 'uint16 :initial-element 0))\n         ;; i|j\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (loop for i from 1 to h\n          do (loop for j from 1 to w\n                   do (if (char= #\\# (fast-read-char *standard-input*))\n                          (enqueue (logxor i (ash j 16)) q)\n                          (setf (aref plan i j) #xffff)))\n             (fast-read-char *standard-input*))\n    (labels ((frob (next-d next-i next-j)\n               (declare (uint32 next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (logxor next-i (ash next-j 16)) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint32 = (dequeue q)\n            for i = (logand #.(ldb (byte 16 0) -1) node)\n            for j = (ash node -16)\n            for d = (aref plan i j)\n            do (frob (+ 1 d) (- i 1) j)\n               (frob (+ 1 d) (+ i 1) j)\n               (frob (+ 1 d) i (- j 1))\n               (frob (+ 1 d) i (+ j 1))))\n    (println (loop for x across (array-storage-vector plan) maximize x))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3343, "cpu_time_ms": 434, "memory_kb": 55904}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s400775806", "group_id": "codeNet:p03053", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline fast-read-char))\n(defun fast-read-char (stream)\n  (declare #-swank (sb-kernel:ansi-stream stream)\n           (inline read-byte))\n  #+swank (read-char stream nil #\\Newline) ; on SLIME\n  #-swank (code-char (read-byte stream nil #.(char-code #\\Newline))))\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array '(1000 1000) :element-type 'uint16 :initial-element 0))\n         ;; i|j\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (dotimes (j w)\n        (if (char= #\\# (fast-read-char *standard-input*))\n            (enqueue (logxor i (ash j 16)) q)\n            (setf (aref plan i j) #xffff)))\n      (fast-read-char *standard-input*))\n    (labels ((frob (next-d next-i next-j)\n               (declare (uint32 next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (logxor next-i (ash next-j 16)) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint32 = (dequeue q)\n            for i = (logand #.(ldb (byte 16 0) -1) node)\n            for j = (ash node -16)\n            for d = (aref plan i j)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (loop for x across (array-storage-vector plan) maximize x))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1566539530, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s400775806.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s400775806", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline fast-read-char))\n(defun fast-read-char (stream)\n  (declare #-swank (sb-kernel:ansi-stream stream)\n           (inline read-byte))\n  #+swank (read-char stream nil #\\Newline) ; on SLIME\n  #-swank (code-char (read-byte stream nil #.(char-code #\\Newline))))\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array '(1000 1000) :element-type 'uint16 :initial-element 0))\n         ;; i|j\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (dotimes (j w)\n        (if (char= #\\# (fast-read-char *standard-input*))\n            (enqueue (logxor i (ash j 16)) q)\n            (setf (aref plan i j) #xffff)))\n      (fast-read-char *standard-input*))\n    (labels ((frob (next-d next-i next-j)\n               (declare (uint32 next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (logxor next-i (ash next-j 16)) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint32 = (dequeue q)\n            for i = (logand #.(ldb (byte 16 0) -1) node)\n            for j = (ash node -16)\n            for d = (aref plan i j)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (loop for x across (array-storage-vector plan) maximize x))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3409, "cpu_time_ms": 286, "memory_kb": 46176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s584046312", "group_id": "codeNet:p03053", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline fast-read-char))\n(defun fast-read-char (stream)\n  (declare #-swank (sb-kernel:ansi-stream stream)\n           (inline read-byte))\n  #+swank (read-char stream nil #\\Newline) ; on SLIME\n  #-swank (code-char (read-byte stream nil #.(char-code #\\Newline))))\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array '(1000 1000) :element-type 'uint16 :initial-element 0))\n         ;; i|j\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (dotimes (j w)\n        (if (char= #\\# (fast-read-char *standard-input*))\n            (enqueue (encode i j) q)\n            (setf (aref plan i j) #xffff)))\n      (fast-read-char *standard-input*))\n    (labels ((frob (next-d next-i next-j)\n               (declare (uint32 next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (+ next-i (ash next-j 16)) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint32 = (dequeue q)\n            for i = (logand #.(ldb (byte 16 0) -1) node)\n            for j = (ash node -16)\n            for d = (aref plan i j)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1566539246, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s584046312.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s584046312", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline fast-read-char))\n(defun fast-read-char (stream)\n  (declare #-swank (sb-kernel:ansi-stream stream)\n           (inline read-byte))\n  #+swank (read-char stream nil #\\Newline) ; on SLIME\n  #-swank (code-char (read-byte stream nil #.(char-code #\\Newline))))\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array '(1000 1000) :element-type 'uint16 :initial-element 0))\n         ;; i|j\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (dotimes (j w)\n        (if (char= #\\# (fast-read-char *standard-input*))\n            (enqueue (encode i j) q)\n            (setf (aref plan i j) #xffff)))\n      (fast-read-char *standard-input*))\n    (labels ((frob (next-d next-i next-j)\n               (declare (uint32 next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (+ next-i (ash next-j 16)) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint32 = (dequeue q)\n            for i = (logand #.(ldb (byte 16 0) -1) node)\n            for j = (ash node -16)\n            for d = (aref plan i j)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3379, "cpu_time_ms": 103, "memory_kb": 20196}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s003377121", "group_id": "codeNet:p03053", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline fast-read-char))\n(defun fast-read-char (stream)\n  (declare #-swank (sb-kernel:ansi-stream stream)\n           (inline read-byte))\n  #+swank (read-char stream nil #\\Newline) ; on SLIME\n  #-swank (code-char (read-byte stream nil #.(char-code #\\Newline))))\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (inline encode))\n(defun encode (i j)\n  (dpb j (byte 16 16) i))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array '(1000 1000) :element-type 'uint16 :initial-element 0))\n         ;; i|j\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (dotimes (j w)\n        (if (char= #\\# (fast-read-char *standard-input*))\n            (enqueue (encode i j) q)\n            (setf (aref plan i j) #xffff)))\n      (fast-read-char *standard-input*))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (encode next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint32 = (dequeue q)\n            for i = (logand #.(ldb (byte 16 0) -1) node)\n            for j = (ash node -16)\n            for d = (aref plan i j)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1566539125, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s003377121.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s003377121", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline fast-read-char))\n(defun fast-read-char (stream)\n  (declare #-swank (sb-kernel:ansi-stream stream)\n           (inline read-byte))\n  #+swank (read-char stream nil #\\Newline) ; on SLIME\n  #-swank (code-char (read-byte stream nil #.(char-code #\\Newline))))\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (inline encode))\n(defun encode (i j)\n  (dpb j (byte 16 16) i))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array '(1000 1000) :element-type 'uint16 :initial-element 0))\n         ;; i|j\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (dotimes (j w)\n        (if (char= #\\# (fast-read-char *standard-input*))\n            (enqueue (encode i j) q)\n            (setf (aref plan i j) #xffff)))\n      (fast-read-char *standard-input*))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (encode next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint32 = (dequeue q)\n            for i = (logand #.(ldb (byte 16 0) -1) node)\n            for j = (ash node -16)\n            for d = (aref plan i j)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3448, "cpu_time_ms": 342, "memory_kb": 46180}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s016630517", "group_id": "codeNet:p03053", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  \"Reads ASCII inputs and returns two values: the string and the end\nposition. Note that the returned string will be reused if this form is executed\nmore than once.\n\nThis macro calls READ-BYTE to read characters though it calls READ-CHAR instead\non SLIME because SLIME's IO is not bivalent.\"\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym))\n        (stream (gensym)))\n    `(let* ((,stream ,in)\n            (,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte)\n                #+swank (sb-kernel:ansi-stream ,stream))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,stream nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,stream nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (inline encode))\n(defun encode (i j)\n  (dpb j (byte 16 16) i))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         ;; i|j|dist\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (let ((line (buffered-read-line 1000)))\n        (dotimes (j w)\n          (when (char= #\\# (aref line j))\n            (setf (aref plan i j) 0)\n            (enqueue (encode i j) q)))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (encode next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint32 = (dequeue q)\n            for i = (ldb (byte 16 0) node)\n            for j = (ldb (byte 16 16) node)\n            for d = (aref plan i j)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1566538807, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s016630517.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s016630517", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  \"Reads ASCII inputs and returns two values: the string and the end\nposition. Note that the returned string will be reused if this form is executed\nmore than once.\n\nThis macro calls READ-BYTE to read characters though it calls READ-CHAR instead\non SLIME because SLIME's IO is not bivalent.\"\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym))\n        (stream (gensym)))\n    `(let* ((,stream ,in)\n            (,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte)\n                #+swank (sb-kernel:ansi-stream ,stream))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,stream nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,stream nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (inline encode))\n(defun encode (i j)\n  (dpb j (byte 16 16) i))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         ;; i|j|dist\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (let ((line (buffered-read-line 1000)))\n        (dotimes (j w)\n          (when (char= #\\# (aref line j))\n            (setf (aref plan i j) 0)\n            (enqueue (encode i j) q)))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (encode next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint32 = (dequeue q)\n            for i = (ldb (byte 16 0) node)\n            for j = (ldb (byte 16 16) node)\n            for d = (aref plan i j)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4469, "cpu_time_ms": 370, "memory_kb": 48484}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s281012190", "group_id": "codeNet:p03053", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (terminate-char #\\Space))\n  (declare (simple-base-string buffer-string))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (schar buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (schar buffer-string idx) terminate-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (inline encode decode))\n(defun encode (d i j)\n  (dpb j (byte 16 32) (dpb i (byte 16 16) d)))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         (line (make-string w :element-type 'base-char))\n         ;; i|j|dist\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (read-line-into line)\n      (dotimes (j w)\n        (when (char= #\\# (aref line j))\n          (setf (aref plan i j) 0)\n          (enqueue (encode 0 i j) q))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (encode next-d next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint62 = (dequeue q)\n            for d = (ldb (byte 16 0) node)\n            for i = (ldb (byte 16 16) node)\n            for j = (ldb (byte 16 32) node)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1557047925, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s281012190.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s281012190", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (terminate-char #\\Space))\n  (declare (simple-base-string buffer-string))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (schar buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (schar buffer-string idx) terminate-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (inline encode decode))\n(defun encode (d i j)\n  (dpb j (byte 16 32) (dpb i (byte 16 16) d)))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         (line (make-string w :element-type 'base-char))\n         ;; i|j|dist\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (read-line-into line)\n      (dotimes (j w)\n        (when (char= #\\# (aref line j))\n          (setf (aref plan i j) 0)\n          (enqueue (encode 0 i j) q))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (encode next-d next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for node of-type uint62 = (dequeue q)\n            for d = (ldb (byte 16 0) node)\n            for i = (ldb (byte 16 16) node)\n            for j = (ldb (byte 16 32) node)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3920, "cpu_time_ms": 160, "memory_kb": 35432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s008673939", "group_id": "codeNet:p03053", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n;; -*- coding:utf-8 -*-\n\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (terminate-char #\\Space))\n  (declare (simple-base-string buffer-string))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (schar buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (schar buffer-string idx) terminate-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         (line (make-string w :element-type 'base-char))\n         ;; (dist i . j)\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (read-line-into line)\n      (dotimes (j w)\n        (when (char= #\\# (aref line j))\n          (setf (aref plan i j) 0)\n          (enqueue (list* 0 i j) q))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (list* next-d next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for (d i . j) of-type (uint32 uint32 . uint32) = (dequeue q)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1557040126, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s008673939.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s008673939", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n;; -*- coding:utf-8 -*-\n\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (terminate-char #\\Space))\n  (declare (simple-base-string buffer-string))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (schar buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (schar buffer-string idx) terminate-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         (line (make-string w :element-type 'base-char))\n         ;; (dist i . j)\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (read-line-into line)\n      (dotimes (j w)\n        (when (char= #\\# (aref line j))\n          (setf (aref plan i j) 0)\n          (enqueue (list* 0 i j) q))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (list* next-d next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (declare (inline frob))\n      (loop until (queue-empty-p q)\n            for (d i . j) of-type (uint32 uint32 . uint32) = (dequeue q)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3737, "cpu_time_ms": 391, "memory_kb": 109920}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s045863483", "group_id": "codeNet:p03053", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n;; -*- coding:utf-8 -*-\n\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (terminate-char #\\Space))\n  (declare (simple-base-string buffer-string))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (schar buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (schar buffer-string idx) terminate-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         (line (make-string w :element-type 'base-char))\n         ;; (dist i . j)\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (read-line-into line)\n      (dotimes (j w)\n        (when (char= #\\# (aref line j))\n          (setf (aref plan i j) 0)\n          (enqueue (list* 0 i j) q))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (list* next-d next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (loop until (queue-empty-p q)\n            for (d i . j) of-type (uint32 uint32 . uint32) = (dequeue q)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1557040054, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s045863483.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s045863483", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n;; -*- coding:utf-8 -*-\n\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (terminate-char #\\Space))\n  (declare (simple-base-string buffer-string))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (schar buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (schar buffer-string idx) terminate-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         (line (make-string w :element-type 'base-char))\n         ;; (dist i . j)\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (read-line-into line)\n      (dotimes (j w)\n        (when (char= #\\# (aref line j))\n          (setf (aref plan i j) 0)\n          (enqueue (list* 0 i j) q))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (= #xffff (aref plan next-i next-j))\n                 (enqueue (list* next-d next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (loop until (queue-empty-p q)\n            for (d i . j) of-type (uint32 uint32 . uint32) = (dequeue q)\n            do (when (< 0 i)\n                 (frob (+ 1 d) (- i 1) j))\n               (when (< i (- h 1))\n                 (frob (+ 1 d) (+ i 1) j))\n               (when (< 0 j)\n                 (frob (+ 1 d) i (- j 1)))\n               (when (< j (- w 1))\n                 (frob (+ 1 d) i (+ j 1)))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3707, "cpu_time_ms": 217, "memory_kb": 100448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s186695404", "group_id": "codeNet:p03053", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n;; -*- coding:utf-8 -*-\n\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(declaim (inline enqueue-front))\n(defun enqueue-front (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (push obj list))\n    queue))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (terminate-char #\\Space))\n  (declare (simple-base-string buffer-string))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (schar buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (schar buffer-string idx) terminate-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         (line (make-string w :element-type 'base-char))\n         ;; (dist i . j)\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (read-line-into line)\n      (dotimes (j w)\n        (when (char= #\\# (aref line j))\n          (setf (aref plan i j) 0)\n          (enqueue (list* 0 i j) q))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (and (<= 0 next-i (- h 1))\n                          (<= 0 next-j (- w 1))\n                          (= #xffff (aref plan next-i next-j)))\n                 (enqueue (list* next-d next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (loop until (queue-empty-p q)\n            for (d i . j) of-type (uint32 uint32 . uint32) = (dequeue q)\n            do (frob (+ 1 d) (- i 1) j)\n               (frob (+ 1 d) (+ i 1) j)\n               (frob (+ 1 d) i (- j 1))\n               (frob (+ 1 d) i (+ j 1))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1557027241, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s186695404.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s186695404", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n;; -*- coding:utf-8 -*-\n\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(declaim (inline enqueue-front))\n(defun enqueue-front (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (push obj list))\n    queue))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (terminate-char #\\Space))\n  (declare (simple-base-string buffer-string))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (schar buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (schar buffer-string idx) terminate-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         (line (make-string w :element-type 'base-char))\n         ;; (dist i . j)\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (read-line-into line)\n      (dotimes (j w)\n        (when (char= #\\# (aref line j))\n          (setf (aref plan i j) 0)\n          (enqueue (list* 0 i j) q))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (and (<= 0 next-i (- h 1))\n                          (<= 0 next-j (- w 1))\n                          (= #xffff (aref plan next-i next-j)))\n                 (enqueue (list* next-d next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (loop until (queue-empty-p q)\n            for (d i . j) of-type (uint32 uint32 . uint32) = (dequeue q)\n            do (frob (+ 1 d) (- i 1) j)\n               (frob (+ 1 d) (+ i 1) j)\n               (frob (+ 1 d) i (- j 1))\n               (frob (+ 1 d) i (+ j 1))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3941, "cpu_time_ms": 379, "memory_kb": 111976}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s803699702", "group_id": "codeNet:p03053", "input_text": "(defparameter *h* (read))\n(defparameter *w* (read))\n\n(defun black-white-positions (h w)\n  (let ((black-positions '())\n        (white-positions '()))\n    (dotimes (i h)\n      (let ((row (remove #\\ (coerce (read-line) 'list))))\n        (dotimes (j w)\n          (let ((a_ij (nth j row)))\n            (if (char= #\\# a_ij)\n                (push (cons i j) black-positions)\n                (push (cons i j) white-positions))))))\n    (values black-positions\n            white-positions)))\n\n(multiple-value-bind (b-poss w-poss)\n  (black-white-positions *h* *w*)\n  (defparameter *black-positions* b-poss)\n  (defparameter *white-positions* w-poss))\n\n(defun f (b-poss w-poss)\n  (reduce #'max\n          (mapcar (lambda (w-pos)\n                    (reduce #'min\n                            (mapcar (lambda (b-pos) (+ (abs (- (car b-pos) (car w-pos)))\n                                                       (abs (- (cdr b-pos) (cdr w-pos)))))\n                                    b-poss)))\n                  w-poss)))\n\n(princ (f *black-positions* *white-positions*))\n", "language": "Lisp", "metadata": {"date": 1557021042, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s803699702.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s803699702", "user_id": "u956039157"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defparameter *h* (read))\n(defparameter *w* (read))\n\n(defun black-white-positions (h w)\n  (let ((black-positions '())\n        (white-positions '()))\n    (dotimes (i h)\n      (let ((row (remove #\\ (coerce (read-line) 'list))))\n        (dotimes (j w)\n          (let ((a_ij (nth j row)))\n            (if (char= #\\# a_ij)\n                (push (cons i j) black-positions)\n                (push (cons i j) white-positions))))))\n    (values black-positions\n            white-positions)))\n\n(multiple-value-bind (b-poss w-poss)\n  (black-white-positions *h* *w*)\n  (defparameter *black-positions* b-poss)\n  (defparameter *white-positions* w-poss))\n\n(defun f (b-poss w-poss)\n  (reduce #'max\n          (mapcar (lambda (w-pos)\n                    (reduce #'min\n                            (mapcar (lambda (b-pos) (+ (abs (- (car b-pos) (car w-pos)))\n                                                       (abs (- (cdr b-pos) (cdr w-pos)))))\n                                    b-poss)))\n                  w-poss)))\n\n(princ (f *black-positions* *white-positions*))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1052, "cpu_time_ms": 1057, "memory_kb": 123232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s984055110", "group_id": "codeNet:p03053", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n;; -*- coding:utf-8 -*-\n\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(declaim (inline enqueue-front))\n(defun enqueue-front (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (push obj list))\n    queue))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (terminate-char #\\Space))\n  (declare (simple-base-string buffer-string))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (schar buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (schar buffer-string idx) terminate-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         (line (make-string w :element-type 'base-char))\n         ;; (dist i . j)\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (read-line-into line)\n      (dotimes (j w)\n        (when (char= #\\# (aref line j))\n          (setf (aref plan i j) 0)\n          (enqueue (list* 0 i j) q))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (and (<= 0 next-i (- h 1))\n                          (<= 0 next-j (- w 1))\n                          (= #xffff (aref plan next-i next-j)))\n                 (enqueue (list* next-d next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (loop until (queue-empty-p q)\n            for (d i . j) = (dequeue q)\n            do (frob (+ 1 d) (- i 1) j)\n               (frob (+ 1 d) (+ i 1) j)\n               (frob (+ 1 d) i (- j 1))\n               (frob (+ 1 d) i (+ j 1))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n\n", "language": "Lisp", "metadata": {"date": 1557018538, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Lisp/s984055110.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s984055110", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n;; -*- coding:utf-8 -*-\n\n\n(defstruct (queue (:constructor make-queue\n                    (&optional list &aux (tail (last list)))))\n  (list nil :type list)\n  (tail nil :type (or null (cons t null))))\n\n(declaim (inline enqueue))\n(defun enqueue (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (setf (cdr tail) (list obj)\n              tail (cdr tail))))\n  queue)\n\n(declaim (inline dequeue))\n(defun dequeue (queue)\n  (pop (queue-list queue)))\n\n(declaim (inline queue-empty-p))\n(defun queue-empty-p (queue)\n  (null (queue-list queue)))\n\n(declaim (inline enqueue-front))\n(defun enqueue-front (obj queue)\n  (symbol-macrolet ((list (queue-list queue))\n                    (tail (queue-tail queue)))\n    (if (null list)\n        (setf tail (list obj)\n              list tail)\n        (push obj list))\n    queue))\n\n(declaim (inline read-line-into))\n(defun read-line-into (buffer-string &key (in *standard-input*) (terminate-char #\\Space))\n  (declare (simple-base-string buffer-string))\n  (loop for c of-type base-char =\n           #-swank (code-char (read-byte in nil #.(char-code #\\Newline)))\n           #+swank (read-char in nil #\\Newline)\n        for idx from 0\n        until (char= c #\\Newline)\n        do (setf (schar buffer-string idx) c)\n        finally (when (< idx (length buffer-string))\n                  (setf (schar buffer-string idx) terminate-char))\n                (return (values buffer-string idx))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((h (read))\n         (w (read))\n         (plan (make-array (list h w) :element-type 'uint16 :initial-element #xffff))\n         (line (make-string w :element-type 'base-char))\n         ;; (dist i . j)\n         (q (make-queue)))\n    (declare (uint32 h w))\n    (dotimes (i h)\n      (read-line-into line)\n      (dotimes (j w)\n        (when (char= #\\# (aref line j))\n          (setf (aref plan i j) 0)\n          (enqueue (list* 0 i j) q))))\n    (labels ((frob (next-d next-i next-j)\n               (declare (fixnum next-d next-i next-j))\n               (when (and (<= 0 next-i (- h 1))\n                          (<= 0 next-j (- w 1))\n                          (= #xffff (aref plan next-i next-j)))\n                 (enqueue (list* next-d next-i next-j) q)\n                 (setf (aref plan next-i next-j) next-d))))\n      (loop until (queue-empty-p q)\n            for (d i . j) = (dequeue q)\n            do (frob (+ 1 d) (- i 1) j)\n               (frob (+ 1 d) (+ i 1) j)\n               (frob (+ 1 d) i (- j 1))\n               (frob (+ 1 d) i (+ j 1))))\n    (println (reduce #'max (array-storage-vector plan)))))\n\n#-swank(main)\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3891, "cpu_time_ms": 414, "memory_kb": 109668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s203883126", "group_id": "codeNet:p03061", "input_text": "(defun main ()\n  (let* ((n (read))\n         (a (make-array 0 :element-type 'integer\n                          :adjustable t\n                          :fill-pointer 0))\n         (g (make-array (+ n 2) :element-type 'integer\n                                :initial-element 0\n                                :adjustable t))\n         (gr (make-array (+ n 2) :element-type 'integer\n                                 :initial-element 0\n                                 :adjustable t))\n         (ans 0))\n    (dotimes (i n)\n      (vector-push-extend (read) a))\n    (setf (aref g 0) (aref a 0))\n    (setf (aref gr (1+ n)) (aref a (1- n)))\n    (loop for i from 1 upto n\n          do (setf (aref g i) (gcd (aref g (1- i)) (aref a (1- i))))\n             (setf (aref gr (1+ (- n i))) (gcd (aref gr (- n i -2)) (aref a (- n i)))))\n;;    (format t \"~A~%~A~%~A~%\" a g gr)\n    (loop for i from 2 below n\n          do (setf ans (max ans (gcd (aref g (1- i)) (aref gr (1+ i))))))\n    (format t \"~A~%\" (max ans (aref g (1- n)) (aref gr 2)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1590547875, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lisp/s203883126.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s203883126", "user_id": "u994767958"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (a (make-array 0 :element-type 'integer\n                          :adjustable t\n                          :fill-pointer 0))\n         (g (make-array (+ n 2) :element-type 'integer\n                                :initial-element 0\n                                :adjustable t))\n         (gr (make-array (+ n 2) :element-type 'integer\n                                 :initial-element 0\n                                 :adjustable t))\n         (ans 0))\n    (dotimes (i n)\n      (vector-push-extend (read) a))\n    (setf (aref g 0) (aref a 0))\n    (setf (aref gr (1+ n)) (aref a (1- n)))\n    (loop for i from 1 upto n\n          do (setf (aref g i) (gcd (aref g (1- i)) (aref a (1- i))))\n             (setf (aref gr (1+ (- n i))) (gcd (aref gr (- n i -2)) (aref a (- n i)))))\n;;    (format t \"~A~%~A~%~A~%\" a g gr)\n    (loop for i from 2 below n\n          do (setf ans (max ans (gcd (aref g (1- i)) (aref gr (1+ i))))))\n    (format t \"~A~%\" (max ans (aref g (1- n)) (aref gr 2)))))\n\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1031, "cpu_time_ms": 341, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s456451226", "group_id": "codeNet:p03061", "input_text": "(defun main ()\n  (let* ((n (read))\n         (a (make-array 0 :element-type 'integer\n                          :adjustable t\n                          :fill-pointer 0))\n         (g (make-array (+ n 2) :element-type 'integer\n                                :initial-element 0\n                                :adjustable t))\n         (gr (make-array (+ n 2) :element-type 'integer\n                                 :initial-element 0\n                                 :adjustable t))\n         (ans 0))\n    (dotimes (i n)\n      (vector-push-extend (read) a))\n    (setf (aref g 0) (aref a 0))\n    (setf (aref gr (1+ n)) (aref a (1- n)))\n    (loop for i from 1 upto n\n          do (setf (aref g i) (gcd (aref g (1- i)) (aref a (1- i))))\n             (setf (aref gr (1+ (- n i))) (gcd (aref gr (1+ i)) (aref a (- n i)))))\n;;    (format t \"~A~%~A~%~A~%\" a g gr)\n    (loop for i from 2 below n\n          do (setf ans (max ans (gcd (aref g (1- i)) (aref gr (1+ i))))))\n    (format t \"~A~%\" (max ans (aref g (1- n)) (aref gr 2)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1590534816, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lisp/s456451226.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s456451226", "user_id": "u994767958"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (a (make-array 0 :element-type 'integer\n                          :adjustable t\n                          :fill-pointer 0))\n         (g (make-array (+ n 2) :element-type 'integer\n                                :initial-element 0\n                                :adjustable t))\n         (gr (make-array (+ n 2) :element-type 'integer\n                                 :initial-element 0\n                                 :adjustable t))\n         (ans 0))\n    (dotimes (i n)\n      (vector-push-extend (read) a))\n    (setf (aref g 0) (aref a 0))\n    (setf (aref gr (1+ n)) (aref a (1- n)))\n    (loop for i from 1 upto n\n          do (setf (aref g i) (gcd (aref g (1- i)) (aref a (1- i))))\n             (setf (aref gr (1+ (- n i))) (gcd (aref gr (1+ i)) (aref a (- n i)))))\n;;    (format t \"~A~%~A~%~A~%\" a g gr)\n    (loop for i from 2 below n\n          do (setf ans (max ans (gcd (aref g (1- i)) (aref gr (1+ i))))))\n    (format t \"~A~%\" (max ans (aref g (1- n)) (aref gr 2)))))\n\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1027, "cpu_time_ms": 340, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s550257966", "group_id": "codeNet:p03061", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  ;; (return-from read-fixnum 0)\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the fixnum (* result 10))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (ftype (function * (values (array (integer 0 #.most-positive-fixnum) (*))))\n                enum-divisors))\n(defun enum-divisors (x)\n  \"Enumerates divisors of X in ascending order\"\n  (declare #.OPT (fixnum x))\n  (setf x (abs x))\n  (let* ((sqrt (isqrt x))\n         (res (make-array (round (expt x 0.33d0))\n                          :element-type '(integer 0 #.most-positive-fixnum)\n                          :fill-pointer 0)))\n    (loop for i from 1 to sqrt\n          do (multiple-value-bind (quot rem) (floor x i)\n               (when (zerop rem)\n                 (vector-push-extend i res)\n                 (unless (= i quot)\n                   (vector-push-extend quot res)))))\n    res))\n\n(declaim (inline unique-merge))\n(defun unique-merge (element-type vec1 vec2 predicate)\n  (declare (function predicate))\n  (let ((res (make-array 0\n                         :element-type element-type\n                         :fill-pointer 0)))\n    (let ((i1 1)\n          (i2 0)\n          (pos -1))\n      (declare ((integer -1 #.most-positive-fixnum) i1 i2 pos))\n      (loop (if (= i1 (length vec1))\n                (loop (when (= i2 (length vec2))\n                        (return-from unique-merge res))\n                      (when (or (= -1 pos)\n                                (funcall predicate (aref res pos) (aref vec2 i2)))\n                        (vector-push-extend (aref vec2 i2) res)\n                        (incf pos))\n                      (incf i2))\n                (when (= i2 (length vec2))\n                  (loop (when (= i1 (length vec1))\n                          (return-from unique-merge res))\n                        (when (or (= -1 pos)\n                                  (funcall predicate (aref res pos) (aref vec1 i1)))\n                          (vector-push-extend (aref vec1 i1) res)\n                          (incf pos))\n                        (incf i1))))\n            (if (funcall predicate (aref vec1 i1) (aref vec2 i2))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec1 i1)))\n                    (vector-push-extend (aref vec1 i1) res)\n                    (incf pos))\n                  (incf i1))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec2 i2)))\n                    (vector-push-extend (aref vec2 i2) res)\n                    (incf pos))\n                  (incf i2)))))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (as (make-array n :element-type 'uint32)))\n    (declare (uint32 n))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)))\n    (let* ((div1 (sort (enum-divisors (aref as 0)) #'>))\n           (div2 (sort (enum-divisors (aref as 1)) #'>))\n           (div (unique-merge 'uint32 div1 div2\n                              (lambda (x y)\n                                (declare (uint32 x y))\n                                (> x y)))))\n      (declare ((array uint32 (*)) div))\n      (loop for d across div\n            when (>= (loop for a of-type uint32 across as count (zerop (mod a d)))\n                     (- n 1))\n            do (println d)\n               (return-from main)\n            finally (error \"Huh?\")))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1556456087, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lisp/s550257966.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s550257966", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  ;; (return-from read-fixnum 0)\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the fixnum (* result 10))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (ftype (function * (values (array (integer 0 #.most-positive-fixnum) (*))))\n                enum-divisors))\n(defun enum-divisors (x)\n  \"Enumerates divisors of X in ascending order\"\n  (declare #.OPT (fixnum x))\n  (setf x (abs x))\n  (let* ((sqrt (isqrt x))\n         (res (make-array (round (expt x 0.33d0))\n                          :element-type '(integer 0 #.most-positive-fixnum)\n                          :fill-pointer 0)))\n    (loop for i from 1 to sqrt\n          do (multiple-value-bind (quot rem) (floor x i)\n               (when (zerop rem)\n                 (vector-push-extend i res)\n                 (unless (= i quot)\n                   (vector-push-extend quot res)))))\n    res))\n\n(declaim (inline unique-merge))\n(defun unique-merge (element-type vec1 vec2 predicate)\n  (declare (function predicate))\n  (let ((res (make-array 0\n                         :element-type element-type\n                         :fill-pointer 0)))\n    (let ((i1 1)\n          (i2 0)\n          (pos -1))\n      (declare ((integer -1 #.most-positive-fixnum) i1 i2 pos))\n      (loop (if (= i1 (length vec1))\n                (loop (when (= i2 (length vec2))\n                        (return-from unique-merge res))\n                      (when (or (= -1 pos)\n                                (funcall predicate (aref res pos) (aref vec2 i2)))\n                        (vector-push-extend (aref vec2 i2) res)\n                        (incf pos))\n                      (incf i2))\n                (when (= i2 (length vec2))\n                  (loop (when (= i1 (length vec1))\n                          (return-from unique-merge res))\n                        (when (or (= -1 pos)\n                                  (funcall predicate (aref res pos) (aref vec1 i1)))\n                          (vector-push-extend (aref vec1 i1) res)\n                          (incf pos))\n                        (incf i1))))\n            (if (funcall predicate (aref vec1 i1) (aref vec2 i2))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec1 i1)))\n                    (vector-push-extend (aref vec1 i1) res)\n                    (incf pos))\n                  (incf i1))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec2 i2)))\n                    (vector-push-extend (aref vec2 i2) res)\n                    (incf pos))\n                  (incf i2)))))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (as (make-array n :element-type 'uint32)))\n    (declare (uint32 n))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)))\n    (let* ((div1 (sort (enum-divisors (aref as 0)) #'>))\n           (div2 (sort (enum-divisors (aref as 1)) #'>))\n           (div (unique-merge 'uint32 div1 div2\n                              (lambda (x y)\n                                (declare (uint32 x y))\n                                (> x y)))))\n      (declare ((array uint32 (*)) div))\n      (loop for d across div\n            when (>= (loop for a of-type uint32 across as count (zerop (mod a d)))\n                     (- n 1))\n            do (println d)\n               (return-from main)\n            finally (error \"Huh?\")))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5585, "cpu_time_ms": 154, "memory_kb": 14824}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s560305469", "group_id": "codeNet:p03061", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  ;; (return-from read-fixnum 0)\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the fixnum (* result 10))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (ftype (function * (values (array (integer 0 #.most-positive-fixnum) (*))))\n                enum-divisors))\n(defun enum-divisors (x)\n  \"Enumerates divisors of X in ascending order\"\n  (declare #.OPT (fixnum x))\n  (setf x (abs x))\n  (let* ((sqrt (isqrt x))\n         (res (make-array sqrt\n                          :element-type '(integer 0 #.most-positive-fixnum)\n                          :fill-pointer 0)))\n    (loop for i from 1 to sqrt\n          do (multiple-value-bind (quot rem) (floor x i)\n               (when (zerop rem)\n                 (vector-push-extend i res)\n                 (unless (= i quot)\n                   (vector-push-extend quot res)))))\n    res))\n\n(declaim (inline unique-merge))\n(defun unique-merge (element-type vec1 vec2 predicate)\n  (declare (function predicate))\n  (let ((res (make-array 0\n                         :element-type element-type\n                         :fill-pointer 0)))\n    (let ((i1 1)\n          (i2 0)\n          (pos -1))\n      (declare ((integer -1 #.most-positive-fixnum) i1 i2 pos))\n      (loop (if (= i1 (length vec1))\n                (loop (when (= i2 (length vec2))\n                        (return-from unique-merge res))\n                      (when (or (= -1 pos)\n                                (funcall predicate (aref res pos) (aref vec2 i2)))\n                        (vector-push-extend (aref vec2 i2) res)\n                        (incf pos))\n                      (incf i2))\n                (when (= i2 (length vec2))\n                  (loop (when (= i1 (length vec1))\n                          (return-from unique-merge res))\n                        (when (or (= -1 pos)\n                                  (funcall predicate (aref res pos) (aref vec1 i1)))\n                          (vector-push-extend (aref vec1 i1) res)\n                          (incf pos))\n                        (incf i1))))\n            (if (funcall predicate (aref vec1 i1) (aref vec2 i2))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec1 i1)))\n                    (vector-push-extend (aref vec1 i1) res)\n                    (incf pos))\n                  (incf i1))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec2 i2)))\n                    (vector-push-extend (aref vec2 i2) res)\n                    (incf pos))\n                  (incf i2)))))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (as (make-array n :element-type 'uint32)))\n    (declare (uint32 n))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)))\n    (let* ((div1 (sort (enum-divisors (aref as 0)) #'>))\n           (div2 (sort (enum-divisors (aref as 1)) #'>))\n           (div (unique-merge 'uint32 div1 div2\n                              (lambda (x y)\n                                (declare (uint32 x y))\n                                (> x y)))))\n      (declare ((array uint32 (*)) div))\n      (loop for d across div\n            when (>= (loop for a of-type uint32 across as count (zerop (mod a d)))\n                     (- n 1))\n            do (println d)\n               (return-from main)\n            finally (error \"Huh?\")))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1556455790, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lisp/s560305469.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s560305469", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  ;; (return-from read-fixnum 0)\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the fixnum (* result 10))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (ftype (function * (values (array (integer 0 #.most-positive-fixnum) (*))))\n                enum-divisors))\n(defun enum-divisors (x)\n  \"Enumerates divisors of X in ascending order\"\n  (declare #.OPT (fixnum x))\n  (setf x (abs x))\n  (let* ((sqrt (isqrt x))\n         (res (make-array sqrt\n                          :element-type '(integer 0 #.most-positive-fixnum)\n                          :fill-pointer 0)))\n    (loop for i from 1 to sqrt\n          do (multiple-value-bind (quot rem) (floor x i)\n               (when (zerop rem)\n                 (vector-push-extend i res)\n                 (unless (= i quot)\n                   (vector-push-extend quot res)))))\n    res))\n\n(declaim (inline unique-merge))\n(defun unique-merge (element-type vec1 vec2 predicate)\n  (declare (function predicate))\n  (let ((res (make-array 0\n                         :element-type element-type\n                         :fill-pointer 0)))\n    (let ((i1 1)\n          (i2 0)\n          (pos -1))\n      (declare ((integer -1 #.most-positive-fixnum) i1 i2 pos))\n      (loop (if (= i1 (length vec1))\n                (loop (when (= i2 (length vec2))\n                        (return-from unique-merge res))\n                      (when (or (= -1 pos)\n                                (funcall predicate (aref res pos) (aref vec2 i2)))\n                        (vector-push-extend (aref vec2 i2) res)\n                        (incf pos))\n                      (incf i2))\n                (when (= i2 (length vec2))\n                  (loop (when (= i1 (length vec1))\n                          (return-from unique-merge res))\n                        (when (or (= -1 pos)\n                                  (funcall predicate (aref res pos) (aref vec1 i1)))\n                          (vector-push-extend (aref vec1 i1) res)\n                          (incf pos))\n                        (incf i1))))\n            (if (funcall predicate (aref vec1 i1) (aref vec2 i2))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec1 i1)))\n                    (vector-push-extend (aref vec1 i1) res)\n                    (incf pos))\n                  (incf i1))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec2 i2)))\n                    (vector-push-extend (aref vec2 i2) res)\n                    (incf pos))\n                  (incf i2)))))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (as (make-array n :element-type 'uint32)))\n    (declare (uint32 n))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)))\n    (let* ((div1 (sort (enum-divisors (aref as 0)) #'>))\n           (div2 (sort (enum-divisors (aref as 1)) #'>))\n           (div (unique-merge 'uint32 div1 div2\n                              (lambda (x y)\n                                (declare (uint32 x y))\n                                (> x y)))))\n      (declare ((array uint32 (*)) div))\n      (loop for d across div\n            when (>= (loop for a of-type uint32 across as count (zerop (mod a d)))\n                     (- n 1))\n            do (println d)\n               (return-from main)\n            finally (error \"Huh?\")))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5566, "cpu_time_ms": 152, "memory_kb": 14824}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s153403584", "group_id": "codeNet:p03061", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  ;; (return-from read-fixnum 0)\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the fixnum (* result 10))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (ftype (function * (values (array (integer 0 #.most-positive-fixnum) (*))))\n                enum-divisors))\n(defun enum-divisors (x)\n  \"Enumerates divisors of X in ascending order\"\n  (declare #.OPT (fixnum x))\n  (setf x (abs x))\n  (let* ((sqrt (isqrt x))\n         (res (make-array sqrt\n                          :element-type '(integer 0 #.most-positive-fixnum)\n                          :fill-pointer 0)))\n    (loop for i from 1 to sqrt\n          do (multiple-value-bind (quot rem) (floor x i)\n               (when (zerop rem)\n                 (vector-push-extend i res)\n                 (unless (= i quot)\n                   (vector-push-extend quot res)))))\n    res))\n\n(declaim (inline unique-merge))\n(defun unique-merge (element-type vec1 vec2 predicate)\n  (declare (function predicate))\n  (let ((res (make-array 0\n                         :element-type element-type\n                         :fill-pointer 0)))\n    (let ((i1 1)\n          (i2 0)\n          (pos -1))\n      (declare ((integer -1 #.most-positive-fixnum) i1 i2 pos))\n      (loop (if (= i1 (length vec1))\n                (loop (when (= i2 (length vec2))\n                        (return-from unique-merge res))\n                      (when (or (= -1 pos)\n                                (funcall predicate (aref res pos) (aref vec2 i2)))\n                        (vector-push-extend (aref vec2 i2) res)\n                        (incf pos))\n                      (incf i2))\n                (when (= i2 (length vec2))\n                  (loop (when (= i1 (length vec1))\n                          (return-from unique-merge res))\n                        (when (or (= -1 pos)\n                                  (funcall predicate (aref res pos) (aref vec1 i1)))\n                          (vector-push-extend (aref vec1 i1) res)\n                          (incf pos))\n                        (incf i1))))\n            (if (funcall predicate (aref vec1 i1) (aref vec2 i2))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec1 i1)))\n                    (vector-push-extend (aref vec1 i1) res)\n                    (incf pos))\n                  (incf i1))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec2 i2)))\n                    (vector-push-extend (aref vec2 i2) res)\n                    (incf pos))\n                  (incf i2)))))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (as (make-array (- n 2) :element-type 'uint32))\n         (a1 (read-fixnum))\n         (a2 (read-fixnum)))\n    (declare (uint32 n))\n    (dotimes (i (- n 2))\n      (setf (aref as i) (read-fixnum)))\n    (let* ((div1 (sort (enum-divisors a1) #'>))\n           (div2 (sort (enum-divisors a2) #'>))\n           (div (unique-merge 'uint32 div1 div2\n                              (lambda (x y)\n                                (declare (uint32 x y))\n                                (> x y)))))\n      (declare ((array uint32 (*)) div))\n      (loop for d across div\n            when (every (lambda (a) (zerop (mod (the uint32 a) d))) as)\n            do (println d)\n               (return-from main)\n            finally (error \"Huh?\")))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1556448717, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lisp/s153403584.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s153403584", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  ;; (return-from read-fixnum 0)\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the fixnum (* result 10))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(declaim (ftype (function * (values (array (integer 0 #.most-positive-fixnum) (*))))\n                enum-divisors))\n(defun enum-divisors (x)\n  \"Enumerates divisors of X in ascending order\"\n  (declare #.OPT (fixnum x))\n  (setf x (abs x))\n  (let* ((sqrt (isqrt x))\n         (res (make-array sqrt\n                          :element-type '(integer 0 #.most-positive-fixnum)\n                          :fill-pointer 0)))\n    (loop for i from 1 to sqrt\n          do (multiple-value-bind (quot rem) (floor x i)\n               (when (zerop rem)\n                 (vector-push-extend i res)\n                 (unless (= i quot)\n                   (vector-push-extend quot res)))))\n    res))\n\n(declaim (inline unique-merge))\n(defun unique-merge (element-type vec1 vec2 predicate)\n  (declare (function predicate))\n  (let ((res (make-array 0\n                         :element-type element-type\n                         :fill-pointer 0)))\n    (let ((i1 1)\n          (i2 0)\n          (pos -1))\n      (declare ((integer -1 #.most-positive-fixnum) i1 i2 pos))\n      (loop (if (= i1 (length vec1))\n                (loop (when (= i2 (length vec2))\n                        (return-from unique-merge res))\n                      (when (or (= -1 pos)\n                                (funcall predicate (aref res pos) (aref vec2 i2)))\n                        (vector-push-extend (aref vec2 i2) res)\n                        (incf pos))\n                      (incf i2))\n                (when (= i2 (length vec2))\n                  (loop (when (= i1 (length vec1))\n                          (return-from unique-merge res))\n                        (when (or (= -1 pos)\n                                  (funcall predicate (aref res pos) (aref vec1 i1)))\n                          (vector-push-extend (aref vec1 i1) res)\n                          (incf pos))\n                        (incf i1))))\n            (if (funcall predicate (aref vec1 i1) (aref vec2 i2))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec1 i1)))\n                    (vector-push-extend (aref vec1 i1) res)\n                    (incf pos))\n                  (incf i1))\n                (progn\n                  (when (or (= -1 pos)\n                            (funcall predicate (aref res pos) (aref vec2 i2)))\n                    (vector-push-extend (aref vec2 i2) res)\n                    (incf pos))\n                  (incf i2)))))))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (as (make-array (- n 2) :element-type 'uint32))\n         (a1 (read-fixnum))\n         (a2 (read-fixnum)))\n    (declare (uint32 n))\n    (dotimes (i (- n 2))\n      (setf (aref as i) (read-fixnum)))\n    (let* ((div1 (sort (enum-divisors a1) #'>))\n           (div2 (sort (enum-divisors a2) #'>))\n           (div (unique-merge 'uint32 div1 div2\n                              (lambda (x y)\n                                (declare (uint32 x y))\n                                (> x y)))))\n      (declare ((array uint32 (*)) div))\n      (loop for d across div\n            when (every (lambda (a) (zerop (mod (the uint32 a) d))) as)\n            do (println d)\n               (return-from main)\n            finally (error \"Huh?\")))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5813, "cpu_time_ms": 362, "memory_kb": 32872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s909393239", "group_id": "codeNet:p03061", "input_text": "(defun input (n)\n  (let ((a (make-array (1+ n))))\n    (loop for i from 1 to n do (setf (aref a i) (read)))\n    a)) \n(let* ((n (read))\n       (a (input n))\n       (r (make-array (+ n 2)))\n       (l (make-array (+ n 2))))\n  (setf (aref l n) (aref a n))\n  (loop for i from 1 below n\n    do (setf (aref r i) (gcd (aref r (1- i)) (aref a i))))\n  (loop for i from n downto 1\n    do (setf (aref l (1- i)) (gcd (aref l i) (aref a (1- i)))))\n  (format t \"~A~%\"\n          (loop for i from 1 to n\n                maximize (gcd (aref r (1- i)) (aref l (1+ i))))))", "language": "Lisp", "metadata": {"date": 1556421741, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lisp/s909393239.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s909393239", "user_id": "u672956630"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun input (n)\n  (let ((a (make-array (1+ n))))\n    (loop for i from 1 to n do (setf (aref a i) (read)))\n    a)) \n(let* ((n (read))\n       (a (input n))\n       (r (make-array (+ n 2)))\n       (l (make-array (+ n 2))))\n  (setf (aref l n) (aref a n))\n  (loop for i from 1 below n\n    do (setf (aref r i) (gcd (aref r (1- i)) (aref a i))))\n  (loop for i from n downto 1\n    do (setf (aref l (1- i)) (gcd (aref l i) (aref a (1- i)))))\n  (format t \"~A~%\"\n          (loop for i from 1 to n\n                maximize (gcd (aref r (1- i)) (aref l (1+ i))))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 551, "cpu_time_ms": 328, "memory_kb": 59748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s928601655", "group_id": "codeNet:p03061", "input_text": "(defparameter *a* #())\n(defparameter *ans* 0)\n(defparameter *memo* '())\n\n(defun gcd2(a b)\n  (if (= b 0) a (gcd2 b (mod a b))))\n\n(defun solve ()\n  (loop :for i :from 0 :to (1- (length *a*))\n        :if (not (find (aref *a* i) *memo*))\n        :do\n           (let ((value (aref *a* i)))\n             (append *memo* (list value))\n             (setf (aref *a* i) 0)\n             (let ((gcd (reduce #'gcd2 *a*)))\n               (setf *ans* (max *ans* gcd)))\n             (setf (aref *a* i) value)))\n  *ans*)\n\n(defun main ()\n  (let* ((n (read))\n         (a (loop :repeat n :collect (read))))\n    (setf *a* (make-array (length a) :initial-contents a))\n    (format t \"~A~%\" (solve))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1556417067, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lisp/s928601655.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s928601655", "user_id": "u736675286"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defparameter *a* #())\n(defparameter *ans* 0)\n(defparameter *memo* '())\n\n(defun gcd2(a b)\n  (if (= b 0) a (gcd2 b (mod a b))))\n\n(defun solve ()\n  (loop :for i :from 0 :to (1- (length *a*))\n        :if (not (find (aref *a* i) *memo*))\n        :do\n           (let ((value (aref *a* i)))\n             (append *memo* (list value))\n             (setf (aref *a* i) 0)\n             (let ((gcd (reduce #'gcd2 *a*)))\n               (setf *ans* (max *ans* gcd)))\n             (setf (aref *a* i) value)))\n  *ans*)\n\n(defun main ()\n  (let* ((n (read))\n         (a (loop :repeat n :collect (read))))\n    (setf *a* (make-array (length a) :initial-contents a))\n    (format t \"~A~%\" (solve))))\n\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 685, "cpu_time_ms": 2105, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s666582707", "group_id": "codeNet:p03061", "input_text": "(defparameter *a* #())\n(defparameter *ans* 0)\n(defparameter *memo* '())\n\n(defun solve ()\n  (loop :for i :from 0 :to (1- (length *a*))\n        :if (not (find (aref *a* i) *memo*))\n        :do\n           (let ((value (aref *a* i)))\n             (append *memo* (list value))\n             (setf (aref *a* i) 0)\n             (let ((gcd (reduce #'gcd *a*)))\n               (setf *ans* (max *ans* gcd)))\n             (setf (aref *a* i) value)))\n  *ans*)\n\n(defun main ()\n  (let* ((n (read))\n         (a (loop :repeat n :collect (read))))\n    (setf *a* (make-array (length a) :initial-contents a))\n    (format t \"~A~%\" (solve))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1556416364, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lisp/s666582707.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s666582707", "user_id": "u736675286"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defparameter *a* #())\n(defparameter *ans* 0)\n(defparameter *memo* '())\n\n(defun solve ()\n  (loop :for i :from 0 :to (1- (length *a*))\n        :if (not (find (aref *a* i) *memo*))\n        :do\n           (let ((value (aref *a* i)))\n             (append *memo* (list value))\n             (setf (aref *a* i) 0)\n             (let ((gcd (reduce #'gcd *a*)))\n               (setf *ans* (max *ans* gcd)))\n             (setf (aref *a* i) value)))\n  *ans*)\n\n(defun main ()\n  (let* ((n (read))\n         (a (loop :repeat n :collect (read))))\n    (setf *a* (make-array (length a) :initial-contents a))\n    (format t \"~A~%\" (solve))))\n\n(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 629, "cpu_time_ms": 2105, "memory_kb": 59748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s422475606", "group_id": "codeNet:p03061", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  ;; (return-from read-fixnum 0)\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the fixnum (* result 10))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((n (read))\n         (as (make-array n :element-type 'uint32))\n         (cumul (make-array (+ 1 n) :element-type 'uint32 :initial-element 0))\n         (cumul2 (make-array (+ 1 n) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)))\n    (dotimes (i n)\n      (setf (aref cumul (+ i 1))\n            (gcd (aref cumul i) (aref as i))))\n    (loop for i from n above 0\n          do (setf (aref cumul2 (- i 1))\n                   (gcd (aref cumul2 i) (aref as (- i 1)))))\n    (println\n     (loop for i from 0 below n\n           maximize (gcd (aref cumul i) (aref cumul2 (+ i 1)))))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1556415452, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lisp/s422475606.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s422475606", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  ;; (return-from read-fixnum 0)\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the fixnum (* result 10))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((n (read))\n         (as (make-array n :element-type 'uint32))\n         (cumul (make-array (+ 1 n) :element-type 'uint32 :initial-element 0))\n         (cumul2 (make-array (+ 1 n) :element-type 'uint32 :initial-element 0)))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)))\n    (dotimes (i n)\n      (setf (aref cumul (+ i 1))\n            (gcd (aref cumul i) (aref as i))))\n    (loop for i from n above 0\n          do (setf (aref cumul2 (- i 1))\n                   (gcd (aref cumul2 i) (aref as (- i 1)))))\n    (println\n     (loop for i from 0 below n\n           maximize (gcd (aref cumul i) (aref cumul2 (+ i 1)))))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2958, "cpu_time_ms": 240, "memory_kb": 25188}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s385693863", "group_id": "codeNet:p03061", "input_text": "(let* ((n (read))\n       (arr (make-array n :element-type 'fixnum :initial-element 0)))\n  (loop :for a :from 0 :upto (1- n) :do(setf (aref arr a) (read)))\n  (defun r-at (q)\n    (remove nil arr :start q :count 1 :test (constantly T)))\n  (princ (loop :for k :from 0 :upto (1- n) :maximize (reduce #'gcd (r-at k)))))", "language": "Lisp", "metadata": {"date": 1556415252, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lisp/s385693863.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s385693863", "user_id": "u610490393"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let* ((n (read))\n       (arr (make-array n :element-type 'fixnum :initial-element 0)))\n  (loop :for a :from 0 :upto (1- n) :do(setf (aref arr a) (read)))\n  (defun r-at (q)\n    (remove nil arr :start q :count 1 :test (constantly T)))\n  (princ (loop :for k :from 0 :upto (1- n) :maximize (reduce #'gcd (r-at k)))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 313, "cpu_time_ms": 2105, "memory_kb": 69988}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s033461032", "group_id": "codeNet:p03061", "input_text": "(defun input (n)\n  (let ((a (make-array n)))\n    (loop for i below n do (setf (aref a i) (read)))\n    a)) \n(let* ((n (read))\n       (a (input n)))\n  (format t \"~A~%\"\n          (loop for i below n\n                maximize (let ((x 0))\n                           (loop for j below n\n                                 when (not (= i j))\n                                 do (setf x (gcd x (aref a j))))\n                           x))))", "language": "Lisp", "metadata": {"date": 1556414418, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Lisp/s033461032.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s033461032", "user_id": "u672956630"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun input (n)\n  (let ((a (make-array n)))\n    (loop for i below n do (setf (aref a i) (read)))\n    a)) \n(let* ((n (read))\n       (a (input n)))\n  (format t \"~A~%\"\n          (loop for i below n\n                maximize (let ((x 0))\n                           (loop for j below n\n                                 when (not (= i j))\n                                 do (setf x (gcd x (aref a j))))\n                           x))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 430, "cpu_time_ms": 2104, "memory_kb": 59748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s994281540", "group_id": "codeNet:p03105", "input_text": "(let ((a (read))\n      (b (read))\n      (c (read)))\n     (princ (min (floor b a) c)))\n", "language": "Lisp", "metadata": {"date": 1590695219, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lisp/s994281540.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s994281540", "user_id": "u425762225"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(let ((a (read))\n      (b (read))\n      (c (read)))\n     (princ (min (floor b a) c)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 121, "memory_kb": 12648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s706100394", "group_id": "codeNet:p03105", "input_text": "(defun favorite-sound(a b c)\n  (min\n   (floor (/ b a))\n   c))\n\n(format t \"~A~%\" (favorite-sound(read) (read) (read)))", "language": "Lisp", "metadata": {"date": 1585421067, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lisp/s706100394.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s706100394", "user_id": "u324761590"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun favorite-sound(a b c)\n  (min\n   (floor (/ b a))\n   c))\n\n(format t \"~A~%\" (favorite-sound(read) (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 117, "cpu_time_ms": 133, "memory_kb": 13028}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s756054128", "group_id": "codeNet:p03105", "input_text": "(defun fs (a b c) (min (floor b a) c))\n(format t \"~A~%\" (fs (read) (read) (read)))", "language": "Lisp", "metadata": {"date": 1560547006, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lisp/s756054128.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s756054128", "user_id": "u606976120"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun fs (a b c) (min (floor b a) c))\n(format t \"~A~%\" (fs (read) (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 82, "cpu_time_ms": 13, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s426556277", "group_id": "codeNet:p03105", "input_text": "(let ((a (read))\n      (b (read)))\n     (princ(min(floor(/ b a))(read))))", "language": "Lisp", "metadata": {"date": 1551656427, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lisp/s426556277.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s426556277", "user_id": "u994767958"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(let ((a (read))\n      (b (read)))\n     (princ(min(floor(/ b a))(read))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 73, "cpu_time_ms": 13, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s318325802", "group_id": "codeNet:p03105", "input_text": "(setq a(read))(setq b(read))(setq c(read))\n(princ(min(floor b a)c))", "language": "Lisp", "metadata": {"date": 1551646480, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lisp/s318325802.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s318325802", "user_id": "u657913472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(setq a(read))(setq b(read))(setq c(read))\n(princ(min(floor b a)c))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 67, "cpu_time_ms": 75, "memory_kb": 8420}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s186855220", "group_id": "codeNet:p03105", "input_text": "(let* ((a (read))\n       (b (read))\n       (c (read)))\n  (if (< (floor b a) c)\n      (princ (floor b a))\n      (princ c)))", "language": "Lisp", "metadata": {"date": 1551645466, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lisp/s186855220.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s186855220", "user_id": "u610490393"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(let* ((a (read))\n       (b (read))\n       (c (read)))\n  (if (< (floor b a) c)\n      (princ (floor b a))\n      (princ c)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 122, "cpu_time_ms": 115, "memory_kb": 12772}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s180550101", "group_id": "codeNet:p03105", "input_text": "(defun main ()\n  (let* ((a (read))\n         (b (read))\n         (c (read)))\n    (format t \"~A~%\" (min (floor b a) c))))\n", "language": "Lisp", "metadata": {"date": 1551644774, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lisp/s180550101.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s180550101", "user_id": "u736675286"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(defun main ()\n  (let* ((a (read))\n         (b (read))\n         (c (read)))\n    (format t \"~A~%\" (min (floor b a) c))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 112, "memory_kb": 13416}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s832087334", "group_id": "codeNet:p03105", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Hauptteil\n\n(defun main ()\n  (let* ((a (read))\n         (b (read))\n         (c (read)))\n    (println\n     (min c\n          (floor b a)))))\n\n#-swank(main)\n\n", "language": "Lisp", "metadata": {"date": 1551643554, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Lisp/s832087334.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s832087334", "user_id": "u352600849"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Hauptteil\n\n(defun main ()\n  (let* ((a (read))\n         (b (read))\n         (c (read)))\n    (println\n     (min c\n          (floor b a)))))\n\n#-swank(main)\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1061, "cpu_time_ms": 136, "memory_kb": 16228}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s482467922", "group_id": "codeNet:p03160", "input_text": ";;; Utils\n\n(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n(defconstant +mod+ 1000000007)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(in-package :cl-user)\n\n(defmethod fast-sort ((sequence list) &optional (test #'<))\n  (declare (inline sort)\n           (inline sb-impl::stable-sort-list))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n\n(defmethod fast-sort ((sequence array) &optional (test #'<))\n  (declare (inline sort))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n\n(defmacro read-numbers-to-array (size)\n  `(make-array ,size :element-type 'fixnum :adjustable nil :initial-contents (read-numbers-to-list ,size)))\n\n(defmacro read-numbers-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size))))\n       (dotimes (,r ,row-size)\n         (dotimes (,c ,column-size)\n           (setf (aref ,board ,r ,c) (read))))\n       ,board)))\n\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n(defmethod make-cumlative-sum ((sequence array))\n  (declare (type (simple-array fixnum) sequence))\n  (the array\n       (let* ((n (length sequence))\n              (acc (make-array (1+ n) :element-type 'integer :initial-element 0)))\n         (loop for i below n do\n              (setf (aref acc (1+ i)) (+ (aref sequence i)\n                                         (aref acc i)))\n            finally\n              (return acc)))))\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 (fresh-line)\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i)))\n  (fresh-line))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n(defmacro minf (res cand)\n  `(setf ,res (min ,res ,cand)))\n\n;;; Write code here\n\n(defparameter *inf* 1000000001)\n\n(declaim (inline solve))\n(defun solve (n h)\n  (declare (fixnum n)\n           ((array fixnum 1) h))\n  (let ((memo (make-hash-table :test #'eql)))\n    (declare (hash-table memo))\n    (loop for i to (+ n 10) do\n         (setf (gethash i memo) *inf*))\n    (setf (gethash 0 memo) 0)\n    (loop for i below n do\n         (when (< (+ i 1) n)\n           (minf (gethash (1+ i) memo)\n                 (+ (gethash i memo)\n                    (abs (- (aref h i)\n                            (aref h (1+ i)))))))\n         (when (< (+ i 2) n)\n           (minf (gethash (+ i 2) memo)\n                 (+ (gethash i memo)\n                    (abs (- (aref h i)\n                            (aref h (+ i 2))))))))\n    (gethash (1- n) memo)))\n\n\n\n(defun main ()\n  (let* ((n (read))\n         (h (read-numbers-to-array n)))\n    (format t \"~a~%\" (solve n h))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1600712410, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s482467922.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s482467922", "user_id": "u425762225"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";;; Utils\n\n(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n(defconstant +mod+ 1000000007)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(in-package :cl-user)\n\n(defmethod fast-sort ((sequence list) &optional (test #'<))\n  (declare (inline sort)\n           (inline sb-impl::stable-sort-list))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n\n(defmethod fast-sort ((sequence array) &optional (test #'<))\n  (declare (inline sort))\n  (sort sequence (lambda (x y)\n                   (funcall test x y))))\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n\n(defmacro read-numbers-to-array (size)\n  `(make-array ,size :element-type 'fixnum :adjustable nil :initial-contents (read-numbers-to-list ,size)))\n\n(defmacro read-numbers-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size))))\n       (dotimes (,r ,row-size)\n         (dotimes (,c ,column-size)\n           (setf (aref ,board ,r ,c) (read))))\n       ,board)))\n\n\n(defmethod make-cumlative-sum ((sequence list))\n  (labels ((inner (sequence &optional (acc '(0)))\n             (if (null sequence)\n                 (reverse acc)\n                 (inner (rest sequence) (cons (+ (first sequence)\n                                                 (first acc))\n                                              acc)))))\n    (inner sequence)))\n\n\n(defmethod make-cumlative-sum ((sequence array))\n  (declare (type (simple-array fixnum) sequence))\n  (the array\n       (let* ((n (length sequence))\n              (acc (make-array (1+ n) :element-type 'integer :initial-element 0)))\n         (loop for i below n do\n              (setf (aref acc (1+ i)) (+ (aref sequence i)\n                                         (aref acc i)))\n            finally\n              (return acc)))))\n\n\n\n\n(defmethod princ-for-each-line ((sequence list))\n  (labels ((inner (sequence)\n             (if (null sequence)\n                 (fresh-line)\n                 (progn\n                   (fresh-line)\n                   (princ (first sequence))\n                   (inner (rest sequence))))))\n    (inner sequence)))\n\n(defmethod princ-for-each-line ((sequence array))\n  (dotimes (i (length sequence))\n    (fresh-line)\n    (princ (aref sequence i)))\n  (fresh-line))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n(defmacro minf (res cand)\n  `(setf ,res (min ,res ,cand)))\n\n;;; Write code here\n\n(defparameter *inf* 1000000001)\n\n(declaim (inline solve))\n(defun solve (n h)\n  (declare (fixnum n)\n           ((array fixnum 1) h))\n  (let ((memo (make-hash-table :test #'eql)))\n    (declare (hash-table memo))\n    (loop for i to (+ n 10) do\n         (setf (gethash i memo) *inf*))\n    (setf (gethash 0 memo) 0)\n    (loop for i below n do\n         (when (< (+ i 1) n)\n           (minf (gethash (1+ i) memo)\n                 (+ (gethash i memo)\n                    (abs (- (aref h i)\n                            (aref h (1+ i)))))))\n         (when (< (+ i 2) n)\n           (minf (gethash (+ i 2) memo)\n                 (+ (gethash i memo)\n                    (abs (- (aref h i)\n                            (aref h (+ i 2))))))))\n    (gethash (1- n) memo)))\n\n\n\n(defun main ()\n  (let* ((n (read))\n         (h (read-numbers-to-array n)))\n    (format t \"~a~%\" (solve n h))))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4121, "cpu_time_ms": 130, "memory_kb": 79456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s062010875", "group_id": "codeNet:p03160", "input_text": "(defun calc-cost (heights a b)\n  (abs (- (aref heights a)\n          (aref heights b))))\n\n\n(defun min-cost (heights costs n)\n  (min (+ (aref costs (- n 1)) \n          (calc-cost heights n (- n 1)))\n       (+ (aref costs (- n 2)) \n          (calc-cost heights n (- n 2)))))\n\n(defun set-cost (heights costs n)\n  (cond\n    ((zerop n)\n      (setf (aref costs 0) 0))\n    ((= n 1) \n      (setf (aref costs 1) (calc-cost heights 0 1)))\n    (t \n      (setf (aref costs n) (min-cost heights costs n)))))\n\n(defun recursive (heights costs n to)\n  (if (= n (- to 1))\n      (if (= to 2)\n          (calc-cost heights 0 1)\n          (min-cost heights costs n))\n      (progn\n        (set-cost heights costs n)\n        (recursive heights costs (+ n 1) to))))\n \n(defun main ()\n  (let* ((n (read))\n         (heights (make-array n \n                              :initial-contents (loop :repeat n :collect (read))))\n         (costs (make-array n :initial-element -1)))\n    (princ (recursive heights costs 0 n))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1594885927, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s062010875.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s062010875", "user_id": "u606976120"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defun calc-cost (heights a b)\n  (abs (- (aref heights a)\n          (aref heights b))))\n\n\n(defun min-cost (heights costs n)\n  (min (+ (aref costs (- n 1)) \n          (calc-cost heights n (- n 1)))\n       (+ (aref costs (- n 2)) \n          (calc-cost heights n (- n 2)))))\n\n(defun set-cost (heights costs n)\n  (cond\n    ((zerop n)\n      (setf (aref costs 0) 0))\n    ((= n 1) \n      (setf (aref costs 1) (calc-cost heights 0 1)))\n    (t \n      (setf (aref costs n) (min-cost heights costs n)))))\n\n(defun recursive (heights costs n to)\n  (if (= n (- to 1))\n      (if (= to 2)\n          (calc-cost heights 0 1)\n          (min-cost heights costs n))\n      (progn\n        (set-cost heights costs n)\n        (recursive heights costs (+ n 1) to))))\n \n(defun main ()\n  (let* ((n (read))\n         (heights (make-array n \n                              :initial-contents (loop :repeat n :collect (read))))\n         (costs (make-array n :initial-element -1)))\n    (princ (recursive heights costs 0 n))))\n\n(main)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 998, "cpu_time_ms": 124, "memory_kb": 78608}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s885028555", "group_id": "codeNet:p03160", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n    :unix-status\n    (process-exit-code\n      (run-program *runtime-pathname*\n                   `(\"--control-stack-size\" \"128MB\"\n                     \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                     \"--eval\" \"(push :child-sbcl *features*)\"\n                     \"--script\" ,(namestring *load-pathname*))\n                   :output t :error t :input t))))\n\n(defun solve (n h)\n  (declare (optimize speed))\n  (let ((memo (make-array n :initial-element -1)))\n    (labels ((dp (x h)\n               (let (cost)\n                 (cond\n                   ((= x 0) 0)\n                   ((< x 0) (expt 10 5))\n                   ((= x 1) (abs (- (aref h 1) (aref h 0))))\n                   ((/= (aref memo x) -1) (aref memo x))\n                   (t   (setq cost (min (+ (dp (- x 1) h) (abs (- (aref h x)\n                                                                  (aref h (- x 1)))))\n                                        (+ (dp (- x 2) h) (abs (- (aref h x)\n                                                                  (aref h (- x 2)))))))\n                        (setf (aref memo x) cost)\n                        cost)))))\n      (dp (1- n) h))))\n\n(defun main ()\n  (let* ((n (read))\n         (h (make-array n :initial-contents (read-from-string (concatenate 'string \"(\" (read-line) \")\")))))\n    (princ (solve n h))\n    (fresh-line)))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1594632197, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s885028555.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s885028555", "user_id": "u425762225"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n    :unix-status\n    (process-exit-code\n      (run-program *runtime-pathname*\n                   `(\"--control-stack-size\" \"128MB\"\n                     \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                     \"--eval\" \"(push :child-sbcl *features*)\"\n                     \"--script\" ,(namestring *load-pathname*))\n                   :output t :error t :input t))))\n\n(defun solve (n h)\n  (declare (optimize speed))\n  (let ((memo (make-array n :initial-element -1)))\n    (labels ((dp (x h)\n               (let (cost)\n                 (cond\n                   ((= x 0) 0)\n                   ((< x 0) (expt 10 5))\n                   ((= x 1) (abs (- (aref h 1) (aref h 0))))\n                   ((/= (aref memo x) -1) (aref memo x))\n                   (t   (setq cost (min (+ (dp (- x 1) h) (abs (- (aref h x)\n                                                                  (aref h (- x 1)))))\n                                        (+ (dp (- x 2) h) (abs (- (aref h x)\n                                                                  (aref h (- x 2)))))))\n                        (setf (aref memo x) cost)\n                        cost)))))\n      (dp (1- n) h))))\n\n(defun main ()\n  (let* ((n (read))\n         (h (make-array n :initial-contents (read-from-string (concatenate 'string \"(\" (read-line) \")\")))))\n    (princ (solve n h))\n    (fresh-line)))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1452, "cpu_time_ms": 84, "memory_kb": 41664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s221965836", "group_id": "codeNet:p03160", "input_text": "(defun solve (n h)\n  (declare (optimize speed))\n  (let ((memo (make-array n :initial-element -1)))\n    (labels ((dp (x h)\n               (let (cost)\n                 (cond\n                   ((= x 0) 0)\n                   ((< x 0) (expt 10 5))\n                   ((= x 1) (abs (- (aref h 1) (aref h 0))))\n                   ((/= (aref memo x) -1) (aref memo x))\n                   (t   (setq cost (min (+ (dp (- x 1) h) (abs (- (aref h x)\n                                                                  (aref h (- x 1)))))\n                                        (+ (dp (- x 2) h) (abs (- (aref h x)\n                                                                  (aref h (- x 2)))))))\n                        (setf (aref memo x) cost)\n                        cost)))))\n      (dp (1- n) h))))\n\n(defun main ()\n  (let* ((n (read))\n         (h (make-array n :initial-contents (read-from-string (concatenate 'string \"(\" (read-line) \")\")))))\n    (princ (solve n h))\n    (fresh-line)))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1594631495, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s221965836.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s221965836", "user_id": "u425762225"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defun solve (n h)\n  (declare (optimize speed))\n  (let ((memo (make-array n :initial-element -1)))\n    (labels ((dp (x h)\n               (let (cost)\n                 (cond\n                   ((= x 0) 0)\n                   ((< x 0) (expt 10 5))\n                   ((= x 1) (abs (- (aref h 1) (aref h 0))))\n                   ((/= (aref memo x) -1) (aref memo x))\n                   (t   (setq cost (min (+ (dp (- x 1) h) (abs (- (aref h x)\n                                                                  (aref h (- x 1)))))\n                                        (+ (dp (- x 2) h) (abs (- (aref h x)\n                                                                  (aref h (- x 2)))))))\n                        (setf (aref memo x) cost)\n                        cost)))))\n      (dp (1- n) h))))\n\n(defun main ()\n  (let* ((n (read))\n         (h (make-array n :initial-contents (read-from-string (concatenate 'string \"(\" (read-line) \")\")))))\n    (princ (solve n h))\n    (fresh-line)))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 992, "cpu_time_ms": 68, "memory_kb": 35828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s809703810", "group_id": "codeNet:p03160", "input_text": "(defun solve (n h)\n  (let ((memo (make-array n :initial-element -1)))\n    (labels ((dp (x h)\n               (let (cost)\n                 (cond\n                   ((= x 0) 0)\n                   ((< x 0) (expt 10 5))\n                   ((= x 1) (abs (- (aref h 1) (aref h 0))))\n                   ((/= (aref memo x) -1) (aref memo x))\n                   (t   (setq cost (min (+ (dp (- x 1) h) (abs (- (aref h x)\n                                                                  (aref h (- x 1)))))\n                                        (+ (dp (- x 2) h) (abs (- (aref h x)\n                                                                  (aref h (- x 2)))))))\n                        (setf (aref memo x) cost)\n                        cost)))))\n      (dp (1- n) h))))\n\n(defun main ()\n  (let* ((n (read))\n         (h (make-array n :initial-contents (read-from-string (concatenate 'string \"(\" (read-line) \")\")))))\n    (princ (solve n h))\n    (fresh-line)))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1594630799, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s809703810.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s809703810", "user_id": "u425762225"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defun solve (n h)\n  (let ((memo (make-array n :initial-element -1)))\n    (labels ((dp (x h)\n               (let (cost)\n                 (cond\n                   ((= x 0) 0)\n                   ((< x 0) (expt 10 5))\n                   ((= x 1) (abs (- (aref h 1) (aref h 0))))\n                   ((/= (aref memo x) -1) (aref memo x))\n                   (t   (setq cost (min (+ (dp (- x 1) h) (abs (- (aref h x)\n                                                                  (aref h (- x 1)))))\n                                        (+ (dp (- x 2) h) (abs (- (aref h x)\n                                                                  (aref h (- x 2)))))))\n                        (setf (aref memo x) cost)\n                        cost)))))\n      (dp (1- n) h))))\n\n(defun main ()\n  (let* ((n (read))\n         (h (make-array n :initial-contents (read-from-string (concatenate 'string \"(\" (read-line) \")\")))))\n    (princ (solve n h))\n    (fresh-line)))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 963, "cpu_time_ms": 68, "memory_kb": 35868}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s235145124", "group_id": "codeNet:p03160", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read-fixnum))\n         (dp (make-array n :element-type 'uint32 :initial-element #xffffffff))\n         (hs (make-array n :element-type 'uint32 :initial-element 0)))\n    (dotimes (i n)\n      (setf (aref hs i) (read-fixnum)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (- n 1))\n      (minf (aref dp (+ i 1))\n            (+ (abs (- (aref hs (+ i 1)) (aref hs i))) (aref dp i)))\n      (when (< i (- n 2))\n        (minf (aref dp (+ i 2))\n              (+ (abs (- (aref hs (+ i 2)) (aref hs i))) (aref dp i)))))\n    (println (aref dp (- n 1)))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4\n10 30 40 20\n\"\n    \"30\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\n10 10\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"6\n30 10 60 10 60 50\n\"\n    \"40\n\")))\n", "language": "Lisp", "metadata": {"date": 1593259467, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s235145124.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s235145124", "user_id": "u352600849"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read-fixnum))\n         (dp (make-array n :element-type 'uint32 :initial-element #xffffffff))\n         (hs (make-array n :element-type 'uint32 :initial-element 0)))\n    (dotimes (i n)\n      (setf (aref hs i) (read-fixnum)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (- n 1))\n      (minf (aref dp (+ i 1))\n            (+ (abs (- (aref hs (+ i 1)) (aref hs i))) (aref dp i)))\n      (when (< i (- n 2))\n        (minf (aref dp (+ i 2))\n              (+ (abs (- (aref hs (+ i 2)) (aref hs i))) (aref dp i)))))\n    (println (aref dp (- n 1)))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4\n10 30 40 20\n\"\n    \"30\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2\n10 10\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"6\n30 10 60 10 60 50\n\"\n    \"40\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5294, "cpu_time_ms": 24, "memory_kb": 27676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s089161863", "group_id": "codeNet:p03160", "input_text": "(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer *standard-input*) stairs))\n  (format t \"~A~%\" (solve stairs n)))\n\n", "language": "Lisp", "metadata": {"date": 1592870207, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s089161863.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s089161863", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer *standard-input*) stairs))\n  (format t \"~A~%\" (solve stairs n)))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2207, "cpu_time_ms": 36, "memory_kb": 26384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s439520542", "group_id": "codeNet:p03160", "input_text": "(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return y))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer *standard-input*) stairs))\n  (format t \"~A~%\" (solve stairs n)))\n\n", "language": "Lisp", "metadata": {"date": 1592869269, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s439520542.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s439520542", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return y))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer *standard-input*) stairs))\n  (format t \"~A~%\" (solve stairs n)))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2176, "cpu_time_ms": 35, "memory_kb": 26444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s915278053", "group_id": "codeNet:p03160", "input_text": "#-swank (eval-when (:compile-toplevel)\n          (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun read-integer (&optional (in *standard-input*))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (let* ((minus-p nil)\n           (x (loop for b = (read-byte in nil 0)\n                    if (number-char-p b)\n                      return (to-number b)\n                      end\n                    if (minus-char-p b)\n                      do (setf minus-p t))))\n      (loop for b = (read-byte in nil 0)\n            and y = x then (+ (* y 10) (to-number b))\n            unless (number-char-p b)\n              return y))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer *standard-input*) stairs))\n  (format t \"~A~%\" (solve stairs n)))\n", "language": "Lisp", "metadata": {"date": 1592867986, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s915278053.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s915278053", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-swank (eval-when (:compile-toplevel)\n          (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun read-integer (&optional (in *standard-input*))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (let* ((minus-p nil)\n           (x (loop for b = (read-byte in nil 0)\n                    if (number-char-p b)\n                      return (to-number b)\n                      end\n                    if (minus-char-p b)\n                      do (setf minus-p t))))\n      (loop for b = (read-byte in nil 0)\n            and y = x then (+ (* y 10) (to-number b))\n            unless (number-char-p b)\n              return y))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer *standard-input*) stairs))\n  (format t \"~A~%\" (solve stairs n)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1795, "cpu_time_ms": 39, "memory_kb": 26240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s786035096", "group_id": "codeNet:p03160", "input_text": "#-swank (eval-when (:compile-toplevel)\n          (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun read-integer (&optional (in *standard-input*))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) c #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (let* ((minus-p nil)\n           (x (loop for b = (read-byte in)\n                    if (number-char-p b)\n                      return b\n                      end\n                    if (minus-char-p b)\n                      do (setf minus-p t))))\n      (loop for b = (read-byte in)\n            unless (number-char-p b)\n              return x\n              end\n            do (setf x (+ (* x 10) (to-number b))))\n      x)))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) stairs)))\n", "language": "Lisp", "metadata": {"date": 1592865977, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s786035096.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s786035096", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-swank (eval-when (:compile-toplevel)\n          (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun read-integer (&optional (in *standard-input*))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) c #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (let* ((minus-p nil)\n           (x (loop for b = (read-byte in)\n                    if (number-char-p b)\n                      return b\n                      end\n                    if (minus-char-p b)\n                      do (setf minus-p t))))\n      (loop for b = (read-byte in)\n            unless (number-char-p b)\n              return x\n              end\n            do (setf x (+ (* x 10) (to-number b))))\n      x)))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) stairs)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1740, "cpu_time_ms": 23, "memory_kb": 26932}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s060560362", "group_id": "codeNet:p03160", "input_text": "#-swank (eval-when (:compile-toplevel)\n          (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun read-integer (&optional (in *standard-input*))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) c #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (let* ((minus-p nil)\n           (x (loop for b = (read-byte in)\n                    if (number-char-p b)\n                      return b\n                      end\n                    if (minus-char-p b)\n                      do (setf minus-p t))))\n      (loop for b = (read-byte in)\n            unless (number-char-p b)\n              return x\n              end\n            do (setf x (+ (* x 10) (to-number b)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) stairs)))\n", "language": "Lisp", "metadata": {"date": 1592865897, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s060560362.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s060560362", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-swank (eval-when (:compile-toplevel)\n          (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun read-integer (&optional (in *standard-input*))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) c #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (let* ((minus-p nil)\n           (x (loop for b = (read-byte in)\n                    if (number-char-p b)\n                      return b\n                      end\n                    if (minus-char-p b)\n                      do (setf minus-p t))))\n      (loop for b = (read-byte in)\n            unless (number-char-p b)\n              return x\n              end\n            do (setf x (+ (* x 10) (to-number b)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) stairs)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1732, "cpu_time_ms": 27, "memory_kb": 26900}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s091173255", "group_id": "codeNet:p03160", "input_text": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 3) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc (make-array 100001 :adjustable t :fill-pointer 0)))\n  (declare (type string x str) (type vector acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (progn (vector-push (subseq str 0 pos) acc)\n               (split x (subseq str (+ pos size)) acc))\n        (progn (vector-push str acc)\n               (the vector acc)))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (map 'vector #'parse-integer (split \" \" (read-line)))))\n  (format t \"~A~%\" stairs))\n", "language": "Lisp", "metadata": {"date": 1592862355, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s091173255.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s091173255", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 3) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc (make-array 100001 :adjustable t :fill-pointer 0)))\n  (declare (type string x str) (type vector acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (progn (vector-push (subseq str 0 pos) acc)\n               (split x (subseq str (+ pos size)) acc))\n        (progn (vector-push str acc)\n               (the vector acc)))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (map 'vector #'parse-integer (split \" \" (read-line)))))\n  (format t \"~A~%\" stairs))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 679, "cpu_time_ms": 2207, "memory_kb": 105480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s195722428", "group_id": "codeNet:p03160", "input_text": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 3) (safety 3))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc (make-array 100001 :adjustable t :fill-pointer 0)))\n  (declare (type string x str) (type vector acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (progn (vector-push (subseq str 0 pos) acc)\n               (split x (subseq str (+ pos size)) acc))\n        (progn (vector-push str acc)\n               (the vector acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (format t \"i: ~A~%\" i)\n      (minf (aref dp (+ i 1)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 1))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2)))))))\n    (aref dp (1- n)))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (map 'vector #'parse-integer (split \" \" (read-line)))))\n  (format t \"~A~%\" (solve stairs n)))\n", "language": "Lisp", "metadata": {"date": 1592854994, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s195722428.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s195722428", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 3) (safety 3))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc (make-array 100001 :adjustable t :fill-pointer 0)))\n  (declare (type string x str) (type vector acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (progn (vector-push (subseq str 0 pos) acc)\n               (split x (subseq str (+ pos size)) acc))\n        (progn (vector-push str acc)\n               (the vector acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (format t \"i: ~A~%\" i)\n      (minf (aref dp (+ i 1)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 1))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2)))))))\n    (aref dp (1- n)))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (map 'vector #'parse-integer (split \" \" (read-line)))))\n  (format t \"~A~%\" (solve stairs n)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1219, "cpu_time_ms": 2208, "memory_kb": 105636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s687931813", "group_id": "codeNet:p03160", "input_text": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 3) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc (make-array 100001 :adjustable t :fill-pointer 0)))\n  (declare (type string x str) (type vector acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (progn (vector-push (subseq str 0 pos) acc)\n               (split x (subseq str (+ pos size)) acc))\n        (progn (vector-push str acc)\n               (the vector acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (let ((a nil)\n            (b nil))\n        (if (> i 0)\n            (setf a (+ (aref dp (- i 1)) (abs (- (aref stairs i) (aref stairs (- i 1)))))))\n        (if (> i 1)\n            (setf b (+ (aref dp (- i 2)) (abs (- (aref stairs i) (aref stairs (- i 2)))))))\n        (setf (aref dp i) (min a b))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (map 'vector #'parse-integer (split \" \" (read-line)))))\n  (format t \"~A~%\" (solve stairs n)))\n", "language": "Lisp", "metadata": {"date": 1592854127, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s687931813.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s687931813", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 3) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc (make-array 100001 :adjustable t :fill-pointer 0)))\n  (declare (type string x str) (type vector acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (progn (vector-push (subseq str 0 pos) acc)\n               (split x (subseq str (+ pos size)) acc))\n        (progn (vector-push str acc)\n               (the vector acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (let ((a nil)\n            (b nil))\n        (if (> i 0)\n            (setf a (+ (aref dp (- i 1)) (abs (- (aref stairs i) (aref stairs (- i 1)))))))\n        (if (> i 1)\n            (setf b (+ (aref dp (- i 2)) (abs (- (aref stairs i) (aref stairs (- i 2)))))))\n        (setf (aref dp i) (min a b))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (map 'vector #'parse-integer (split \" \" (read-line)))))\n  (format t \"~A~%\" (solve stairs n)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1269, "cpu_time_ms": 2208, "memory_kb": 105704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s564547101", "group_id": "codeNet:p03160", "input_text": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 3) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc (make-array 100001 :adjustable t :fill-pointer 0)))\n  (declare (type string x str) (type vector acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (progn (vector-push (subseq str 0 pos) acc)\n               (split x (subseq str (+ pos size)) acc))\n        (progn (vector-push str acc)\n               (the vector acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (map 'vector #'parse-integer (split \" \" (read-line)))))\n  (format t \"~A~%\" (solve stairs n)))\n", "language": "Lisp", "metadata": {"date": 1592793990, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s564547101.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s564547101", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 3) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc (make-array 100001 :adjustable t :fill-pointer 0)))\n  (declare (type string x str) (type vector acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (progn (vector-push (subseq str 0 pos) acc)\n               (split x (subseq str (+ pos size)) acc))\n        (progn (vector-push str acc)\n               (the vector acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (map 'vector #'parse-integer (split \" \" (read-line)))))\n  (format t \"~A~%\" (solve stairs n)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1211, "cpu_time_ms": 2208, "memory_kb": 105680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s475065145", "group_id": "codeNet:p03160", "input_text": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 3) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc (make-array 0 :adjustable t :fill-pointer 0)))\n  (declare (type string x str) (type vector acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (progn (vector-push-extend (subseq str 0 pos) acc)\n               (split x (subseq str (+ pos size)) acc))\n        (progn (vector-push-extend str acc)\n               (the vector acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (map 'vector #'parse-integer (split \" \" (read-line)))))\n  (format t \"~A~%\" (solve stairs n)))\n", "language": "Lisp", "metadata": {"date": 1592793862, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s475065145.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s475065145", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 3) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc (make-array 0 :adjustable t :fill-pointer 0)))\n  (declare (type string x str) (type vector acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (progn (vector-push-extend (subseq str 0 pos) acc)\n               (split x (subseq str (+ pos size)) acc))\n        (progn (vector-push-extend str acc)\n               (the vector acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (aref dp (1- n))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (map 'vector #'parse-integer (split \" \" (read-line)))))\n  (format t \"~A~%\" (solve stairs n)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1220, "cpu_time_ms": 2207, "memory_kb": 107396}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s723949695", "group_id": "codeNet:p03160", "input_text": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc nil))\n  (declare (type string x str) (type list acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (the list (reverse (cons str acc))))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (declare (type integer n) (type simple-vector stairs))\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (declare (type simple-vactor dp))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (declare (type integer i))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (the integer (aref dp (1- n)))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :element-type 'integer :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (declare (type fixnum n) (type simple-vector stairs))\n  (format t \"~A~%\" (solve stairs n)))\n", "language": "Lisp", "metadata": {"date": 1592792587, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s723949695.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s723949695", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(eval-when (:compile-toplevel)\n  (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc nil))\n  (declare (type string x str) (type list acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (the list (reverse (cons str acc))))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (declare (type integer n) (type simple-vector stairs))\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (declare (type simple-vactor dp))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (declare (type integer i))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (the integer (aref dp (1- n)))))\n\n(let* ((n (parse-integer (read-line)))\n       (stairs (make-array n :element-type 'integer :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (declare (type fixnum n) (type simple-vector stairs))\n  (format t \"~A~%\" (solve stairs n)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1352, "cpu_time_ms": 2208, "memory_kb": 109096}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s660966578", "group_id": "codeNet:p03160", "input_text": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc nil))\n  (declare (type string x str) (type list acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (the list (reverse (cons str acc))))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (declare (type integer n) (type simple-vector stairs))\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (declare (type simple-vactor dp))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (declare (type integer i))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (the integer (aref dp (1- n)))))\n\n(let* ((n (read))\n       (stairs (make-array n :element-type 'integer :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (declare (type fixnum n) (type simple-vector stairs))\n  (format t \"~A~%\" (solve stairs n)))\n", "language": "Lisp", "metadata": {"date": 1592791826, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s660966578.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s660966578", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n\n(defparameter inf 2000000000)\n\n(defun split (x str &optional (acc nil))\n  (declare (type string x str) (type list acc))\n  (let ((pos (search x str))\n        (size (length x)))\n    (declare (type integer size))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (the list (reverse (cons str acc))))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defun solve (stairs n)\n  (declare (type integer n) (type simple-vector stairs))\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (declare (type simple-vactor dp))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (declare (type integer i))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (the integer (aref dp (1- n)))))\n\n(let* ((n (read))\n       (stairs (make-array n :element-type 'integer :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (declare (type fixnum n) (type simple-vector stairs))\n  (format t \"~A~%\" (solve stairs n)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1295, "cpu_time_ms": 2207, "memory_kb": 109088}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s927978365", "group_id": "codeNet:p03160", "input_text": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n\n(defparameter mod-number 1000000007)\n(defparameter inf 2000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro minf (field x)\n  `(setf ,field (min ,field ,x)))\n\n(defmacro maxf (field x)\n  `(setf ,field (max ,field ,x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun solve (stairs n)\n  (declare (type integer n) (type simple-vector stairs))\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (declare (type simple-vactor dp))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (declare (type integer i))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (the integer (aref dp (1- n)))))\n\n(let* ((n (read))\n       (stairs (make-array n :element-type 'integer :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (declare (type fixnum n) (type simple-vector stairs))\n  (format t \"~A~%\" (solve stairs n)))\n", "language": "Lisp", "metadata": {"date": 1592791246, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s927978365.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s927978365", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n\n(defparameter mod-number 1000000007)\n(defparameter inf 2000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro minf (field x)\n  `(setf ,field (min ,field ,x)))\n\n(defmacro maxf (field x)\n  `(setf ,field (max ,field ,x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun solve (stairs n)\n  (declare (type integer n) (type simple-vector stairs))\n  (let ((dp (make-array n :element-type 'integer :initial-element inf)))\n    (declare (type simple-vactor dp))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (declare (type integer i))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (the integer (aref dp (1- n)))))\n\n(let* ((n (read))\n       (stairs (make-array n :element-type 'integer :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (declare (type fixnum n) (type simple-vector stairs))\n  (format t \"~A~%\" (solve stairs n)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1765, "cpu_time_ms": 2208, "memory_kb": 107168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s291097842", "group_id": "codeNet:p03160", "input_text": "(defparameter mod-number 1000000007)\n(defparameter inf 2000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro minf (field x)\n  `(setf ,field (min ,field ,x)))\n\n(defmacro maxf (field x)\n  `(setf ,field (max ,field ,x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(declaim (ftype (function (simple-vector integer) integer) solve))\n(defun solve (stairs n)\n  (declaim (simple-vector dp))\n  (let ((dp (make-array n :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (the integer (aref dp (1- n)))))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (format t \"~A~%\" (solve stairs n)))\n", "language": "Lisp", "metadata": {"date": 1592790334, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s291097842.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s291097842", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defparameter mod-number 1000000007)\n(defparameter inf 2000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro minf (field x)\n  `(setf ,field (min ,field ,x)))\n\n(defmacro maxf (field x)\n  `(setf ,field (max ,field ,x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(declaim (ftype (function (simple-vector integer) integer) solve))\n(defun solve (stairs n)\n  (declaim (simple-vector dp))\n  (let ((dp (make-array n :initial-element inf)))\n    (setf (aref dp 0) 0)\n    (dotimes (i (1- n))\n      (minf (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (1+ i))))))\n      (if (< (+ i 2) n)\n          (minf (aref dp (+ i 2)) (+ (aref dp i) (abs (- (aref stairs i) (aref stairs (+ i 2))))))))\n    (the integer (aref dp (1- n)))))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (format t \"~A~%\" (solve stairs n)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1580, "cpu_time_ms": 2208, "memory_kb": 109288}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s930049086", "group_id": "codeNet:p03160", "input_text": "(defparameter mod-number 1000000007)\n(defparameter inf 2000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun memorized-solve (stairs)\n  (let ((dp (make-hash-table :test #'eq)))\n    (labels ((solve (pos)\n               (let ((memo (gethash pos dp)))\n                 (if memo\n                     (the integer memo)\n                     (let ((ret (if (zerop pos)\n                                    0\n                                    (min (if (minusp (1- pos))\n                                             inf\n                                             (+ (solve (1- pos))\n                                                (abs (- (aref stairs pos) (aref stairs (1- pos))))))\n                                         (if (minusp (- pos 2))\n                                             inf\n                                             (+ (solve (- pos 2))\n                                                (abs (- (aref stairs pos) (aref stairs (- pos 2))))))))))\n                       (setf (gethash pos dp) ret)\n                       (the integer ret))))))\n      #'solve)))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (format t \"~A~%\" (funcall (memorized-solve stairs) (1- n))))\n", "language": "Lisp", "metadata": {"date": 1592788288, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s930049086.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s930049086", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defparameter mod-number 1000000007)\n(defparameter inf 2000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun memorized-solve (stairs)\n  (let ((dp (make-hash-table :test #'eq)))\n    (labels ((solve (pos)\n               (let ((memo (gethash pos dp)))\n                 (if memo\n                     (the integer memo)\n                     (let ((ret (if (zerop pos)\n                                    0\n                                    (min (if (minusp (1- pos))\n                                             inf\n                                             (+ (solve (1- pos))\n                                                (abs (- (aref stairs pos) (aref stairs (1- pos))))))\n                                         (if (minusp (- pos 2))\n                                             inf\n                                             (+ (solve (- pos 2))\n                                                (abs (- (aref stairs pos) (aref stairs (- pos 2))))))))))\n                       (setf (gethash pos dp) ret)\n                       (the integer ret))))))\n      #'solve)))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (format t \"~A~%\" (funcall (memorized-solve stairs) (1- n))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1985, "cpu_time_ms": 2208, "memory_kb": 109104}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s670559294", "group_id": "codeNet:p03160", "input_text": "(defparameter mod-number 1000000007)\n(defparameter inf 10000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun memorized-solve (stairs)\n  (let ((dp (make-hash-table :test #'eq)))\n    (labels ((solve (pos)\n               (let ((memo (gethash pos dp)))\n                 (if memo\n                     memo\n                     (let ((ret (if (zerop pos)\n                                    0\n                                    (min (+ (solve (max (1- pos) 0))\n                                            (abs (- (aref stairs pos) (aref stairs (max (1- pos) 0)))))\n                                         (+ (solve (max (- pos 2) 0))\n                                            (abs (- (aref stairs pos) (aref stairs (max (- pos 2) 0)))))))))\n                       (setf (gethash pos dp) ret)\n                       ret)))))\n      #'solve)))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (format t \"~A~%\" (funcall (memorized-solve stairs) (1- n))))\n", "language": "Lisp", "metadata": {"date": 1592785995, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s670559294.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s670559294", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defparameter mod-number 1000000007)\n(defparameter inf 10000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun memorized-solve (stairs)\n  (let ((dp (make-hash-table :test #'eq)))\n    (labels ((solve (pos)\n               (let ((memo (gethash pos dp)))\n                 (if memo\n                     memo\n                     (let ((ret (if (zerop pos)\n                                    0\n                                    (min (+ (solve (max (1- pos) 0))\n                                            (abs (- (aref stairs pos) (aref stairs (max (1- pos) 0)))))\n                                         (+ (solve (max (- pos 2) 0))\n                                            (abs (- (aref stairs pos) (aref stairs (max (- pos 2) 0)))))))))\n                       (setf (gethash pos dp) ret)\n                       ret)))))\n      #'solve)))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line))))))\n  (format t \"~A~%\" (funcall (memorized-solve stairs) (1- n))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1747, "cpu_time_ms": 2209, "memory_kb": 109036}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s197110531", "group_id": "codeNet:p03160", "input_text": "(defparameter mod-number 1000000007)\n(defparameter inf 10000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun solve (pos stairs dp)\n  (let ((memo (aref dp pos)))\n    (if memo\n        memo\n        (let ((ret (if (zerop pos)\n                       0\n                       (apply #'min\n                          (mapcar (lambda (prev-pos)\n                                    (if (< prev-pos 0)\n                                        inf\n                                        (+ (solve prev-pos stairs dp)\n                                           (abs (- (aref stairs prev-pos) (aref stairs pos))))))\n                                  (list (1- pos) (- pos 2)))))))\n          (setf (aref dp pos) ret)\n          ret))))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line)))))\n       (dp (make-array n :initial-element nil)))\n  (format t \"~A~%\" (solve (1- n) stairs dp)))\n", "language": "Lisp", "metadata": {"date": 1592783716, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s197110531.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s197110531", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defparameter mod-number 1000000007)\n(defparameter inf 10000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun solve (pos stairs dp)\n  (let ((memo (aref dp pos)))\n    (if memo\n        memo\n        (let ((ret (if (zerop pos)\n                       0\n                       (apply #'min\n                          (mapcar (lambda (prev-pos)\n                                    (if (< prev-pos 0)\n                                        inf\n                                        (+ (solve prev-pos stairs dp)\n                                           (abs (- (aref stairs prev-pos) (aref stairs pos))))))\n                                  (list (1- pos) (- pos 2)))))))\n          (setf (aref dp pos) ret)\n          ret))))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line)))))\n       (dp (make-array n :initial-element nil)))\n  (format t \"~A~%\" (solve (1- n) stairs dp)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1659, "cpu_time_ms": 2209, "memory_kb": 109068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s810951270", "group_id": "codeNet:p03160", "input_text": "(defparameter mod-number 1000000007)\n(defparameter inf 10000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun solve (pos stairs dp)\n  (let ((memo (aref dp pos)))\n    (if memo\n        memo\n        (let ((ret (apply #'min\n                          (mapcar (lambda (prev-pos)\n                                    (if (< prev-pos 0)\n                                        inf\n                                        (+ (if (= prev-pos 0)\n                                             0\n                                             (solve prev-pos stairs dp))\n                                           (abs (- (aref stairs prev-pos) (aref stairs pos))))))\n                                  (list (1- pos) (- pos 2))))))\n          (setf (aref dp pos) ret)\n          ret))))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line)))))\n       (dp (make-array n :initial-element nil)))\n  (format t \"~A~%\" (solve (1- n) stairs dp)))\n", "language": "Lisp", "metadata": {"date": 1592783338, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s810951270.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s810951270", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defparameter mod-number 1000000007)\n(defparameter inf 10000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun solve (pos stairs dp)\n  (let ((memo (aref dp pos)))\n    (if memo\n        memo\n        (let ((ret (apply #'min\n                          (mapcar (lambda (prev-pos)\n                                    (if (< prev-pos 0)\n                                        inf\n                                        (+ (if (= prev-pos 0)\n                                             0\n                                             (solve prev-pos stairs dp))\n                                           (abs (- (aref stairs prev-pos) (aref stairs pos))))))\n                                  (list (1- pos) (- pos 2))))))\n          (setf (aref dp pos) ret)\n          ret))))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line)))))\n       (dp (make-array n :initial-element nil)))\n  (format t \"~A~%\" (solve (1- n) stairs dp)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1706, "cpu_time_ms": 2208, "memory_kb": 109156}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s818614330", "group_id": "codeNet:p03160", "input_text": "(defparameter mod-number 1000000007)\n(defparameter inf 10000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun solve (pos stairs dp)\n  (let ((memo (aref dp pos)))\n    (if memo\n        memo\n        (let ((ret (apply #'min\n                          (mapcar (lambda (prev-pos)\n                                    (if (< prev-pos 0)\n                                        inf\n                                        (+ (if (= prev-pos 0)\n                                             0\n                                             (solve prev-pos stairs dp))\n                                           (abs (- (aref stairs prev-pos) (aref stairs pos))))))\n                                  (list (1- pos) (- pos 2))))))\n          (setf (aref dp pos) ret)\n          ret))))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line)))))\n       (dp (make-array n :initial-element nil)))\n  (format t \"~A~%\" stairs)\n  (format t \"~A~%\" (solve (1- n) stairs dp)))\n", "language": "Lisp", "metadata": {"date": 1592764191, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s818614330.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s818614330", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defparameter mod-number 1000000007)\n(defparameter inf 10000000000)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n\t  (cons (f seed)\n\t        (unfold p f g (g seed) tail-gen))))\n  \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n    (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (reverse (cons str acc)))))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n\ty))\n\n(defun solve (pos stairs dp)\n  (let ((memo (aref dp pos)))\n    (if memo\n        memo\n        (let ((ret (apply #'min\n                          (mapcar (lambda (prev-pos)\n                                    (if (< prev-pos 0)\n                                        inf\n                                        (+ (if (= prev-pos 0)\n                                             0\n                                             (solve prev-pos stairs dp))\n                                           (abs (- (aref stairs prev-pos) (aref stairs pos))))))\n                                  (list (1- pos) (- pos 2))))))\n          (setf (aref dp pos) ret)\n          ret))))\n\n(let* ((n (read))\n       (stairs (make-array n :initial-contents (mapcar #'parse-integer (split \" \" (read-line)))))\n       (dp (make-array n :initial-element nil)))\n  (format t \"~A~%\" stairs)\n  (format t \"~A~%\" (solve (1- n) stairs dp)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1733, "cpu_time_ms": 2208, "memory_kb": 109000}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s141717686", "group_id": "codeNet:p03160", "input_text": "(defvar N (read))\n(defvar infty (expt 10 10))\n\n(loop repeat (1- N) with a = infty and b = 0\n      and ha and hb = 0 and hc = (read) do\n      (shiftf ha hb hc (read))\n      (shiftf a b (min (+ a (abs (- ha hc)))\n                       (+ b (abs (- hb hc)))))\n      finally (princ b))\n", "language": "Lisp", "metadata": {"date": 1589018101, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s141717686.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s141717686", "user_id": "u334552723"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defvar N (read))\n(defvar infty (expt 10 10))\n\n(loop repeat (1- N) with a = infty and b = 0\n      and ha and hb = 0 and hc = (read) do\n      (shiftf ha hb hc (read))\n      (shiftf a b (min (+ a (abs (- ha hc)))\n                       (+ b (abs (- hb hc)))))\n      finally (princ b))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 283, "cpu_time_ms": 181, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s910480768", "group_id": "codeNet:p03160", "input_text": "(defun Frog-1 (n)\n  (let\n   ((h\n     (make-array 0 :fill-pointer 0 :adjustable t))\n    (dp\n     (make-array 0 :fill-pointer 0 :adjustable t))\n     )\n   (loop :repeat n\n         :do (vector-push-extend (read) h))\n   (vector-push-extend 0 dp)\n   (vector-push-extend (abs (- (aref h 0) (aref h 1))) dp)\n   (if (> n 2)\n       (loop :for i :from 2 :to (- n 1)\n           \t :do (let ((tmp1\n                        (+ (aref dp (- i 1)) (abs (- (aref h i) (aref h (- i 1)))))) \n                   \t   (tmp2\n                        (+ (aref dp (- i 2)) (abs (- (aref h i) (aref h (- i 2)))))))\n                  \t  (if (< tmp1 tmp2)\n                          (vector-push-extend tmp1 dp)\n                      \t  (vector-push-extend tmp2 dp)))))\n   (aref dp (- n 1))))\n\n(print (Frog-1 (read)))", "language": "Lisp", "metadata": {"date": 1588503593, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s910480768.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s910480768", "user_id": "u046178504"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defun Frog-1 (n)\n  (let\n   ((h\n     (make-array 0 :fill-pointer 0 :adjustable t))\n    (dp\n     (make-array 0 :fill-pointer 0 :adjustable t))\n     )\n   (loop :repeat n\n         :do (vector-push-extend (read) h))\n   (vector-push-extend 0 dp)\n   (vector-push-extend (abs (- (aref h 0) (aref h 1))) dp)\n   (if (> n 2)\n       (loop :for i :from 2 :to (- n 1)\n           \t :do (let ((tmp1\n                        (+ (aref dp (- i 1)) (abs (- (aref h i) (aref h (- i 1)))))) \n                   \t   (tmp2\n                        (+ (aref dp (- i 2)) (abs (- (aref h i) (aref h (- i 2)))))))\n                  \t  (if (< tmp1 tmp2)\n                          (vector-push-extend tmp1 dp)\n                      \t  (vector-push-extend tmp2 dp)))))\n   (aref dp (- n 1))))\n\n(print (Frog-1 (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 784, "cpu_time_ms": 196, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s693549414", "group_id": "codeNet:p03160", "input_text": "(defun chmin (a b)\n  (if (> a b)\n      b\n      a))\n\n(defun main ()\n  (let* ((n (read))\n         (h (make-array n))\n         (dp (make-array 100005 :initial-element 1000000000)))\n    (dotimes (i n)\n      (setf (aref h i) (read)))\n    (setf (aref dp 0) 0)\n\n    (dotimes (i (1- n))\n      (setf (aref dp (1+ i)) (chmin (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref h (1+ i)) (aref h i))))))\n      (if (> i 0)\n          (setf (aref dp (1+ i)) (chmin (aref dp (1+ i)) (+ (aref dp (1- i)) (abs (- (aref h (1+ i)) (aref h (1- i)))))))))\n    (format t \"~d~%\" (aref dp (1- n)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1585143187, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s693549414.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s693549414", "user_id": "u091381267"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defun chmin (a b)\n  (if (> a b)\n      b\n      a))\n\n(defun main ()\n  (let* ((n (read))\n         (h (make-array n))\n         (dp (make-array 100005 :initial-element 1000000000)))\n    (dotimes (i n)\n      (setf (aref h i) (read)))\n    (setf (aref dp 0) 0)\n\n    (dotimes (i (1- n))\n      (setf (aref dp (1+ i)) (chmin (aref dp (1+ i)) (+ (aref dp i) (abs (- (aref h (1+ i)) (aref h i))))))\n      (if (> i 0)\n          (setf (aref dp (1+ i)) (chmin (aref dp (1+ i)) (+ (aref dp (1- i)) (abs (- (aref h (1+ i)) (aref h (1- i)))))))))\n    (format t \"~d~%\" (aref dp (1- n)))))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 578, "cpu_time_ms": 196, "memory_kb": 59748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s250142503", "group_id": "codeNet:p03160", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defvar n (read))\n(defvar h (coerce (loop repeat n collect (read)) 'vector))\n\n(defun cul-cost (from to)\n  (labels ((height (x)\n             (if (>= x n) (expt 10 10)\n                 (aref h x))))\n    (abs (- (height from) (height to)))))\n\n(dp func (x) '(100010)\n    (if (>= x (1- n)) 0\n        (apply #'min\n               (loop for i from 1 to 2\n                     collect (+ (cul-cost x (+ x i)) (func (+ x i)))))))\n\n(princ (func 0))\n\n", "language": "Lisp", "metadata": {"date": 1584486992, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s250142503.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s250142503", "user_id": "u493610446"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defvar n (read))\n(defvar h (coerce (loop repeat n collect (read)) 'vector))\n\n(defun cul-cost (from to)\n  (labels ((height (x)\n             (if (>= x n) (expt 10 10)\n                 (aref h x))))\n    (abs (- (height from) (height to)))))\n\n(dp func (x) '(100010)\n    (if (>= x (1- n)) 0\n        (apply #'min\n               (loop for i from 1 to 2\n                     collect (+ (cul-cost x (+ x i)) (func (+ x i)))))))\n\n(princ (func 0))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1341, "cpu_time_ms": 252, "memory_kb": 70716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s097616286", "group_id": "codeNet:p03160", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defvar n (read))\n(defvar h (coerce (loop repeat n collect (read)) 'vector))\n\n(defun cul-cost (from to)\n  (labels ((height (x)\n             (if (>= x n) 0\n                 (aref h x))))\n    (abs (- (height from) (height to)))))\n\n(dp func (x) '(100010)\n    (if (>= x (1- n)) 0\n        (apply #'min\n               (loop for i from 1 to 2\n                     collect (+ (cul-cost x (+ x i)) (func (+ x i)))))))\n\n(princ (func 0))\n\n", "language": "Lisp", "metadata": {"date": 1584486504, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s097616286.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s097616286", "user_id": "u493610446"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defvar n (read))\n(defvar h (coerce (loop repeat n collect (read)) 'vector))\n\n(defun cul-cost (from to)\n  (labels ((height (x)\n             (if (>= x n) 0\n                 (aref h x))))\n    (abs (- (height from) (height to)))))\n\n(dp func (x) '(100010)\n    (if (>= x (1- n)) 0\n        (apply #'min\n               (loop for i from 1 to 2\n                     collect (+ (cul-cost x (+ x i)) (func (+ x i)))))))\n\n(princ (func 0))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1330, "cpu_time_ms": 251, "memory_kb": 70712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s656134655", "group_id": "codeNet:p03160", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defparameter *hash-memo* (make-hash-table :test #'equal))\n\n(defmacro dp (func &body args)\n  `(let* ((h (list (quote func) ,@args))\n          (g (gethash h *hash-memo*)))\n     (if g\n       g\n       (setf (gethash h *hash-memo*) (eval h)))))\n\n(defparameter n (read))\n(defparameter line (concatenate 'vector (loop repeat n collect (read))))\n\n(defun num (x)\n  (if (>= x n)\n    (aref line (1- n))\n    (aref line x)))\n\n(defun get-value (a b)\n  (abs (- (num a) (num b))))\n\n(defun func (place)\n  (if (>= place (1- n))\n    0\n    (min (+ (get-value place (1+ place)) (dp func (1+ place)))\n         (+ (get-value place (+ place 2)) (dp func (+ place 2))))))\n\n(princ (dp func 0))\n", "language": "Lisp", "metadata": {"date": 1581338219, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s656134655.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s656134655", "user_id": "u493610446"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defparameter *hash-memo* (make-hash-table :test #'equal))\n\n(defmacro dp (func &body args)\n  `(let* ((h (list (quote func) ,@args))\n          (g (gethash h *hash-memo*)))\n     (if g\n       g\n       (setf (gethash h *hash-memo*) (eval h)))))\n\n(defparameter n (read))\n(defparameter line (concatenate 'vector (loop repeat n collect (read))))\n\n(defun num (x)\n  (if (>= x n)\n    (aref line (1- n))\n    (aref line x)))\n\n(defun get-value (a b)\n  (abs (- (num a) (num b))))\n\n(defun func (place)\n  (if (>= place (1- n))\n    0\n    (min (+ (get-value place (1+ place)) (dp func (1+ place)))\n         (+ (get-value place (+ place 2)) (dp func (+ place 2))))))\n\n(princ (dp func 0))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1115, "cpu_time_ms": 403, "memory_kb": 67896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s967259946", "group_id": "codeNet:p03160", "input_text": "(defparameter *hash-memo* (make-hash-table :test #'equal))\n\n(defmacro dp (func &body args)\n  `(let* ((h (list (quote func) ,@args))\n          (g (gethash h *hash-memo*)))\n     (if g\n       g\n       (setf (gethash h *hash-memo*) (eval h)))))\n\n(defparameter n (read))\n(defparameter line (concatenate 'vector (loop repeat n collect (read))))\n\n(defun num (x)\n  (if (>= x n)\n    (aref line (1- n))\n    (aref line x)))\n\n(defun get-value (a b)\n  (abs (- (num a) (num b))))\n\n(defun func (place)\n  (if (>= place (1- n))\n    0\n    (min (+ (get-value place (1+ place)) (dp func (1+ place)))\n         (+ (get-value place (+ place 2)) (dp func (+ place 2))))))\n\n(princ (dp func 0))\n", "language": "Lisp", "metadata": {"date": 1581338173, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s967259946.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s967259946", "user_id": "u493610446"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defparameter *hash-memo* (make-hash-table :test #'equal))\n\n(defmacro dp (func &body args)\n  `(let* ((h (list (quote func) ,@args))\n          (g (gethash h *hash-memo*)))\n     (if g\n       g\n       (setf (gethash h *hash-memo*) (eval h)))))\n\n(defparameter n (read))\n(defparameter line (concatenate 'vector (loop repeat n collect (read))))\n\n(defun num (x)\n  (if (>= x n)\n    (aref line (1- n))\n    (aref line x)))\n\n(defun get-value (a b)\n  (abs (- (num a) (num b))))\n\n(defun func (place)\n  (if (>= place (1- n))\n    0\n    (min (+ (get-value place (1+ place)) (dp func (1+ place)))\n         (+ (get-value place (+ place 2)) (dp func (+ place 2))))))\n\n(princ (dp func 0))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 669, "cpu_time_ms": 330, "memory_kb": 62308}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s854584464", "group_id": "codeNet:p03160", "input_text": "(defun solve (n h)\n  (let ((costs (make-array n :element-type 'fixnum)))\n    (loop for i from 0 below n\n          do (setf (aref costs i)\n                   (min (+ (aref costs (max (- i 1) 0))\n                           (abs (- (aref h (max (- i 1) 0))\n                                   (aref h i))))\n                        (+ (aref costs (max (- i 2) 0))\n                           (abs (- (aref h (max (- i 2) 0))\n                                   (aref h i)))))))\n    (aref costs (1- n))))\n\n#-swank\n(let* ((n (read))\n       (h (make-array n :element-type 'fixnum)))\n  (loop for i from 0 below n\n        do (setf (aref h i) (read)))\n  (format t \"~A~%\" (solve n h)))\n", "language": "Lisp", "metadata": {"date": 1580126366, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s854584464.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s854584464", "user_id": "u202886318"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defun solve (n h)\n  (let ((costs (make-array n :element-type 'fixnum)))\n    (loop for i from 0 below n\n          do (setf (aref costs i)\n                   (min (+ (aref costs (max (- i 1) 0))\n                           (abs (- (aref h (max (- i 1) 0))\n                                   (aref h i))))\n                        (+ (aref costs (max (- i 2) 0))\n                           (abs (- (aref h (max (- i 2) 0))\n                                   (aref h i)))))))\n    (aref costs (1- n))))\n\n#-swank\n(let* ((n (read))\n       (h (make-array n :element-type 'fixnum)))\n  (loop for i from 0 below n\n        do (setf (aref h i) (read)))\n  (format t \"~A~%\" (solve n h)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 672, "cpu_time_ms": 200, "memory_kb": 60132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s179558897", "group_id": "codeNet:p03160", "input_text": "(defun solve (n h)\n  (let ((costs (make-array n :element-type 'fixnum)))\n    (loop for i from 0 below n\n          do (setf (aref costs i)\n                   (min (+ (aref costs (max (- i 1) 0))\n                           (abs (- (nth (max (- i 1) 0) h)\n                                   (nth i h))))\n                        (+ (aref costs (max (- i 2) 0))\n                           (abs (- (nth (max (- i 2) 0) h)\n                                   (nth i h)))))))\n    (aref costs (1- n))))\n\n#-swank\n(let* ((n (read))\n       (h (loop repeat n collect (read))))\n  (format t \"~A~%\" (solve n h)))\n", "language": "Lisp", "metadata": {"date": 1580125832, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s179558897.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s179558897", "user_id": "u202886318"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defun solve (n h)\n  (let ((costs (make-array n :element-type 'fixnum)))\n    (loop for i from 0 below n\n          do (setf (aref costs i)\n                   (min (+ (aref costs (max (- i 1) 0))\n                           (abs (- (nth (max (- i 1) 0) h)\n                                   (nth i h))))\n                        (+ (aref costs (max (- i 2) 0))\n                           (abs (- (nth (max (- i 2) 0) h)\n                                   (nth i h)))))))\n    (aref costs (1- n))))\n\n#-swank\n(let* ((n (read))\n       (h (loop repeat n collect (read))))\n  (format t \"~A~%\" (solve n h)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 596, "cpu_time_ms": 2105, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s396720813", "group_id": "codeNet:p03160", "input_text": "(let* ((n (read))\n       (arr (make-array n :initial-element 0 :element-type 'fixnum))\n       (dparr (make-array (1+ n) :initial-element most-positive-fixnum :element-type 'fixnum)))\n  (loop :for k :from 0 :upto (1- n) :do(setf (aref arr k) (read)))\n  (setf (aref dparr 0) 0)\n  (setf (aref dparr 1) (abs (- (aref arr 0) (aref arr 1))))\n  (loop :for k :from 2 :upto (1- n)\n        :do (setf (aref dparr k)\n                  (min (+ (aref dparr (- k 2))\n                          (abs (- (aref arr (- k 2)) (aref arr k))))\n                       (+ (aref dparr (- k 1))\n                          (abs (- (aref arr (- k 1)) (aref arr k)))))))\n  (princ (aref dparr (1- n))))", "language": "Lisp", "metadata": {"date": 1576026996, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s396720813.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s396720813", "user_id": "u610490393"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(let* ((n (read))\n       (arr (make-array n :initial-element 0 :element-type 'fixnum))\n       (dparr (make-array (1+ n) :initial-element most-positive-fixnum :element-type 'fixnum)))\n  (loop :for k :from 0 :upto (1- n) :do(setf (aref arr k) (read)))\n  (setf (aref dparr 0) 0)\n  (setf (aref dparr 1) (abs (- (aref arr 0) (aref arr 1))))\n  (loop :for k :from 2 :upto (1- n)\n        :do (setf (aref dparr k)\n                  (min (+ (aref dparr (- k 2))\n                          (abs (- (aref arr (- k 2)) (aref arr k))))\n                       (+ (aref dparr (- k 1))\n                          (abs (- (aref arr (- k 1)) (aref arr k)))))))\n  (princ (aref dparr (1- n))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 670, "cpu_time_ms": 198, "memory_kb": 60128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s594868957", "group_id": "codeNet:p03160", "input_text": "(let* ((n (read))\n       (lst (loop :repeat n :collect (read)))\n       (dparr (make-array (1+ n) :initial-element most-positive-fixnum :element-type 'fixnum)))\n  (setf (aref dparr 0) 0)\n  (setf (aref dparr 1) (abs (- (car lst) (cadr lst))))\n  (loop :for k :from 2 :upto (1- n)\n        :do (setf (aref dparr k)\n                  (min (+ (aref dparr (- k 2))\n                          (abs (- (elt lst (- k 2)) (elt lst k))))\n                       (+ (aref dparr (- k 1))\n                          (abs (- (elt lst (- k 1)) (elt lst k)))))))\n  (princ (aref dparr (1- n))))", "language": "Lisp", "metadata": {"date": 1576026643, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s594868957.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s594868957", "user_id": "u610490393"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(let* ((n (read))\n       (lst (loop :repeat n :collect (read)))\n       (dparr (make-array (1+ n) :initial-element most-positive-fixnum :element-type 'fixnum)))\n  (setf (aref dparr 0) 0)\n  (setf (aref dparr 1) (abs (- (car lst) (cadr lst))))\n  (loop :for k :from 2 :upto (1- n)\n        :do (setf (aref dparr k)\n                  (min (+ (aref dparr (- k 2))\n                          (abs (- (elt lst (- k 2)) (elt lst k))))\n                       (+ (aref dparr (- k 1))\n                          (abs (- (elt lst (- k 1)) (elt lst k)))))))\n  (princ (aref dparr (1- n))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 571, "cpu_time_ms": 2104, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s909430020", "group_id": "codeNet:p03160", "input_text": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defvar *n* (read))\n(defvar *k* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element nil))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n\n(defun cand (i delta)\n  (if (< *k* delta)\n    nil\n    (cons (+ (ans (- i delta)) (cost i delta)) (cand i (+ delta 1)))))\n\n(defun ans (i)\n  (cond\n    ((aref *dp* i) (aref *dp* i))\n    (t\n       (setf (aref *dp* i) (apply #'min (cand i 1))))))\n\n(print (ans (1- *n*)))\n", "language": "Lisp", "metadata": {"date": 1572287553, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s909430020.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s909430020", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defvar *n* (read))\n(defvar *k* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element nil))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n\n(defun cand (i delta)\n  (if (< *k* delta)\n    nil\n    (cons (+ (ans (- i delta)) (cost i delta)) (cand i (+ delta 1)))))\n\n(defun ans (i)\n  (cond\n    ((aref *dp* i) (aref *dp* i))\n    (t\n       (setf (aref *dp* i) (apply #'min (cand i 1))))))\n\n(print (ans (1- *n*)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1074, "cpu_time_ms": 181, "memory_kb": 62396}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s551431918", "group_id": "codeNet:p03160", "input_text": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n \n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n \n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element nil))\n \n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n \n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n \n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n \n(defun ans (i)\n  (cond\n    ((aref *dp* i) (aref *dp* i))\n    (t (setf (aref *dp* i) (min\n                            (+ (ans (- i 1)) (cost i 1))\n                            (+ (ans (- i 2)) (cost i 2))\n                            )))))\n                                         \n \n(print (ans (1- *n*)))", "language": "Lisp", "metadata": {"date": 1572275695, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s551431918.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s551431918", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n \n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n \n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element nil))\n \n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n \n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n \n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n \n(defun ans (i)\n  (cond\n    ((aref *dp* i) (aref *dp* i))\n    (t (setf (aref *dp* i) (min\n                            (+ (ans (- i 1)) (cost i 1))\n                            (+ (ans (- i 2)) (cost i 2))\n                            )))))\n                                         \n \n(print (ans (1- *n*)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1129, "cpu_time_ms": 206, "memory_kb": 68540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s999199867", "group_id": "codeNet:p03160", "input_text": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n \n(defconstant inf 1000000)\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n \n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element inf))\n \n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n \n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n \n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n \n(defun ans (i)\n  (cond\n    ((< (aref *dp* i) inf) (aref *dp* i))\n    (t (setf (aref *dp* i) (min\n                            (+ (ans (- i 1)) (cost i 1))\n                            (+ (ans (- i 2)) (cost i 2))\n                            )))))\n                                         \n\n(print (ans (1- *n*)))", "language": "Lisp", "metadata": {"date": 1572263038, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s999199867.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s999199867", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n \n(defconstant inf 1000000)\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n \n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element inf))\n \n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n \n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n \n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n \n(defun ans (i)\n  (cond\n    ((< (aref *dp* i) inf) (aref *dp* i))\n    (t (setf (aref *dp* i) (min\n                            (+ (ans (- i 1)) (cost i 1))\n                            (+ (ans (- i 2)) (cost i 2))\n                            )))))\n                                         \n\n(print (ans (1- *n*)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1162, "cpu_time_ms": 2112, "memory_kb": 68540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s222296824", "group_id": "codeNet:p03160", "input_text": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n \n(defconstant inf 1000000)\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n \n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element inf))\n \n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n \n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n \n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n \n(defun ans (i)\n  (cond\n    ((< (aref *dp* i) inf) (aref *dp* i))\n    (t (setf (aref *dp* i) (min\n                            (+ (ans (- i 1)) (cost i 1))\n                            (+ (ans (- i 2)) (cost i ))\n                            )))))\n                                         \n\n(print (ans (1- *n*)))", "language": "Lisp", "metadata": {"date": 1572262951, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s222296824.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s222296824", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n \n(defconstant inf 1000000)\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n \n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element inf))\n \n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n \n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n \n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n \n(defun ans (i)\n  (cond\n    ((< (aref *dp* i) inf) (aref *dp* i))\n    (t (setf (aref *dp* i) (min\n                            (+ (ans (- i 1)) (cost i 1))\n                            (+ (ans (- i 2)) (cost i ))\n                            )))))\n                                         \n\n(print (ans (1- *n*)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1161, "cpu_time_ms": 226, "memory_kb": 68664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s161976632", "group_id": "codeNet:p03160", "input_text": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n \n(defconstant inf 1000000)\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n \n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element inf))\n \n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n \n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n \n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n \n(defun ans (i)\n  (cond\n    ((< (aref *dp* i) inf) (aref *dp* i))\n    (t\n     (let ((m (min\n               (+ (ans (- i 1)) (cost i 1))\n               (+ (ans (- i 2)) (cost i 2)))))\n       (setf (aref *dp* i) m)))))\n \n \n(print (ans (1- *n*)))", "language": "Lisp", "metadata": {"date": 1572261498, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s161976632.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s161976632", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n \n(defconstant inf 1000000)\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n \n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element inf))\n \n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n \n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n \n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n \n(defun ans (i)\n  (cond\n    ((< (aref *dp* i) inf) (aref *dp* i))\n    (t\n     (let ((m (min\n               (+ (ans (- i 1)) (cost i 1))\n               (+ (ans (- i 2)) (cost i 2)))))\n       (setf (aref *dp* i) m)))))\n \n \n(print (ans (1- *n*)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1094, "cpu_time_ms": 2112, "memory_kb": 68540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s481487392", "group_id": "codeNet:p03160", "input_text": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defconstant inf 1000000)\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element inf))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((< (aref *dp* i) inf) (aref *dp* i))\n    (t\n     (let ((m (min\n               (+ (ans (- i 1)) (cost i 1))\n               (+ (ans (- i 2)) (cost i 2)))))\n       (setf (aref *dp* i) m)))))\n\n\n(print (ans (1- *n*)))", "language": "Lisp", "metadata": {"date": 1572205416, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s481487392.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s481487392", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defconstant inf 1000000)\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element inf))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((< (aref *dp* i) inf) (aref *dp* i))\n    (t\n     (let ((m (min\n               (+ (ans (- i 1)) (cost i 1))\n               (+ (ans (- i 2)) (cost i 2)))))\n       (setf (aref *dp* i) m)))))\n\n\n(print (ans (1- *n*)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1086, "cpu_time_ms": 2112, "memory_kb": 68540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s864014834", "group_id": "codeNet:p03160", "input_text": "(defconstant inf 1000000)\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element inf))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((< (aref *dp* i) inf) (aref *dp* i))\n    (t\n     (let ((m (min\n               (+ (ans (- i 1)) (cost i 1))\n               (+ (ans (- i 2)) (cost i 2)))))\n       (setf (aref *dp* i) m)))))\n\n\n(print (ans (1- *n*)))", "language": "Lisp", "metadata": {"date": 1572205384, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s864014834.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s864014834", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defconstant inf 1000000)\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element inf))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((< (aref *dp* i) inf) (aref *dp* i))\n    (t\n     (let ((m (min\n               (+ (ans (- i 1)) (cost i 1))\n               (+ (ans (- i 2)) (cost i 2)))))\n       (setf (aref *dp* i) m)))))\n\n\n(print (ans (1- *n*)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 648, "cpu_time_ms": 521, "memory_kb": 62560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s433737847", "group_id": "codeNet:p03160", "input_text": "(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n*))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t\n     (if (not (equal (aref *dp* i) nil)) (aref *dp* i)\n      (setf (aref *dp* i)\n       (min\n        (+ (ans (- i 1)) (cost i 1))\n        (+ (ans (- i 2)) (cost i 2))))))))\n\n(ans (1- *n*))\n(print (aref *dp* (1- *n*)))\n", "language": "Lisp", "metadata": {"date": 1572204280, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s433737847.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s433737847", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n*))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t\n     (if (not (equal (aref *dp* i) nil)) (aref *dp* i)\n      (setf (aref *dp* i)\n       (min\n        (+ (ans (- i 1)) (cost i 1))\n        (+ (ans (- i 2)) (cost i 2))))))))\n\n(ans (1- *n*))\n(print (aref *dp* (1- *n*)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 658, "cpu_time_ms": 188, "memory_kb": 59112}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s394840784", "group_id": "codeNet:p03160", "input_text": "(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n*))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t\n     (if (not (equal (aref *dp* i) nil)) (aref *dp* i)\n      (setf (aref *dp* i)\n       (min\n        (+ (ans (- i 1)) (cost i 1))\n        (+ (ans (- i 2)) (cost i 2))))))))\n\n(ans (1- *n*))\n(print *dp*)\n(print (aref *dp* (1- *n*)))\n", "language": "Lisp", "metadata": {"date": 1572204186, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s394840784.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s394840784", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n*))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t\n     (if (not (equal (aref *dp* i) nil)) (aref *dp* i)\n      (setf (aref *dp* i)\n       (min\n        (+ (ans (- i 1)) (cost i 1))\n        (+ (ans (- i 2)) (cost i 2))))))))\n\n(ans (1- *n*))\n(print *dp*)\n(print (aref *dp* (1- *n*)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 671, "cpu_time_ms": 300, "memory_kb": 59364}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s010893682", "group_id": "codeNet:p03160", "input_text": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n*))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t\n     (if (not (equal (aref *dp* i) nil)) (aref *dp* i)\n      (setf (aref *dp* i)\n       (min\n        (+ (ans (- i 1)) (cost i 1))\n        (+ (ans (- i 2)) (cost i 2))))))))\n\n\n\n(ans (1- *n*))\n(print (aref *dp* (1- *n*)))\n", "language": "Lisp", "metadata": {"date": 1572203976, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s010893682.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s010893682", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n*))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t\n     (if (not (equal (aref *dp* i) nil)) (aref *dp* i)\n      (setf (aref *dp* i)\n       (min\n        (+ (ans (- i 1)) (cost i 1))\n        (+ (ans (- i 2)) (cost i 2))))))))\n\n\n\n(ans (1- *n*))\n(print (aref *dp* (1- *n*)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1098, "cpu_time_ms": 193, "memory_kb": 61884}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s419415665", "group_id": "codeNet:p03160", "input_text": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n*))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t (setf (aref *dp* i)\n        (min\n         (+ (ans (- i 1)) (cost i 1))\n         (+ (ans (- i 2)) (cost i 2)))))))\n\n(ans (1- *n*))\n(print (aref *dp* (1- *n*)))", "language": "Lisp", "metadata": {"date": 1572203412, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s419415665.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s419415665", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n*))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n(setf (aref *dp* 1) (cost 1 1))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t (setf (aref *dp* i)\n        (min\n         (+ (ans (- i 1)) (cost i 1))\n         (+ (ans (- i 2)) (cost i 2)))))))\n\n(ans (1- *n*))\n(print (aref *dp* (1- *n*)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1036, "cpu_time_ms": 2112, "memory_kb": 68024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s558332321", "group_id": "codeNet:p03160", "input_text": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n*))\n\n;*hi*の初期化\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t (setf (aref *dp* i)\n        (min\n         (+ (ans (- i 1)) (cost i 1))\n         (+ (ans (- i 2)) (cost i 2)))))))\n\n(ans (1- *n*))\n(print (aref *dp* (1- *n*)))\n", "language": "Lisp", "metadata": {"date": 1572203314, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s558332321.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s558332321", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n*))\n\n;*hi*の初期化\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t (setf (aref *dp* i)\n        (min\n         (+ (ans (- i 1)) (cost i 1))\n         (+ (ans (- i 2)) (cost i 2)))))))\n\n(ans (1- *n*))\n(print (aref *dp* (1- *n*)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 974, "cpu_time_ms": 2112, "memory_kb": 68028}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s010596209", "group_id": "codeNet:p03160", "input_text": "(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t (min\n        (+ (ans (- i 1)) (cost i 1))\n        (+ (ans (- i 2)) (cost i 2))))))\n\n\n(print (ans (1- *n*)))\n", "language": "Lisp", "metadata": {"date": 1572202589, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s010596209.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s010596209", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defvar *n* (read))\n(defvar *hi* (make-array *n*))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n(defun ans (i)\n  (cond\n    ((equal i 0) 0)\n    ((equal i 1) (cost 1 1))\n    (t (min\n        (+ (ans (- i 1)) (cost i 1))\n        (+ (ans (- i 2)) (cost i 2))))))\n\n\n(print (ans (1- *n*)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 376, "cpu_time_ms": 534, "memory_kb": 60516}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s511248703", "group_id": "codeNet:p03160", "input_text": "(defun carmincost (rest done mincosts)\n  \"To compute minimum cost to car of rest.\"\n  (let ((dest (car rest)))\n    (apply #'min (remove nil (mapcar (lambda (depth)\n\t\t\t\t       (let ((from (nth depth done))\n\t\t\t\t\t     (mincost (nth depth mincosts)))\n\t\t\t\t\t (when from\n\t\t\t\t\t   (+ mincost (abs (- dest from))))\n\t\t\t\t\t ))\n\t\t\t\t     '(0 1))))))\n(defun solve (initial-list)\n  (labels ((aux (rest done mincosts)\n\t     (if rest\n\t\t (let ((mincost (carmincost rest done mincosts)))\n\t\t   (aux (cdr rest) (cons (car rest) done) (cons mincost mincosts)))\n\t\t (car mincosts))\n\t     ))\n    (aux (cdr initial-list) (list (car initial-list)) '(0))))\n(let* ((n (read))\n       (initial-list (loop for i from 1 to n\n\t\t\tcollect (read))))\n  (princ (solve initial-list))\n  (princ #\\newline))\n", "language": "Lisp", "metadata": {"date": 1557950654, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s511248703.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s511248703", "user_id": "u320354968"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defun carmincost (rest done mincosts)\n  \"To compute minimum cost to car of rest.\"\n  (let ((dest (car rest)))\n    (apply #'min (remove nil (mapcar (lambda (depth)\n\t\t\t\t       (let ((from (nth depth done))\n\t\t\t\t\t     (mincost (nth depth mincosts)))\n\t\t\t\t\t (when from\n\t\t\t\t\t   (+ mincost (abs (- dest from))))\n\t\t\t\t\t ))\n\t\t\t\t     '(0 1))))))\n(defun solve (initial-list)\n  (labels ((aux (rest done mincosts)\n\t     (if rest\n\t\t (let ((mincost (carmincost rest done mincosts)))\n\t\t   (aux (cdr rest) (cons (car rest) done) (cons mincost mincosts)))\n\t\t (car mincosts))\n\t     ))\n    (aux (cdr initial-list) (list (car initial-list)) '(0))))\n(let* ((n (read))\n       (initial-list (loop for i from 1 to n\n\t\t\tcollect (read))))\n  (princ (solve initial-list))\n  (princ #\\newline))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 762, "cpu_time_ms": 198, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s500339382", "group_id": "codeNet:p03160", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype int32 () '(signed-byte 32))\n\n(defun main ()\n  (let* ((n (the int32 (read)))\n         (k (the int32 (read)))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (the int32 (read))))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         while (< j n)\n         do\n           (setf (aref dp j) (min (aref dp j) nval))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n;; (defun main2 ()\n;;   (let* ((n (the int32 (read)))\n;;          (k (the int32 (read)))\n;;          (a (make-array n :element-type 'int32))\n;;          (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n;;     (let ((stream (make-string-input-stream (read-line))))\n;;       (loop for i from 0\n;;          for j = (read stream nil) until (null j)\n;;          do (setf (aref a i) (the int32 j)))\n;;     (setf (aref dp 0) 0)\n;;     (loop for i of-type int32 from 0 below n do\n;;       (loop with from-val of-type int32 = (aref dp i)\n;;          for j of-type int32 from (1+ i) to (+ i k)\n;;          while (< j n)\n;;          do\n;;            (let ((nval (the int32 (+ from-val (abs (- (aref a i) (aref a j)))))))\n;;              (setf (aref dp j) (min (aref dp j) nval)))\n;;     (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n", "language": "Lisp", "metadata": {"date": 1555362782, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s500339382.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s500339382", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype int32 () '(signed-byte 32))\n\n(defun main ()\n  (let* ((n (the int32 (read)))\n         (k (the int32 (read)))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (the int32 (read))))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         while (< j n)\n         do\n           (setf (aref dp j) (min (aref dp j) nval))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n;; (defun main2 ()\n;;   (let* ((n (the int32 (read)))\n;;          (k (the int32 (read)))\n;;          (a (make-array n :element-type 'int32))\n;;          (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n;;     (let ((stream (make-string-input-stream (read-line))))\n;;       (loop for i from 0\n;;          for j = (read stream nil) until (null j)\n;;          do (setf (aref a i) (the int32 j)))\n;;     (setf (aref dp 0) 0)\n;;     (loop for i of-type int32 from 0 below n do\n;;       (loop with from-val of-type int32 = (aref dp i)\n;;          for j of-type int32 from (1+ i) to (+ i k)\n;;          while (< j n)\n;;          do\n;;            (let ((nval (the int32 (+ from-val (abs (- (aref a i) (aref a j)))))))\n;;              (setf (aref dp j) (min (aref dp j) nval)))\n;;     (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1647, "cpu_time_ms": 190, "memory_kb": 59876}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s746175715", "group_id": "codeNet:p03160", "input_text": "(defun main ()\n  (let* ((n (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (dotimes (i n)\n      (setf (aref a i) (read)))\n    (flet ((relax (from to)\n             (let* ((from-val (aref dp from))\n                    (to-val (aref dp to))\n                    (diff (abs (- (aref a to) (aref a from)))))\n               (setf (aref dp to) (min to-val (+ from-val diff))))))\n      (setf (aref dp 0) 0)\n      (dotimes (i n)\n        (when (< (+ i 1) n) (relax i (+ i 1)))\n        (when (< (+ i 2) n) (relax i (+ i 2)))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1555284773, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s746175715.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s746175715", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (dotimes (i n)\n      (setf (aref a i) (read)))\n    (flet ((relax (from to)\n             (let* ((from-val (aref dp from))\n                    (to-val (aref dp to))\n                    (diff (abs (- (aref a to) (aref a from)))))\n               (setf (aref dp to) (min to-val (+ from-val diff))))))\n      (setf (aref dp 0) 0)\n      (dotimes (i n)\n        (when (< (+ i 1) n) (relax i (+ i 1)))\n        (when (< (+ i 2) n) (relax i (+ i 2)))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 679, "cpu_time_ms": 196, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s474044706", "group_id": "codeNet:p03160", "input_text": "#-(or child-sbcl swank)\n(quit\n :unix-status\n (process-exit-code\n  (run-program *runtime-pathname*\n               '(\"--control-stack-size\" \"32MB\"\n                 \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                 \"--eval\" \"(push :child-sbcl *features*)\"\n                 \"--script\" #.(namestring *load-pathname*))\n               :output t :error t :input t)))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n(declaim (inline split-ints-into-vector))\n(defun split-ints-into-vector (str dest-arr &key (offset 0))\n  (declare ((simple-array * (*)) dest-arr)\n           ((integer 0 #.most-positive-fixnum) offset))\n  (loop for idx from offset below (length dest-arr)\n        for pos1 = 0 then (1+ pos2)\n        for pos2 = (position #\\space str :start pos1 :test #'char=)\n        do (setf (aref dest-arr idx)\n                 (parse-integer str :start pos1 :end pos2))\n        finally (return dest-arr)))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (hs)\n  (declare #.OPT\n           ((simple-array uint32 (*)) hs))\n  (let ((dest (- (length hs) 1)))\n    (with-memoizing (:array (100001) :element-type 'uint32\n                     :initial-element #.(- (expt 2 32) 1))\n      (nlet recurse ((i 0))\n        (cond ((= i dest) 0)\n              ((= i (- dest 1))\n               (+ (abs (- (aref hs i) (aref hs (+ i 1))))\n                  (recurse (+ i 1))))\n              (t (min (+ (abs (- (aref hs i) (aref hs (+ i 1))))\n                         (recurse (+ i 1)))\n                      (+ (abs (- (aref hs i) (aref hs (+ i 2))))\n                         (recurse (+ i 2))))))))))\n(defun main ()\n  (let* ((n (read))\n         (hs (make-array n :element-type 'uint32)))\n    (split-ints-into-vector (read-line) hs)\n    (println (solve hs))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1546888842, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Lisp/s474044706.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s474044706", "user_id": "u352600849"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-(or child-sbcl swank)\n(quit\n :unix-status\n (process-exit-code\n  (run-program *runtime-pathname*\n               '(\"--control-stack-size\" \"32MB\"\n                 \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                 \"--eval\" \"(push :child-sbcl *features*)\"\n                 \"--script\" #.(namestring *load-pathname*))\n               :output t :error t :input t)))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n(declaim (inline split-ints-into-vector))\n(defun split-ints-into-vector (str dest-arr &key (offset 0))\n  (declare ((simple-array * (*)) dest-arr)\n           ((integer 0 #.most-positive-fixnum) offset))\n  (loop for idx from offset below (length dest-arr)\n        for pos1 = 0 then (1+ pos2)\n        for pos2 = (position #\\space str :start pos1 :test #'char=)\n        do (setf (aref dest-arr idx)\n                 (parse-integer str :start pos1 :end pos2))\n        finally (return dest-arr)))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (hs)\n  (declare #.OPT\n           ((simple-array uint32 (*)) hs))\n  (let ((dest (- (length hs) 1)))\n    (with-memoizing (:array (100001) :element-type 'uint32\n                     :initial-element #.(- (expt 2 32) 1))\n      (nlet recurse ((i 0))\n        (cond ((= i dest) 0)\n              ((= i (- dest 1))\n               (+ (abs (- (aref hs i) (aref hs (+ i 1))))\n                  (recurse (+ i 1))))\n              (t (min (+ (abs (- (aref hs i) (aref hs (+ i 1))))\n                         (recurse (+ i 1)))\n                      (+ (abs (- (aref hs i) (aref hs (+ i 2))))\n                         (recurse (+ i 2))))))))))\n(defun main ()\n  (let* ((n (read))\n         (hs (make-array n :element-type 'uint32)))\n    (split-ints-into-vector (read-line) hs)\n    (println (solve hs))))\n\n#-swank(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8922, "cpu_time_ms": 154, "memory_kb": 31804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s340129383", "group_id": "codeNet:p03161", "input_text": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(declaim (inline read-numbers-to-list))\n(defun read-numbers-to-list (size)\n  (loop repeat size collect (read-fixnum)))\n\n(declaim (inline read-numbers-to-array))\n(defun read-numbers-to-array (size)\n  (let ((arr (make-array size\n                         :element-type 'fixnum\n                         :adjustable nil)))\n    (declare ((array fixnum 1) arr))\n    (loop for i of-type fixnum below size do\n         (setf (aref arr i) (read-fixnum))\n       finally\n         (return arr))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(declaim (inline princ-for-each-line))\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(declaim (inline iota))\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(declaim (inline int->lst))\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(declaim (inline lst->int))\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n(defparameter *inf* 1000000001)\n\n(declaim (inline solve main))\n(defun solve (n k h)\n  (declare (uint32 n)\n           (uint8 k)\n           ((array fixnum 1)))\n  (let ((memo (make-array (+ n 110)\n                          :element-type 'fixnum\n                          :adjustable nil\n                          :initial-element *inf*)))\n    (declare ((array fixnum 1) memo))\n    (setf (aref memo 0) 0)\n    (dotimes (i n)\n      (dotimes (j k)\n        (minf (aref memo (+ i j 1))\n              (+ (aref memo i)\n                 (abs (- (aref h (min (+ i j 1) (1- n)))\n                         (aref h i)))))))\n    (aref memo (1- n))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (k (read)))\n    (declare (uint32 n)\n             (uint8 k))\n    (let ((h (read-numbers-to-array n)))\n      (declare ((array fixnum 1) h))\n      (princ (solve n k h))\n      (fresh-line))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600714624, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s340129383.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s340129383", "user_id": "u425762225"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(declaim (inline read-numbers-to-list))\n(defun read-numbers-to-list (size)\n  (loop repeat size collect (read-fixnum)))\n\n(declaim (inline read-numbers-to-array))\n(defun read-numbers-to-array (size)\n  (let ((arr (make-array size\n                         :element-type 'fixnum\n                         :adjustable nil)))\n    (declare ((array fixnum 1) arr))\n    (loop for i of-type fixnum below size do\n         (setf (aref arr i) (read-fixnum))\n       finally\n         (return arr))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(declaim (inline princ-for-each-line))\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(declaim (inline iota))\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(declaim (inline int->lst))\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(declaim (inline lst->int))\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n(defparameter *inf* 1000000001)\n\n(declaim (inline solve main))\n(defun solve (n k h)\n  (declare (uint32 n)\n           (uint8 k)\n           ((array fixnum 1)))\n  (let ((memo (make-array (+ n 110)\n                          :element-type 'fixnum\n                          :adjustable nil\n                          :initial-element *inf*)))\n    (declare ((array fixnum 1) memo))\n    (setf (aref memo 0) 0)\n    (dotimes (i n)\n      (dotimes (j k)\n        (minf (aref memo (+ i j 1))\n              (+ (aref memo i)\n                 (abs (- (aref h (min (+ i j 1) (1- n)))\n                         (aref h i)))))))\n    (aref memo (1- n))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (k (read)))\n    (declare (uint32 n)\n             (uint8 k))\n    (let ((h (read-numbers-to-array n)))\n      (declare ((array fixnum 1) h))\n      (princ (solve n k h))\n      (fresh-line))))\n\n#-swank (main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8669, "cpu_time_ms": 116, "memory_kb": 28004}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s880911041", "group_id": "codeNet:p03161", "input_text": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(declaim (inline read-numbers-to-list))\n(defun read-numbers-to-list (size)\n  (loop repeat size collect (read-fixnum)))\n\n(declaim (inline read-numbers-to-array))\n(defun read-numbers-to-array (size)\n  (let ((arr (make-array size\n                         :element-type 'fixnum\n                         :adjustable nil)))\n    (declare ((array fixnum 1) arr))\n    (loop for i of-type fixnum below size do\n         (setf (aref arr i) (read-fixnum))\n       finally\n         (return arr))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(declaim (inline princ-for-each-line))\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(declaim (inline iota))\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(declaim (inline int->lst))\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(declaim (inline lst->int))\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n(defparameter *inf* 1000000001)\n\n(declaim (inline solve main))\n(defun solve (n k h)\n  (let ((memo (make-array (+ n 110)\n                          :element-type 'fixnum\n                          :adjustable nil\n                          :initial-element *inf*)))\n    (declare ((array fixnum 1) memo))\n    (setf (aref memo 0) 0)\n    (dotimes (i n)\n      (dotimes (j k)\n        (when (< (+ i j 1) n)\n          (minf (aref memo (+ i j 1))\n                (+ (aref memo i)\n                   (abs (- (aref h (+ i j 1))\n                           (aref h i))))))))\n    (aref memo (1- n))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (k (read)))\n    (declare (uint32 n)\n             (uint8 k))\n    (let ((h (read-numbers-to-array n)))\n      (declare ((array fixnum 1) h))\n      (princ (solve n k h))\n      (fresh-line))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600713710, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s880911041.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s880911041", "user_id": "u425762225"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#|\n------------------------------------\n                Utils                \n------------------------------------\n|#\n\n(in-package :cl-user)\n\n(defconstant +mod+ 1000000007)\n;(defconstant +mod+ 998244353)\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n                ,(if (member :swank *features*)\n                     `(read-char ,in nil #\\Newline) ; on SLIME\n                     `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n                     (return (values ,buffer ,idx))))))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n(declaim (inline read-numbers-to-list))\n(defun read-numbers-to-list (size)\n  (loop repeat size collect (read-fixnum)))\n\n(declaim (inline read-numbers-to-array))\n(defun read-numbers-to-array (size)\n  (let ((arr (make-array size\n                         :element-type 'fixnum\n                         :adjustable nil)))\n    (declare ((array fixnum 1) arr))\n    (loop for i of-type fixnum below size do\n         (setf (aref arr i) (read-fixnum))\n       finally\n         (return arr))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (buffered-read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(declaim (inline princ-for-each-line))\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(declaim (inline unwrap))\n(defun unwrap (list)\n  (the string\n       (format nil \"~{~a~^ ~}\" list)))\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n(defmacro maxf (place cand)\n  `(setf ,place (max ,place ,cand)))\n\n(defmacro minf (place cand)\n  `(setf ,place (min ,place ,cand)))\n\n(defmacro modf (place &optional (m +mod+))\n  `(setf ,place (mod ,place ,m)))\n\n(defmacro alambda (parms &body body)\n  `(labels ((self ,parms ,@body))\n     #'self))\n\n(declaim (inline iota))\n(defun iota (count &optional (start 0) (step 1))\n  (loop for i from 0 below count collect (+ start (* i step))))\n\n(declaim (inline int->lst))\n(defun int->lst (integer)\n  (declare ((integer 0) integer))\n  (labels ((sub (int &optional (acc nil))\n             (declare ((integer 0) int)\n                      (list acc))\n             (if (zerop int)\n                 acc\n                 (sub (floor int 10) (cons (rem int 10) acc)))))\n    (sub integer)))\n\n(declaim (inline lst->int))\n(defun lst->int (list)\n  (declare (list list))\n  (labels ((sub (xs &optional (acc 0))\n             (declare (ftype (function (list &optional (integer 0)) (integer 0)) sub))\n             (declare (list xs)\n                      ((integer 0) acc))\n             (if (null xs)\n                 acc\n                 (sub (rest xs) (+ (* acc 10)\n                                   (rem (first xs) 10))))))\n    (the fixnum\n         (sub list))))\n\n(defun int->str (integer)\n  (format nil \"~a\" integer))\n\n(defun str->int (str)\n  (parse-integer str))\n\n(defun char->int (char)\n  (declare (character char))\n  (- (char-code char) #.(char-code #\\0)))\n\n(declaim (inline prime-factorize-to-list))\n(defun prime-factorize-to-list (integer)\n  (declare ((integer 0) integer))\n  (the list\n       (if (<= integer 1)\n           nil\n           (loop\n              while (<= (* f f) integer)\n              with acc list = nil\n              with f integer = 2\n              do\n                (if (zerop (rem integer f))\n                    (progn\n                      (push f acc)\n                      (setq integer (floor integer f)))\n                    (incf f))\n              finally\n                (when (/= integer 1)\n                  (push integer acc))\n                (return (reverse acc))))))\n\n(declaim (inline prime-p))\n(defun prime-p (integer)\n  (declare ((integer 1) integer))\n  (if (= integer 1)\n      nil\n      (loop\n         with f = 2\n         while (<= (* f f) integer)\n         do\n           (when (zerop (rem integer f))\n             (return nil))\n           (incf f)\n         finally\n           (return t))))\n\n\n#|\n------------------------------------\n                Body                \n------------------------------------\n|#\n\n(defparameter *inf* 1000000001)\n\n(declaim (inline solve main))\n(defun solve (n k h)\n  (let ((memo (make-array (+ n 110)\n                          :element-type 'fixnum\n                          :adjustable nil\n                          :initial-element *inf*)))\n    (declare ((array fixnum 1) memo))\n    (setf (aref memo 0) 0)\n    (dotimes (i n)\n      (dotimes (j k)\n        (when (< (+ i j 1) n)\n          (minf (aref memo (+ i j 1))\n                (+ (aref memo i)\n                   (abs (- (aref h (+ i j 1))\n                           (aref h i))))))))\n    (aref memo (1- n))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((n (read))\n        (k (read)))\n    (declare (uint32 n)\n             (uint8 k))\n    (let ((h (read-numbers-to-array n)))\n      (declare ((array fixnum 1) h))\n      (princ (solve n k h))\n      (fresh-line))))\n\n#-swank (main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8621, "cpu_time_ms": 108, "memory_kb": 28012}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s734146391", "group_id": "codeNet:p03161", "input_text": "(defparameter *inf* (expt 10 9))\n\n(defun solve (n k h)\n  (let ((memo (make-array (+ n k 1) :initial-element *inf*)))\n    (setf (aref memo 0) 0)\n    (dotimes (x n)\n      (dotimes (i k)\n        (setf (aref memo (+ x (1+ i))) (min (aref memo (+ x (1+ i)))\n                                       (+ (aref memo x)\n                                          (abs (- (aref h (+ x (1+ i)))\n                                                  (aref h x))))))))\n    (aref memo (1- n))))\n\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (h (make-array 104000 :adjustable t :initial-element 0)))\n    (dotimes (i n)\n      (setf (aref h i) (read)))\n    (princ (solve n k h))\n    (fresh-line)))\n\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1594663091, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s734146391.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s734146391", "user_id": "u425762225"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defparameter *inf* (expt 10 9))\n\n(defun solve (n k h)\n  (let ((memo (make-array (+ n k 1) :initial-element *inf*)))\n    (setf (aref memo 0) 0)\n    (dotimes (x n)\n      (dotimes (i k)\n        (setf (aref memo (+ x (1+ i))) (min (aref memo (+ x (1+ i)))\n                                       (+ (aref memo x)\n                                          (abs (- (aref h (+ x (1+ i)))\n                                                  (aref h x))))))))\n    (aref memo (1- n))))\n\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (h (make-array 104000 :adjustable t :initial-element 0)))\n    (dotimes (i n)\n      (setf (aref h i) (read)))\n    (princ (solve n k h))\n    (fresh-line)))\n\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 703, "cpu_time_ms": 443, "memory_kb": 76984}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s433422381", "group_id": "codeNet:p03161", "input_text": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defconstant mod-number 1000000007)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (loop for b = (%read-byte)\n              and y = x then (+ (* y 10) (to-number b))\n              unless (number-char-p b)\n                return (the fixnum (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defun make-solve (n k h)\n  (let ((dp (make-array n :initial-element nil)))\n    (setf (aref dp 0) 0)\n    (labels ((solve (pos)\n               (let ((memo (aref dp pos)))\n                 (if memo\n                     memo\n                     (let ((ret (loop for i from 1 to k\n                                      if (>= (- pos i) 0)\n                                        minimize (+ (solve (- pos i))\n                                                    (abs (- (aref h pos) (aref h (- pos i))))))))\n                       (setf (aref dp pos) ret)\n                       ret)))))\n      #'solve)))\n\n(let* ((n (read))\n       (k (read))\n       (h (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) h))\n  (format t \"~A~%\" (funcall (make-solve n k h) (1- n))))\n\n", "language": "Lisp", "metadata": {"date": 1592873311, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s433422381.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s433422381", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defconstant mod-number 1000000007)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (loop for b = (%read-byte)\n              and y = x then (+ (* y 10) (to-number b))\n              unless (number-char-p b)\n                return (the fixnum (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defun make-solve (n k h)\n  (let ((dp (make-array n :initial-element nil)))\n    (setf (aref dp 0) 0)\n    (labels ((solve (pos)\n               (let ((memo (aref dp pos)))\n                 (if memo\n                     memo\n                     (let ((ret (loop for i from 1 to k\n                                      if (>= (- pos i) 0)\n                                        minimize (+ (solve (- pos i))\n                                                    (abs (- (aref h pos) (aref h (- pos i))))))))\n                       (setf (aref dp pos) ret)\n                       ret)))))\n      #'solve)))\n\n(let* ((n (read))\n       (k (read))\n       (h (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) h))\n  (format t \"~A~%\" (funcall (make-solve n k h) (1- n))))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3534, "cpu_time_ms": 306, "memory_kb": 36652}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s302378217", "group_id": "codeNet:p03161", "input_text": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              name*\n              `(\"--control-stack-size\" \"128MB\"\n                \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                \"--eval\" \"(push :child-sbcl *features*)\"\n                \"--script\" ,(namestring *load-pathname*))\n              :output t :error t :input t)))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defconstant mod-number 1000000007)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (loop for b = (%read-byte)\n              and y = x then (+ (* y 10) (to-number b))\n              unless (number-char-p b)\n                return (the fixnum (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defun make-solve (n k h)\n  (let ((dp (make-array n :initial-element nil)))\n    (setf (aref dp 0) 0)\n    (labels ((solve (pos)\n               (let ((memo (aref dp pos)))\n                 (if memo\n                     memo\n                     (let ((ret (loop for i from 1 to k\n                                      if (>= (- pos i) 0)\n                                        minimize (+ (solve (- pos i))\n                                                    (abs (- (aref h pos) (aref h (- pos i))))))))\n                       (setf (aref dp pos) ret)\n                       ret)))))\n      #'solve)))\n\n(let* ((n (read))\n       (k (read))\n       (h (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) h))\n  (format t \"~A~%\" (funcall (make-solve n k h) (1- n))))\n\n", "language": "Lisp", "metadata": {"date": 1592872969, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s302378217.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s302378217", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              name*\n              `(\"--control-stack-size\" \"128MB\"\n                \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                \"--eval\" \"(push :child-sbcl *features*)\"\n                \"--script\" ,(namestring *load-pathname*))\n              :output t :error t :input t)))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defconstant mod-number 1000000007)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (loop for b = (%read-byte)\n              and y = x then (+ (* y 10) (to-number b))\n              unless (number-char-p b)\n                return (the fixnum (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defun make-solve (n k h)\n  (let ((dp (make-array n :initial-element nil)))\n    (setf (aref dp 0) 0)\n    (labels ((solve (pos)\n               (let ((memo (aref dp pos)))\n                 (if memo\n                     memo\n                     (let ((ret (loop for i from 1 to k\n                                      if (>= (- pos i) 0)\n                                        minimize (+ (solve (- pos i))\n                                                    (abs (- (aref h pos) (aref h (- pos i))))))))\n                       (setf (aref dp pos) ret)\n                       ret)))))\n      #'solve)))\n\n(let* ((n (read))\n       (k (read))\n       (h (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) h))\n  (format t \"~A~%\" (funcall (make-solve n k h) (1- n))))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3355, "cpu_time_ms": 22, "memory_kb": 26760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s324948138", "group_id": "codeNet:p03161", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defconstant mod-number 1000000007)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (loop for b = (%read-byte)\n              and y = x then (+ (* y 10) (to-number b))\n              unless (number-char-p b)\n                return (the fixnum (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defun make-solve (n k h)\n  (let ((dp (make-array n :initial-element nil)))\n    (setf (aref dp 0) 0)\n    (labels ((solve (pos)\n               (let ((memo (aref dp pos)))\n                 (if memo\n                     memo\n                     (let ((ret (loop for i from 1 to k\n                                      if (>= (- pos i) 0)\n                                        minimize (+ (solve (- pos i))\n                                                    (abs (- (aref h pos) (aref h (- pos i))))))))\n                       (setf (aref dp pos) ret)\n                       ret)))))\n      #'solve)))\n\n(let* ((n (read))\n       (k (read))\n       (h (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) h))\n  (format t \"~A~%\" (funcall (make-solve n k h) (1- n))))\n\n", "language": "Lisp", "metadata": {"date": 1592872772, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s324948138.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s324948138", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(defconstant mod-number 1000000007)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (loop for b = (%read-byte)\n              and y = x then (+ (* y 10) (to-number b))\n              unless (number-char-p b)\n                return (the fixnum (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defun make-solve (n k h)\n  (let ((dp (make-array n :initial-element nil)))\n    (setf (aref dp 0) 0)\n    (labels ((solve (pos)\n               (let ((memo (aref dp pos)))\n                 (if memo\n                     memo\n                     (let ((ret (loop for i from 1 to k\n                                      if (>= (- pos i) 0)\n                                        minimize (+ (solve (- pos i))\n                                                    (abs (- (aref h pos) (aref h (- pos i))))))))\n                       (setf (aref dp pos) ret)\n                       ret)))))\n      #'solve)))\n\n(let* ((n (read))\n       (k (read))\n       (h (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) h))\n  (format t \"~A~%\" (funcall (make-solve n k h) (1- n))))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3369, "cpu_time_ms": 321, "memory_kb": 36656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s532920216", "group_id": "codeNet:p03161", "input_text": "(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 0) (debug 3) (safety 3))))\n\n(defconstant mod-number 1000000007)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defun make-solve (n k h)\n  (let ((dp (make-array n :initial-element nil)))\n    (setf (aref dp 0) 0)\n    (labels ((solve (pos)\n               (let ((memo (aref dp pos)))\n                 (if memo\n                     memo\n                     (let ((ret (loop for i from 1 to k\n                                      if (>= (- pos i) 0)\n                                        minimize (+ (solve (- pos i))\n                                                    (abs (- (aref h pos) (aref h (- pos i))))))))\n                       (setf (aref dp pos) ret)\n                       ret)))))\n      #'solve)))\n\n(let* ((n (read))\n       (k (read))\n       (h (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) h))\n  (funcall (make-solve n k h) (1- n)))\n\n", "language": "Lisp", "metadata": {"date": 1592872392, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s532920216.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s532920216", "user_id": "u684901760"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 0) (debug 3) (safety 3))))\n\n(defconstant mod-number 1000000007)\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (reverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defun make-solve (n k h)\n  (let ((dp (make-array n :initial-element nil)))\n    (setf (aref dp 0) 0)\n    (labels ((solve (pos)\n               (let ((memo (aref dp pos)))\n                 (if memo\n                     memo\n                     (let ((ret (loop for i from 1 to k\n                                      if (>= (- pos i) 0)\n                                        minimize (+ (solve (- pos i))\n                                                    (abs (- (aref h pos) (aref h (- pos i))))))))\n                       (setf (aref dp pos) ret)\n                       ret)))))\n      #'solve)))\n\n(let* ((n (read))\n       (k (read))\n       (h (make-array n :adjustable t :fill-pointer 0)))\n  (dotimes (i n)\n    (vector-push (read-integer) h))\n  (funcall (make-solve n k h) (1- n)))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2941, "cpu_time_ms": 39, "memory_kb": 27868}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s970957809", "group_id": "codeNet:p03161", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defvar n (read))\n(defvar k (read))\n(defvar h (coerce (loop repeat n collect (read)) 'vector))\n\n(defun cul-cost (from to)\n  (labels ((height (x)\n             (if (>= x n) (expt 10 10)\n                 (aref h x))))\n    (abs (- (height from) (height to)))))\n\n(dp func (x) '(100010)\n    (if (>= x (1- n)) 0\n        (apply #'min\n               (loop for i from 1 to k\n                     collect (+ (cul-cost x (+ x i)) (func (+ x i)))))))\n\n(princ (func 0))\n\n", "language": "Lisp", "metadata": {"date": 1584487060, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s970957809.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s970957809", "user_id": "u493610446"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defvar n (read))\n(defvar k (read))\n(defvar h (coerce (loop repeat n collect (read)) 'vector))\n\n(defun cul-cost (from to)\n  (labels ((height (x)\n             (if (>= x n) (expt 10 10)\n                 (aref h x))))\n    (abs (- (height from) (height to)))))\n\n(dp func (x) '(100010)\n    (if (>= x (1- n)) 0\n        (apply #'min\n               (loop for i from 1 to k\n                     collect (+ (cul-cost x (+ x i)) (func (+ x i)))))))\n\n(princ (func 0))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1359, "cpu_time_ms": 1076, "memory_kb": 232504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s561199601", "group_id": "codeNet:p03161", "input_text": "(deftype uint32 () '(unsigned-byte 32))\n\n(defun solve (n k h)\n  (let ((costs (make-array n :element-type 'uint32)))\n    (loop for i from 0 below n\n          do (setf (aref costs i)\n                   (loop for d from 1 to k\n                         minimize (+ (aref costs (max 0 (- i d)))\n                                     (abs (- (aref h (max 0 (- i d)))\n                                             (aref h i)))))))\n    (aref costs (1- n))))\n\n#-swank\n(let* ((n (read))\n       (k (read))\n       (h (make-array n :element-type 'uint32)))\n  (loop for i from 0 below n\n        do (setf (aref h i) (read)))\n  (format t \"~A~%\" (solve n k h)))\n", "language": "Lisp", "metadata": {"date": 1580224611, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s561199601.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s561199601", "user_id": "u202886318"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(deftype uint32 () '(unsigned-byte 32))\n\n(defun solve (n k h)\n  (let ((costs (make-array n :element-type 'uint32)))\n    (loop for i from 0 below n\n          do (setf (aref costs i)\n                   (loop for d from 1 to k\n                         minimize (+ (aref costs (max 0 (- i d)))\n                                     (abs (- (aref h (max 0 (- i d)))\n                                             (aref h i)))))))\n    (aref costs (1- n))))\n\n#-swank\n(let* ((n (read))\n       (k (read))\n       (h (make-array n :element-type 'uint32)))\n  (loop for i from 0 below n\n        do (setf (aref h i) (read)))\n  (format t \"~A~%\" (solve n k h)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 643, "cpu_time_ms": 549, "memory_kb": 57828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s938404464", "group_id": "codeNet:p03161", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((result (loop (let ((byte (%read-byte)))\n                           (when (<= 48 byte)\n                             (return (- byte 48)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return result)))))))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; Body\n\n(define-modify-macro minf (new-value) min)\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array 100000 :element-type '(unsigned-byte 31)))\n         (dp (make-array 100000 :element-type '(unsigned-byte 31) :initial-element #x7fffffff)))\n    (declare ((unsigned-byte 31) n k))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (setf (aref hs i) (read-fixnum)))\n    (dotimes (i n)\n      (let ((h (aref hs i))\n            (d (aref dp i)))\n        (loop for dest from (+ i 1) to (min (+ i k) (- n 1))\n              do (minf (aref dp dest) (+ d (abs (- h (aref hs dest))))))))\n    (println (aref dp (- n 1)))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1579639190, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s938404464.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s938404464", "user_id": "u352600849"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((result (loop (let ((byte (%read-byte)))\n                           (when (<= 48 byte)\n                             (return (- byte 48)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return result)))))))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; Body\n\n(define-modify-macro minf (new-value) min)\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array 100000 :element-type '(unsigned-byte 31)))\n         (dp (make-array 100000 :element-type '(unsigned-byte 31) :initial-element #x7fffffff)))\n    (declare ((unsigned-byte 31) n k))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (setf (aref hs i) (read-fixnum)))\n    (dotimes (i n)\n      (let ((h (aref hs i))\n            (d (aref dp i)))\n        (loop for dest from (+ i 1) to (min (+ i k) (- n 1))\n              do (minf (aref dp dest) (+ d (abs (- h (aref hs dest))))))))\n    (println (aref dp (- n 1)))))\n\n#-swank (main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2137, "cpu_time_ms": 257, "memory_kb": 21988}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s563663129", "group_id": "codeNet:p03161", "input_text": "(defparameter *safe-aref-error* most-positive-fixnum)\n(defun safe-aref (array discript)\n  (if (not (minusp discript))\n      (aref array discript)\n      *safe-aref-error*))\n(let* ((n (read))\n       (m (read))\n       (arr (make-array n :initial-element 0 :element-type 'fixnum))\n       (dparr (make-array (1+ n) :initial-element most-positive-fixnum :element-type 'fixnum)))\n  (setf *safe-aref-error* 10000000)\n  (loop :for k :from 0 :upto (1- n) :do(setf (aref arr k) (read)))\n  (setf (aref dparr 0) 0)\n  (loop :for k :from 1 :upto (1- n)\n        :do (setf (aref dparr k)\n                  (loop :for j :from 1 :upto m\n                        :minimize (+ (safe-aref dparr (- k j))\n                                     (abs (- (safe-aref arr (- k j)) (aref arr k)))))))\n  (princ (aref dparr (1- n))))", "language": "Lisp", "metadata": {"date": 1576030006, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s563663129.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s563663129", "user_id": "u610490393"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defparameter *safe-aref-error* most-positive-fixnum)\n(defun safe-aref (array discript)\n  (if (not (minusp discript))\n      (aref array discript)\n      *safe-aref-error*))\n(let* ((n (read))\n       (m (read))\n       (arr (make-array n :initial-element 0 :element-type 'fixnum))\n       (dparr (make-array (1+ n) :initial-element most-positive-fixnum :element-type 'fixnum)))\n  (setf *safe-aref-error* 10000000)\n  (loop :for k :from 0 :upto (1- n) :do(setf (aref arr k) (read)))\n  (setf (aref dparr 0) 0)\n  (loop :for k :from 1 :upto (1- n)\n        :do (setf (aref dparr k)\n                  (loop :for j :from 1 :upto m\n                        :minimize (+ (safe-aref dparr (- k j))\n                                     (abs (- (safe-aref arr (- k j)) (aref arr k)))))))\n  (princ (aref dparr (1- n))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 799, "cpu_time_ms": 602, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s737504191", "group_id": "codeNet:p03161", "input_text": "(defparameter *safe-aref-error* most-positive-fixnum)\n(defun safe-aref (array discript)\n  (if (not (minusp discript))\n      (aref array discript)\n      *safe-aref-error*))\n(let* ((n (read))\n       (m (read))\n       (arr (make-array n :initial-element 0 :element-type 'fixnum))\n       (dparr (make-array (1+ n) :initial-element most-positive-fixnum :element-type 'fixnum)))\n  (setf *safe-aref-error* 10000000)\n  (loop :for k :from 0 :upto (1- n) :do(setf (aref arr k) (read)))\n  (setf (aref dparr 0) 0)\n  (loop :for k :from 1 :upto (1- n)\n        :do (setf (aref dparr k)\n                  (loop :for j :from 1 :upto m\n                        :minimize (+ (aref dparr k)\n                                     (abs (- (safe-aref arr (- k j)) (aref arr k)))))))\n  (princ (aref dparr (1- n))))\n", "language": "Lisp", "metadata": {"date": 1576029293, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s737504191.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s737504191", "user_id": "u610490393"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defparameter *safe-aref-error* most-positive-fixnum)\n(defun safe-aref (array discript)\n  (if (not (minusp discript))\n      (aref array discript)\n      *safe-aref-error*))\n(let* ((n (read))\n       (m (read))\n       (arr (make-array n :initial-element 0 :element-type 'fixnum))\n       (dparr (make-array (1+ n) :initial-element most-positive-fixnum :element-type 'fixnum)))\n  (setf *safe-aref-error* 10000000)\n  (loop :for k :from 0 :upto (1- n) :do(setf (aref arr k) (read)))\n  (setf (aref dparr 0) 0)\n  (loop :for k :from 1 :upto (1- n)\n        :do (setf (aref dparr k)\n                  (loop :for j :from 1 :upto m\n                        :minimize (+ (aref dparr k)\n                                     (abs (- (safe-aref arr (- k j)) (aref arr k)))))))\n  (princ (aref dparr (1- n))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 789, "cpu_time_ms": 212, "memory_kb": 59880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s481676134", "group_id": "codeNet:p03161", "input_text": "(defparameter *safe-aref-error* most-positive-fixnum)\n(defun safe-aref (array discript)\n  (if (not (minusp discript))\n      (aref array discript)\n      *safe-aref-error*))\n(let* ((n (read))\n       (m (read))\n       (arr (make-array n :initial-element 0 :element-type 'fixnum))\n       (dparr (make-array (1+ n) :initial-element most-positive-fixnum :element-type 'fixnum)))\n  (setf *safe-aref-error* 10000000)\n  (loop :for k :from 0 :upto (1- n) :do(setf (aref arr k) (read)))\n  (setf (aref dparr 0) 0)\n  (loop :for k :from 1 :upto (1- n)\n        :do (setf (aref dparr k)\n                  (loop :for j :from 1 :upto m\n                        :minimize (+ (safe-aref dparr (- k j))\n                                     (abs (- (aref arr (- k j)) (aref arr k)))))))\n  (princ (aref dparr (1- n))))\n", "language": "Lisp", "metadata": {"date": 1576029209, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s481676134.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s481676134", "user_id": "u610490393"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defparameter *safe-aref-error* most-positive-fixnum)\n(defun safe-aref (array discript)\n  (if (not (minusp discript))\n      (aref array discript)\n      *safe-aref-error*))\n(let* ((n (read))\n       (m (read))\n       (arr (make-array n :initial-element 0 :element-type 'fixnum))\n       (dparr (make-array (1+ n) :initial-element most-positive-fixnum :element-type 'fixnum)))\n  (setf *safe-aref-error* 10000000)\n  (loop :for k :from 0 :upto (1- n) :do(setf (aref arr k) (read)))\n  (setf (aref dparr 0) 0)\n  (loop :for k :from 1 :upto (1- n)\n        :do (setf (aref dparr k)\n                  (loop :for j :from 1 :upto m\n                        :minimize (+ (safe-aref dparr (- k j))\n                                     (abs (- (aref arr (- k j)) (aref arr k)))))))\n  (princ (aref dparr (1- n))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 795, "cpu_time_ms": 262, "memory_kb": 59876}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s711132371", "group_id": "codeNet:p03161", "input_text": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defvar *n* (read))\n(defvar *k* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element nil))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n\n(defun cand (i delta)\n  (if (or (< *k* delta) (< (- i delta) 0))\n    nil\n    (cons (+ (ans (- i delta)) (cost i delta)) (cand i (+ delta 1)))))\n\n(defun ans (i)\n  (cond\n    ((aref *dp* i) (aref *dp* i))\n    (t\n       (setf (aref *dp* i) (apply #'min (cand i 1))))))\n\n(print (ans (1- *n*)))\n", "language": "Lisp", "metadata": {"date": 1572287462, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s711132371.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s711132371", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n(defvar *n* (read))\n(defvar *k* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element nil))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n\n(defun cand (i delta)\n  (if (or (< *k* delta) (< (- i delta) 0))\n    nil\n    (cons (+ (ans (- i delta)) (cost i delta)) (cand i (+ delta 1)))))\n\n(defun ans (i)\n  (cond\n    ((aref *dp* i) (aref *dp* i))\n    (t\n       (setf (aref *dp* i) (apply #'min (cand i 1))))))\n\n(print (ans (1- *n*)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1097, "cpu_time_ms": 858, "memory_kb": 70716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s162000566", "group_id": "codeNet:p03161", "input_text": "(defvar *n* (read))\n(defvar *k* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element nil))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n\n(defun cand (i delta)\n  (if (or (< *k* delta) (< (- i delta) 0))\n    nil\n    (cons (+ (ans (- i delta)) (cost i delta)) (cand i (+ delta 1)))))\n\n(defun ans (i)\n  (cond\n    ((aref *dp* i) (aref *dp* i))\n    (t\n       (setf (aref *dp* i) (apply #'min (cand i 1))))))\n\n(print (ans (1- *n*)))", "language": "Lisp", "metadata": {"date": 1572287434, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s162000566.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s162000566", "user_id": "u358554431"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "(defvar *n* (read))\n(defvar *k* (read))\n(defvar *hi* (make-array *n*))\n\n;dp[i]→i番目にたどり着くための最小コスト\n(defvar *dp* (make-array *n* :initial-element nil))\n\n(dotimes (i *n*)\n         (setf (aref *hi* i) (read)))\n\n(defun cost (now delta)\n   (abs (- (aref *hi* now) (aref *hi* (- now delta)))))\n\n;dpテーブル初期化\n(setf (aref *dp* 0) 0)\n\n(defun cand (i delta)\n  (if (or (< *k* delta) (< (- i delta) 0))\n    nil\n    (cons (+ (ans (- i delta)) (cost i delta)) (cand i (+ delta 1)))))\n\n(defun ans (i)\n  (cond\n    ((aref *dp* i) (aref *dp* i))\n    (t\n       (setf (aref *dp* i) (apply #'min (cand i 1))))))\n\n(print (ans (1- *n*)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 658, "cpu_time_ms": 703, "memory_kb": 61032}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s819592442", "group_id": "codeNet:p03161", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((result (loop (let ((byte (%read-byte)))\n                           (when (<= 48 byte)\n                             (return (- byte 48)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return result)))))))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; Body\n\n(define-modify-macro minf (new-value)\n  (lambda (x y) (min x y)))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array 100000 :element-type '(unsigned-byte 32)))\n         (dp (make-array 100000 :element-type '(unsigned-byte 32) :initial-element #xffffffff)))\n    (declare ((unsigned-byte 31) n k))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (setf (aref hs i) (read-fixnum)))\n    (dotimes (i n)\n      (let ((h (aref hs i))\n            (d (aref dp i)))\n        (loop for dest from (+ i 1) to (min (+ i k) (- n 1))\n              do (minf (aref dp dest) (+ d (abs (- h (aref hs dest))))))))\n    (println (aref dp (- n 1)))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1566536026, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s819592442.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s819592442", "user_id": "u352600849"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((result (loop (let ((byte (%read-byte)))\n                           (when (<= 48 byte)\n                             (return (- byte 48)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return result)))))))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; Body\n\n(define-modify-macro minf (new-value)\n  (lambda (x y) (min x y)))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array 100000 :element-type '(unsigned-byte 32)))\n         (dp (make-array 100000 :element-type '(unsigned-byte 32) :initial-element #xffffffff)))\n    (declare ((unsigned-byte 31) n k))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (setf (aref hs i) (read-fixnum)))\n    (dotimes (i n)\n      (let ((h (aref hs i))\n            (d (aref dp i)))\n        (loop for dest from (+ i 1) to (min (+ i k) (- n 1))\n              do (minf (aref dp dest) (+ d (abs (- h (aref hs dest))))))))\n    (println (aref dp (- n 1)))))\n\n#-swank (main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2128, "cpu_time_ms": 83, "memory_kb": 8680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s608677399", "group_id": "codeNet:p03161", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\")))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return result)))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(define-modify-macro minf (new-value)\n  (lambda (x y) (min x y)))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array n :element-type '(unsigned-byte 32)))\n         (dp (make-array n :element-type '(unsigned-byte 32) :initial-element #xffffffff)))\n    (declare ((unsigned-byte 31) n k))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (setf (aref hs i) (read-fixnum)))\n    (dotimes (i n)\n      (loop for dest from (+ i 1) to (min (+ i k) (- n 1))\n            do (minf (aref dp dest)\n                     (+ (aref dp i) (abs (- (aref hs i) (aref hs dest)))))))\n    (println (aref dp (- n 1)))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1566534511, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s608677399.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s608677399", "user_id": "u352600849"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\")))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return result)))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(define-modify-macro minf (new-value)\n  (lambda (x y) (min x y)))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array n :element-type '(unsigned-byte 32)))\n         (dp (make-array n :element-type '(unsigned-byte 32) :initial-element #xffffffff)))\n    (declare ((unsigned-byte 31) n k))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (setf (aref hs i) (read-fixnum)))\n    (dotimes (i n)\n      (loop for dest from (+ i 1) to (min (+ i k) (- n 1))\n            do (minf (aref dp dest)\n                     (+ (aref dp i) (abs (- (aref hs i) (aref hs dest)))))))\n    (println (aref dp (- n 1)))))\n\n#-swank (main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2612, "cpu_time_ms": 97, "memory_kb": 10856}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s291754141", "group_id": "codeNet:p03161", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(define-modify-macro minf (new-value)\n  (lambda (x y) (min x y)))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array n :element-type 'uint32))\n         (dp (make-array n :element-type 'uint32 :initial-element #xffffffff)))\n    (declare (uint31 n k))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (setf (aref hs i) (read-fixnum)))\n    (dotimes (i n)\n      (loop for dest from (+ i 1) to (min (+ i k) (- n 1))\n            do (minf (aref dp dest)\n                     (+ (aref dp i) (abs (- (aref hs i) (aref hs dest)))))))\n    (println (aref dp (- n 1)))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1566534408, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s291754141.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s291754141", "user_id": "u352600849"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (ql:quickload '(:cl-debug-print :fiveam))\n  #-swank (set-dispatch-macro-character #\\# #\\> (lambda (s c p) (declare (ignore c p)) (read s nil (values) t))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare #.OPT\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setf minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(define-modify-macro minf (new-value)\n  (lambda (x y) (min x y)))\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array n :element-type 'uint32))\n         (dp (make-array n :element-type 'uint32 :initial-element #xffffffff)))\n    (declare (uint31 n k))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (setf (aref hs i) (read-fixnum)))\n    (dotimes (i n)\n      (loop for dest from (+ i 1) to (min (+ i k) (- n 1))\n            do (minf (aref dp dest)\n                     (+ (aref dp i) (abs (- (aref hs i) (aref hs dest)))))))\n    (println (aref dp (- n 1)))))\n\n#-swank (main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3034, "cpu_time_ms": 104, "memory_kb": 14176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s162503327", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(define-alien-routine getchar_unlocked char)\n\n(declaim (optimize (speed 3) (safety 0) (debug 0))\n         (inline getchar_unlocked))\n\n(deftype int32 () '(signed-byte 32))\n\n(declaim (ftype (function () int32) my-read-int))\n(defun my-read-int ()\n  (let ((is-negative nil)\n        (result 0))\n    (declare (type int32 result)\n             (type boolean is-negative))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (and (/= cur-char 45)\n                  (not (<= 48 cur-char 57)))\n       finally (if (<= 48 cur-char 57)\n                   (setf result (- cur-char 48))\n                   (setf is-negative t)))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (<= 48 cur-char 57)\n       do (setf result (+ (ash result 3) (ash result 1) (- cur-char 48))))\n    (when is-negative (setf result (- result)))\n    result))\n\n(defun main ()\n  (let* ((n (my-read-int))\n         (k (my-read-int))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (my-read-int)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n", "language": "Lisp", "metadata": {"date": 1555666742, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s162503327.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s162503327", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(define-alien-routine getchar_unlocked char)\n\n(declaim (optimize (speed 3) (safety 0) (debug 0))\n         (inline getchar_unlocked))\n\n(deftype int32 () '(signed-byte 32))\n\n(declaim (ftype (function () int32) my-read-int))\n(defun my-read-int ()\n  (let ((is-negative nil)\n        (result 0))\n    (declare (type int32 result)\n             (type boolean is-negative))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (and (/= cur-char 45)\n                  (not (<= 48 cur-char 57)))\n       finally (if (<= 48 cur-char 57)\n                   (setf result (- cur-char 48))\n                   (setf is-negative t)))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (<= 48 cur-char 57)\n       do (setf result (+ (ash result 3) (ash result 1) (- cur-char 48))))\n    (when is-negative (setf result (- result)))\n    result))\n\n(defun main ()\n  (let* ((n (my-read-int))\n         (k (my-read-int))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (my-read-int)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1591, "cpu_time_ms": 103, "memory_kb": 8680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s795422988", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(define-alien-routine getchar_unlocked char)\n\n(declaim (optimize (speed 3) (safety 0) (debug 0))\n         (inline getchar_unlocked my-read-int))\n\n(deftype int32 () '(signed-byte 32))\n\n(declaim (ftype (function () int32) my-read-int))\n(defun my-read-int ()\n  (let ((is-negative nil)\n        (result 0))\n    (declare (type int32 result))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (and (/= cur-char (char-code #\\-))\n                  (/= 0)\n                  (or (< cur-char 48)\n                      (> cur-char 57)))\n       finally (if (<= 48 cur-char 57)\n                   (setf result (- cur-char 48))\n                   (setf is-negative t)))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (<= 48 cur-char 57)\n       do (setf result (+ (* result 10) (- cur-char 48))))\n    (when is-negative (setf result (- result)))\n    result))\n\n(defun main ()\n  (let* ((n (my-read-int))\n         (k (my-read-int))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (my-read-int)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n", "language": "Lisp", "metadata": {"date": 1555642431, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s795422988.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s795422988", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(define-alien-routine getchar_unlocked char)\n\n(declaim (optimize (speed 3) (safety 0) (debug 0))\n         (inline getchar_unlocked my-read-int))\n\n(deftype int32 () '(signed-byte 32))\n\n(declaim (ftype (function () int32) my-read-int))\n(defun my-read-int ()\n  (let ((is-negative nil)\n        (result 0))\n    (declare (type int32 result))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (and (/= cur-char (char-code #\\-))\n                  (/= 0)\n                  (or (< cur-char 48)\n                      (> cur-char 57)))\n       finally (if (<= 48 cur-char 57)\n                   (setf result (- cur-char 48))\n                   (setf is-negative t)))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (<= 48 cur-char 57)\n       do (setf result (+ (* result 10) (- cur-char 48))))\n    (when is-negative (setf result (- result)))\n    result))\n\n(defun main ()\n  (let* ((n (my-read-int))\n         (k (my-read-int))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (my-read-int)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1618, "cpu_time_ms": 229, "memory_kb": 22756}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s614973122", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(define-alien-routine getchar_unlocked char)\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n(declaim (inline getchar_unlocked))\n\n(deftype uint8 () '(unsigned-byte 8))\n(deftype int32 () '(signed-byte 32))\n\n;; (declaim (type fixnum *ptr* *len*)\n;;          (type (vector uint8 4096) *buf*))\n\n;; (defvar *buf* (make-array 4096 :element-type 'uint8 :initial-element 0))\n;; (defvar *ptr* (the fixnum 0))\n;; (defvar *len* (the fixnum -1))\n;; \n;; (defun refresh-buf ()\n;;   (setf *len* (the fixnum (read-sequence *buf* *standard-input*)))\n;;   (setf *ptr* (the fixnum 0)))\n;; \n;; (declaim (ftype (function () uint8) my-read-char))\n;; (defun my-read-char ()\n;;   (when (>= *ptr* *len*) (refresh-buf))\n;;   (if (>= *ptr* *len*)\n;;       0\n;;       (progn (incf *ptr*)\n;;              (aref *buf* (1- *ptr*))))\n\n(declaim (ftype (function () int32) my-read-int))\n(defun my-read-int ()\n  (let ((is-negative nil)\n        (result 0))\n    (declare (type int32 result))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (and (/= cur-char (char-code #\\-))\n                  (/= 0)\n                  (or (< cur-char 48)\n                      (> cur-char 57)))\n       finally (if (<= 48 cur-char 57)\n                   (setf result (- cur-char 48))\n                   (setf is-negative t)))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (<= 48 cur-char 57)\n       do (setf result (+ (* result 10) (- cur-char 48))))\n    (when is-negative (setf result (- result)))\n    result))\n\n(defun main ()\n  (let* ((n (my-read-int))\n         (k (my-read-int))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (my-read-int)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n;; (defun main2 ()\n;;   (let* ((n (the int32 (read)))\n;;          (k (the int32 (read)))\n;;          (a (make-array n :element-type 'int32))\n;;          (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n;;     (let ((stream (make-string-input-stream (read-line))))\n;;       (loop for i from 0\n;;          for j = (read stream nil) until (null j)\n;;          do (setf (aref a i) (the int32 j)))\n;;     (setf (aref dp 0) 0)\n;;     (loop for i of-type int32 from 0 below n do\n;;       (loop with from-val of-type int32 = (aref dp i)\n;;          for j of-type int32 from (1+ i) to (+ i k)\n;;          while (< j n)\n;;          do\n;;            (let ((nval (the int32 (+ from-val (abs (- (aref a i) (aref a j)))))))\n;;              (setf (aref dp j) (min (aref dp j) nval)))\n;;     (format t \"~a~%\" (aref dp (- n 1)))))\n\n", "language": "Lisp", "metadata": {"date": 1555642270, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s614973122.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s614973122", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(define-alien-routine getchar_unlocked char)\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n(declaim (inline getchar_unlocked))\n\n(deftype uint8 () '(unsigned-byte 8))\n(deftype int32 () '(signed-byte 32))\n\n;; (declaim (type fixnum *ptr* *len*)\n;;          (type (vector uint8 4096) *buf*))\n\n;; (defvar *buf* (make-array 4096 :element-type 'uint8 :initial-element 0))\n;; (defvar *ptr* (the fixnum 0))\n;; (defvar *len* (the fixnum -1))\n;; \n;; (defun refresh-buf ()\n;;   (setf *len* (the fixnum (read-sequence *buf* *standard-input*)))\n;;   (setf *ptr* (the fixnum 0)))\n;; \n;; (declaim (ftype (function () uint8) my-read-char))\n;; (defun my-read-char ()\n;;   (when (>= *ptr* *len*) (refresh-buf))\n;;   (if (>= *ptr* *len*)\n;;       0\n;;       (progn (incf *ptr*)\n;;              (aref *buf* (1- *ptr*))))\n\n(declaim (ftype (function () int32) my-read-int))\n(defun my-read-int ()\n  (let ((is-negative nil)\n        (result 0))\n    (declare (type int32 result))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (and (/= cur-char (char-code #\\-))\n                  (/= 0)\n                  (or (< cur-char 48)\n                      (> cur-char 57)))\n       finally (if (<= 48 cur-char 57)\n                   (setf result (- cur-char 48))\n                   (setf is-negative t)))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (<= 48 cur-char 57)\n       do (setf result (+ (* result 10) (- cur-char 48))))\n    (when is-negative (setf result (- result)))\n    result))\n\n(defun main ()\n  (let* ((n (my-read-int))\n         (k (my-read-int))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (my-read-int)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n;; (defun main2 ()\n;;   (let* ((n (the int32 (read)))\n;;          (k (the int32 (read)))\n;;          (a (make-array n :element-type 'int32))\n;;          (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n;;     (let ((stream (make-string-input-stream (read-line))))\n;;       (loop for i from 0\n;;          for j = (read stream nil) until (null j)\n;;          do (setf (aref a i) (the int32 j)))\n;;     (setf (aref dp 0) 0)\n;;     (loop for i of-type int32 from 0 below n do\n;;       (loop with from-val of-type int32 = (aref dp i)\n;;          for j of-type int32 from (1+ i) to (+ i k)\n;;          while (< j n)\n;;          do\n;;            (let ((nval (the int32 (+ from-val (abs (- (aref a i) (aref a j)))))))\n;;              (setf (aref dp j) (min (aref dp j) nval)))\n;;     (format t \"~a~%\" (aref dp (- n 1)))))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3087, "cpu_time_ms": 104, "memory_kb": 8800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s937745943", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(define-alien-routine getchar_unlocked char)\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype uint8 () '(unsigned-byte 8))\n(deftype int32 () '(signed-byte 32))\n\n;; (declaim (type fixnum *ptr* *len*)\n;;          (type (vector uint8 4096) *buf*))\n\n;; (defvar *buf* (make-array 4096 :element-type 'uint8 :initial-element 0))\n;; (defvar *ptr* (the fixnum 0))\n;; (defvar *len* (the fixnum -1))\n;; \n;; (defun refresh-buf ()\n;;   (setf *len* (the fixnum (read-sequence *buf* *standard-input*)))\n;;   (setf *ptr* (the fixnum 0)))\n;; \n;; (declaim (ftype (function () uint8) my-read-char))\n;; (defun my-read-char ()\n;;   (when (>= *ptr* *len*) (refresh-buf))\n;;   (if (>= *ptr* *len*)\n;;       0\n;;       (progn (incf *ptr*)\n;;              (aref *buf* (1- *ptr*))))\n\n(declaim (ftype (function () int32) my-read-int))\n(defun my-read-int ()\n  (let ((is-negative nil)\n        (result 0))\n    (declare (type int32 result))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (and (/= cur-char (char-code #\\-))\n                  (/= 0)\n                  (or (< cur-char 48)\n                      (> cur-char 57)))\n       finally (if (<= 48 cur-char 57)\n                   (setf result (- cur-char 48))\n                   (setf is-negative t)))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (<= 48 cur-char 57)\n       do (setf result (+ (* result 10) (- cur-char 48))))\n    (when is-negative (setf result (- result)))\n    result))\n\n(defun main ()\n  (let* ((n (my-read-int))\n         (k (my-read-int))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (my-read-int)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n;; (defun main2 ()\n;;   (let* ((n (the int32 (read)))\n;;          (k (the int32 (read)))\n;;          (a (make-array n :element-type 'int32))\n;;          (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n;;     (let ((stream (make-string-input-stream (read-line))))\n;;       (loop for i from 0\n;;          for j = (read stream nil) until (null j)\n;;          do (setf (aref a i) (the int32 j)))\n;;     (setf (aref dp 0) 0)\n;;     (loop for i of-type int32 from 0 below n do\n;;       (loop with from-val of-type int32 = (aref dp i)\n;;          for j of-type int32 from (1+ i) to (+ i k)\n;;          while (< j n)\n;;          do\n;;            (let ((nval (the int32 (+ from-val (abs (- (aref a i) (aref a j)))))))\n;;              (setf (aref dp j) (min (aref dp j) nval)))\n;;     (format t \"~a~%\" (aref dp (- n 1)))))\n\n", "language": "Lisp", "metadata": {"date": 1555642199, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s937745943.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s937745943", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(define-alien-routine getchar_unlocked char)\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype uint8 () '(unsigned-byte 8))\n(deftype int32 () '(signed-byte 32))\n\n;; (declaim (type fixnum *ptr* *len*)\n;;          (type (vector uint8 4096) *buf*))\n\n;; (defvar *buf* (make-array 4096 :element-type 'uint8 :initial-element 0))\n;; (defvar *ptr* (the fixnum 0))\n;; (defvar *len* (the fixnum -1))\n;; \n;; (defun refresh-buf ()\n;;   (setf *len* (the fixnum (read-sequence *buf* *standard-input*)))\n;;   (setf *ptr* (the fixnum 0)))\n;; \n;; (declaim (ftype (function () uint8) my-read-char))\n;; (defun my-read-char ()\n;;   (when (>= *ptr* *len*) (refresh-buf))\n;;   (if (>= *ptr* *len*)\n;;       0\n;;       (progn (incf *ptr*)\n;;              (aref *buf* (1- *ptr*))))\n\n(declaim (ftype (function () int32) my-read-int))\n(defun my-read-int ()\n  (let ((is-negative nil)\n        (result 0))\n    (declare (type int32 result))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (and (/= cur-char (char-code #\\-))\n                  (/= 0)\n                  (or (< cur-char 48)\n                      (> cur-char 57)))\n       finally (if (<= 48 cur-char 57)\n                   (setf result (- cur-char 48))\n                   (setf is-negative t)))\n    (loop for cur-char = (getchar_unlocked) then (getchar_unlocked)\n       while (<= 48 cur-char 57)\n       do (setf result (+ (* result 10) (- cur-char 48))))\n    (when is-negative (setf result (- result)))\n    result))\n\n(defun main ()\n  (let* ((n (my-read-int))\n         (k (my-read-int))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (my-read-int)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n;; (defun main2 ()\n;;   (let* ((n (the int32 (read)))\n;;          (k (the int32 (read)))\n;;          (a (make-array n :element-type 'int32))\n;;          (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n;;     (let ((stream (make-string-input-stream (read-line))))\n;;       (loop for i from 0\n;;          for j = (read stream nil) until (null j)\n;;          do (setf (aref a i) (the int32 j)))\n;;     (setf (aref dp 0) 0)\n;;     (loop for i of-type int32 from 0 below n do\n;;       (loop with from-val of-type int32 = (aref dp i)\n;;          for j of-type int32 from (1+ i) to (+ i k)\n;;          while (< j n)\n;;          do\n;;            (let ((nval (the int32 (+ from-val (abs (- (aref a i) (aref a j)))))))\n;;              (setf (aref dp j) (min (aref dp j) nval)))\n;;     (format t \"~a~%\" (aref dp (- n 1)))))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3051, "cpu_time_ms": 603, "memory_kb": 20836}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s025180557", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype uint8 () '(unsigned-byte 8))\n(deftype int32 () '(signed-byte 32))\n\n(declaim (type fixnum *ptr* *len*)\n         (type (vector uint8 4096) *buf*))\n\n(defvar *buf* (make-array 4096 :element-type 'uint8 :initial-element 0))\n(defvar *ptr* (the fixnum 0))\n(defvar *len* (the fixnum -1))\n\n(defun refresh-buf ()\n  (setf *len* (the fixnum (read-sequence *buf* *standard-input*)))\n  (setf *ptr* (the fixnum 0)))\n\n(declaim (ftype (function () uint8) my-read-char))\n(defun my-read-char ()\n  (when (>= *ptr* *len*) (refresh-buf))\n  (if (>= *ptr* *len*)\n      0\n      (progn (incf *ptr*)\n             (aref *buf* (1- *ptr*)))))\n\n(declaim (ftype (function () int32) my-read-int))\n(defun my-read-int ()\n  (let ((is-negative nil)\n        (result 0))\n    (declare (type int32 result))\n    (loop for cur-char = (my-read-char) then (my-read-char)\n       while (and (/= cur-char (char-code #\\-))\n                  (/= 0)\n                  (or (< cur-char 48)\n                      (> cur-char 57)))\n       finally (if (<= 48 cur-char 57)\n                   (setf result (- cur-char 48))\n                   (setf is-negative t)))\n    (loop for cur-char = (my-read-char) then (my-read-char)\n       while (<= 48 cur-char 57)\n       do (setf result (+ (* result 10) (- cur-char 48))))\n    (when is-negative (setf result (- result)))\n    result))\n\n(defun main ()\n  (let* ((n (my-read-int))\n         (k (my-read-int))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (my-read-int)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n;; (defun main2 ()\n;;   (let* ((n (the int32 (read)))\n;;          (k (the int32 (read)))\n;;          (a (make-array n :element-type 'int32))\n;;          (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n;;     (let ((stream (make-string-input-stream (read-line))))\n;;       (loop for i from 0\n;;          for j = (read stream nil) until (null j)\n;;          do (setf (aref a i) (the int32 j)))\n;;     (setf (aref dp 0) 0)\n;;     (loop for i of-type int32 from 0 below n do\n;;       (loop with from-val of-type int32 = (aref dp i)\n;;          for j of-type int32 from (1+ i) to (+ i k)\n;;          while (< j n)\n;;          do\n;;            (let ((nval (the int32 (+ from-val (abs (- (aref a i) (aref a j)))))))\n;;              (setf (aref dp j) (min (aref dp j) nval)))\n;;     (format t \"~a~%\" (aref dp (- n 1)))))\n\n", "language": "Lisp", "metadata": {"date": 1555641608, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s025180557.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s025180557", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype uint8 () '(unsigned-byte 8))\n(deftype int32 () '(signed-byte 32))\n\n(declaim (type fixnum *ptr* *len*)\n         (type (vector uint8 4096) *buf*))\n\n(defvar *buf* (make-array 4096 :element-type 'uint8 :initial-element 0))\n(defvar *ptr* (the fixnum 0))\n(defvar *len* (the fixnum -1))\n\n(defun refresh-buf ()\n  (setf *len* (the fixnum (read-sequence *buf* *standard-input*)))\n  (setf *ptr* (the fixnum 0)))\n\n(declaim (ftype (function () uint8) my-read-char))\n(defun my-read-char ()\n  (when (>= *ptr* *len*) (refresh-buf))\n  (if (>= *ptr* *len*)\n      0\n      (progn (incf *ptr*)\n             (aref *buf* (1- *ptr*)))))\n\n(declaim (ftype (function () int32) my-read-int))\n(defun my-read-int ()\n  (let ((is-negative nil)\n        (result 0))\n    (declare (type int32 result))\n    (loop for cur-char = (my-read-char) then (my-read-char)\n       while (and (/= cur-char (char-code #\\-))\n                  (/= 0)\n                  (or (< cur-char 48)\n                      (> cur-char 57)))\n       finally (if (<= 48 cur-char 57)\n                   (setf result (- cur-char 48))\n                   (setf is-negative t)))\n    (loop for cur-char = (my-read-char) then (my-read-char)\n       while (<= 48 cur-char 57)\n       do (setf result (+ (* result 10) (- cur-char 48))))\n    (when is-negative (setf result (- result)))\n    result))\n\n(defun main ()\n  (let* ((n (my-read-int))\n         (k (my-read-int))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (my-read-int)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n;; (defun main2 ()\n;;   (let* ((n (the int32 (read)))\n;;          (k (the int32 (read)))\n;;          (a (make-array n :element-type 'int32))\n;;          (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n;;     (let ((stream (make-string-input-stream (read-line))))\n;;       (loop for i from 0\n;;          for j = (read stream nil) until (null j)\n;;          do (setf (aref a i) (the int32 j)))\n;;     (setf (aref dp 0) 0)\n;;     (loop for i of-type int32 from 0 below n do\n;;       (loop with from-val of-type int32 = (aref dp i)\n;;          for j of-type int32 from (1+ i) to (+ i k)\n;;          while (< j n)\n;;          do\n;;            (let ((nval (the int32 (+ from-val (abs (- (aref a i) (aref a j)))))))\n;;              (setf (aref dp j) (min (aref dp j) nval)))\n;;     (format t \"~a~%\" (aref dp (- n 1)))))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2939, "cpu_time_ms": 211, "memory_kb": 20328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s643071415", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype int32 () '(signed-byte 32))\n\n(defun main ()\n  (let* ((n (the int32 (read)))\n         (k (the int32 (read)))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (the int32 (read))))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n;; (defun main2 ()\n;;   (let* ((n (the int32 (read)))\n;;          (k (the int32 (read)))\n;;          (a (make-array n :element-type 'int32))\n;;          (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n;;     (let ((stream (make-string-input-stream (read-line))))\n;;       (loop for i from 0\n;;          for j = (read stream nil) until (null j)\n;;          do (setf (aref a i) (the int32 j)))\n;;     (setf (aref dp 0) 0)\n;;     (loop for i of-type int32 from 0 below n do\n;;       (loop with from-val of-type int32 = (aref dp i)\n;;          for j of-type int32 from (1+ i) to (+ i k)\n;;          while (< j n)\n;;          do\n;;            (let ((nval (the int32 (+ from-val (abs (- (aref a i) (aref a j)))))))\n;;              (setf (aref dp j) (min (aref dp j) nval)))\n;;     (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n", "language": "Lisp", "metadata": {"date": 1555362903, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s643071415.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s643071415", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype int32 () '(signed-byte 32))\n\n(defun main ()\n  (let* ((n (the int32 (read)))\n         (k (the int32 (read)))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (dotimes (i n)\n      (setf (aref a i) (the int32 (read))))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         for nval of-type int32 = (+ from-val (abs (- (aref a i) (aref a j))))\n         if (< nval (aref dp j))\n         do\n           (setf (aref dp j) nval)))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n;; (defun main2 ()\n;;   (let* ((n (the int32 (read)))\n;;          (k (the int32 (read)))\n;;          (a (make-array n :element-type 'int32))\n;;          (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n;;     (let ((stream (make-string-input-stream (read-line))))\n;;       (loop for i from 0\n;;          for j = (read stream nil) until (null j)\n;;          do (setf (aref a i) (the int32 j)))\n;;     (setf (aref dp 0) 0)\n;;     (loop for i of-type int32 from 0 below n do\n;;       (loop with from-val of-type int32 = (aref dp i)\n;;          for j of-type int32 from (1+ i) to (+ i k)\n;;          while (< j n)\n;;          do\n;;            (let ((nval (the int32 (+ from-val (abs (- (aref a i) (aref a j)))))))\n;;              (setf (aref dp j) (min (aref dp j) nval)))\n;;     (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1662, "cpu_time_ms": 253, "memory_kb": 59876}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s625608512", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype int32 () '(signed-byte 32))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (let ((stream (make-string-input-stream (read-line))))\n      (loop for i from 0\n         for j = (read stream nil) until (null j)\n         do (setf (aref a i) (the int32 j))))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         do\n           (let ((nval (+ from-val (abs (- (aref a i) (aref a j))))))\n             (setf (aref dp j) (min (aref dp j) nval)))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1555288255, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s625608512.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s625608512", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype int32 () '(signed-byte 32))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    (let ((stream (make-string-input-stream (read-line))))\n      (loop for i from 0\n         for j = (read stream nil) until (null j)\n         do (setf (aref a i) (the int32 j))))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         do\n           (let ((nval (+ from-val (abs (- (aref a i) (aref a j))))))\n             (setf (aref dp j) (min (aref dp j) nval)))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 888, "cpu_time_ms": 178, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s374749236", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype int32 () '(signed-byte 32))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    ;; (let ((stream (make-string-input-stream (read-line))))\n    ;;   (loop for i from 0\n    ;;      for j = (read stream nil) until (null j)\n    ;;      do (setf (aref a i) j))\n    (loop for i of-type int32 from 0 below n do (setf (aref a i) (read)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         do\n           (let ((nval (+ from-val (abs (- (aref a i) (aref a j))))))\n             (setf (aref dp j) (min (aref dp j) nval)))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1555288190, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s374749236.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s374749236", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype int32 () '(signed-byte 32))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    ;; (let ((stream (make-string-input-stream (read-line))))\n    ;;   (loop for i from 0\n    ;;      for j = (read stream nil) until (null j)\n    ;;      do (setf (aref a i) j))\n    (loop for i of-type int32 from 0 below n do (setf (aref a i) (read)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         do\n           (let ((nval (+ from-val (abs (- (aref a i) (aref a j))))))\n             (setf (aref dp j) (min (aref dp j) nval)))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 961, "cpu_time_ms": 235, "memory_kb": 59748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s614642899", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n;; (declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype int32 () '(signed-byte 32))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    ;; (let ((stream (make-string-input-stream (read-line))))\n    ;;   (loop for i from 0\n    ;;      for j = (read stream nil) until (null j)\n    ;;      do (setf (aref a i) j))\n    (loop for i of-type int32 from 0 below n do (setf (aref a i) (read)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         do\n           (let ((nval (+ from-val (abs (- (aref a i) (aref a j))))))\n             (setf (aref dp j) (min (aref dp j) nval)))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1555288130, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s614642899.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s614642899", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n;; (declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(deftype int32 () '(signed-byte 32))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'int32))\n         (dp (make-array n :element-type 'int32 :initial-element (+ (expt 10 9) 100))))\n    ;; (let ((stream (make-string-input-stream (read-line))))\n    ;;   (loop for i from 0\n    ;;      for j = (read stream nil) until (null j)\n    ;;      do (setf (aref a i) j))\n    (loop for i of-type int32 from 0 below n do (setf (aref a i) (read)))\n    (setf (aref dp 0) 0)\n    (loop for i of-type int32 from 0 below n do\n      (loop with from-val of-type int32 = (aref dp i)\n         for j of-type int32 from (1+ i) to (+ i k)\n         while (< j n)\n         do\n           (let ((nval (+ from-val (abs (- (aref a i) (aref a j))))))\n             (setf (aref dp j) (min (aref dp j) nval)))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 964, "cpu_time_ms": 259, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s353521681", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (let ((stream (make-string-input-stream (read-line))))\n      (loop for i from 0\n         for j = (read stream nil) until (null j)\n         do (setf (aref a i) j)))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (dotimes (j k)\n        (when (>= (+ i j 1) n) (return))\n        (let* ((jj (+ i j 1))\n               (from-val (aref dp i))\n               (to-val (aref dp jj))\n               (nval (+ from-val (abs (- (aref a i) (aref a jj))))))\n          (setf (aref dp jj) (min to-val nval)))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1555287208, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s353521681.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s353521681", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (let ((stream (make-string-input-stream (read-line))))\n      (loop for i from 0\n         for j = (read stream nil) until (null j)\n         do (setf (aref a i) j)))\n    (setf (aref dp 0) 0)\n    (dotimes (i n)\n      (dotimes (j k)\n        (when (>= (+ i j 1) n) (return))\n        (let* ((jj (+ i j 1))\n               (from-val (aref dp i))\n               (to-val (aref dp jj))\n               (nval (+ from-val (abs (- (aref a i) (aref a jj))))))\n          (setf (aref dp jj) (min to-val nval)))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 840, "cpu_time_ms": 397, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s030444745", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (let ((stream (make-string-input-stream (read-line))))\n      (loop for i from 0\n         for j = (read stream nil) until (null j)\n         do (setf (aref a i) j)))\n    (flet ((relax (from to)\n             (let* ((from-val (aref dp from))\n                    (to-val (aref dp to))\n                    (diff (abs (- (aref a to) (aref a from)))))\n               (setf (aref dp to) (min to-val (+ from-val diff))))))\n      (setf (aref dp 0) 0)\n      (dotimes (i n)\n        (dotimes (j k)\n          (when (>= (+ i (1+ j)) n) (return))\n          (when (< (+ i (1+ j)) n) (relax i (+ i (1+ j)))))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1555286919, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s030444745.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s030444745", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (let ((stream (make-string-input-stream (read-line))))\n      (loop for i from 0\n         for j = (read stream nil) until (null j)\n         do (setf (aref a i) j)))\n    (flet ((relax (from to)\n             (let* ((from-val (aref dp from))\n                    (to-val (aref dp to))\n                    (diff (abs (- (aref a to) (aref a from)))))\n               (setf (aref dp to) (min to-val (+ from-val diff))))))\n      (setf (aref dp 0) 0)\n      (dotimes (i n)\n        (dotimes (j k)\n          (when (>= (+ i (1+ j)) n) (return))\n          (when (< (+ i (1+ j)) n) (relax i (+ i (1+ j)))))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 937, "cpu_time_ms": 469, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s312313415", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (dotimes (i n)\n      (setf (aref a i) (read)))\n    (flet ((relax (from to)\n             (declaim (inline relax))\n             (let* ((from-val (aref dp from))\n                    (to-val (aref dp to))\n                    (diff (abs (- (aref a to) (aref a from)))))\n               (setf (aref dp to) (min to-val (+ from-val diff))))))\n      (setf (aref dp 0) 0)\n      (dotimes (i n)\n        (dotimes (j k)\n          (when (< (+ i (1+ j)) n) (relax i (+ i (1+ j)))))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1555285887, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s312313415.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s312313415", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(declaim (optimize (speed 3) (safety 0) (debug 0)))\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (dotimes (i n)\n      (setf (aref a i) (read)))\n    (flet ((relax (from to)\n             (declaim (inline relax))\n             (let* ((from-val (aref dp from))\n                    (to-val (aref dp to))\n                    (diff (abs (- (aref a to) (aref a from)))))\n               (setf (aref dp to) (min to-val (+ from-val diff))))))\n      (setf (aref dp 0) 0)\n      (dotimes (i n)\n        (dotimes (j k)\n          (when (< (+ i (1+ j)) n) (relax i (+ i (1+ j)))))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 812, "cpu_time_ms": 2104, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s357782144", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (dotimes (i n)\n      (setf (aref a i) (read)))\n    ;; (flet ((relax (from to)\n    ;;          (let* ((from-val (aref dp from))\n    ;;                 (to-val (aref dp to))\n    ;;                 (diff (abs (- (aref a to) (aref a from))))\n    ;;            (setf (aref dp to) (min to-val (+ from-val diff))))\n    ;;   (setf (aref dp 0) 0)\n    ;;   (dotimes (i n)\n    ;;     (dotimes (j k)\n    ;;       (when (< (+ i (1+ j)) n) (relax i (+ i (1+ j))))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1555285381, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s357782144.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s357782144", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (dotimes (i n)\n      (setf (aref a i) (read)))\n    ;; (flet ((relax (from to)\n    ;;          (let* ((from-val (aref dp from))\n    ;;                 (to-val (aref dp to))\n    ;;                 (diff (abs (- (aref a to) (aref a from))))\n    ;;            (setf (aref dp to) (min to-val (+ from-val diff))))\n    ;;   (setf (aref dp 0) 0)\n    ;;   (dotimes (i n)\n    ;;     (dotimes (j k)\n    ;;       (when (< (+ i (1+ j)) n) (relax i (+ i (1+ j))))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 744, "cpu_time_ms": 200, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s092845958", "group_id": "codeNet:p03161", "input_text": ";; #!/usr/bin/env sbcl --script\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (dotimes (i n)\n      (setf (aref a i) (read)))\n    (flet ((relax (from to)\n             (let* ((from-val (aref dp from))\n                    (to-val (aref dp to))\n                    (diff (abs (- (aref a to) (aref a from)))))\n               (setf (aref dp to) (min to-val (+ from-val diff))))))\n      (setf (aref dp 0) 0)\n      (dotimes (i n)\n        (dotimes (j k)\n          (when (< (+ i (1+ j)) n) (relax i (+ i (1+ j)))))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1555285019, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s092845958.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s092845958", "user_id": "u337226168"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": ";; #!/usr/bin/env sbcl --script\n\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (a (make-array n :element-type 'fixnum))\n         (dp (make-array n :element-type 'fixnum :initial-element (floor most-positive-fixnum 2))))\n    (dotimes (i n)\n      (setf (aref a i) (read)))\n    (flet ((relax (from to)\n             (let* ((from-val (aref dp from))\n                    (to-val (aref dp to))\n                    (diff (abs (- (aref a to) (aref a from)))))\n               (setf (aref dp to) (min to-val (+ from-val diff))))))\n      (setf (aref dp 0) 0)\n      (dotimes (i n)\n        (dotimes (j k)\n          (when (< (+ i (1+ j)) n) (relax i (+ i (1+ j)))))))\n    (format t \"~a~%\" (aref dp (- n 1)))))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 721, "cpu_time_ms": 491, "memory_kb": 59752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s538612346", "group_id": "codeNet:p03161", "input_text": "#-(or child-sbcl swank)\n(quit\n :unix-status\n (process-exit-code\n  (run-program *runtime-pathname*\n               '(\"--control-stack-size\" \"32MB\"\n                 \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                 \"--eval\" \"(push :child-sbcl *features*)\"\n                 \"--script\" #.(namestring *load-pathname*))\n               :output t :error t :input t)))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n\n(declaim (inline split-ints-into-vector))\n(defun split-ints-into-vector (str dest-arr &key (offset 0))\n  (declare ((simple-array * (*)) dest-arr)\n           ((integer 0 #.most-positive-fixnum) offset))\n  (loop for idx from offset below (length dest-arr)\n        for pos1 = 0 then (1+ pos2)\n        for pos2 = (position #\\space str :start pos1 :test #'char=)\n        do (setf (aref dest-arr idx)\n                 (parse-integer str :start pos1 :end pos2))\n        finally (return dest-arr)))\n\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (hs k)\n  (declare #.OPT\n           ((simple-array uint32 (*)) hs)\n           (uint32 k))\n  (let ((dest (- (length hs) 1)))\n    (with-memoizing (:array (100001) :element-type 'uint32\n                     :initial-element #.(- (expt 2 32) 1))\n      (nlet recurse ((i 0))\n        (if (= i dest) 0\n            (loop for delta from 1 to k\n                  while (<= (+ i delta) dest)\n                  minimize (+ (abs (- (aref hs i) (aref hs (+ i delta))))\n                              (recurse (+ i delta)))))))))\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array n :element-type 'uint32)))\n    (split-ints-into-vector (read-line) hs)\n    (println (solve hs k))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1546888999, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s538612346.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s538612346", "user_id": "u352600849"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-(or child-sbcl swank)\n(quit\n :unix-status\n (process-exit-code\n  (run-program *runtime-pathname*\n               '(\"--control-stack-size\" \"32MB\"\n                 \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                 \"--eval\" \"(push :child-sbcl *features*)\"\n                 \"--script\" #.(namestring *load-pathname*))\n               :output t :error t :input t)))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n\n(declaim (inline split-ints-into-vector))\n(defun split-ints-into-vector (str dest-arr &key (offset 0))\n  (declare ((simple-array * (*)) dest-arr)\n           ((integer 0 #.most-positive-fixnum) offset))\n  (loop for idx from offset below (length dest-arr)\n        for pos1 = 0 then (1+ pos2)\n        for pos2 = (position #\\space str :start pos1 :test #'char=)\n        do (setf (aref dest-arr idx)\n                 (parse-integer str :start pos1 :end pos2))\n        finally (return dest-arr)))\n\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (hs k)\n  (declare #.OPT\n           ((simple-array uint32 (*)) hs)\n           (uint32 k))\n  (let ((dest (- (length hs) 1)))\n    (with-memoizing (:array (100001) :element-type 'uint32\n                     :initial-element #.(- (expt 2 32) 1))\n      (nlet recurse ((i 0))\n        (if (= i dest) 0\n            (loop for delta from 1 to k\n                  while (<= (+ i delta) dest)\n                  minimize (+ (abs (- (aref hs i) (aref hs (+ i delta))))\n                              (recurse (+ i delta)))))))))\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array n :element-type 'uint32)))\n    (split-ints-into-vector (read-line) hs)\n    (println (solve hs k))))\n\n#-swank(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8830, "cpu_time_ms": 260, "memory_kb": 33848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s558601885", "group_id": "codeNet:p03161", "input_text": "#-(or child-sbcl swank)\n(quit\n :unix-status\n (process-exit-code\n  (run-program *runtime-pathname*\n               '(\"--control-stack-size\" \"32MB\"\n                 \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                 \"--eval\" \"(push :child-sbcl *features*)\"\n                 \"--script\" #.(namestring *load-pathname*))\n               :output t :error t :input t)))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n\n(declaim (inline split-ints-into-vector))\n(defun split-ints-into-vector (str dest-arr &key (offset 0))\n  (declare ((simple-array * (*)) dest-arr)\n           ((integer 0 #.most-positive-fixnum) offset))\n  (loop for idx from offset below (length dest-arr)\n        for pos1 = 0 then (1+ pos2)\n        for pos2 = (position #\\space str :start pos1 :test #'char=)\n        do (setf (aref dest-arr idx)\n                 (parse-integer str :start pos1 :end pos2))\n        finally (return dest-arr)))\n\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (hs k)\n  (let ((dest (- (length hs) 1)))\n    (with-memoizing (:array (100001) :element-type 'uint32\n                     :initial-element #.(- (expt 2 32) 1))\n      (nlet recurse ((i 0))\n        (if (= i dest) 0\n            (loop for delta from 1 to k\n                  while (<= (+ i delta) dest)\n                  minimize (+ (abs (- (aref hs i) (aref hs (+ i delta))))\n                              (recurse (+ i delta)))))))))\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array n :element-type 'uint32)))\n    (split-ints-into-vector (read-line) hs)\n    (println (solve hs k))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1546802677, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Lisp/s558601885.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s558601885", "user_id": "u352600849"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#-(or child-sbcl swank)\n(quit\n :unix-status\n (process-exit-code\n  (run-program *runtime-pathname*\n               '(\"--control-stack-size\" \"32MB\"\n                 \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                 \"--eval\" \"(push :child-sbcl *features*)\"\n                 \"--script\" #.(namestring *load-pathname*))\n               :output t :error t :input t)))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n\n(declaim (inline split-ints-into-vector))\n(defun split-ints-into-vector (str dest-arr &key (offset 0))\n  (declare ((simple-array * (*)) dest-arr)\n           ((integer 0 #.most-positive-fixnum) offset))\n  (loop for idx from offset below (length dest-arr)\n        for pos1 = 0 then (1+ pos2)\n        for pos2 = (position #\\space str :start pos1 :test #'char=)\n        do (setf (aref dest-arr idx)\n                 (parse-integer str :start pos1 :end pos2))\n        finally (return dest-arr)))\n\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (hs k)\n  (let ((dest (- (length hs) 1)))\n    (with-memoizing (:array (100001) :element-type 'uint32\n                     :initial-element #.(- (expt 2 32) 1))\n      (nlet recurse ((i 0))\n        (if (= i dest) 0\n            (loop for delta from 1 to k\n                  while (<= (+ i delta) dest)\n                  minimize (+ (abs (- (aref hs i) (aref hs (+ i delta))))\n                              (recurse (+ i delta)))))))))\n(defun main ()\n  (let* ((n (read))\n         (k (read))\n         (hs (make-array n :element-type 'uint32)))\n    (split-ints-into-vector (read-line) hs)\n    (println (solve hs k))))\n\n#-swank(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8748, "cpu_time_ms": 544, "memory_kb": 33852}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s574875946", "group_id": "codeNet:p03163", "input_text": ";; Utils\n\n;; Read fixnum\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n;; fast read-line\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n             ,(if (member :swank *features*)\n                  `(read-char ,in nil #\\Newline) ; on SLIME\n                `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n             (return (values ,buffer ,idx))))))\n\n\n;;; invoke child process\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n    :unix-status\n    (process-exit-code\n      (run-program *runtime-pathname*\n                   `(\"--control-stack-size\" \"128MB\"\n                     \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                     \"--eval\" \"(push :child-sbcl *features*)\"\n                     \"--script\" ,(namestring *load-pathname*))\n                                                                 :output t :error t :input t))))\n\n\n\n;-------------------\n; Write code here\n;-------------------\n\n(defparameter *inf* (expt 10 10))\n\n(defun solve (n weight-limit l)\n  (let ((memo (make-array (list (1+ n) (1+ weight-limit)) :initial-element -1)))\n    (labels ((dp (i w)\n               ; 1 ~ iまでの品物での価値の最大化\n               (cond\n                 ((< w 0) (- *inf*))\n                 ((zerop i) 0)\n                 ((/= (aref memo i w) -1) (aref memo i w))\n                 (t\n                  (let ((weight (aref l (1- i) 0))\n                        (value  (aref l (1- i) 1)))\n                    (let ((res (max (dp (1- i) w)\n                                    (+ (dp (1- i) (- w weight))\n                                       value))))\n                      (setf (aref memo i w) res)\n                      res))))))\n      (dp n weight-limit))))\n\n(defun main ()\n  (let* ((n (read))\n         (weight-limit (read))\n         (l (make-array (list n 2))))\n    (dotimes (i n)\n      (setf (aref l i 0) (read))\n      (setf (aref l i 1) (read)))\n    (princ (solve n weight-limit l))\n    (fresh-line)))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1595955064, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lisp/s574875946.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s574875946", "user_id": "u425762225"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": ";; Utils\n\n;; Read fixnum\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n;; fast read-line\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n             ,(if (member :swank *features*)\n                  `(read-char ,in nil #\\Newline) ; on SLIME\n                `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n             (return (values ,buffer ,idx))))))\n\n\n;;; invoke child process\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n    :unix-status\n    (process-exit-code\n      (run-program *runtime-pathname*\n                   `(\"--control-stack-size\" \"128MB\"\n                     \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                     \"--eval\" \"(push :child-sbcl *features*)\"\n                     \"--script\" ,(namestring *load-pathname*))\n                                                                 :output t :error t :input t))))\n\n\n\n;-------------------\n; Write code here\n;-------------------\n\n(defparameter *inf* (expt 10 10))\n\n(defun solve (n weight-limit l)\n  (let ((memo (make-array (list (1+ n) (1+ weight-limit)) :initial-element -1)))\n    (labels ((dp (i w)\n               ; 1 ~ iまでの品物での価値の最大化\n               (cond\n                 ((< w 0) (- *inf*))\n                 ((zerop i) 0)\n                 ((/= (aref memo i w) -1) (aref memo i w))\n                 (t\n                  (let ((weight (aref l (1- i) 0))\n                        (value  (aref l (1- i) 1)))\n                    (let ((res (max (dp (1- i) w)\n                                    (+ (dp (1- i) (- w weight))\n                                       value))))\n                      (setf (aref memo i w) res)\n                      res))))))\n      (dp n weight-limit))))\n\n(defun main ()\n  (let* ((n (read))\n         (weight-limit (read))\n         (l (make-array (list n 2))))\n    (dotimes (i n)\n      (setf (aref l i 0) (read))\n      (setf (aref l i 1) (read)))\n    (princ (solve n weight-limit l))\n    (fresh-line)))\n\n(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3655, "cpu_time_ms": 674, "memory_kb": 104764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s463080495", "group_id": "codeNet:p03163", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(macrolet ((def (name fname)\n             `(define-modify-macro ,name (new-value) ,fname)))\n  (def minf min)\n  (def maxf max)\n  (def mulf *)\n  (def divf /)\n  (def iorf logior)\n  (def xorf logxor)\n  (def andf logand))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read-fixnum))\n         (limit (read-fixnum))\n         (dp (make-array (+ limit 1) :element-type 'fixnum :initial-element 0)))\n    (dotimes (x n)\n      (let ((w (read-fixnum))\n            (v (read-fixnum)))\n        (loop for y from limit downto 0\n              do (setf (aref dp y)\n                       (if (>= y w)\n                           (max (+ v (aref dp (- y w))) (aref dp y))\n                           (aref dp y))))))\n    (println (aref dp limit))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3 8\n3 30\n4 50\n5 60\n\"\n    \"90\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\"\n    \"5000000000\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\"\n    \"17\n\")))\n", "language": "Lisp", "metadata": {"date": 1593343643, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lisp/s463080495.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s463080495", "user_id": "u352600849"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(macrolet ((def (name fname)\n             `(define-modify-macro ,name (new-value) ,fname)))\n  (def minf min)\n  (def maxf max)\n  (def mulf *)\n  (def divf /)\n  (def iorf logior)\n  (def xorf logxor)\n  (def andf logand))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((n (read-fixnum))\n         (limit (read-fixnum))\n         (dp (make-array (+ limit 1) :element-type 'fixnum :initial-element 0)))\n    (dotimes (x n)\n      (let ((w (read-fixnum))\n            (v (read-fixnum)))\n        (loop for y from limit downto 0\n              do (setf (aref dp y)\n                       (if (>= y w)\n                           (max (+ v (aref dp (- y w))) (aref dp y))\n                           (aref dp y))))))\n    (println (aref dp limit))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3 8\n3 30\n4 50\n5 60\n\"\n    \"90\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\"\n    \"5000000000\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\"\n    \"17\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5557, "cpu_time_ms": 47, "memory_kb": 25516}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s404444433", "group_id": "codeNet:p03163", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(macrolet ((def (name fname)\n             `(define-modify-macro ,name (new-value) ,fname)))\n  (def minf min)\n  (def maxf max)\n  (def mulf *)\n  (def divf /)\n  (def iorf logior)\n  (def xorf logxor)\n  (def andf logand))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read-fixnum))\n         (limit (read-fixnum))\n         (dp (make-array (list (+ n 1) (+ limit 1))\n                         :element-type 'fixnum\n                         :initial-element 0))\n         (ws (make-array n :element-type 'uint32 :initial-element 0))\n         (vs (make-array n :element-type 'uint32 :initial-element 0)))\n    (dotimes (i n)\n      (setf (aref ws i) (read-fixnum)\n            (aref vs i) (read-fixnum)))\n    (loop for x from 1 to n\n          for w = (aref ws (- x 1))\n          for v = (aref vs (- x 1))\n          do (dotimes (y (+ limit 1))\n               (setf (aref dp x y)\n                     (if (>= y w)\n                         (max (+ v (aref dp (- x 1) (- y w)))\n                              (aref dp (- x 1) y))\n                         (aref dp (- x 1) y)))))\n    (println (aref dp n limit))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3 8\n3 30\n4 50\n5 60\n\"\n    \"90\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\"\n    \"5000000000\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\"\n    \"17\n\")))\n", "language": "Lisp", "metadata": {"date": 1593260355, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lisp/s404444433.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s404444433", "user_id": "u352600849"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(macrolet ((def (name fname)\n             `(define-modify-macro ,name (new-value) ,fname)))\n  (def minf min)\n  (def maxf max)\n  (def mulf *)\n  (def divf /)\n  (def iorf logior)\n  (def xorf logxor)\n  (def andf logand))\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read-fixnum))\n         (limit (read-fixnum))\n         (dp (make-array (list (+ n 1) (+ limit 1))\n                         :element-type 'fixnum\n                         :initial-element 0))\n         (ws (make-array n :element-type 'uint32 :initial-element 0))\n         (vs (make-array n :element-type 'uint32 :initial-element 0)))\n    (dotimes (i n)\n      (setf (aref ws i) (read-fixnum)\n            (aref vs i) (read-fixnum)))\n    (loop for x from 1 to n\n          for w = (aref ws (- x 1))\n          for v = (aref vs (- x 1))\n          do (dotimes (y (+ limit 1))\n               (setf (aref dp x y)\n                     (if (>= y w)\n                         (max (+ v (aref dp (- x 1) (- y w)))\n                              (aref dp (- x 1) y))\n                         (aref dp (- x 1) y)))))\n    (println (aref dp n limit))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3 8\n3 30\n4 50\n5 60\n\"\n    \"90\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\"\n    \"5000000000\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\"\n    \"17\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5890, "cpu_time_ms": 118, "memory_kb": 103200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s033884308", "group_id": "codeNet:p03163", "input_text": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n \n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n \n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (labels ((array-reference-reader (stream c n)\n             \"Reader macro #&(array index) => (aref array index)\"\n             (declare (ignore c n))\n             (let ((list (read stream)))\n               `(aref ,(car list) ,@(cdr list)))))\n    (setf *readtable* (copy-readtable))\n    (set-dispatch-macro-character #\\# #\\& #'array-reference-reader)))\n \n(defconstant mod-number 1000000007)\n(defconstant inf 2000000000)\n \n(defmacro let-if (var cond tbody &optional fbody)\n  `(let ((,var ,cond))\n     (if ,var\n         ,tbody\n         ,fbody)))\n \n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (nreverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n \n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n \n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n \n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n \n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n \n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n \n(defmacro defdp (name args &body body)\n  (let ((argc (length args))\n        (key (gensym)))\n    `(let ((dp (make-hash-table :test #'equal)))\n       (defun ,name ,args\n         (let ((,key ,@(if (= argc 1) args `((list ,@args)))))\n           (let-if memo (gethash ,key dp)\n                   memo\n                   (setf (gethash ,key dp)\n                         (progn ,@body))))))))\n \n(defparameter n (read))\n(defparameter w-max (read))\n(defparameter w (make-array n))\n(defparameter v (make-array n))\n(dotimes (i n)\n  (setf #&(w i) (read))\n  (setf #&(v i) (read)))\n \n(defdp solve (index weight)\n  (cond ((< weight 0) (- inf))\n        ((< index 0) 0)\n        (t (max (+ (solve (1- index) (- weight #&(w index)))\n                   #&(v index))\n                (solve (1- index) weight)))))\n \n;; (format t \"~A~%\" (solve (1- n) w-max))", "language": "Lisp", "metadata": {"date": 1593074401, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lisp/s033884308.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s033884308", "user_id": "u684901760"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n \n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n \n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (labels ((array-reference-reader (stream c n)\n             \"Reader macro #&(array index) => (aref array index)\"\n             (declare (ignore c n))\n             (let ((list (read stream)))\n               `(aref ,(car list) ,@(cdr list)))))\n    (setf *readtable* (copy-readtable))\n    (set-dispatch-macro-character #\\# #\\& #'array-reference-reader)))\n \n(defconstant mod-number 1000000007)\n(defconstant inf 2000000000)\n \n(defmacro let-if (var cond tbody &optional fbody)\n  `(let ((,var ,cond))\n     (if ,var\n         ,tbody\n         ,fbody)))\n \n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n \n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (nreverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n \n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n \n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n \n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n \n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n \n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n \n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n \n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n \n(defmacro defdp (name args &body body)\n  (let ((argc (length args))\n        (key (gensym)))\n    `(let ((dp (make-hash-table :test #'equal)))\n       (defun ,name ,args\n         (let ((,key ,@(if (= argc 1) args `((list ,@args)))))\n           (let-if memo (gethash ,key dp)\n                   memo\n                   (setf (gethash ,key dp)\n                         (progn ,@body))))))))\n \n(defparameter n (read))\n(defparameter w-max (read))\n(defparameter w (make-array n))\n(defparameter v (make-array n))\n(dotimes (i n)\n  (setf #&(w i) (read))\n  (setf #&(v i) (read)))\n \n(defdp solve (index weight)\n  (cond ((< weight 0) (- inf))\n        ((< index 0) 0)\n        (t (max (+ (solve (1- index) (- weight #&(w index)))\n                   #&(v index))\n                (solve (1- index) weight)))))\n \n;; (format t \"~A~%\" (solve (1- n) w-max))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4174, "cpu_time_ms": 34, "memory_kb": 25576}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s158379392", "group_id": "codeNet:p03163", "input_text": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (labels ((array-reference-reader (stream c n)\n             \"Reader macro #&(array index) => (aref array index)\"\n             (declare (ignore c n))\n             (let ((list (read stream)))\n               `(aref ,(car list) ,@(cdr list)))))\n    (setf *readtable* (copy-readtable))\n    (set-dispatch-macro-character #\\# #\\& #'array-reference-reader)))\n\n(defconstant mod-number 1000000007)\n(defconstant inf 2000000000)\n\n(defmacro let-if (var cond tbody &optional fbody)\n  `(let ((,var ,cond))\n     (if ,var\n         ,tbody\n         ,fbody)))\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (nreverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defmacro defdp (name args &body body)\n  (let ((argc (length args))\n        (key (gensym)))\n    `(let ((dp (make-hash-table :test #'equal)))\n       (defun ,name ,args\n         (let ((,key ,@(if (= argc 1) args `((list ,@args)))))\n           (let-if memo (gethash ,key dp)\n                   memo\n                   (setf (gethash ,key dp)\n                         (progn ,@body))))))))\n\n(defparameter n (read-integer))\n(defparameter w-max (read-integer))\n(defparameter w (make-array n :element-type 'fixnum))\n(defparameter v (make-array n :element-type 'fixnum))\n(dotimes (i n)\n  (setf #&(w i) (read-integer))\n  (setf #&(v i) (read-integer)))\n\n(defdp solve (index weight)\n  (the fixnum\n       (cond ((< weight 0) (- (the fixnum inf)))\n             ((< index 0) 0)\n             (t (max (+ (the fixnum (solve (1- index) (- weight #&(w index))))\n                        (the fixnum #&(v index)))\n                     (the fixnum (solve (1- index) weight)))))))\n\n(format t \"~A~%\" (the fixnum (solve (1- n) w-max)))\n", "language": "Lisp", "metadata": {"date": 1593034028, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lisp/s158379392.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s158379392", "user_id": "u684901760"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (labels ((array-reference-reader (stream c n)\n             \"Reader macro #&(array index) => (aref array index)\"\n             (declare (ignore c n))\n             (let ((list (read stream)))\n               `(aref ,(car list) ,@(cdr list)))))\n    (setf *readtable* (copy-readtable))\n    (set-dispatch-macro-character #\\# #\\& #'array-reference-reader)))\n\n(defconstant mod-number 1000000007)\n(defconstant inf 2000000000)\n\n(defmacro let-if (var cond tbody &optional fbody)\n  `(let ((,var ,cond))\n     (if ,var\n         ,tbody\n         ,fbody)))\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (nreverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defmacro defdp (name args &body body)\n  (let ((argc (length args))\n        (key (gensym)))\n    `(let ((dp (make-hash-table :test #'equal)))\n       (defun ,name ,args\n         (let ((,key ,@(if (= argc 1) args `((list ,@args)))))\n           (let-if memo (gethash ,key dp)\n                   memo\n                   (setf (gethash ,key dp)\n                         (progn ,@body))))))))\n\n(defparameter n (read-integer))\n(defparameter w-max (read-integer))\n(defparameter w (make-array n :element-type 'fixnum))\n(defparameter v (make-array n :element-type 'fixnum))\n(dotimes (i n)\n  (setf #&(w i) (read-integer))\n  (setf #&(v i) (read-integer)))\n\n(defdp solve (index weight)\n  (the fixnum\n       (cond ((< weight 0) (- (the fixnum inf)))\n             ((< index 0) 0)\n             (t (max (+ (the fixnum (solve (1- index) (- weight #&(w index))))\n                        (the fixnum #&(v index)))\n                     (the fixnum (solve (1- index) weight)))))))\n\n(format t \"~A~%\" (the fixnum (solve (1- n) w-max)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4336, "cpu_time_ms": 2206, "memory_kb": 497872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s617814683", "group_id": "codeNet:p03163", "input_text": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (labels ((array-reference-reader (stream c n)\n             \"Reader macro #&(array index) => (aref array index)\"\n             (declare (ignore c n))\n             (let ((list (read stream)))\n               `(aref ,(car list) ,@(cdr list)))))\n    (setf *readtable* (copy-readtable))\n    (set-dispatch-macro-character #\\# #\\& #'array-reference-reader)))\n\n(defconstant mod-number 1000000007)\n(defconstant inf 2000000000)\n\n(defmacro let-if (var cond tbody &optional fbody)\n  `(let ((,var ,cond))\n     (if ,var\n         ,tbody\n         ,fbody)))\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (nreverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defmacro defdp (name args &body body)\n  (let ((argc (length args))\n        (key (gensym)))\n    `(let ((dp (make-hash-table :test #'equal)))\n       (defun ,name ,args\n         (let ((,key ,@(if (= argc 1) args `((list ,@args)))))\n           (let-if memo (gethash ,key dp)\n                   memo\n                   (setf (gethash ,key dp)\n                         (progn ,@body))))))))\n\n(defparameter n (read-integer))\n(defparameter w-max (read-integer))\n(defparameter w (make-array n))\n(defparameter v (make-array n))\n(dotimes (i n)\n  (setf #&(w i) (read-integer))\n  (setf #&(v i) (read-integer)))\n\n(defdp solve (index weight)\n  (cond ((< weight 0) (- inf))\n        ((< index 0) 0)\n        (t (max (+ (solve (1- index) (- weight #&(w index)))\n                   #&(v index))\n                (solve (1- index) weight)))))\n\n;; (format t \"~A~%\" (solve (1- n) w-max))\n", "language": "Lisp", "metadata": {"date": 1593031958, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lisp/s617814683.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s617814683", "user_id": "u684901760"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (labels ((array-reference-reader (stream c n)\n             \"Reader macro #&(array index) => (aref array index)\"\n             (declare (ignore c n))\n             (let ((list (read stream)))\n               `(aref ,(car list) ,@(cdr list)))))\n    (setf *readtable* (copy-readtable))\n    (set-dispatch-macro-character #\\# #\\& #'array-reference-reader)))\n\n(defconstant mod-number 1000000007)\n(defconstant inf 2000000000)\n\n(defmacro let-if (var cond tbody &optional fbody)\n  `(let ((,var ,cond))\n     (if ,var\n         ,tbody\n         ,fbody)))\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (nreverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defmacro defdp (name args &body body)\n  (let ((argc (length args))\n        (key (gensym)))\n    `(let ((dp (make-hash-table :test #'equal)))\n       (defun ,name ,args\n         (let ((,key ,@(if (= argc 1) args `((list ,@args)))))\n           (let-if memo (gethash ,key dp)\n                   memo\n                   (setf (gethash ,key dp)\n                         (progn ,@body))))))))\n\n(defparameter n (read-integer))\n(defparameter w-max (read-integer))\n(defparameter w (make-array n))\n(defparameter v (make-array n))\n(dotimes (i n)\n  (setf #&(w i) (read-integer))\n  (setf #&(v i) (read-integer)))\n\n(defdp solve (index weight)\n  (cond ((< weight 0) (- inf))\n        ((< index 0) 0)\n        (t (max (+ (solve (1- index) (- weight #&(w index)))\n                   #&(v index))\n                (solve (1- index) weight)))))\n\n;; (format t \"~A~%\" (solve (1- n) w-max))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4190, "cpu_time_ms": 37, "memory_kb": 25424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s721180107", "group_id": "codeNet:p03163", "input_text": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (labels ((array-reference-reader (stream c n)\n             \"Reader macro #&(array index) => (aref array index)\"\n             (declare (ignore c n))\n             (let ((list (read stream)))\n               `(aref ,(car list) ,@(cdr list)))))\n    (setf *readtable* (copy-readtable))\n    (set-dispatch-macro-character #\\# #\\& #'array-reference-reader)))\n\n(defconstant mod-number 1000000007)\n(defconstant inf 2000000000)\n\n(defmacro let-if (var cond tbody &optional fbody)\n  `(let ((,var ,cond))\n     (if ,var\n         ,tbody\n         ,fbody)))\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (nreverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defmacro defdp (name args &body body)\n  (let ((argc (length args))\n        (key (gensym)))\n    `(let ((dp (make-hash-table :test #'equal)))\n       (defun ,name ,args\n         (let ((,key ,@(if (= argc 1) args `((list ,@args)))))\n           (let-if memo (gethash ,key dp)\n                   memo\n                   (setf (gethash ,key dp)\n                         (progn ,@body))))))))\n\n(defparameter n (read-integer))\n(defparameter w-max (read-integer))\n(defparameter w (make-array n))\n(defparameter v (make-array n))\n(dotimes (i n)\n  (setf #&(w i) (read-integer))\n  (setf #&(v i) (read-integer)))\n\n(defdp solve (index weight)\n  (cond ((< weight 0) (- inf))\n        ((< index 0) 0)\n        (t (max (+ (solve (1- index) (- weight #&(w index)))\n                   #&(v index))\n                (solve (1- index) weight)))))\n\n(format t \"~A~%\" (solve (1- n) w-max))\n", "language": "Lisp", "metadata": {"date": 1593031716, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lisp/s721180107.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s721180107", "user_id": "u684901760"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (labels ((array-reference-reader (stream c n)\n             \"Reader macro #&(array index) => (aref array index)\"\n             (declare (ignore c n))\n             (let ((list (read stream)))\n               `(aref ,(car list) ,@(cdr list)))))\n    (setf *readtable* (copy-readtable))\n    (set-dispatch-macro-character #\\# #\\& #'array-reference-reader)))\n\n(defconstant mod-number 1000000007)\n(defconstant inf 2000000000)\n\n(defmacro let-if (var cond tbody &optional fbody)\n  `(let ((,var ,cond))\n     (if ,var\n         ,tbody\n         ,fbody)))\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (nreverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defmacro defdp (name args &body body)\n  (let ((argc (length args))\n        (key (gensym)))\n    `(let ((dp (make-hash-table :test #'equal)))\n       (defun ,name ,args\n         (let ((,key ,@(if (= argc 1) args `((list ,@args)))))\n           (let-if memo (gethash ,key dp)\n                   memo\n                   (setf (gethash ,key dp)\n                         (progn ,@body))))))))\n\n(defparameter n (read-integer))\n(defparameter w-max (read-integer))\n(defparameter w (make-array n))\n(defparameter v (make-array n))\n(dotimes (i n)\n  (setf #&(w i) (read-integer))\n  (setf #&(v i) (read-integer)))\n\n(defdp solve (index weight)\n  (cond ((< weight 0) (- inf))\n        ((< index 0) 0)\n        (t (max (+ (solve (1- index) (- weight #&(w index)))\n                   #&(v index))\n                (solve (1- index) weight)))))\n\n(format t \"~A~%\" (solve (1- n) w-max))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4187, "cpu_time_ms": 2206, "memory_kb": 497880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s557966943", "group_id": "codeNet:p03163", "input_text": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (labels ((array-reference-reader (stream c n)\n             \"Reader macro #&(array index) => (aref array index)\"\n             (declare (ignore c n))\n             (let ((list (read stream)))\n               `(aref ,(car list) ,@(cdr list)))))\n    (setf *readtable* (copy-readtable))\n    (set-dispatch-macro-character #\\# #\\& #'array-reference-reader)))\n\n(defconstant mod-number 1000000007)\n(defconstant inf 1000000000000000)\n\n(defmacro let-if (var cond tbody &optional fbody)\n  `(let ((,var ,cond))\n     (if ,var\n         ,tbody\n         ,fbody)))\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (nreverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defmacro defdp (name args &body body)\n  (let ((argc (length args)))\n    `(let ((dp (make-hash-table :test #'equal)))\n       (defun ,name ,args\n         (let-if memo (gethash ,@(if (= argc 1)\n                                     args\n                                     `((list ,@args)))\n                               dp)\n                 memo\n                 (setf (gethash ,@(if (= argc 1)\n                                      args\n                                      `((list ,@args)))\n                                dp)\n                       (progn ,@body)))))))\n\n(defparameter n (read-integer))\n(defparameter w-max (read-integer))\n(defparameter w (make-array n))\n(defparameter v (make-array n))\n(dotimes (i n)\n  (setf #&(w i) (read-integer))\n  (setf #&(v i) (read-integer)))\n\n(defdp solve (index weight)\n  (cond ((< weight 0) (- inf))\n        ((< index 0) 0)\n        (t (max (+ (solve (1- index) (- weight #&(w index)))\n                   #&(v index))\n                (solve (1- index) weight)))))\n\n(format t \"~A~%\" (solve (1- n) w-max))\n", "language": "Lisp", "metadata": {"date": 1593031228, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lisp/s557966943.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s557966943", "user_id": "u684901760"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "(unless (member :child-sbcl *features*)\n  #-swank (quit\n            :unix-status\n            (process-exit-code\n              (run-program *runtime-pathname*\n                           `(\"--control-stack-size\" \"128MB\"\n                             \"--noinform\"\n                             \"--disable-ldb\"\n                             \"--lose-on-corruption\"\n                             \"--end-runtime-options\"\n                             \"--eval\" \"(push :child-sbcl *features*)\"\n                             \"--script\" ,(namestring *load-pathname*))\n                           :output t :error t :input t))))\n\n(eval-when (:compile-toplevel)\n  #-swank (proclaim '(optimize (speed 3) (debug 0) (safety 0))))\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (labels ((array-reference-reader (stream c n)\n             \"Reader macro #&(array index) => (aref array index)\"\n             (declare (ignore c n))\n             (let ((list (read stream)))\n               `(aref ,(car list) ,@(cdr list)))))\n    (setf *readtable* (copy-readtable))\n    (set-dispatch-macro-character #\\# #\\& #'array-reference-reader)))\n\n(defconstant mod-number 1000000007)\n(defconstant inf 1000000000000000)\n\n(defmacro let-if (var cond tbody &optional fbody)\n  `(let ((,var ,cond))\n     (if ,var\n         ,tbody\n         ,fbody)))\n\n(defun unfold (p f g seed &optional (tail-gen (lambda () '())))\n  (if (p seed)\n      (tail-gen seed)\n      (cons (f seed)\n            (unfold p f g (g seed) tail-gen))))\n\n(defun iota (c &optional (s 0) (step 1) (acc nil))\n  (if (zerop c)\n      (nreverse acc)\n      (iota (1- c) (+ s step) step (cons s acc))))\n\n(defun sum (list &optional (init 0))\n  (reduce #'+ list :initial-value init))\n\n(defun chomp (str)\n  (string-right-trim '(#\\Return #\\Linefeed) str))\n\n(defun read-integer (&optional (in *standard-input*))\n  (declare (inline read-byte))\n  (labels ((number-char-p (b)\n             (<= #.(char-code #\\0) b #.(char-code #\\9)))\n           (minus-char-p (b)\n             (= b #.(char-code #\\-)))\n           (to-number (b)\n             (- b #.(char-code #\\0))))\n    (declare (inline number-char-p minus-char-p to-number))\n    (macrolet ((%read-byte ()\n                 '(the (unsigned-byte 8)\n                       #+swank (char-code (read-char in nil #\\Nul))\n                       #-swank (read-byte in nil 0))))\n      (let* ((minus-p nil)\n             (x (loop for b = (%read-byte)\n                      if (number-char-p b)\n                        return (to-number b)\n                        end\n                      if (minus-char-p b)\n                        do (setf minus-p t))))\n        (declare (boolean minus-p) (fixnum x))\n        (the fixnum (loop for b = (%read-byte)\n                          and y = x then (+ (* y 10) (to-number b))\n                          unless (number-char-p b)\n                            return (funcall (if minus-p #'- #'+) y)))))))\n\n(defun split (x str &optional (acc nil))\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (split x (subseq str (+ pos size)) (cons (subseq str 0 pos) acc))\n        (nreverse (cons str acc)))))\n\n(defmacro minf (field &rest x)\n  `(setf ,field (min ,field ,@x)))\n\n(defmacro maxf (field &rest x)\n  `(setf ,field (max ,field ,@x)))\n\n(defmacro debug-print (x)\n  `(let ((y ,x))\n    (format t \"~A: ~A~%\" ',x y)\n    y))\n\n(defmacro defdp (name args &body body)\n  (let ((argc (length args)))\n    `(let ((dp (make-hash-table :test #'equal)))\n       (defun ,name ,args\n         (let-if memo (gethash ,@(if (= argc 1)\n                                     args\n                                     `((list ,@args)))\n                               dp)\n                 memo\n                 (setf (gethash ,@(if (= argc 1)\n                                      args\n                                      `((list ,@args)))\n                                dp)\n                       (progn ,@body)))))))\n\n(defparameter n (read-integer))\n(defparameter w-max (read-integer))\n(defparameter w (make-array n))\n(defparameter v (make-array n))\n(dotimes (i n)\n  (setf #&(w i) (read-integer))\n  (setf #&(v i) (read-integer)))\n\n(defdp solve (index weight)\n  (cond ((< weight 0) (- inf))\n        ((< index 0) 0)\n        (t (max (+ (solve (1- index) (- weight #&(w index)))\n                   #&(v index))\n                (solve (1- index) weight)))))\n\n(format t \"~A~%\" (solve (1- n) w-max))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4381, "cpu_time_ms": 2206, "memory_kb": 490876}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s168126894", "group_id": "codeNet:p03163", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n\n(defun main (n m item)\n  (dp f (p w) '(101 100010)\n    (if (eq p n) 0\n        (apply #'max\n               (append (list 0)\n                       (loop for i from 0 to 1\n                             for nv = (* i (cdr (aref item p)))\n                             for nw = (+ w (* i (car (aref item p))))\n                             when (<= nw m)\n                               collect (+ nv\n                                          (f (1+ p)\n                                             nw)))))))\n  (f 0 0))\n\n\n(let* ((n (read))\n       (m (read))\n       (item (make-array (list n) :initial-contents\n                         (loop repeat n collect (cons (read) (read))))))\n  (princ (main n m item)))\n", "language": "Lisp", "metadata": {"date": 1584490105, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lisp/s168126894.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s168126894", "user_id": "u493610446"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n\n(defun main (n m item)\n  (dp f (p w) '(101 100010)\n    (if (eq p n) 0\n        (apply #'max\n               (append (list 0)\n                       (loop for i from 0 to 1\n                             for nv = (* i (cdr (aref item p)))\n                             for nw = (+ w (* i (car (aref item p))))\n                             when (<= nw m)\n                               collect (+ nv\n                                          (f (1+ p)\n                                             nw)))))))\n  (f 0 0))\n\n\n(let* ((n (read))\n       (m (read))\n       (item (make-array (list n) :initial-contents\n                         (loop repeat n collect (cons (read) (read))))))\n  (princ (main n m item)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1610, "cpu_time_ms": 1661, "memory_kb": 142360}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s265926403", "group_id": "codeNet:p03163", "input_text": "(defun knapsack-p-map-rec-f (things w func)\n  (if things\n      (let* ((thing (car things))\n             (dp-arr (knapsack-p-map-rec-f (cdr things) w func)))\n        (if (>= w (car thing))\n            (concatenate 'vector (subseq dp-arr 0 (car thing))\n                         (map 'vector (lambda (in not-in)\n                                        (funcall func not-in (+ in (cdr thing))))\n                              dp-arr (subseq dp-arr (car thing))))\n            dp-arr))\n      (make-array w :initial-element 0)))\n\n(defun knapsack-problem (n w things)\n  (let* ((arr (knapsack-p-map-rec-f things (1+ w) #'max)))\n    (aref arr (1- (length arr)))))\n\n(let* ((n (read))\n       (w (read))\n       (things (loop :repeat n :collect (cons (read) (read)))))\n  (princ (knapsack-problem n w things)))\n", "language": "Lisp", "metadata": {"date": 1576073971, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Lisp/s265926403.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s265926403", "user_id": "u610490393"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "(defun knapsack-p-map-rec-f (things w func)\n  (if things\n      (let* ((thing (car things))\n             (dp-arr (knapsack-p-map-rec-f (cdr things) w func)))\n        (if (>= w (car thing))\n            (concatenate 'vector (subseq dp-arr 0 (car thing))\n                         (map 'vector (lambda (in not-in)\n                                        (funcall func not-in (+ in (cdr thing))))\n                              dp-arr (subseq dp-arr (car thing))))\n            dp-arr))\n      (make-array w :initial-element 0)))\n\n(defun knapsack-problem (n w things)\n  (let* ((arr (knapsack-p-map-rec-f things (1+ w) #'max)))\n    (aref arr (1- (length arr)))))\n\n(let* ((n (read))\n       (w (read))\n       (things (loop :repeat n :collect (cons (read) (read)))))\n  (princ (knapsack-problem n w things)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 795, "cpu_time_ms": 1127, "memory_kb": 100836}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s868658143", "group_id": "codeNet:p03165", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((ss (coerce (read-line) 'simple-base-string))\n         (slen (length ss))\n         (tt (coerce (read-line) 'simple-base-string))\n         (tlen (length tt))\n         (dp (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (prev-xs (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (prev-ys (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (cs (make-array '(3001 3001) :element-type 'base-char :initial-element #\\Nul)))\n    (dotimes (x (+ slen 1))\n      (dotimes (y (+ tlen 1))\n        (unless (= x y 0)\n          (let ((value -1)\n                (prev-x 0)\n                (prev-y 0)\n                (char #\\Nul))\n            (when (and (> x 0) (> (aref dp (- x 1) y) value))\n              (setq value (aref dp (- x 1) y)\n                    prev-x (- x 1)\n                    prev-y y))\n            (when (and (> y 0) (> (aref dp x (- y 1)) value))\n              (setq value (aref dp x (- y 1))\n                    prev-x x\n                    prev-y (- y 1)))\n            (when (and (> x 0) (> y 0)\n                       (char= (aref ss (- x 1)) (aref tt (- y 1)))\n                       (> (+ 1 (aref dp (- x 1) (- y 1))) value))\n              (setq value (+ 1 (aref dp (- x 1) (- y 1)))\n                    prev-x (- x 1)\n                    prev-y (- y 1)\n                    char (aref ss (- x 1))))\n            (setf (aref dp x y) value\n                  (aref prev-xs x y) prev-x\n                  (aref prev-ys x y) prev-y\n                  (aref cs x y) char)))))\n    (let ((x slen)\n          (y tlen)\n          res)\n      (loop until (= x y 0)\n            unless (char= (aref cs x y) #\\Nul)\n            do (push (aref cs x y) res)\n            do (psetq x (aref prev-xs x y)\n                      y (aref prev-ys x y)))\n      (map () #'write-char res)\n      (terpri))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"axyb\nabyxb\n\"\n    \"axb\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"aa\nxayaz\n\"\n    \"aa\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"a\nz\n\"\n    \"\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"abracadabra\navadakedavra\n\"\n    \"aaadara\n\")))\n", "language": "Lisp", "metadata": {"date": 1593261829, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s868658143.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s868658143", "user_id": "u352600849"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((ss (coerce (read-line) 'simple-base-string))\n         (slen (length ss))\n         (tt (coerce (read-line) 'simple-base-string))\n         (tlen (length tt))\n         (dp (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (prev-xs (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (prev-ys (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (cs (make-array '(3001 3001) :element-type 'base-char :initial-element #\\Nul)))\n    (dotimes (x (+ slen 1))\n      (dotimes (y (+ tlen 1))\n        (unless (= x y 0)\n          (let ((value -1)\n                (prev-x 0)\n                (prev-y 0)\n                (char #\\Nul))\n            (when (and (> x 0) (> (aref dp (- x 1) y) value))\n              (setq value (aref dp (- x 1) y)\n                    prev-x (- x 1)\n                    prev-y y))\n            (when (and (> y 0) (> (aref dp x (- y 1)) value))\n              (setq value (aref dp x (- y 1))\n                    prev-x x\n                    prev-y (- y 1)))\n            (when (and (> x 0) (> y 0)\n                       (char= (aref ss (- x 1)) (aref tt (- y 1)))\n                       (> (+ 1 (aref dp (- x 1) (- y 1))) value))\n              (setq value (+ 1 (aref dp (- x 1) (- y 1)))\n                    prev-x (- x 1)\n                    prev-y (- y 1)\n                    char (aref ss (- x 1))))\n            (setf (aref dp x y) value\n                  (aref prev-xs x y) prev-x\n                  (aref prev-ys x y) prev-y\n                  (aref cs x y) char)))))\n    (let ((x slen)\n          (y tlen)\n          res)\n      (loop until (= x y 0)\n            unless (char= (aref cs x y) #\\Nul)\n            do (push (aref cs x y) res)\n            do (psetq x (aref prev-xs x y)\n                      y (aref prev-ys x y)))\n      (map () #'write-char res)\n      (terpri))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"axyb\nabyxb\n\"\n    \"axb\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"aa\nxayaz\n\"\n    \"aa\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"a\nz\n\"\n    \"\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"abracadabra\navadakedavra\n\"\n    \"aaadara\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5538, "cpu_time_ms": 150, "memory_kb": 85756}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s598390084", "group_id": "codeNet:p03165", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((ss (coerce (read-line) 'simple-base-string))\n         (slen (length ss))\n         (tt (coerce (read-line) 'simple-base-string))\n         (tlen (length tt))\n         (dp (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (prev-xs (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (prev-ys (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (cs (make-array '(3001 3001) :element-type 'base-char :initial-element #\\Nul)))\n    (dotimes (x (+ slen 1))\n      (dotimes (y (+ tlen 1))\n        (unless (= x y 0)\n          (let ((value -1)\n                (prev-x 0)\n                (prev-y 0)\n                (char #\\Nul))\n            (when (and (> x 0) (> (aref dp (- x 1) y) value))\n              (setq value (aref dp (- x 1) y)\n                    prev-x (- x 1)\n                    prev-y y))\n            (when (and (> y 0) (> (aref dp x (- y 1)) value))\n              (setq value (aref dp x (- y 1))\n                    prev-x x\n                    prev-y (- y 1)))\n            (when (and (> x 0) (> y 0)\n                       (char= (aref ss (- x 1)) (aref tt (- y 1)))\n                       (> (+ 1 (aref dp (- x 1) (- y 1))) value))\n              (setq value (+ 1 (aref dp (- x 1) (- y 1)))\n                    prev-x (- x 1)\n                    prev-y (- y 1)\n                    char (aref ss (- x 1))))\n            (setf (aref dp x y) value\n                  (aref prev-xs x y) prev-x\n                  (aref prev-ys x y) prev-y\n                  (aref cs x y) char)))))\n    (let ((x slen)\n          (y tlen)\n          res)\n      (loop until (= x y 0)\n            unless (char= (aref cs x y) #\\Nul)\n            do (push (aref cs x y) res)\n            do (psetq x (aref prev-xs x y)\n                      y (aref prev-ys x y)))\n      (map () #'write-char res)\n      (terpri))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"axyb\nabyxb\n\"\n    \"axb\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"aa\nxayaz\n\"\n    \"aa\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"a\nz\n\"\n    \"\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"abracadabra\navadakedavra\n\"\n    \"aaadara\n\")))\n", "language": "Lisp", "metadata": {"date": 1593261763, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s598390084.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s598390084", "user_id": "u352600849"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(in-package :cl-user)\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((ss (coerce (read-line) 'simple-base-string))\n         (slen (length ss))\n         (tt (coerce (read-line) 'simple-base-string))\n         (tlen (length tt))\n         (dp (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (prev-xs (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (prev-ys (make-array '(3001 3001) :element-type 'uint16 :initial-element 0))\n         (cs (make-array '(3001 3001) :element-type 'base-char :initial-element #\\Nul)))\n    (dotimes (x (+ slen 1))\n      (dotimes (y (+ tlen 1))\n        (unless (= x y 0)\n          (let ((value -1)\n                (prev-x 0)\n                (prev-y 0)\n                (char #\\Nul))\n            (when (and (> x 0) (> (aref dp (- x 1) y) value))\n              (setq value (aref dp (- x 1) y)\n                    prev-x (- x 1)\n                    prev-y y))\n            (when (and (> y 0) (> (aref dp x (- y 1)) value))\n              (setq value (aref dp x (- y 1))\n                    prev-x x\n                    prev-y (- y 1)))\n            (when (and (> x 0) (> y 0)\n                       (char= (aref ss (- x 1)) (aref tt (- y 1)))\n                       (> (+ 1 (aref dp (- x 1) (- y 1))) value))\n              (setq value (+ 1 (aref dp (- x 1) (- y 1)))\n                    prev-x (- x 1)\n                    prev-y (- y 1)\n                    char (aref ss (- x 1))))\n            (setf (aref dp x y) value\n                  (aref prev-xs x y) prev-x\n                  (aref prev-ys x y) prev-y\n                  (aref cs x y) char)))))\n    (let ((x slen)\n          (y tlen)\n          res)\n      (loop until (= x y 0)\n            unless (char= (aref cs x y) #\\Nul)\n            do (push (aref cs x y) res)\n            do (psetq x (aref prev-xs x y)\n                      y (aref prev-ys x y)))\n      (map () #'write-char res)\n      (terpri))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"axyb\nabyxb\n\"\n    \"axb\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"aa\nxayaz\n\"\n    \"aa\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"a\nz\n\"\n    \"\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"abracadabra\navadakedavra\n\"\n    \"aaadara\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5520, "cpu_time_ms": 208, "memory_kb": 85696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s742087805", "group_id": "codeNet:p03165", "input_text": "(setq a (string (read)))\n(setq al (concatenate 'list a))\n(setq b (string (read)))\n(setq bl (concatenate 'list b))\n\n(setq n (length al))\n(setq m (length bl))\n(setq dp (make-array `(,(+ n 1) ,(+ m 1)) :initial-element nil))\n(dotimes (i n)\n  (dotimes (j m)\n    (if (eq (elt al i) (elt bl j))\n       (setf (aref dp (+ i 1) (+ j 1))\n             (concatenate 'string (aref dp i j) (string (elt al i)))\n             )\n        (if (> (length (aref dp (+ i 1) j))\n               (length (aref dp i (+ j 1)))\n               )\n            (setf (aref dp (+ i 1) (+ j 1))\n                  (aref dp (+ i 1) j))\n            (setf (aref dp (+ i 1) (+ j 1))\n                  (aref dp i (+ j 1))\n                  )\n            )\n        )\n    ))\n(format t (string-downcase (aref dp n m", "language": "Lisp", "metadata": {"date": 1590237568, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s742087805.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s742087805", "user_id": "u223904637"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "(setq a (string (read)))\n(setq al (concatenate 'list a))\n(setq b (string (read)))\n(setq bl (concatenate 'list b))\n\n(setq n (length al))\n(setq m (length bl))\n(setq dp (make-array `(,(+ n 1) ,(+ m 1)) :initial-element nil))\n(dotimes (i n)\n  (dotimes (j m)\n    (if (eq (elt al i) (elt bl j))\n       (setf (aref dp (+ i 1) (+ j 1))\n             (concatenate 'string (aref dp i j) (string (elt al i)))\n             )\n        (if (> (length (aref dp (+ i 1) j))\n               (length (aref dp i (+ j 1)))\n               )\n            (setf (aref dp (+ i 1) (+ j 1))\n                  (aref dp (+ i 1) j))\n            (setf (aref dp (+ i 1) (+ j 1))\n                  (aref dp i (+ j 1))\n                  )\n            )\n        )\n    ))\n(format t (string-downcase (aref dp n m", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 772, "cpu_time_ms": 2105, "memory_kb": 162276}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s710028644", "group_id": "codeNet:p03165", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline read-schar))\n(defun read-schar (&optional (stream *standard-input*))\n  (declare #-swank (sb-kernel:ansi-stream stream)\n           (inline read-byte))\n  #+swank (read-char stream nil #\\Newline) ; on SLIME\n  #-swank (code-char (read-byte stream nil #.(char-code #\\Newline))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (dp (make-array 1001 :element-type 'uint31 :initial-element 0)))\n    (declare (uint16 h w))\n    (setf (aref dp 1) 1)\n    (dotimes (_ h)\n      (loop for x from 1 to w\n            do (setf (aref dp x)\n                     (if (char= #\\. (read-schar))\n                         (let ((sum (+ (aref dp x) (aref dp (- x 1)))))\n                           (if (>= sum +mod+)\n                               (- sum +mod+)\n                               sum))\n                         0)))\n      (read-schar))\n    \n    (println (aref dp w))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    ;; (run-program \"C:/Windows/System32/WindowsPowerShell/v1.0/powershell.exe\" '(\"get-clipboard\") :output out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3 4\n...#\n.#..\n....\n\"\n    \"3\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 2\n..\n#.\n..\n.#\n..\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 5\n..#..\n.....\n#...#\n.....\n..#..\n\"\n    \"24\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"20 20\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n\"\n    \"345263555\n\")))\n", "language": "Lisp", "metadata": {"date": 1579752130, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s710028644.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s710028644", "user_id": "u352600849"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline read-schar))\n(defun read-schar (&optional (stream *standard-input*))\n  (declare #-swank (sb-kernel:ansi-stream stream)\n           (inline read-byte))\n  #+swank (read-char stream nil #\\Newline) ; on SLIME\n  #-swank (code-char (read-byte stream nil #.(char-code #\\Newline))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((h (read))\n         (w (read))\n         (dp (make-array 1001 :element-type 'uint31 :initial-element 0)))\n    (declare (uint16 h w))\n    (setf (aref dp 1) 1)\n    (dotimes (_ h)\n      (loop for x from 1 to w\n            do (setf (aref dp x)\n                     (if (char= #\\. (read-schar))\n                         (let ((sum (+ (aref dp x) (aref dp (- x 1)))))\n                           (if (>= sum +mod+)\n                               (- sum +mod+)\n                               sum))\n                         0)))\n      (read-schar))\n    \n    (println (aref dp w))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    ;; (run-program \"C:/Windows/System32/WindowsPowerShell/v1.0/powershell.exe\" '(\"get-clipboard\") :output out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"3 4\n...#\n.#..\n....\n\"\n    \"3\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 2\n..\n#.\n..\n.#\n..\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 5\n..#..\n.....\n#...#\n.....\n..#..\n\"\n    \"24\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"20 20\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n\"\n    \"345263555\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5186, "cpu_time_ms": 2104, "memory_kb": 31208}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s039523998", "group_id": "codeNet:p03165", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((ss (coerce (read-line) 'simple-base-string))\n         (tt (coerce (read-line) 'simple-base-string))\n         (slen (length ss))\n         (tlen (length tt))\n         (dp (make-array (list (+ 1 slen) (+ 1 tlen))\n                         :element-type 'uint32\n                         :initial-element 0)))\n    (declare (uint16 slen tlen))\n    (loop for x from 1 to slen\n          do (loop for y from 1 to tlen\n                   if (char= (aref ss (- x 1)) (aref tt (- y 1)))\n                   do (setf (aref dp x y) (+ 1 (aref dp (- x 1) (- y 1))))\n                   else if (>= (aref dp (- x 1) y) (aref dp x (- y 1)))\n                   do (setf (aref dp x y) (aref dp (- x 1) y))\n                   else\n                   do (setf (aref dp x y) (aref dp x (- y 1)))))\n    (let* ((res (make-string (aref dp slen tlen) :element-type 'base-char))\n           (x slen)\n           (y tlen)\n           (pos (- (length res) 1)))\n      (loop while (>= pos 0)\n            for len = (aref dp x y)\n            if (and (= (+ 1 (aref dp (- x 1) (- y 1))) (aref dp x y))\n                    (char= (aref ss (- x 1)) (aref tt (- y 1))))\n            do (setf (aref res pos) (aref ss (- x 1))\n                     x (- x 1)\n                     y (- y 1)\n                     pos (- pos 1))\n            else if (and (> x 0) (= (aref dp (- x 1) y) (aref dp x y)))\n            do (decf x)\n            else\n            do (decf y))\n      (write-line res))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    ;; (run-program \"C:/Windows/System32/WindowsPowerShell/v1.0/powershell.exe\" '(\"get-clipboard\") :output out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"axyb\nabyxb\n\"\n    \"axb\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"aa\nxayaz\n\"\n    \"aa\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"a\nz\n\"\n    \"\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"abracadabra\navadakedavra\n\"\n    \"aaadara\n\")))\n", "language": "Lisp", "metadata": {"date": 1579738859, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s039523998.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s039523998", "user_id": "u352600849"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT)\n  (let* ((ss (coerce (read-line) 'simple-base-string))\n         (tt (coerce (read-line) 'simple-base-string))\n         (slen (length ss))\n         (tlen (length tt))\n         (dp (make-array (list (+ 1 slen) (+ 1 tlen))\n                         :element-type 'uint32\n                         :initial-element 0)))\n    (declare (uint16 slen tlen))\n    (loop for x from 1 to slen\n          do (loop for y from 1 to tlen\n                   if (char= (aref ss (- x 1)) (aref tt (- y 1)))\n                   do (setf (aref dp x y) (+ 1 (aref dp (- x 1) (- y 1))))\n                   else if (>= (aref dp (- x 1) y) (aref dp x (- y 1)))\n                   do (setf (aref dp x y) (aref dp (- x 1) y))\n                   else\n                   do (setf (aref dp x y) (aref dp x (- y 1)))))\n    (let* ((res (make-string (aref dp slen tlen) :element-type 'base-char))\n           (x slen)\n           (y tlen)\n           (pos (- (length res) 1)))\n      (loop while (>= pos 0)\n            for len = (aref dp x y)\n            if (and (= (+ 1 (aref dp (- x 1) (- y 1))) (aref dp x y))\n                    (char= (aref ss (- x 1)) (aref tt (- y 1))))\n            do (setf (aref res pos) (aref ss (- x 1))\n                     x (- x 1)\n                     y (- y 1)\n                     pos (- pos 1))\n            else if (and (> x 0) (= (aref dp (- x 1) y) (aref dp x y)))\n            do (decf x)\n            else\n            do (decf y))\n      (write-line res))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    ;; (run-program \"C:/Windows/System32/WindowsPowerShell/v1.0/powershell.exe\" '(\"get-clipboard\") :output out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"axyb\nabyxb\n\"\n    \"axb\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"aa\nxayaz\n\"\n    \"aa\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"a\nz\n\"\n    \"\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"abracadabra\navadakedavra\n\"\n    \"aaadara\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5315, "cpu_time_ms": 249, "memory_kb": 49640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s441104623", "group_id": "codeNet:p03165", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((ss (coerce (read-line) 'simple-base-string))\n         (tt (coerce (read-line) 'simple-base-string))\n         (slen (length ss))\n         (tlen (length tt))\n         (dp (make-array (list (+ 1 slen) (+ 1 tlen))\n                         :element-type 'uint32\n                         :initial-element 0)))\n    (declare (uint16 slen tlen))\n    (loop for x from 1 to slen\n          do (loop for y from 1 to tlen\n                   if (char= (aref ss (- x 1)) (aref tt (- y 1)))\n                   do (setf (aref dp x y) (+ 1 (aref dp (- x 1) (- y 1))))\n                   else if (>= (aref dp (- x 1) y) (aref dp x (- y 1)))\n                   do (setf (aref dp x y) (aref dp (- x 1) y))\n                   else\n                   do (setf (aref dp x y) (aref dp x (- y 1)))))\n    #>dp\n    (let* ((res (make-string (aref dp slen tlen) :element-type 'base-char))\n           (x slen)\n           (y tlen)\n           (pos (- (length res) 1)))\n      (loop while (>= pos 0)\n            for len = (aref dp x y)\n            if (and (= (+ 1 (aref dp (- x 1) (- y 1))) (aref dp x y))\n                    (char= (aref ss (- x 1)) (aref tt (- y 1))))\n            do (setf (aref res pos) (aref ss (- x 1))\n                     x (- x 1)\n                     y (- y 1)\n                     pos (- pos 1))\n            else if (and (> x 0) (= (aref dp (- x 1) y) (aref dp x y)))\n            do (decf x)\n            else\n            do (assert (and (> y 0) (= (aref dp x (- y 1)) (aref dp x y))))\n               (decf y))\n      (write-line res))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    ;; (run-program \"C:/Windows/System32/WindowsPowerShell/v1.0/powershell.exe\" '(\"get-clipboard\") :output out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"axyb\nabyxb\n\"\n    \"axb\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"aa\nxayaz\n\"\n    \"aa\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"a\nz\n\"\n    \"\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"abracadabra\navadakedavra\n\"\n    \"aaadara\n\")))\n", "language": "Lisp", "metadata": {"date": 1579738797, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s441104623.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s441104623", "user_id": "u352600849"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((ss (coerce (read-line) 'simple-base-string))\n         (tt (coerce (read-line) 'simple-base-string))\n         (slen (length ss))\n         (tlen (length tt))\n         (dp (make-array (list (+ 1 slen) (+ 1 tlen))\n                         :element-type 'uint32\n                         :initial-element 0)))\n    (declare (uint16 slen tlen))\n    (loop for x from 1 to slen\n          do (loop for y from 1 to tlen\n                   if (char= (aref ss (- x 1)) (aref tt (- y 1)))\n                   do (setf (aref dp x y) (+ 1 (aref dp (- x 1) (- y 1))))\n                   else if (>= (aref dp (- x 1) y) (aref dp x (- y 1)))\n                   do (setf (aref dp x y) (aref dp (- x 1) y))\n                   else\n                   do (setf (aref dp x y) (aref dp x (- y 1)))))\n    #>dp\n    (let* ((res (make-string (aref dp slen tlen) :element-type 'base-char))\n           (x slen)\n           (y tlen)\n           (pos (- (length res) 1)))\n      (loop while (>= pos 0)\n            for len = (aref dp x y)\n            if (and (= (+ 1 (aref dp (- x 1) (- y 1))) (aref dp x y))\n                    (char= (aref ss (- x 1)) (aref tt (- y 1))))\n            do (setf (aref res pos) (aref ss (- x 1))\n                     x (- x 1)\n                     y (- y 1)\n                     pos (- pos 1))\n            else if (and (> x 0) (= (aref dp (- x 1) y) (aref dp x y)))\n            do (decf x)\n            else\n            do (assert (and (> y 0) (= (aref dp x (- y 1)) (aref dp x y))))\n               (decf y))\n      (write-line res))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    ;; (run-program \"C:/Windows/System32/WindowsPowerShell/v1.0/powershell.exe\" '(\"get-clipboard\") :output out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"axyb\nabyxb\n\"\n    \"axb\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"aa\nxayaz\n\"\n    \"aa\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"a\nz\n\"\n    \"\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"abracadabra\navadakedavra\n\"\n    \"aaadara\n\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5382, "cpu_time_ms": 217, "memory_kb": 49640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s412655873", "group_id": "codeNet:p03165", "input_text": "(defun lcs (str1 str2 &key (backtrace nil))\n  (let* ((dp-table (make-array (list (1+ (length str1)) (1+ (length str2)))\n                               :initial-element 0 :element-type 'fixnum)))\n    (loop :for k :from 1 :upto (length str1)\n          :do(loop :for l :from 1 :upto (length str2)\n                   :do (setf (aref dp-table k l) (max (aref dp-table (1- k) l)\n                                                      (aref dp-table k (1- l))\n                                                      (if (char= (aref str1 (1- k))\n                                                                 (aref str2 (1- l)))\n                                                          (1+ (aref dp-table (1- k) (1- l)))\n                                                          0)))))\n    (if backtrace\n        (let* ((ret nil)\n               (mem (length str2)))\n          (loop :for k :from (length str1) :downto 1\n                :do(loop :for l :from mem :downto 1\n                         :always (= (aref dp-table k l)\n                                    (aref dp-table k mem))\n                         :never (if (and (not (= (aref dp-table k l) (aref dp-table (1- k) l)))\n                                         (not (= (aref dp-table k l) (aref dp-table k (1- l)))))\n                                    (progn (push l ret) (setf mem (1- l))))))\n          (concatenate 'String (loop :for k :in ret :collect (aref str2 (1- k)))))\n        dp-table)))\n(princ (lcs (read-line) (read-line) :backtrace t))\n", "language": "Lisp", "metadata": {"date": 1578414010, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s412655873.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s412655873", "user_id": "u610490393"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "(defun lcs (str1 str2 &key (backtrace nil))\n  (let* ((dp-table (make-array (list (1+ (length str1)) (1+ (length str2)))\n                               :initial-element 0 :element-type 'fixnum)))\n    (loop :for k :from 1 :upto (length str1)\n          :do(loop :for l :from 1 :upto (length str2)\n                   :do (setf (aref dp-table k l) (max (aref dp-table (1- k) l)\n                                                      (aref dp-table k (1- l))\n                                                      (if (char= (aref str1 (1- k))\n                                                                 (aref str2 (1- l)))\n                                                          (1+ (aref dp-table (1- k) (1- l)))\n                                                          0)))))\n    (if backtrace\n        (let* ((ret nil)\n               (mem (length str2)))\n          (loop :for k :from (length str1) :downto 1\n                :do(loop :for l :from mem :downto 1\n                         :always (= (aref dp-table k l)\n                                    (aref dp-table k mem))\n                         :never (if (and (not (= (aref dp-table k l) (aref dp-table (1- k) l)))\n                                         (not (= (aref dp-table k l) (aref dp-table k (1- l)))))\n                                    (progn (push l ret) (setf mem (1- l))))))\n          (concatenate 'String (loop :for k :in ret :collect (aref str2 (1- k)))))\n        dp-table)))\n(princ (lcs (read-line) (read-line) :backtrace t))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1503, "cpu_time_ms": 259, "memory_kb": 80360}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s650591366", "group_id": "codeNet:p03165", "input_text": "(defun lcs (str1 str2 &key (backtrace nil))\n  (let* ((dp-table (make-array (list (1+ (length str1)) (1+ (length str2)))\n                               :initial-element 0 :element-type 'fixnum)))\n    (loop :for k :from 1 :upto (length str1)\n          :do(loop :for l :from 1 :upto (length str2)\n                   :do (setf (aref dp-table k l) (max (aref dp-table (1- k) l)\n                                                      (aref dp-table k (1- l))\n                                                      (if (char= (aref str1 (1- k))\n                                                                 (aref str2 (1- l)))\n                                                          (1+ (aref dp-table (1- k) (1- l)))\n                                                          0)))))\n    (if backtrace\n        (let* ((ret nil)\n               (mem (length str2)))\n          (loop :for k :from (length str1) :downto 1\n                :do(loop :for l :from (1- mem) :downto 1\n                         :always (= (aref dp-table k l)\n                                    (aref dp-table k (1- mem)))\n                         :never (if (and (not (= (aref dp-table k l) (aref dp-table (1- k) l)))\n                                         (not (= (aref dp-table k l) (aref dp-table k (1- l)))))\n                                    (push l ret))))\n          (concatenate 'String (loop :for k :in ret :collect (aref str2 (1- k)))))\n        dp-table)))\n(princ (lcs (read-line) (read-line) :backtrace t))\n", "language": "Lisp", "metadata": {"date": 1578413811, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s650591366.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s650591366", "user_id": "u610490393"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "(defun lcs (str1 str2 &key (backtrace nil))\n  (let* ((dp-table (make-array (list (1+ (length str1)) (1+ (length str2)))\n                               :initial-element 0 :element-type 'fixnum)))\n    (loop :for k :from 1 :upto (length str1)\n          :do(loop :for l :from 1 :upto (length str2)\n                   :do (setf (aref dp-table k l) (max (aref dp-table (1- k) l)\n                                                      (aref dp-table k (1- l))\n                                                      (if (char= (aref str1 (1- k))\n                                                                 (aref str2 (1- l)))\n                                                          (1+ (aref dp-table (1- k) (1- l)))\n                                                          0)))))\n    (if backtrace\n        (let* ((ret nil)\n               (mem (length str2)))\n          (loop :for k :from (length str1) :downto 1\n                :do(loop :for l :from (1- mem) :downto 1\n                         :always (= (aref dp-table k l)\n                                    (aref dp-table k (1- mem)))\n                         :never (if (and (not (= (aref dp-table k l) (aref dp-table (1- k) l)))\n                                         (not (= (aref dp-table k l) (aref dp-table k (1- l)))))\n                                    (push l ret))))\n          (concatenate 'String (loop :for k :in ret :collect (aref str2 (1- k)))))\n        dp-table)))\n(princ (lcs (read-line) (read-line) :backtrace t))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1487, "cpu_time_ms": 269, "memory_kb": 80356}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s055082214", "group_id": "codeNet:p03165", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (str1 str2)\n  (declare #.OPT\n           (simple-base-string str1 str2))\n  (let ((len1 (length str1))\n        (len2 (length str2))\n        (lcs-table (make-array '(3001 3001) :element-type 'list\n                                            :initial-element nil)))\n    (declare ((simple-array list (* *)) lcs-table))\n    (with-memoizing (:array (3001 3001) :element-type 'uint15\n                     :initial-element #.(- (expt 2 15) 1))\n      (nlet recurse ((i 0) (j 0))\n        (cond ((or (= len1 i) (= len2 j)) 0)\n              ((char= (schar str1 i) (schar str2 j))\n               (let* ((res1 (1+ (recurse (+ i 1) (+ j 1))))\n                      (res2 (recurse i (+ j 1)))\n                      (res3 (recurse (+ i 1) j))\n                      (maxres (max res1 res2 res3)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (cons (schar str1 i) (aref lcs-table (+ i 1) (+ j 1))))\n                             ((= res2 maxres)\n                              (aref lcs-table i (+ j 1)))\n                             (t\n                              (aref lcs-table (+ i 1) j))))\n                 maxres))\n              (t\n               (let* ((res1 (recurse i (+ j 1)))\n                      (res2 (recurse (+ i 1) j))\n                      (maxres (max res1 res2)))\n                 (setf (aref lcs-table i j)\n                       (if (= res1 maxres)\n                           (aref lcs-table i (+ j 1))\n                           (aref lcs-table (+ i 1) j)))\n                 maxres)))))\n    (coerce (aref lcs-table 0 0) 'simple-base-string)))\n\n(defun main ()\n  (let* ((str1 (coerce (read-line) 'simple-base-string))\n         (str2 (coerce (read-line) 'simple-base-string)))\n    (write-line (solve str1 str2))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1547444790, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s055082214.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s055082214", "user_id": "u352600849"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (str1 str2)\n  (declare #.OPT\n           (simple-base-string str1 str2))\n  (let ((len1 (length str1))\n        (len2 (length str2))\n        (lcs-table (make-array '(3001 3001) :element-type 'list\n                                            :initial-element nil)))\n    (declare ((simple-array list (* *)) lcs-table))\n    (with-memoizing (:array (3001 3001) :element-type 'uint15\n                     :initial-element #.(- (expt 2 15) 1))\n      (nlet recurse ((i 0) (j 0))\n        (cond ((or (= len1 i) (= len2 j)) 0)\n              ((char= (schar str1 i) (schar str2 j))\n               (let* ((res1 (1+ (recurse (+ i 1) (+ j 1))))\n                      (res2 (recurse i (+ j 1)))\n                      (res3 (recurse (+ i 1) j))\n                      (maxres (max res1 res2 res3)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (cons (schar str1 i) (aref lcs-table (+ i 1) (+ j 1))))\n                             ((= res2 maxres)\n                              (aref lcs-table i (+ j 1)))\n                             (t\n                              (aref lcs-table (+ i 1) j))))\n                 maxres))\n              (t\n               (let* ((res1 (recurse i (+ j 1)))\n                      (res2 (recurse (+ i 1) j))\n                      (maxres (max res1 res2)))\n                 (setf (aref lcs-table i j)\n                       (if (= res1 maxres)\n                           (aref lcs-table i (+ j 1))\n                           (aref lcs-table (+ i 1) j)))\n                 maxres)))))\n    (coerce (aref lcs-table 0 0) 'simple-base-string)))\n\n(defun main ()\n  (let* ((str1 (coerce (read-line) 'simple-base-string))\n         (str2 (coerce (read-line) 'simple-base-string)))\n    (write-line (solve str1 str2))))\n\n#-swank(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9030, "cpu_time_ms": 967, "memory_kb": 289380}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s817874758", "group_id": "codeNet:p03165", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (str1 str2)\n  (declare #.OPT\n           (simple-base-string str1 str2))\n  (let ((len1 (length str1))\n        (len2 (length str2))\n        (lcs-table (make-array '(3001 3001) :element-type 'list\n                                            :initial-element nil)))\n    (declare (dynamic-extent lcs-table))\n    (with-memoizing (:array (3001 3001) :element-type 'uint15\n                     :initial-element #.(- (expt 2 15) 1))\n      (nlet recurse ((i 0) (j 0))\n        (cond ((or (= len1 i) (= len2 j)) 0)\n              ((char= (schar str1 i) (schar str2 j))\n               (let* ((res1 (1+ (recurse (+ i 1) (+ j 1))))\n                      (res2 (recurse i (+ j 1)))\n                      (res3 (recurse (+ i 1) j))\n                      (maxres (max res1 res2 res3)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (cons (schar str1 i) (aref lcs-table (+ i 1) (+ j 1))))\n                             ((= res2 maxres)\n                              (aref lcs-table i (+ j 1)))\n                             (t\n                              (aref lcs-table (+ i 1) j))))\n                 maxres))\n              (t\n               (let* ((res1 (recurse i (+ j 1)))\n                      (res2 (recurse (+ i 1) j))\n                      (maxres (max res1 res2)))\n                 (setf (aref lcs-table i j)\n                       (if (= res1 maxres)\n                           (aref lcs-table i (+ j 1))\n                           (aref lcs-table (+ i 1) j)))\n                 maxres)))))\n    (coerce (aref lcs-table 0 0) 'simple-base-string)))\n\n(defun main ()\n  (let* ((str1 (coerce (read-line) 'simple-base-string))\n         (str2 (coerce (read-line) 'simple-base-string)))\n    (write-line (solve str1 str2))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1546832960, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s817874758.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s817874758", "user_id": "u352600849"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (str1 str2)\n  (declare #.OPT\n           (simple-base-string str1 str2))\n  (let ((len1 (length str1))\n        (len2 (length str2))\n        (lcs-table (make-array '(3001 3001) :element-type 'list\n                                            :initial-element nil)))\n    (declare (dynamic-extent lcs-table))\n    (with-memoizing (:array (3001 3001) :element-type 'uint15\n                     :initial-element #.(- (expt 2 15) 1))\n      (nlet recurse ((i 0) (j 0))\n        (cond ((or (= len1 i) (= len2 j)) 0)\n              ((char= (schar str1 i) (schar str2 j))\n               (let* ((res1 (1+ (recurse (+ i 1) (+ j 1))))\n                      (res2 (recurse i (+ j 1)))\n                      (res3 (recurse (+ i 1) j))\n                      (maxres (max res1 res2 res3)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (cons (schar str1 i) (aref lcs-table (+ i 1) (+ j 1))))\n                             ((= res2 maxres)\n                              (aref lcs-table i (+ j 1)))\n                             (t\n                              (aref lcs-table (+ i 1) j))))\n                 maxres))\n              (t\n               (let* ((res1 (recurse i (+ j 1)))\n                      (res2 (recurse (+ i 1) j))\n                      (maxres (max res1 res2)))\n                 (setf (aref lcs-table i j)\n                       (if (= res1 maxres)\n                           (aref lcs-table i (+ j 1))\n                           (aref lcs-table (+ i 1) j)))\n                 maxres)))))\n    (coerce (aref lcs-table 0 0) 'simple-base-string)))\n\n(defun main ()\n  (let* ((str1 (coerce (read-line) 'simple-base-string))\n         (str2 (coerce (read-line) 'simple-base-string)))\n    (write-line (solve str1 str2))))\n\n#-swank(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9019, "cpu_time_ms": 1239, "memory_kb": 289384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s652711298", "group_id": "codeNet:p03165", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (str1 str2)\n  (declare #.OPT)\n  (let ((len1 (length str1))\n        (len2 (length str2))\n        (lcs-table (make-array '(3001 3001) :element-type 'list\n                                            :initial-element nil)))\n    (with-memoizing (:array (3001 3001) :element-type 'uint16\n                     :initial-element #.(- (expt 2 16) 1))\n      (nlet recurse ((i 0) (j 0))\n        (cond ((or (= len1 i) (= len2 j)) 0)\n              ((eql (schar str1 i) (schar str2 j))\n               (let* ((res1 (1+ (recurse (+ i 1) (+ j 1))))\n                      (res2 (recurse i (+ j 1)))\n                      (res3 (recurse (+ i 1) j))\n                      (maxres (max res1 res2 res3)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (cons (schar str1 i) (aref lcs-table (+ i 1) (+ j 1))))\n                             ((= res2 maxres)\n                              (aref lcs-table i (+ j 1)))\n                             (t\n                              (aref lcs-table (+ i 1) j))))\n                 maxres))\n              (t\n               (let* ((res1 (recurse i (+ j 1)))\n                      (res2 (recurse (+ i 1) j))\n                      (maxres (max res1 res2)))\n                 (setf (aref lcs-table i j)\n                       (if (= res1 maxres)\n                           (aref lcs-table i (+ j 1))\n                           (aref lcs-table (+ i 1) j)))\n                 maxres)))))\n    (coerce (aref lcs-table 0 0) 'simple-base-string)))\n\n(defun main ()\n  (let* ((str1 (coerce (read-line) 'simple-base-string))\n         (str2 (coerce (read-line) 'simple-base-string)))\n    (write-line (solve str1 str2))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1546832475, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s652711298.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s652711298", "user_id": "u352600849"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (str1 str2)\n  (declare #.OPT)\n  (let ((len1 (length str1))\n        (len2 (length str2))\n        (lcs-table (make-array '(3001 3001) :element-type 'list\n                                            :initial-element nil)))\n    (with-memoizing (:array (3001 3001) :element-type 'uint16\n                     :initial-element #.(- (expt 2 16) 1))\n      (nlet recurse ((i 0) (j 0))\n        (cond ((or (= len1 i) (= len2 j)) 0)\n              ((eql (schar str1 i) (schar str2 j))\n               (let* ((res1 (1+ (recurse (+ i 1) (+ j 1))))\n                      (res2 (recurse i (+ j 1)))\n                      (res3 (recurse (+ i 1) j))\n                      (maxres (max res1 res2 res3)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (cons (schar str1 i) (aref lcs-table (+ i 1) (+ j 1))))\n                             ((= res2 maxres)\n                              (aref lcs-table i (+ j 1)))\n                             (t\n                              (aref lcs-table (+ i 1) j))))\n                 maxres))\n              (t\n               (let* ((res1 (recurse i (+ j 1)))\n                      (res2 (recurse (+ i 1) j))\n                      (maxres (max res1 res2)))\n                 (setf (aref lcs-table i j)\n                       (if (= res1 maxres)\n                           (aref lcs-table i (+ j 1))\n                           (aref lcs-table (+ i 1) j)))\n                 maxres)))))\n    (coerce (aref lcs-table 0 0) 'simple-base-string)))\n\n(defun main ()\n  (let* ((str1 (coerce (read-line) 'simple-base-string))\n         (str2 (coerce (read-line) 'simple-base-string)))\n    (write-line (solve str1 str2))))\n\n#-swank(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8934, "cpu_time_ms": 962, "memory_kb": 289380}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s477866580", "group_id": "codeNet:p03165", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (str1 str2)\n  (let ((len1 (length str1))\n        (len2 (length str2))\n        (lcs-table (make-array '(3001 3001) :element-type 'list\n                                            :initial-element nil)))\n    (with-memoizing (:array (3001 3001) :element-type 'uint16\n                     :initial-element #.(- (expt 2 16) 1))\n      (nlet recurse ((i 0) (j 0))\n        (cond ((or (= len1 i) (= len2 j)) 0)\n              ((eql (schar str1 i) (schar str2 j))\n               (let* ((res1 (1+ (recurse (+ i 1) (+ j 1))))\n                      (res2 (recurse i (+ j 1)))\n                      (res3 (recurse (+ i 1) j))\n                      (maxres (max res1 res2 res3)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (cons (schar str1 i) (aref lcs-table (+ i 1) (+ j 1))))\n                             ((= res2 maxres)\n                              (aref lcs-table i (+ j 1)))\n                             ((= res3 maxres)\n                              (aref lcs-table (+ i 1) j))\n                             (t (error \"Huh?\"))))\n                 maxres))\n              (t\n               (let* ((res1 (recurse i (+ j 1)))\n                      (res2 (recurse (+ i 1) j))\n                      (maxres (max res1 res2)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (aref lcs-table i (+ j 1)))\n                             ((= res2 maxres)\n                              (aref lcs-table (+ i 1) j))\n                             (t (error \"Huh?\"))))\n                 maxres)))))\n    (coerce (aref lcs-table 0 0) 'simple-base-string)))\n\n(defun main ()\n  (let* ((str1 (coerce (read-line) 'simple-base-string))\n         (str2 (coerce (read-line) 'simple-base-string)))\n    (write-line (solve str1 str2))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1546832297, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s477866580.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s477866580", "user_id": "u352600849"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (str1 str2)\n  (let ((len1 (length str1))\n        (len2 (length str2))\n        (lcs-table (make-array '(3001 3001) :element-type 'list\n                                            :initial-element nil)))\n    (with-memoizing (:array (3001 3001) :element-type 'uint16\n                     :initial-element #.(- (expt 2 16) 1))\n      (nlet recurse ((i 0) (j 0))\n        (cond ((or (= len1 i) (= len2 j)) 0)\n              ((eql (schar str1 i) (schar str2 j))\n               (let* ((res1 (1+ (recurse (+ i 1) (+ j 1))))\n                      (res2 (recurse i (+ j 1)))\n                      (res3 (recurse (+ i 1) j))\n                      (maxres (max res1 res2 res3)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (cons (schar str1 i) (aref lcs-table (+ i 1) (+ j 1))))\n                             ((= res2 maxres)\n                              (aref lcs-table i (+ j 1)))\n                             ((= res3 maxres)\n                              (aref lcs-table (+ i 1) j))\n                             (t (error \"Huh?\"))))\n                 maxres))\n              (t\n               (let* ((res1 (recurse i (+ j 1)))\n                      (res2 (recurse (+ i 1) j))\n                      (maxres (max res1 res2)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (aref lcs-table i (+ j 1)))\n                             ((= res2 maxres)\n                              (aref lcs-table (+ i 1) j))\n                             (t (error \"Huh?\"))))\n                 maxres)))))\n    (coerce (aref lcs-table 0 0) 'simple-base-string)))\n\n(defun main ()\n  (let* ((str1 (coerce (read-line) 'simple-base-string))\n         (str2 (coerce (read-line) 'simple-base-string)))\n    (write-line (solve str1 str2))))\n\n#-swank(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9083, "cpu_time_ms": 1271, "memory_kb": 287336}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s960120666", "group_id": "codeNet:p03165", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (str1 str2)\n  (let ((len1 (length str1))\n        (len2 (length str2))\n        (lcs-table (make-array '(3001 3001) :element-type 'list\n                                            :initial-element nil)))\n    (with-memoizing (:array (3001 3001) :element-type 'uint16\n                     :initial-element #.(- (expt 2 16) 1))\n      (nlet recurse ((i len1) (j len2))\n        (cond ((or (zerop i) (zerop j)) 0)\n              ((eql (schar str1 (- i 1)) (schar str2 (- j 1)))\n               (let* ((res1 (1+ (recurse (- i 1) (- j 1))))\n                      (res2 (recurse i (- j 1)))\n                      (res3 (recurse (- i 1) j))\n                      (maxres (max res1 res2 res3)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (cons (schar str1 (- i 1))\n                                    (aref lcs-table (- i 1) (- j 1))))\n                             ((= res2 maxres)\n                              (aref lcs-table i (- j 1)))\n                             ((= res3 maxres)\n                              (aref lcs-table (- i 1) j))\n                             (t (error \"Huh?\"))))\n                 maxres))\n              (t\n               (let* ((res1 (recurse i (- j 1)))\n                      (res2 (recurse (- i 1) j))\n                      (maxres (max res1 res2)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (aref lcs-table i (- j 1)))\n                             ((= res2 maxres)\n                              (aref lcs-table (- i 1) j))\n                             (t (error \"Huh?\"))))\n                 maxres)))))\n    (coerce (nreverse (aref lcs-table len1 len2)) 'string)))\n\n(defun main ()\n  (let* ((str1 (coerce (read-line) 'simple-base-string))\n         (str2 (coerce (read-line) 'simple-base-string)))\n    (write-line (solve str1 str2))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1546808566, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Lisp/s960120666.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s960120666", "user_id": "u352600849"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro nlet (name args &body body)\n  (labels ((ensure-list (x) (if (listp x) x (list x))))\n    (let ((args (mapcar #'ensure-list args)))\n      `(labels ((,name ,(mapcar #'car args) ,@body))\n         (,name ,@(mapcar #'cadr args))))))\n\n;; (with-memoizing (:hash-table :test #'equal :key #'cons)\n;;   (defun ...))\n;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)\n;;   (defun ...))\n(defmacro with-memoizing (cache-attribs def-form)\n  (let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))\n         (cache-type (first cache-attribs))\n         (dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))\n         (dimensions (remove '* dimensions-with-*))\n         (rank (length dimensions))\n         (rest-attribs (ecase cache-type\n                         (:hash-table (cdr cache-attribs))\n                         (:array (cddr cache-attribs))))\n         (key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))\n         (cache-form (case cache-type\n                       (:hash-table `(make-hash-table ,@rest-attribs))\n                       (:array `(make-array ',dimensions ,@rest-attribs))))\n         (initial-element (when (eql cache-type :array)\n                            (assert (member :initial-element rest-attribs))\n                            (getf rest-attribs :initial-element))))\n    (let ((cache (gensym))\n          (value (gensym))\n\t  (present-p (gensym))\n          (name-alias (gensym))\n\t  (args-lst (gensym))\n          (indices (loop repeat rank collect (gensym))))\n      (labels ((make-cache-check-form (cache-type args)\n                 (case cache-type\n                   (:hash-table\n                    `(let ((,args-lst (funcall ,(or key #'list) ,@args)))\n                       (multiple-value-bind (,value ,present-p)\n                           (gethash ,args-lst ,cache)\n                         (if ,present-p\n                             ,value\n                             (setf (gethash ,args-lst ,cache)\n                                   (,name-alias ,@args))))))\n                   (:array\n                    (let ((memoized-args (loop for dimension in dimensions-with-*\n                                               for arg in args\n                                               unless (eql dimension '*)\n                                               collect arg)))\n                      (if key\n                          `(multiple-value-bind ,indices\n                               (funcall ,key ,@memoized-args)\n                             (let ((,value (aref ,cache ,@indices)))\n                               (if (eql ,initial-element ,value)\n                                   (setf (aref ,cache ,@indices)\n                                         (,name-alias ,@args))\n                                   ,value)))\n                          `(let ((,value (aref ,cache ,@memoized-args)))\n                             (if (eql ,initial-element ,value)\n                                 (setf (aref ,cache ,@memoized-args)\n                                       (,name-alias ,@args))\n                                 ,value)))))))\n               (make-reset-form (cache-type)\n                 (case cache-type\n                   (:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))\n                   (:array `(prog1 nil\n                              (fill (array-storage-vector ,cache) ,initial-element)))))\n               (make-reset-name (name)\n                 (intern (format nil \"RESET-~A\" (symbol-name name))))\n               (extract-declarations (body)\n                 (remove-if-not (lambda (form) (eql 'declare (car form))) body)))\n        (ecase (car def-form)\n          ((defun)\n           (destructuring-bind (_ name args &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (defun ,(make-reset-name name) () ,(make-reset-form cache-type))\n                (defun ,name ,args\n                  (labels ((,name-alias ,args ,@body))\n                    (declare (inline ,name-alias))\n                    ,@(extract-declarations body)\n                    ,(make-cache-check-form cache-type args))))))\n          ((nlet)\n           (destructuring-bind (_ name bindings &body body) def-form\n             (declare (ignore _))\n             `(let ((,cache ,cache-form))\n                (nlet ,name ,bindings\n                      ,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))\n                         `(labels ((,name-alias ,args ,@body))\n                            (declare (inline ,name-alias))\n                            ,@(extract-declarations body)\n                            ,(make-cache-check-form cache-type args)))))))\n          ((labels flet)\n           (destructuring-bind (_ definitions &body labels-body) def-form\n             (declare (ignore _))\n             (destructuring-bind (name args &body body) (car definitions)\n               `(let ((,cache ,cache-form))\n                  (,(car def-form)\n                   ((,(make-reset-name name) () ,(make-reset-form cache-type))\n                    (,name ,args\n                           (labels ((,name-alias ,args ,@body))\n                             (declare (inline ,name-alias))\n                             ,@(extract-declarations body)\n                             ,(make-cache-check-form cache-type args)))\n                    ,@(cdr definitions))\n                   (declare (ignorable #',(make-reset-name name)))\n                   ,@labels-body))))))))))\n\n;; (test with-memoizing\n;;   (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (defun add (x y) (+ x y)))))\n;;   (finishes (macroexpand `(with-memoizing (:array '(10 10)\n;;                                            :element-type 'fixnum\n;;                                            :initial-element -1)\n;;                             (labels ((add (x y) (+ x y))\n;; \t\t                     (my-print (x) (print x)))\n;; \t                      (add 1 2))))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n;; Hauptteil\n\n(defun solve (str1 str2)\n  (let ((len1 (length str1))\n        (len2 (length str2))\n        (lcs-table (make-array '(3001 3001) :element-type 'list\n                                            :initial-element nil)))\n    (with-memoizing (:array (3001 3001) :element-type 'uint16\n                     :initial-element #.(- (expt 2 16) 1))\n      (nlet recurse ((i len1) (j len2))\n        (cond ((or (zerop i) (zerop j)) 0)\n              ((eql (schar str1 (- i 1)) (schar str2 (- j 1)))\n               (let* ((res1 (1+ (recurse (- i 1) (- j 1))))\n                      (res2 (recurse i (- j 1)))\n                      (res3 (recurse (- i 1) j))\n                      (maxres (max res1 res2 res3)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (cons (schar str1 (- i 1))\n                                    (aref lcs-table (- i 1) (- j 1))))\n                             ((= res2 maxres)\n                              (aref lcs-table i (- j 1)))\n                             ((= res3 maxres)\n                              (aref lcs-table (- i 1) j))\n                             (t (error \"Huh?\"))))\n                 maxres))\n              (t\n               (let* ((res1 (recurse i (- j 1)))\n                      (res2 (recurse (- i 1) j))\n                      (maxres (max res1 res2)))\n                 (setf (aref lcs-table i j)\n                       (cond ((= res1 maxres)\n                              (aref lcs-table i (- j 1)))\n                             ((= res2 maxres)\n                              (aref lcs-table (- i 1) j))\n                             (t (error \"Huh?\"))))\n                 maxres)))))\n    (coerce (nreverse (aref lcs-table len1 len2)) 'string)))\n\n(defun main ()\n  (let* ((str1 (coerce (read-line) 'simple-base-string))\n         (str2 (coerce (read-line) 'simple-base-string)))\n    (write-line (solve str1 str2))))\n\n#-swank(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9146, "cpu_time_ms": 933, "memory_kb": 279136}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s194105677", "group_id": "codeNet:p03206", "input_text": "(write-line (ecase (read)\n  (22 \"Christmas Eve Eve Eve\")\n  (23 \"Christmas Eve Eve\")\n  (24 \"Christmas Eve\")\n  (25 \"Christmas\")))", "language": "Lisp", "metadata": {"date": 1599796528, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lisp/s194105677.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s194105677", "user_id": "u352600849"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "(write-line (ecase (read)\n  (22 \"Christmas Eve Eve Eve\")\n  (23 \"Christmas Eve Eve\")\n  (24 \"Christmas Eve\")\n  (25 \"Christmas\")))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 127, "cpu_time_ms": 12, "memory_kb": 23428}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s336338686", "group_id": "codeNet:p03206", "input_text": "(let ((d (read)))\n     (cond\n       ((= d 25) (princ \"Christmas\"))\n       ((= d 24) (princ \"Christmas Eve\"))\n       ((= d 23) (princ \"Christmas Eve Eve\"))\n       (t        (princ \"Christmas Eve Eve Eve\")))", "language": "Lisp", "metadata": {"date": 1590718033, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lisp/s336338686.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s336338686", "user_id": "u425762225"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "(let ((d (read)))\n     (cond\n       ((= d 25) (princ \"Christmas\"))\n       ((= d 24) (princ \"Christmas Eve\"))\n       ((= d 23) (princ \"Christmas Eve Eve\"))\n       (t        (princ \"Christmas Eve Eve Eve\")))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 205, "cpu_time_ms": 43, "memory_kb": 5984}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s412266683", "group_id": "codeNet:p03206", "input_text": "(defun func (x)\n  (when (< x 25)\n\t(progn\n\t  (princ \" Eve\")\n\t  (func (1+ x)))))\n\n(princ \"Christmas\")\n(func (read))\n", "language": "Lisp", "metadata": {"date": 1576902155, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lisp/s412266683.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s412266683", "user_id": "u493610446"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "(defun func (x)\n  (when (< x 25)\n\t(progn\n\t  (princ \" Eve\")\n\t  (func (1+ x)))))\n\n(princ \"Christmas\")\n(func (read))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 114, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s189331924", "group_id": "codeNet:p03206", "input_text": "(defparameter d (read))\n(defparameter num (- 25 d))\n(defparameter s \"Christmas\")\n(dotimes (i num)\n  (setq s (concatenate 'string s \" Eve\")))\n(princ s)", "language": "Lisp", "metadata": {"date": 1561950715, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lisp/s189331924.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s189331924", "user_id": "u480300350"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "(defparameter d (read))\n(defparameter num (- 25 d))\n(defparameter s \"Christmas\")\n(dotimes (i num)\n  (setq s (concatenate 'string s \" Eve\")))\n(princ s)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 150, "cpu_time_ms": 11, "memory_kb": 3432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s220486779", "group_id": "codeNet:p03206", "input_text": "(defparameter d (read))\n(defparameter num (- 25 d))\n(defparameter s \"Chiristmas\")\n(dotimes (i num)\n  (setq s (concatenate 'string s \" Eve\")))\n(princ s)", "language": "Lisp", "metadata": {"date": 1561950618, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lisp/s220486779.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s220486779", "user_id": "u480300350"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "(defparameter d (read))\n(defparameter num (- 25 d))\n(defparameter s \"Chiristmas\")\n(dotimes (i num)\n  (setq s (concatenate 'string s \" Eve\")))\n(princ s)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 151, "cpu_time_ms": 92, "memory_kb": 7144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s474869572", "group_id": "codeNet:p03206", "input_text": "(defparameter d (read))\n(defparameter num (- 25 d))\n(defparameter s \"Chiristmas\")\n(dotimes (i num)\n  (setq s (concatenate 'string s \" Eve\")))\n(princ s)", "language": "Lisp", "metadata": {"date": 1561950541, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lisp/s474869572.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s474869572", "user_id": "u480300350"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "(defparameter d (read))\n(defparameter num (- 25 d))\n(defparameter s \"Chiristmas\")\n(dotimes (i num)\n  (setq s (concatenate 'string s \" Eve\")))\n(princ s)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 151, "cpu_time_ms": 11, "memory_kb": 3432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s798753286", "group_id": "codeNet:p03206", "input_text": "(defparameter d (read))\n(defparameter num (- 25 d))\n(defparameter s \"Chiristmas\")\n(dotimes (i num)\n  (setq s (concatenate 'string s \" Eve\")))\n(princ s)", "language": "Lisp", "metadata": {"date": 1561950460, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lisp/s798753286.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s798753286", "user_id": "u480300350"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "(defparameter d (read))\n(defparameter num (- 25 d))\n(defparameter s \"Chiristmas\")\n(dotimes (i num)\n  (setq s (concatenate 'string s \" Eve\")))\n(princ s)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 151, "cpu_time_ms": 318, "memory_kb": 25184}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s488822149", "group_id": "codeNet:p03206", "input_text": "  (let ((D (read)))\n    (princ\n      (case D\n        (25 \"Christmas\")\n        (24 \"Christmas Eve\")\n        (23 \"Christmas Eve Eve\")\n        (22 \"Christmas Eve Eve Eve\"))))", "language": "Lisp", "metadata": {"date": 1547107815, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lisp/s488822149.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488822149", "user_id": "u390566373"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "  (let ((D (read)))\n    (princ\n      (case D\n        (25 \"Christmas\")\n        (24 \"Christmas Eve\")\n        (23 \"Christmas Eve Eve\")\n        (22 \"Christmas Eve Eve Eve\"))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 171, "cpu_time_ms": 74, "memory_kb": 7776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s868430176", "group_id": "codeNet:p03206", "input_text": "(defmacro ch-pr (n)\n  `(progn (princ \"Christmas\")\n  (loop :repeat ,n :do(princ \" Eve\"))))\n(case (read)\n  ((22) (ch-pr 3))\n  ((23) (ch-pr 2))\n  ((24) (ch-pr 1))\n  ((25) (ch-pr 0)))", "language": "Lisp", "metadata": {"date": 1544809081, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lisp/s868430176.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s868430176", "user_id": "u610490393"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "(defmacro ch-pr (n)\n  `(progn (princ \"Christmas\")\n  (loop :repeat ,n :do(princ \" Eve\"))))\n(case (read)\n  ((22) (ch-pr 3))\n  ((23) (ch-pr 2))\n  ((24) (ch-pr 1))\n  ((25) (ch-pr 0)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 179, "cpu_time_ms": 119, "memory_kb": 11620}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s556670656", "group_id": "codeNet:p03206", "input_text": "(setq n(- 25(read)))\n(princ\"Christmas\")\n(dotimes(i n)(princ\" Eve\"))", "language": "Lisp", "metadata": {"date": 1544325731, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lisp/s556670656.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s556670656", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "(setq n(- 25(read)))\n(princ\"Christmas\")\n(dotimes(i n)(princ\" Eve\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 67, "cpu_time_ms": 298, "memory_kb": 12644}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s384321053", "group_id": "codeNet:p03206", "input_text": "(let ((d (read)))\n  (cond ((= d 25)\n         (princ \"Christmas\"))\n        ((= d 24)\n         (princ \"Christmas Eve\"))\n        ((= d 23)\n         (princ \"Christmas Eve Eve\"))\n        ((= d 22)\n         (princ \"Christmas Eve Eve Eve\"))))", "language": "Lisp", "metadata": {"date": 1544323003, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Lisp/s384321053.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s384321053", "user_id": "u631655863"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "(let ((d (read)))\n  (cond ((= d 25)\n         (princ \"Christmas\"))\n        ((= d 24)\n         (princ \"Christmas Eve\"))\n        ((= d 23)\n         (princ \"Christmas Eve Eve\"))\n        ((= d 22)\n         (princ \"Christmas Eve Eve Eve\"))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 235, "cpu_time_ms": 164, "memory_kb": 8420}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s400687933", "group_id": "codeNet:p03240", "input_text": "(defun pyramid-height (c n h)\n  (+ h (abs (- (car n) (car c))) (abs (- (cdr n) (cdr c)))))\n\n\n(defun pyramid-find (list)\n  (loop :for cx :from 0 :upto 100\n          :thereis(loop :for cy :from 0 :upto 100\n                          :thereis (if (and\n                                        (apply #'= (mapcar (lambda (k)\n                                                             (pyramid-height (cons cx cy) (first k) (second k))) list))\n                                        (<= 0 (pyramid-height (cons cx cy) (first (car list)) (second (car list))) ))\n                                       (format t \"~A ~A ~A\" cx cy (pyramid-height (cons cx cy) (first (car list)) (second (car list))))))))\n(let* ((n (read))\n       (lst (loop :repeat n :collect (list (cons (read) (read)) (read)))))\n  (pyramid-find lst))\n", "language": "Lisp", "metadata": {"date": 1575664900, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lisp/s400687933.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s400687933", "user_id": "u610490393"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "(defun pyramid-height (c n h)\n  (+ h (abs (- (car n) (car c))) (abs (- (cdr n) (cdr c)))))\n\n\n(defun pyramid-find (list)\n  (loop :for cx :from 0 :upto 100\n          :thereis(loop :for cy :from 0 :upto 100\n                          :thereis (if (and\n                                        (apply #'= (mapcar (lambda (k)\n                                                             (pyramid-height (cons cx cy) (first k) (second k))) list))\n                                        (<= 0 (pyramid-height (cons cx cy) (first (car list)) (second (car list))) ))\n                                       (format t \"~A ~A ~A\" cx cy (pyramid-height (cons cx cy) (first (car list)) (second (car list))))))))\n(let* ((n (read))\n       (lst (loop :repeat n :collect (list (cons (read) (read)) (read)))))\n  (pyramid-find lst))\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 812, "cpu_time_ms": 85, "memory_kb": 39268}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s073210763", "group_id": "codeNet:p03240", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro split-ints-bind (vars string &body body)\n  (let ((position (gensym))\n        (s (gensym)))\n    (labels ((expand (vars &optional init-pos)\n               (if (null vars)\n                   body\n                   `((multiple-value-bind (,(car vars) ,position)\n                         (parse-integer ,s :start ,(or init-pos position)\n                                           :junk-allowed t)\n                       ,@(when (null (cdr vars)) `((declare (ignore ,position))))\n                       ,@(expand (cdr vars)))))))\n      `(let ((,s ,string))\n         (declare (string ,s))\n         ,@(expand vars 0)))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Hauptteil\n\n(defun main ()\n  (let* ((n (read))\n         (hxy-table (make-array n :element-type '(cons uint32 (cons uint32 uint32)))))\n    (dotimes (i n)\n      (split-ints-bind (x y h) (read-line)\n        (setf (aref hxy-table i) (list h x y))))\n    (setf hxy-table (sort hxy-table #'> :key #'car))\n    (when (zerop (car (aref hxy-table 0)))\n      (error \"Huh?\"))\n    (dotimes (cx 101)\n      (dotimes (cy 101)\n        (loop with cand-height = most-positive-fixnum\n              for i below n\n              for (h x y) of-type (uint32 uint32 uint32) = (aref hxy-table i)\n              do (if (zerop h)\n                     (unless (<= cand-height (+ (abs (- x cx)) (abs (- y cy))))\n                       (return))\n                     (let ((must-height (+ h (abs (- x cx)) (abs (- y cy)))))\n                       (when (< must-height 1)\n                         (return))\n                       (if (= cand-height most-positive-fixnum)\n                           (setf cand-height must-height)\n                           (unless (= cand-height must-height)\n                             (return)))))\n              finally (format t \"~A ~A ~A~%\" cx cy cand-height)\n                      (return-from main))))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1549357049, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lisp/s073210763.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s073210763", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro split-ints-bind (vars string &body body)\n  (let ((position (gensym))\n        (s (gensym)))\n    (labels ((expand (vars &optional init-pos)\n               (if (null vars)\n                   body\n                   `((multiple-value-bind (,(car vars) ,position)\n                         (parse-integer ,s :start ,(or init-pos position)\n                                           :junk-allowed t)\n                       ,@(when (null (cdr vars)) `((declare (ignore ,position))))\n                       ,@(expand (cdr vars)))))))\n      `(let ((,s ,string))\n         (declare (string ,s))\n         ,@(expand vars 0)))))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Hauptteil\n\n(defun main ()\n  (let* ((n (read))\n         (hxy-table (make-array n :element-type '(cons uint32 (cons uint32 uint32)))))\n    (dotimes (i n)\n      (split-ints-bind (x y h) (read-line)\n        (setf (aref hxy-table i) (list h x y))))\n    (setf hxy-table (sort hxy-table #'> :key #'car))\n    (when (zerop (car (aref hxy-table 0)))\n      (error \"Huh?\"))\n    (dotimes (cx 101)\n      (dotimes (cy 101)\n        (loop with cand-height = most-positive-fixnum\n              for i below n\n              for (h x y) of-type (uint32 uint32 uint32) = (aref hxy-table i)\n              do (if (zerop h)\n                     (unless (<= cand-height (+ (abs (- x cx)) (abs (- y cy))))\n                       (return))\n                     (let ((must-height (+ h (abs (- x cx)) (abs (- y cy)))))\n                       (when (< must-height 1)\n                         (return))\n                       (if (= cand-height most-positive-fixnum)\n                           (setf cand-height must-height)\n                           (unless (= cand-height must-height)\n                             (return)))))\n              finally (format t \"~A ~A ~A~%\" cx cy cand-height)\n                      (return-from main))))))\n\n#-swank(main)\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2756, "cpu_time_ms": 121, "memory_kb": 16608}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s234313495", "group_id": "codeNet:p03240", "input_text": "(defvar *N* (read))\n(defvar *MAX* (expt 10 9))\n\n(defun calc (x-lst y-lst h-lst)\n  (let ((tmp-h -1)\n        (done nil))\n    (dotimes (c-x 101)\n      (dotimes (c-y 101)\n        (dotimes (n *N*)\n          (let* ((x (nth n x-lst))\n                 (y (nth n y-lst))\n                 (h (+ (nth n h-lst) (abs (- c-x x)) (abs (- c-y y)))))\n            (when (/= h 0)\n              (setq tmp-h h)\n              (return-from nil))))\n        (setq done t)\n        (dotimes (n *N*)\n          (let ((r (max (- tmp-h (abs (- c-x (nth n x-lst))) (abs (- c-y (nth n y-lst)))) 0)))\n            (when (/= (nth n h-lst ) r)\n              (setq done nil))))\n        (when done\n          (format t \"~a ~a ~a\" c-x c-y tmp-h)\n          (return-from calc nil))))))\n\n(defun main ()\n  (let ((x-lst (list nil))\n        (y-lst (list nil))\n        (h-lst (list nil)))\n    (loop repeat *N*\n          do (progn\n               (push (read) x-lst)\n               (push (read) y-lst)\n               (push (read) h-lst)))\n    (setq x-lst (cdr (reverse x-lst)))\n    (setq y-lst (cdr (reverse y-lst)))\n    (setq h-lst (cdr (reverse h-lst)))\n    (let ((count 0)\n          (size (length h-lst)))\n      (dolist (x h-lst)\n        (when (= x 0)\n          (incf count)))\n      (if (= count size)\n          (format t \"0 0 1~%\")\n          (calc x-lst y-lst h-lst)))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1539004549, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lisp/s234313495.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s234313495", "user_id": "u631655863"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "(defvar *N* (read))\n(defvar *MAX* (expt 10 9))\n\n(defun calc (x-lst y-lst h-lst)\n  (let ((tmp-h -1)\n        (done nil))\n    (dotimes (c-x 101)\n      (dotimes (c-y 101)\n        (dotimes (n *N*)\n          (let* ((x (nth n x-lst))\n                 (y (nth n y-lst))\n                 (h (+ (nth n h-lst) (abs (- c-x x)) (abs (- c-y y)))))\n            (when (/= h 0)\n              (setq tmp-h h)\n              (return-from nil))))\n        (setq done t)\n        (dotimes (n *N*)\n          (let ((r (max (- tmp-h (abs (- c-x (nth n x-lst))) (abs (- c-y (nth n y-lst)))) 0)))\n            (when (/= (nth n h-lst ) r)\n              (setq done nil))))\n        (when done\n          (format t \"~a ~a ~a\" c-x c-y tmp-h)\n          (return-from calc nil))))))\n\n(defun main ()\n  (let ((x-lst (list nil))\n        (y-lst (list nil))\n        (h-lst (list nil)))\n    (loop repeat *N*\n          do (progn\n               (push (read) x-lst)\n               (push (read) y-lst)\n               (push (read) h-lst)))\n    (setq x-lst (cdr (reverse x-lst)))\n    (setq y-lst (cdr (reverse y-lst)))\n    (setq h-lst (cdr (reverse h-lst)))\n    (let ((count 0)\n          (size (length h-lst)))\n      (dolist (x h-lst)\n        (when (= x 0)\n          (incf count)))\n      (if (= count size)\n          (format t \"0 0 1~%\")\n          (calc x-lst y-lst h-lst)))))\n\n(main)", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1332, "cpu_time_ms": 260, "memory_kb": 16100}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s706362974", "group_id": "codeNet:p03240", "input_text": "(defvar *N* (read))\n(defvar *MAX* (expt 10 9))\n\n(defun calc (x-lst y-lst h-lst)\n  (let ((tmp-h -1)\n        (done nil))\n    (dotimes (c-x 101)\n      (dotimes (c-y 101)\n        (dotimes (n *N*)\n          (let* ((x (nth n x-lst))\n                 (y (nth n y-lst))\n                 (h (+ (nth n h-lst) (abs (- c-x x)) (abs (- c-y y)))))\n            (when (/= h 0)\n              (setq tmp-h h)\n              (return-from nil))))\n        (setq done t)\n        (dotimes (n *N*)\n          (let ((r (max (- tmp-h (abs (- c-x (nth n x-lst))) (abs (- c-y (nth n y-lst)))) 0)))\n            (when (/= (nth n h-lst ) r)\n              (setq done nil))))\n        (when done\n          (format t \"~a ~a ~a\" c-x c-y tmp-h)\n          (return-from calc nil))))))\n\n(defun main ()\n  (let ((x-lst (list nil))\n        (y-lst (list nil))\n        (h-lst (list nil)))\n    (loop repeat *N*\n          do (progn\n               (push (read) x-lst)\n               (push (read) y-lst)\n               (push (read) h-lst)))\n    (setq x-lst (cdr (reverse x-lst)))\n    (setq y-lst (cdr (reverse y-lst)))\n    (setq h-lst (cdr (reverse h-lst)))\n    (calc x-lst y-lst h-lst)))\n\n(main)", "language": "Lisp", "metadata": {"date": 1539004292, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lisp/s706362974.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s706362974", "user_id": "u631655863"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "(defvar *N* (read))\n(defvar *MAX* (expt 10 9))\n\n(defun calc (x-lst y-lst h-lst)\n  (let ((tmp-h -1)\n        (done nil))\n    (dotimes (c-x 101)\n      (dotimes (c-y 101)\n        (dotimes (n *N*)\n          (let* ((x (nth n x-lst))\n                 (y (nth n y-lst))\n                 (h (+ (nth n h-lst) (abs (- c-x x)) (abs (- c-y y)))))\n            (when (/= h 0)\n              (setq tmp-h h)\n              (return-from nil))))\n        (setq done t)\n        (dotimes (n *N*)\n          (let ((r (max (- tmp-h (abs (- c-x (nth n x-lst))) (abs (- c-y (nth n y-lst)))) 0)))\n            (when (/= (nth n h-lst ) r)\n              (setq done nil))))\n        (when done\n          (format t \"~a ~a ~a\" c-x c-y tmp-h)\n          (return-from calc nil))))))\n\n(defun main ()\n  (let ((x-lst (list nil))\n        (y-lst (list nil))\n        (h-lst (list nil)))\n    (loop repeat *N*\n          do (progn\n               (push (read) x-lst)\n               (push (read) y-lst)\n               (push (read) h-lst)))\n    (setq x-lst (cdr (reverse x-lst)))\n    (setq y-lst (cdr (reverse y-lst)))\n    (setq h-lst (cdr (reverse h-lst)))\n    (calc x-lst y-lst h-lst)))\n\n(main)", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1144, "cpu_time_ms": 256, "memory_kb": 15968}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s704179082", "group_id": "codeNet:p03240", "input_text": "(defvar *N* (read))\n\n(defun calc-center (lst n)\n  (let ((tmp (floor (/ (apply #'+ lst) n))))\n    tmp))\n\n(defun calc-high (x-lst y-lst h-lst c-x c-y &optional (tmp-lst (list nil)))\n  (if (null (car x-lst))\n      (car (sort (cdr (reverse tmp-lst)) #'>))\n      (let ((tmp (+ (car h-lst) (abs (- (car x-lst) c-x)) (abs (- (car y-lst) c-y))))\n            (lst tmp-lst))\n        (push (max tmp 0) lst)\n        (calc-high (cdr x-lst) (cdr y-lst) (cdr h-lst) c-x c-y lst))))\n\n(defun main ()\n  (let ((x-lst (list nil))\n        (y-lst (list nil))\n        (h-lst (list nil)))\n    (loop repeat *N*\n          do (progn\n               (push (read) x-lst)\n               (push (read) y-lst)\n               (push (read) h-lst)))\n    (setq x-lst (cdr (reverse x-lst)))\n    (setq y-lst (cdr (reverse y-lst)))\n    (setq h-lst (cdr (reverse h-lst)))\n    (let ((c-x (calc-center x-lst *N*))\n          (c-y (calc-center y-lst *N*)))\n      (when (oddp *N*)\n        (when (/= c-x 0)\n            (incf c-x))\n        (when (/= c-y 0)\n          (incf c-y)))\n      (let ((h (calc-high x-lst y-lst h-lst c-x c-y)))\n        (format t \"~a ~a ~a~%\" c-x c-y h)))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1538935713, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Lisp/s704179082.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s704179082", "user_id": "u631655863"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "(defvar *N* (read))\n\n(defun calc-center (lst n)\n  (let ((tmp (floor (/ (apply #'+ lst) n))))\n    tmp))\n\n(defun calc-high (x-lst y-lst h-lst c-x c-y &optional (tmp-lst (list nil)))\n  (if (null (car x-lst))\n      (car (sort (cdr (reverse tmp-lst)) #'>))\n      (let ((tmp (+ (car h-lst) (abs (- (car x-lst) c-x)) (abs (- (car y-lst) c-y))))\n            (lst tmp-lst))\n        (push (max tmp 0) lst)\n        (calc-high (cdr x-lst) (cdr y-lst) (cdr h-lst) c-x c-y lst))))\n\n(defun main ()\n  (let ((x-lst (list nil))\n        (y-lst (list nil))\n        (h-lst (list nil)))\n    (loop repeat *N*\n          do (progn\n               (push (read) x-lst)\n               (push (read) y-lst)\n               (push (read) h-lst)))\n    (setq x-lst (cdr (reverse x-lst)))\n    (setq y-lst (cdr (reverse y-lst)))\n    (setq h-lst (cdr (reverse h-lst)))\n    (let ((c-x (calc-center x-lst *N*))\n          (c-y (calc-center y-lst *N*)))\n      (when (oddp *N*)\n        (when (/= c-x 0)\n            (incf c-x))\n        (when (/= c-y 0)\n          (incf c-y)))\n      (let ((h (calc-high x-lst y-lst h-lst c-x c-y)))\n        (format t \"~a ~a ~a~%\" c-x c-y h)))))\n\n(main)", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1139, "cpu_time_ms": 240, "memory_kb": 23012}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s375879351", "group_id": "codeNet:p03250", "input_text": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (set-dispatch-macro-character #\\# #\\> #'cl-debug-print:debug-print-reader)\n\n(macrolet ((def-int (b)\n             `(progn (deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))\n                     (deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))))\n           (defs (&rest bits) `(progn ,@(mapcar (lambda (b) `(def-int ,b)) bits))))\n  (defs 2 4 7 8 15 16 31 32 62 63 64))\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n;; BEGIN_USE_PACKAGE\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((digits (loop repeat 3 collect (read)))\n         (max (reduce #'max digits))\n         (digits (delete max digits :count 1)))\n    (println (+ (* 10 max) (reduce #'+ digits)))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n#-swank\n(eval-when (:compile-toplevel)\n  (when (and (boundp 'sb-c::*compiler-warning-count*)\n             (> sb-c::*compiler-warning-count* 0))\n    (sb-ext:quit :unix-status 1)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (5am:is\n   (equal \"53\n\"\n          (run \"1 5 2\n\" nil)))\n  (5am:is\n   (equal \"108\n\"\n          (run \"9 9 9\n\" nil)))\n  (5am:is\n   (equal \"82\n\"\n          (run \"6 6 7\n\" nil))))\n", "language": "Lisp", "metadata": {"date": 1600763005, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s375879351.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s375879351", "user_id": "u352600849"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (set-dispatch-macro-character #\\# #\\> #'cl-debug-print:debug-print-reader)\n\n(macrolet ((def-int (b)\n             `(progn (deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))\n                     (deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))))\n           (defs (&rest bits) `(progn ,@(mapcar (lambda (b) `(def-int ,b)) bits))))\n  (defs 2 4 7 8 15 16 31 32 62 63 64))\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n;; BEGIN_USE_PACKAGE\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((digits (loop repeat 3 collect (read)))\n         (max (reduce #'max digits))\n         (digits (delete max digits :count 1)))\n    (println (+ (* 10 max) (reduce #'+ digits)))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n#-swank\n(eval-when (:compile-toplevel)\n  (when (and (boundp 'sb-c::*compiler-warning-count*)\n             (> sb-c::*compiler-warning-count* 0))\n    (sb-ext:quit :unix-status 1)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (5am:is\n   (equal \"53\n\"\n          (run \"1 5 2\n\" nil)))\n  (5am:is\n   (equal \"108\n\"\n          (run \"9 9 9\n\" nil)))\n  (5am:is\n   (equal \"82\n\"\n          (run \"6 6 7\n\" nil))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3551, "cpu_time_ms": 16, "memory_kb": 24604}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s742729715", "group_id": "codeNet:p03250", "input_text": "(setf l (make-array 3))\n\n(defun in (a b c)\n  (when (< b c)\n\t(progn \n\t  (setf (aref a b) (read))\n\t  (in a (1+ b) c))))\n\n(in l 0 3)\n\n(let ((x (sort l #'>)))\n  (princ (+ (* (aref x 0) 10) (aref x 1) (aref x 2))))\n", "language": "Lisp", "metadata": {"date": 1576901676, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s742729715.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s742729715", "user_id": "u493610446"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(setf l (make-array 3))\n\n(defun in (a b c)\n  (when (< b c)\n\t(progn \n\t  (setf (aref a b) (read))\n\t  (in a (1+ b) c))))\n\n(in l 0 3)\n\n(let ((x (sort l #'>)))\n  (princ (+ (* (aref x 0) 10) (aref x 1) (aref x 2))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 210, "cpu_time_ms": 21, "memory_kb": 4448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s272473511", "group_id": "codeNet:p03250", "input_text": "(defun f (x)\n  (+ (* (car x) 10) (cadr x) (caddr x)))\n(print\n (f\n  (sort\n   (copy-list (list (read) (read) (read)))\n   #'>)))", "language": "Lisp", "metadata": {"date": 1573535381, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s272473511.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s272473511", "user_id": "u691380397"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(defun f (x)\n  (+ (* (car x) 10) (cadr x) (caddr x)))\n(print\n (f\n  (sort\n   (copy-list (list (read) (read) (read)))\n   #'>)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 9, "memory_kb": 3304}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s180343600", "group_id": "codeNet:p03250", "input_text": "(defun f (x)\n  (+ (* (car x) 10) (cadr x) (caddr x)))\n(print\n (sort\n  (copy-list (list (read) (read) (read)))\n  #'>))", "language": "Lisp", "metadata": {"date": 1573535265, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s180343600.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s180343600", "user_id": "u691380397"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(defun f (x)\n  (+ (* (car x) 10) (cadr x) (caddr x)))\n(print\n (sort\n  (copy-list (list (read) (read) (read)))\n  #'>))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 117, "cpu_time_ms": 9, "memory_kb": 3304}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s426822692", "group_id": "codeNet:p03250", "input_text": "(defun f (a b c)\n  (cond\n    ((> a b) (+ (* a 10) b c))\n    ((< a b) (+ (* b 10) a c))\n    ((> b c) (+ (* a 10) b c))\n    ((< b c) (+ (* b 10) a c))\n    (t (+ (* b 10) a c))))\n(f (read) (read) (read))", "language": "Lisp", "metadata": {"date": 1573534482, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s426822692.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s426822692", "user_id": "u691380397"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(defun f (a b c)\n  (cond\n    ((> a b) (+ (* a 10) b c))\n    ((< a b) (+ (* b 10) a c))\n    ((> b c) (+ (* a 10) b c))\n    ((< b c) (+ (* b 10) a c))\n    (t (+ (* b 10) a c))))\n(f (read) (read) (read))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 200, "cpu_time_ms": 39, "memory_kb": 5728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s065902597", "group_id": "codeNet:p03250", "input_text": "(defun f (a b c)\n  (cond\n    ((> a b) (+ (* a 10) b c))\n    ((< a b) (+ (* b 10) a c))\n    ((> b c) (+ (* a 10) b c))\n    ((< b c) (+ (* b 10) a c))\n    (t (+ (* b 10) a c))))", "language": "Lisp", "metadata": {"date": 1573534404, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s065902597.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s065902597", "user_id": "u691380397"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(defun f (a b c)\n  (cond\n    ((> a b) (+ (* a 10) b c))\n    ((< a b) (+ (* b 10) a c))\n    ((> b c) (+ (* a 10) b c))\n    ((< b c) (+ (* b 10) a c))\n    (t (+ (* b 10) a c))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 175, "cpu_time_ms": 12, "memory_kb": 3944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s671973805", "group_id": "codeNet:p03250", "input_text": "(defun maximizeFomula (a b c) (+ (* (max a b c) 9) a b c))\n(format t \"~A~%\" (maximizeFomula (read) (read) (read)))", "language": "Lisp", "metadata": {"date": 1562298416, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s671973805.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s671973805", "user_id": "u606976120"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(defun maximizeFomula (a b c) (+ (* (max a b c) 9) a b c))\n(format t \"~A~%\" (maximizeFomula (read) (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 114, "cpu_time_ms": 120, "memory_kb": 12388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s559491886", "group_id": "codeNet:p03250", "input_text": "(let* ((a (read)) (b (read)) (c (read)) (lst (sort (list a b c) #'>)))\n  (princ (+ (* 10 (car lst)) (cadr lst) (caddr lst))))", "language": "Lisp", "metadata": {"date": 1547184346, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s559491886.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s559491886", "user_id": "u390566373"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(let* ((a (read)) (b (read)) (c (read)) (lst (sort (list a b c) #'>)))\n  (princ (+ (* 10 (car lst)) (cadr lst) (caddr lst))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 168, "memory_kb": 11108}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s636525036", "group_id": "codeNet:p03250", "input_text": "(setf n (sort (list (read) (read) (read)) #'>))\n(format t \"~A\" (+ (* (first n) 10) (second n) (third n)))", "language": "Lisp", "metadata": {"date": 1539839149, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s636525036.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s636525036", "user_id": "u610490393"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(setf n (sort (list (read) (read) (read)) #'>))\n(format t \"~A\" (+ (* (first n) 10) (second n) (third n)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 105, "cpu_time_ms": 9, "memory_kb": 3304}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s112233179", "group_id": "codeNet:p03250", "input_text": "(setf n (sort (list (read) (read) (read)) #'>))\n(format t \"~A\" (+ (* (first n) 10) (second n) (third)))", "language": "Lisp", "metadata": {"date": 1539839075, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s112233179.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s112233179", "user_id": "u610490393"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(setf n (sort (list (read) (read) (read)) #'>))\n(format t \"~A\" (+ (* (first n) 10) (second n) (third)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 103, "cpu_time_ms": 11, "memory_kb": 3560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s249014628", "group_id": "codeNet:p03250", "input_text": "(defparameter *a* (read))\n(defparameter *b* (read))\n(defparameter *c* (read))\n\n(defun f (a b c)\n  (let ((lst (sort (list a b c) #'>)))\n    (+ (* (first lst) 10) (second lst) (third lst))))\n\n(princ (f *a* *b* *c*))", "language": "Lisp", "metadata": {"date": 1537942526, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s249014628.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s249014628", "user_id": "u956039157"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(defparameter *a* (read))\n(defparameter *b* (read))\n(defparameter *c* (read))\n\n(defun f (a b c)\n  (let ((lst (sort (list a b c) #'>)))\n    (+ (* (first lst) 10) (second lst) (third lst))))\n\n(princ (f *a* *b* *c*))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 213, "cpu_time_ms": 183, "memory_kb": 14944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s177433556", "group_id": "codeNet:p03250", "input_text": "(princ(+(setq a(read))(setq b(read))(setq c(read))(*(max a b c)9)))", "language": "Lisp", "metadata": {"date": 1537765602, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s177433556.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s177433556", "user_id": "u657913472"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(princ(+(setq a(read))(setq b(read))(setq c(read))(*(max a b c)9)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 67, "cpu_time_ms": 10, "memory_kb": 3432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s525814218", "group_id": "codeNet:p03250", "input_text": "(princ(+(setq a(read))(setq b(read))(setq c(read))(max a b c)))", "language": "Lisp", "metadata": {"date": 1537765584, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s525814218.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s525814218", "user_id": "u657913472"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(princ(+(setq a(read))(setq b(read))(setq c(read))(max a b c)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 63, "cpu_time_ms": 78, "memory_kb": 8420}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s739607864", "group_id": "codeNet:p03250", "input_text": "(defvar *a* (read))\n(defvar *b* (read))\n(defvar *c* (read))\n\n(defun main ()\n  (let ((lst (list *a* *b* *c*)))\n    (setq lst (sort lst #'>))\n    (let ((left (concatenate 'string (write-to-string (nth 0 lst)) (write-to-string (nth 1 lst)))))\n      (princ (+ (parse-integer left) (nth 2 lst))))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1537753923, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Lisp/s739607864.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s739607864", "user_id": "u631655863"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "(defvar *a* (read))\n(defvar *b* (read))\n(defvar *c* (read))\n\n(defun main ()\n  (let ((lst (list *a* *b* *c*)))\n    (setq lst (sort lst #'>))\n    (let ((left (concatenate 'string (write-to-string (nth 0 lst)) (write-to-string (nth 1 lst)))))\n      (princ (+ (parse-integer left) (nth 2 lst))))))\n\n(main)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 301, "cpu_time_ms": 231, "memory_kb": 11360}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s499107527", "group_id": "codeNet:p03251", "input_text": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (set-dispatch-macro-character #\\# #\\> #'cl-debug-print:debug-print-reader)\n\n(macrolet ((def-int (b)\n             `(progn (deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))\n                     (deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))))\n           (defs (&rest bits) `(progn ,@(mapcar (lambda (b) `(def-int ,b)) bits))))\n  (defs 2 4 7 8 15 16 31 32 62 63 64))\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n(defpackage :cp/modify-macro\n  (:use :cl)\n  (:export #:minf #:maxf #:mulf #:divf #:iorf #:xorf #:andf))\n(in-package :cp/modify-macro)\n\n(macrolet ((def (name fname)\n             `(define-modify-macro ,name (new-value) ,fname)))\n  (def minf min)\n  (def maxf max)\n  (def mulf *)\n  (def divf /)\n  (def iorf logior)\n  (def xorf logxor)\n  (def andf logand))\n\n;; BEGIN_USE_PACKAGE\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/modify-macro :cl-user))\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (max (read))\n         (min (read)))\n    (dotimes (_ n) (maxf max (read)))\n    (dotimes (_ m) (minf min (read)))\n    (write-line (if (< max min)\n                    \"No War\"\n                    \"War\"))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n#-swank\n(eval-when (:compile-toplevel)\n  (when (and (boundp 'sb-c::*compiler-warning-count*)\n             (> sb-c::*compiler-warning-count* 0))\n    (sb-ext:quit :unix-status 1)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (5am:is\n   (equal \"No War\n\"\n          (run \"3 2 10 20\n8 15 13\n16 22\n\" nil)))\n  (5am:is\n   (equal \"War\n\"\n          (run \"4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\" nil)))\n  (5am:is\n   (equal \"War\n\"\n          (run \"5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\" nil))))\n", "language": "Lisp", "metadata": {"date": 1600760120, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s499107527.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s499107527", "user_id": "u352600849"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (set-dispatch-macro-character #\\# #\\> #'cl-debug-print:debug-print-reader)\n\n(macrolet ((def-int (b)\n             `(progn (deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))\n                     (deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))))\n           (defs (&rest bits) `(progn ,@(mapcar (lambda (b) `(def-int ,b)) bits))))\n  (defs 2 4 7 8 15 16 31 32 62 63 64))\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n(defpackage :cp/modify-macro\n  (:use :cl)\n  (:export #:minf #:maxf #:mulf #:divf #:iorf #:xorf #:andf))\n(in-package :cp/modify-macro)\n\n(macrolet ((def (name fname)\n             `(define-modify-macro ,name (new-value) ,fname)))\n  (def minf min)\n  (def maxf max)\n  (def mulf *)\n  (def divf /)\n  (def iorf logior)\n  (def xorf logxor)\n  (def andf logand))\n\n;; BEGIN_USE_PACKAGE\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (use-package :cp/modify-macro :cl-user))\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read))\n         (m (read))\n         (max (read))\n         (min (read)))\n    (dotimes (_ n) (maxf max (read)))\n    (dotimes (_ m) (minf min (read)))\n    (write-line (if (< max min)\n                    \"No War\"\n                    \"War\"))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n#-swank\n(eval-when (:compile-toplevel)\n  (when (and (boundp 'sb-c::*compiler-warning-count*)\n             (> sb-c::*compiler-warning-count* 0))\n    (sb-ext:quit :unix-status 1)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (5am:is\n   (equal \"No War\n\"\n          (run \"3 2 10 20\n8 15 13\n16 22\n\" nil)))\n  (5am:is\n   (equal \"War\n\"\n          (run \"4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\" nil)))\n  (5am:is\n   (equal \"War\n\"\n          (run \"5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\" nil))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4146, "cpu_time_ms": 20, "memory_kb": 24068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s454191545", "group_id": "codeNet:p03251", "input_text": "(let* ((N (read))\n       (M (read))\n       (X (read))\n       (Y (read))\n       (Xi (loop :repeat N :collect (read)))\n       (Z (apply #'min\n                 (loop :repeat M :collect (read)))))\n  (if (and (< X Z)\n           (<= Z Y)\n           (not (dolist (w Xi)\n                  (if (>= w Z) (return t)))))\n      (princ \"No War\") (princ \"War\")))", "language": "Lisp", "metadata": {"date": 1585332292, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s454191545.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s454191545", "user_id": "u334552723"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(let* ((N (read))\n       (M (read))\n       (X (read))\n       (Y (read))\n       (Xi (loop :repeat N :collect (read)))\n       (Z (apply #'min\n                 (loop :repeat M :collect (read)))))\n  (if (and (< X Z)\n           (<= Z Y)\n           (not (dolist (w Xi)\n                  (if (>= w Z) (return t)))))\n      (princ \"No War\") (princ \"War\")))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 347, "cpu_time_ms": 20, "memory_kb": 6504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s585220557", "group_id": "codeNet:p03251", "input_text": "(let* ((N (read))\n       (M (read))\n       (X (read))\n       (Y (read))\n       (Xi (loop :repeat N :collect (read)))\n       (Z (apply #'min\n                 (loop :repeat M :collect (read)))))\n  (if (and (< X Z)\n           (<= Z Y)\n           (not (dolist (w Xi)\n                  (if (> w Z) (return t)))))\n      (princ \"No War\") (princ \"War\")))", "language": "Lisp", "metadata": {"date": 1585332193, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s585220557.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s585220557", "user_id": "u334552723"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(let* ((N (read))\n       (M (read))\n       (X (read))\n       (Y (read))\n       (Xi (loop :repeat N :collect (read)))\n       (Z (apply #'min\n                 (loop :repeat M :collect (read)))))\n  (if (and (< X Z)\n           (<= Z Y)\n           (not (dolist (w Xi)\n                  (if (> w Z) (return t)))))\n      (princ \"No War\") (princ \"War\")))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 346, "cpu_time_ms": 19, "memory_kb": 6504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s380973920", "group_id": "codeNet:p03251", "input_text": "(defun get-max (n)\n  (cond\n    ((< n 1) -10000000000)\n    (t (let ((x (read)))\n\t (max x (get-max (- n 1)))))))\n(defun get-min (n)\n  (cond\n    ((< n 1) 10000000000)\n    (t (let ((x (read)))\n\t (min x (get-min (- n 1)))))))\n(let*\n    ((n (read))\n     (m (read))\n     (x (read))\n     (y (read))\n     (xmax (max (get-max n) x))\n     (ymin (min (get-min m) y)))\n  (if (>= xmax ymin)\n      (princ \"War\")\n      (princ \"No War\")))", "language": "Lisp", "metadata": {"date": 1573586663, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s380973920.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380973920", "user_id": "u691380397"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(defun get-max (n)\n  (cond\n    ((< n 1) -10000000000)\n    (t (let ((x (read)))\n\t (max x (get-max (- n 1)))))))\n(defun get-min (n)\n  (cond\n    ((< n 1) 10000000000)\n    (t (let ((x (read)))\n\t (min x (get-min (- n 1)))))))\n(let*\n    ((n (read))\n     (m (read))\n     (x (read))\n     (y (read))\n     (xmax (max (get-max n) x))\n     (ymin (min (get-min m) y)))\n  (if (>= xmax ymin)\n      (princ \"War\")\n      (princ \"No War\")))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 421, "cpu_time_ms": 20, "memory_kb": 6632}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s117046562", "group_id": "codeNet:p03251", "input_text": "(let* ((n (read))\n       (m (read))\n       (x (read))\n       (y (read))\n       (xn (first (sort (loop :for p :from 1 :upto n collect(read)) #'>)))\n       (xm (first (sort (loop :for q :from 1 :upto m collect(read)) #'<))))\n  (if (and (< x xm) (>= y xm) (< xn xm))\n      (princ \"No War\")\n      (princ \"War\")))", "language": "Lisp", "metadata": {"date": 1539839929, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s117046562.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s117046562", "user_id": "u610490393"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (x (read))\n       (y (read))\n       (xn (first (sort (loop :for p :from 1 :upto n collect(read)) #'>)))\n       (xm (first (sort (loop :for q :from 1 :upto m collect(read)) #'<))))\n  (if (and (< x xm) (>= y xm) (< xn xm))\n      (princ \"No War\")\n      (princ \"War\")))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 308, "cpu_time_ms": 14, "memory_kb": 4200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s678223814", "group_id": "codeNet:p03251", "input_text": "(defparameter *n* (read))\n(defparameter *m* (read))\n(defparameter *x* (read))\n(defparameter *y* (read))\n(defparameter *xs* (loop repeat *n*\n                         collect (read)))\n(defparameter *ys* (loop repeat *m*\n                         collect (read)))\n\n(defun andmap (pred lst)\n  (every #'identity (mapcar pred lst)))\n\n(defun f (x y xs ys)\n  (let* ((sed-xs (sort xs #'<))\n         (sed-ys (sort ys #'<))\n         (max-x (car (last sed-xs)))\n         (min-y (first sed-ys)))\n    (if (and\n          (< x y)\n          (< x max-x min-y y))\n        \"No War\"\n        \"War\")))\n\n(princ (f *x* *y* *xs* *ys*))", "language": "Lisp", "metadata": {"date": 1537944048, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s678223814.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s678223814", "user_id": "u956039157"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(defparameter *n* (read))\n(defparameter *m* (read))\n(defparameter *x* (read))\n(defparameter *y* (read))\n(defparameter *xs* (loop repeat *n*\n                         collect (read)))\n(defparameter *ys* (loop repeat *m*\n                         collect (read)))\n\n(defun andmap (pred lst)\n  (every #'identity (mapcar pred lst)))\n\n(defun f (x y xs ys)\n  (let* ((sed-xs (sort xs #'<))\n         (sed-ys (sort ys #'<))\n         (max-x (car (last sed-xs)))\n         (min-y (first sed-ys)))\n    (if (and\n          (< x y)\n          (< x max-x min-y y))\n        \"No War\"\n        \"War\")))\n\n(princ (f *x* *y* *xs* *ys*))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 608, "cpu_time_ms": 97, "memory_kb": 11368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s559957208", "group_id": "codeNet:p03251", "input_text": "(defconstant *n* (read))\n(defconstant *m* (read))\n(defconstant *x* (read))\n(defconstant *y* (read))\n\n(defmacro set-lst (n)\n  `(loop for i from 1 to ,n\n        collect (read)))\n\n(defconstant *x-n* (nth 0 (sort (set-lst *n*) #'>)))\n(defconstant *y-m* (nth 0 (sort (set-lst *m*) #'<)))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n(if (calc *x-n* *y-m* (1+ *x*))\n    (princ \"No War\")\n    (princ \"War\"))", "language": "Lisp", "metadata": {"date": 1537838596, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s559957208.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s559957208", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(defconstant *n* (read))\n(defconstant *m* (read))\n(defconstant *x* (read))\n(defconstant *y* (read))\n\n(defmacro set-lst (n)\n  `(loop for i from 1 to ,n\n        collect (read)))\n\n(defconstant *x-n* (nth 0 (sort (set-lst *n*) #'>)))\n(defconstant *y-m* (nth 0 (sort (set-lst *m*) #'<)))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n(if (calc *x-n* *y-m* (1+ *x*))\n    (princ \"No War\")\n    (princ \"War\"))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 506, "cpu_time_ms": 139, "memory_kb": 13156}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s766792428", "group_id": "codeNet:p03251", "input_text": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (loop for i from 1 to n\n        collect (read)))\n\n(defvar *x-n* (nth 0 (sort (set-lst *n*) #'>)))\n(defvar *y-m* (nth 0 (sort (set-lst *m*) #'<)))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n\n(if (calc *x-n* *y-m* (1+ *x*))\n    (princ \"No War\")\n    (princ \"War\"))", "language": "Lisp", "metadata": {"date": 1537811171, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s766792428.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s766792428", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (loop for i from 1 to n\n        collect (read)))\n\n(defvar *x-n* (nth 0 (sort (set-lst *n*) #'>)))\n(defvar *y-m* (nth 0 (sort (set-lst *m*) #'<)))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n\n(if (calc *x-n* *y-m* (1+ *x*))\n    (princ \"No War\")\n    (princ \"War\"))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 472, "cpu_time_ms": 18, "memory_kb": 4200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s026909868", "group_id": "codeNet:p03251", "input_text": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n      (let ((tmp (read)))\n        (push tmp lst)))\n    (cdr (reverse lst))))\n\n(defvar *lst-x* (nth 0 (sort (set-lst *n*) #'>)))\n(defvar *lst-y* (nth 0 (sort (set-lst *m*)) #'<))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n\n(if (calc (nth 0 *lst-x*) (nth 0 *lst-y*) (1+ *x*))\n    (princ \"No War\")\n    (princ \"War\"))", "language": "Lisp", "metadata": {"date": 1537801653, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s026909868.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s026909868", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n      (let ((tmp (read)))\n        (push tmp lst)))\n    (cdr (reverse lst))))\n\n(defvar *lst-x* (nth 0 (sort (set-lst *n*) #'>)))\n(defvar *lst-y* (nth 0 (sort (set-lst *m*)) #'<))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n\n(if (calc (nth 0 *lst-x*) (nth 0 *lst-y*) (1+ *x*))\n    (princ \"No War\")\n    (princ \"War\"))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 567, "cpu_time_ms": 279, "memory_kb": 13408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s405460533", "group_id": "codeNet:p03251", "input_text": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n      (let ((tmp (read)))\n        (push (read) lst)))\n    (cdr (reverse lst))))\n\n(defvar *xn* (nth 0 (sort (set-lst *n*) #'>)))\n(defvar *ym* (nth 0 (sort (set-lst *m*) #'<)))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n\n(if (calc *xn* *ym* (1+ *x*))\n    (princ \"No War\")\n    (princ \"War\"))", "language": "Lisp", "metadata": {"date": 1537801180, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s405460533.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s405460533", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n      (let ((tmp (read)))\n        (push (read) lst)))\n    (cdr (reverse lst))))\n\n(defvar *xn* (nth 0 (sort (set-lst *n*) #'>)))\n(defvar *ym* (nth 0 (sort (set-lst *m*) #'<)))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n\n(if (calc *xn* *ym* (1+ *x*))\n    (princ \"No War\")\n    (princ \"War\"))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 542, "cpu_time_ms": 18, "memory_kb": 4064}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s777810315", "group_id": "codeNet:p03251", "input_text": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n        (push (read) lst))\n    (cdr (reverse lst))))\n\n(defvar *lst-x* (sort (set-lst *n*) #'>))\n(defvar *lst-y* (sort (set-lst *m*) #'<))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n(defun main ()\n  (if (calc (nth 0 *lst-x*) (nth 0 *lst-y*) (1+ *x*))\n      (princ \"No War\")\n      (princ \"War\")))\n\n(main)", "language": "Lisp", "metadata": {"date": 1537799113, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s777810315.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s777810315", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n        (push (read) lst))\n    (cdr (reverse lst))))\n\n(defvar *lst-x* (sort (set-lst *n*) #'>))\n(defvar *lst-y* (sort (set-lst *m*) #'<))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n(defun main ()\n  (if (calc (nth 0 *lst-x*) (nth 0 *lst-y*) (1+ *x*))\n      (princ \"No War\")\n      (princ \"War\")))\n\n(main)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 556, "cpu_time_ms": 183, "memory_kb": 12648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s156546294", "group_id": "codeNet:p03251", "input_text": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n      (let ((tmp (read)))\n        (push tmp lst)))\n    (cdr (reverse lst))))\n\n(defvar *lst-x* (set-lst *n*))\n(setq *lst-x* (sort *lst-x* #'>))\n\n(defvar *lst-y* (set-lst *m*))\n(setq *lst-y* (sort *lst-y* #'<))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n(defun main ()\n  (if (calc (nth 0 *lst-x*) (nth 0 *lst-y*) (1+ *x*))\n      (princ \"No War\")\n      (princ \"War\")))\n\n\n(main)", "language": "Lisp", "metadata": {"date": 1537798724, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s156546294.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156546294", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n      (let ((tmp (read)))\n        (push tmp lst)))\n    (cdr (reverse lst))))\n\n(defvar *lst-x* (set-lst *n*))\n(setq *lst-x* (sort *lst-x* #'>))\n\n(defvar *lst-y* (set-lst *m*))\n(setq *lst-y* (sort *lst-y* #'<))\n\n(defun calc (x y z)\n  (cond ((and (< x z) (>= y z) (< *x* z) (>= *y* z))\n         t)\n        ((> z *y*)\n         nil)\n        (t (calc x y (1+ z)))))\n\n(defun main ()\n  (if (calc (nth 0 *lst-x*) (nth 0 *lst-y*) (1+ *x*))\n      (princ \"No War\")\n      (princ \"War\")))\n\n\n(main)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 628, "cpu_time_ms": 155, "memory_kb": 12516}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s802617209", "group_id": "codeNet:p03251", "input_text": "(setq n(read))(setq m(read))(setq x(read))(setq y(read))\n(princ(if(<(apply #'max(cons x(loop for i from 1 to n collect(read))))(apply #'min(cons y(loop for i from 1 to m collect(read)))))\"No War\"\"War\"))", "language": "Lisp", "metadata": {"date": 1537770352, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s802617209.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s802617209", "user_id": "u657913472"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(setq n(read))(setq m(read))(setq x(read))(setq y(read))\n(princ(if(<(apply #'max(cons x(loop for i from 1 to n collect(read))))(apply #'min(cons y(loop for i from 1 to m collect(read)))))\"No War\"\"War\"))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 69, "memory_kb": 7656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s319183424", "group_id": "codeNet:p03251", "input_text": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n      (let ((tmp (read)))\n        (push tmp lst)))\n    (cdr (reverse lst))))\n\n(defun calc (x y z)\n  (cond ((> z y)\n         nil)\n        ((and (< x z) (>= y z))\n         z)\n        (t (calc x y (1+ z)))))\n\n(defun main ()\n  (let ((lst-x (sort (set-lst *n*) #'>))\n        (lst-y (sort (set-lst *m*) #'>)))\n      (let* ((x (nth 0 lst-x))\n             (y (nth 0 lst-y))\n             (z (calc x y (1+ *x*))))\n        (if (null z)\n            (format t \"War~%\")\n            (format t \"No War~%\")))))\n\n(main)\n      ", "language": "Lisp", "metadata": {"date": 1537756245, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s319183424.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s319183424", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n      (let ((tmp (read)))\n        (push tmp lst)))\n    (cdr (reverse lst))))\n\n(defun calc (x y z)\n  (cond ((> z y)\n         nil)\n        ((and (< x z) (>= y z))\n         z)\n        (t (calc x y (1+ z)))))\n\n(defun main ()\n  (let ((lst-x (sort (set-lst *n*) #'>))\n        (lst-y (sort (set-lst *m*) #'>)))\n      (let* ((x (nth 0 lst-x))\n             (y (nth 0 lst-y))\n             (z (calc x y (1+ *x*))))\n        (if (null z)\n            (format t \"War~%\")\n            (format t \"No War~%\")))))\n\n(main)\n      ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 653, "cpu_time_ms": 193, "memory_kb": 13412}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s131029336", "group_id": "codeNet:p03251", "input_text": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n      (let ((tmp (read)))\n        (push tmp lst)))\n    (cdr (reverse lst))))\n\n(defun calc (x y z)\n  (cond ((> z y)\n         nil)\n        ((and (< x z) (>= y z))\n         z)\n        (t (calc x y (1+ z)))))\n\n(defun main ()\n  (let ((lst-x (set-lst *n*)))\n    (let ((lst-y (set-lst *m*)))\n      (setq lst-x (sort lst-x #'>))\n      (setq lst-y (sort lst-y #'>))\n      (let* ((x (nth 0 lst-x))\n             (y (nth 0 lst-y))\n             (z (calc x y (1+ *x*))))\n        (if (null z)\n            (princ \"War\")\n            (princ \"No War\"))))))\n\n(main)\n      ", "language": "Lisp", "metadata": {"date": 1537756121, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Lisp/s131029336.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s131029336", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "(defvar *n* (read))\n(defvar *m* (read))\n(defvar *x* (read))\n(defvar *y* (read))\n\n(defun set-lst (n)\n  (let ((lst (list nil)))\n    (dotimes (x n)\n      (let ((tmp (read)))\n        (push tmp lst)))\n    (cdr (reverse lst))))\n\n(defun calc (x y z)\n  (cond ((> z y)\n         nil)\n        ((and (< x z) (>= y z))\n         z)\n        (t (calc x y (1+ z)))))\n\n(defun main ()\n  (let ((lst-x (set-lst *n*)))\n    (let ((lst-y (set-lst *m*)))\n      (setq lst-x (sort lst-x #'>))\n      (setq lst-y (sort lst-y #'>))\n      (let* ((x (nth 0 lst-x))\n             (y (nth 0 lst-y))\n             (z (calc x y (1+ *x*))))\n        (if (null z)\n            (princ \"War\")\n            (princ \"No War\"))))))\n\n(main)\n      ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 697, "cpu_time_ms": 221, "memory_kb": 12520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s202800864", "group_id": "codeNet:p03260", "input_text": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (set-dispatch-macro-character #\\# #\\> #'cl-debug-print:debug-print-reader)\n\n(macrolet ((def-int (b)\n             `(progn (deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))\n                     (deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))))\n           (defs (&rest bits) `(progn ,@(mapcar (lambda (b) `(def-int ,b)) bits))))\n  (defs 2 4 7 8 15 16 31 32 62 63 64))\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n;; BEGIN_USE_PACKAGE\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((a (read))\n         (b (read)))\n    (write-line (if (and (oddp a) (oddp b))\n                    \"Yes\"\n                    \"No\"))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n#-swank\n(eval-when (:compile-toplevel)\n  (when (and (boundp 'sb-c::*compiler-warning-count*)\n             (> sb-c::*compiler-warning-count* 0))\n    (sb-ext:quit :unix-status 1)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (5am:is\n   (equal \"Yes\n\"\n          (run \"3 1\n\" nil)))\n  (5am:is\n   (equal \"No\n\"\n          (run \"1 2\n\" nil)))\n  (5am:is\n   (equal \"No\n\"\n          (run \"2 2\n\" nil))))\n", "language": "Lisp", "metadata": {"date": 1600763058, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s202800864.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s202800864", "user_id": "u352600849"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (set-dispatch-macro-character #\\# #\\> #'cl-debug-print:debug-print-reader)\n\n(macrolet ((def-int (b)\n             `(progn (deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))\n                     (deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))))\n           (defs (&rest bits) `(progn ,@(mapcar (lambda (b) `(def-int ,b)) bits))))\n  (defs 2 4 7 8 15 16 31 32 62 63 64))\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n;; BEGIN_USE_PACKAGE\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((a (read))\n         (b (read)))\n    (write-line (if (and (oddp a) (oddp b))\n                    \"Yes\"\n                    \"No\"))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n#-swank\n(eval-when (:compile-toplevel)\n  (when (and (boundp 'sb-c::*compiler-warning-count*)\n             (> sb-c::*compiler-warning-count* 0))\n    (sb-ext:quit :unix-status 1)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (5am:is\n   (equal \"Yes\n\"\n          (run \"3 1\n\" nil)))\n  (5am:is\n   (equal \"No\n\"\n          (run \"1 2\n\" nil)))\n  (5am:is\n   (equal \"No\n\"\n          (run \"2 2\n\" nil))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3500, "cpu_time_ms": 18, "memory_kb": 23868}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s861373890", "group_id": "codeNet:p03260", "input_text": "(let ((a (read))\n      (b (read)))\n  (if (oddp (* a b))\n      (princ \"Yes\")\n      (princ \"No\")))", "language": "Lisp", "metadata": {"date": 1590795844, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s861373890.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s861373890", "user_id": "u425762225"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(let ((a (read))\n      (b (read)))\n  (if (oddp (* a b))\n      (princ \"Yes\")\n      (princ \"No\")))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 114, "memory_kb": 12128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s256858260", "group_id": "codeNet:p03260", "input_text": "(princ (if (oddp (* (read) (read))) \"Yes\" \"No\"))\n", "language": "Lisp", "metadata": {"date": 1576901184, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s256858260.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s256858260", "user_id": "u493610446"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(princ (if (oddp (* (read) (read))) \"Yes\" \"No\"))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 49, "cpu_time_ms": 5, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s651020005", "group_id": "codeNet:p03260", "input_text": "(if (equal (mod (* (read) (read)) 2) 1) (print 'Yes) (print 'No))", "language": "Lisp", "metadata": {"date": 1573535779, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s651020005.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s651020005", "user_id": "u691380397"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(if (equal (mod (* (read) (read)) 2) 1) (print 'Yes) (print 'No))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 65, "cpu_time_ms": 5, "memory_kb": 2788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s794280671", "group_id": "codeNet:p03260", "input_text": "(if (equal (mod (* (read) (read)) 2) 1) 'Yes 'No)", "language": "Lisp", "metadata": {"date": 1573535722, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s794280671.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s794280671", "user_id": "u691380397"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(if (equal (mod (* (read) (read)) 2) 1) 'Yes 'No)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 49, "cpu_time_ms": 5, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s062686968", "group_id": "codeNet:p03260", "input_text": "(if (equal (mod (* (read) (read)) 2) 1 'Yes 'No)", "language": "Lisp", "metadata": {"date": 1573535623, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s062686968.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s062686968", "user_id": "u691380397"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(if (equal (mod (* (read) (read)) 2) 1 'Yes 'No)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 48, "cpu_time_ms": 13, "memory_kb": 3560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s847091877", "group_id": "codeNet:p03260", "input_text": "(if (equal (mod (read) 2) 1 'Yes 'No)", "language": "Lisp", "metadata": {"date": 1573535588, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s847091877.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s847091877", "user_id": "u691380397"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(if (equal (mod (read) 2) 1 'Yes 'No)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 37, "cpu_time_ms": 29, "memory_kb": 4712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s077362069", "group_id": "codeNet:p03260", "input_text": "(defvar a (read))\n(defvar b (read))\n(if (and (= (mod a 2) 1) (= (mod b 2) 1))\n  (princ \"Yes\")\n  (princ \"No\"))", "language": "Lisp", "metadata": {"date": 1561785569, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s077362069.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s077362069", "user_id": "u480300350"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defvar a (read))\n(defvar b (read))\n(if (and (= (mod a 2) 1) (= (mod b 2) 1))\n  (princ \"Yes\")\n  (princ \"No\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 109, "cpu_time_ms": 131, "memory_kb": 12264}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s082736650", "group_id": "codeNet:p03260", "input_text": "(defvar a (read))\n(defvar b (read))\n(if (and (= (mod a 2) 0) (= (mod b 2) 0))\n  (princ \"Yes\")\n  (princ \"No\"))", "language": "Lisp", "metadata": {"date": 1561785489, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s082736650.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s082736650", "user_id": "u480300350"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defvar a (read))\n(defvar b (read))\n(if (and (= (mod a 2) 0) (= (mod b 2) 0))\n  (princ \"Yes\")\n  (princ \"No\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 109, "cpu_time_ms": 111, "memory_kb": 10724}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s156121386", "group_id": "codeNet:p03260", "input_text": "(let ((a (read)) (b (read)))\n  (if (and (oddp a) (oddp b))\n    (princ \"Yes\")\n    (princ \"No\")))", "language": "Lisp", "metadata": {"date": 1547184617, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s156121386.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156121386", "user_id": "u390566373"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(let ((a (read)) (b (read)))\n  (if (and (oddp a) (oddp b))\n    (princ \"Yes\")\n    (princ \"No\")))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 95, "cpu_time_ms": 45, "memory_kb": 5220}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s534025424", "group_id": "codeNet:p03260", "input_text": "(defparameter A (read))\n(defparameter B (read))\n\n(if (oddp (* A B))\n  (princ \"Yes\")\n  (princ \"No\"))\n(fresh-line)", "language": "Lisp", "metadata": {"date": 1543957562, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s534025424.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s534025424", "user_id": "u591440280"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defparameter A (read))\n(defparameter B (read))\n\n(if (oddp (* A B))\n  (princ \"Yes\")\n  (princ \"No\"))\n(fresh-line)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 112, "cpu_time_ms": 29, "memory_kb": 4452}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s919656755", "group_id": "codeNet:p03260", "input_text": "(defun even (n) (if (= 0 (mod n 2)) t nil))\n(defun f (a b) (and (even a) (even b)))\n\n(if (f (read) (read)) (print \"No\") (print \"Yes\"))", "language": "Lisp", "metadata": {"date": 1538520783, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s919656755.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s919656755", "user_id": "u390566373"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun even (n) (if (= 0 (mod n 2)) t nil))\n(defun f (a b) (and (even a) (even b)))\n\n(if (f (read) (read)) (print \"No\") (print \"Yes\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 134, "cpu_time_ms": 12, "memory_kb": 3688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s279558631", "group_id": "codeNet:p03260", "input_text": "(princ(if(=(mod(*(read)(read))2)0)\"No\"\"Yes\"))", "language": "Lisp", "metadata": {"date": 1536461625, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s279558631.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s279558631", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(princ(if(=(mod(*(read)(read))2)0)\"No\"\"Yes\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 45, "cpu_time_ms": 5, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s009680994", "group_id": "codeNet:p03260", "input_text": "(defun main ()\n  (defparameter s_list (loop :for a :from 1 :upto (read) collect(read-line)))\n  (if (equal s_list (remove-duplicates s_list :test #'equal))\n      (if (loop :for k :from 1 :upto (1- (length s_list)) always(equal (car (last (concatenate 'list (nth (1- k) s_list)))) (char (nth k s_list) 0)))\n          \"Yes\"\n          \"No\")\n      \"No\")\n  )\n(format t \"~A\" (main))\n", "language": "Lisp", "metadata": {"date": 1536456931, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s009680994.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s009680994", "user_id": "u610490393"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun main ()\n  (defparameter s_list (loop :for a :from 1 :upto (read) collect(read-line)))\n  (if (equal s_list (remove-duplicates s_list :test #'equal))\n      (if (loop :for k :from 1 :upto (1- (length s_list)) always(equal (car (last (concatenate 'list (nth (1- k) s_list)))) (char (nth k s_list) 0)))\n          \"Yes\"\n          \"No\")\n      \"No\")\n  )\n(format t \"~A\" (main))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 376, "cpu_time_ms": 161, "memory_kb": 13544}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s597181929", "group_id": "codeNet:p03260", "input_text": "(defun calc (a b &optional (c 1) (ans \"No\"))\n  (let ((r (* c (* a b))))\n    (cond ((> c 3)\n           ans)\n          ((oddp r)\n           \"Yes\")\n          (t (calc a b (incf c))))))\n\n(defun main ()\n  (let ((a (read)))\n    (let ((b (read)))\n      (format t \"~a~%\" (calc a b)))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1536456222, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s597181929.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s597181929", "user_id": "u631655863"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun calc (a b &optional (c 1) (ans \"No\"))\n  (let ((r (* c (* a b))))\n    (cond ((> c 3)\n           ans)\n          ((oddp r)\n           \"Yes\")\n          (t (calc a b (incf c))))))\n\n(defun main ()\n  (let ((a (read)))\n    (let ((b (read)))\n      (format t \"~a~%\" (calc a b)))))\n\n(main)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 285, "cpu_time_ms": 383, "memory_kb": 13924}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s023012788", "group_id": "codeNet:p03260", "input_text": "(defun calc (a b &optional (c 1) (ans \"No\"))\n  (let ((r (* c (* a b))))\n    (cond ((> c 3)\n           ans)\n          ((oddp r)\n           \"Yes\")\n          (t (calc a b (incf c))))))\n\n(defun main ()\n  (let ((a (read)))\n    (let ((b (read)))\n      (format t \"~s~%\" (calc a b)))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1536456103, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s023012788.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s023012788", "user_id": "u631655863"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(defun calc (a b &optional (c 1) (ans \"No\"))\n  (let ((r (* c (* a b))))\n    (cond ((> c 3)\n           ans)\n          ((oddp r)\n           \"Yes\")\n          (t (calc a b (incf c))))))\n\n(defun main ()\n  (let ((a (read)))\n    (let ((b (read)))\n      (format t \"~s~%\" (calc a b)))))\n\n(main)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 285, "cpu_time_ms": 300, "memory_kb": 13924}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s487426577", "group_id": "codeNet:p03260", "input_text": "(format t \"~A\" (if (= 3 (* (read) (read))) \"Yes\" \"No\"))", "language": "Lisp", "metadata": {"date": 1536455090, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Lisp/s487426577.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s487426577", "user_id": "u610490393"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(format t \"~A\" (if (= 3 (* (read) (read))) \"Yes\" \"No\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 55, "cpu_time_ms": 12, "memory_kb": 3684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s335729654", "group_id": "codeNet:p03261", "input_text": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (set-dispatch-macro-character #\\# #\\> #'cl-debug-print:debug-print-reader)\n\n(macrolet ((def-int (b)\n             `(progn (deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))\n                     (deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))))\n           (defs (&rest bits) `(progn ,@(mapcar (lambda (b) `(def-int ,b)) bits))))\n  (defs 2 4 7 8 15 16 31 32 62 63 64))\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n;; BEGIN_USE_PACKAGE\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read))\n         (ws (loop repeat n collect (read-line))))\n    (write-line (if (and (loop for (w1 w2) on ws\n                               while w2\n                               always (char= (aref w1 (- (length w1) 1))\n                                             (aref w2 0)))\n                         (= n (length (remove-duplicates ws :test #'string=))))\n                    \"Yes\"\n                    \"No\"))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n#-swank\n(eval-when (:compile-toplevel)\n  (when (and (boundp 'sb-c::*compiler-warning-count*)\n             (> sb-c::*compiler-warning-count* 0))\n    (sb-ext:quit :unix-status 1)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (5am:is\n   (equal \"No\n\"\n          (run \"4\nhoge\nenglish\nhoge\nenigma\n\" nil)))\n  (5am:is\n   (equal \"Yes\n\"\n          (run \"9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\" nil)))\n  (5am:is\n   (equal \"No\n\"\n          (run \"8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\" nil)))\n  (5am:is\n   (equal \"No\n\"\n          (run \"3\nabc\narc\nagc\n\" nil))))\n", "language": "Lisp", "metadata": {"date": 1600760373, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lisp/s335729654.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s335729654", "user_id": "u352600849"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(in-package :cl-user)\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx opt\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (set-dispatch-macro-character #\\# #\\> #'cl-debug-print:debug-print-reader)\n\n(macrolet ((def-int (b)\n             `(progn (deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))\n                     (deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))))\n           (defs (&rest bits) `(progn ,@(mapcar (lambda (b) `(def-int ,b)) bits))))\n  (defs 2 4 7 8 15 16 31 32 62 63 64))\n\n(defconstant +mod+ 1000000007)\n\n(defmacro dbg (&rest forms)\n  #+swank (if (= (length forms) 1)\n              `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n              `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n;; BEGIN_INSERTED_CONTENTS\n;; BEGIN_USE_PACKAGE\n(in-package :cl-user)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (let* ((n (read))\n         (ws (loop repeat n collect (read-line))))\n    (write-line (if (and (loop for (w1 w2) on ws\n                               while w2\n                               always (char= (aref w1 (- (length w1) 1))\n                                             (aref w2 0)))\n                         (= n (length (remove-duplicates ws :test #'string=))))\n                    \"Yes\"\n                    \"No\"))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    #+os-windows (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)\n    #+os-unix (run-program \"xsel\" '(\"-b\" \"-o\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let* ((*standard-output* (or out (make-string-output-stream)))\n         (res (etypecase thing\n                (null\n                 (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n                   (main)))\n                (string\n                 (with-input-from-string (*standard-input* (delete #\\Return thing))\n                   (main)))\n                (symbol (5am:run! thing))\n                (pathname\n                 (with-open-file (*standard-input* thing)\n                   (main))))))\n    (if out res (get-output-stream-string *standard-output*))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n#-swank\n(eval-when (:compile-toplevel)\n  (when (and (boundp 'sb-c::*compiler-warning-count*)\n             (> sb-c::*compiler-warning-count* 0))\n    (sb-ext:quit :unix-status 1)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (5am:is\n   (equal \"No\n\"\n          (run \"4\nhoge\nenglish\nhoge\nenigma\n\" nil)))\n  (5am:is\n   (equal \"Yes\n\"\n          (run \"9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\" nil)))\n  (5am:is\n   (equal \"No\n\"\n          (run \"8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\" nil)))\n  (5am:is\n   (equal \"No\n\"\n          (run \"3\nabc\narc\nagc\n\" nil))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3961, "cpu_time_ms": 21, "memory_kb": 23908}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s325724892", "group_id": "codeNet:p03261", "input_text": "(if (equal (mod (* (read) (read)) 2) 1) 'Yes 'No)", "language": "Lisp", "metadata": {"date": 1573535713, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lisp/s325724892.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s325724892", "user_id": "u691380397"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(if (equal (mod (* (read) (read)) 2) 1) 'Yes 'No)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 49, "cpu_time_ms": 113, "memory_kb": 10980}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s271874764", "group_id": "codeNet:p03261", "input_text": "(setq n(read))\n(setq s(loop for i from 1 to n collect(read-line)))\n(setq f 0)\n(loop for i from 1 to(1- n)do\n\t  (if(char/=(char(nth(1- i)s)(1-(length(nth(1- i)s))))(char(nth i s)0))(incf f)))\n(princ(if(or(> f 0)(<(length(remove-duplicates s :test #'equal))n))\"No\"\"Yes\"))\n", "language": "Lisp", "metadata": {"date": 1536466357, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lisp/s271874764.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s271874764", "user_id": "u657913472"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(setq n(read))\n(setq s(loop for i from 1 to n collect(read-line)))\n(setq f 0)\n(loop for i from 1 to(1- n)do\n\t  (if(char/=(char(nth(1- i)s)(1-(length(nth(1- i)s))))(char(nth i s)0))(incf f)))\n(princ(if(or(> f 0)(<(length(remove-duplicates s :test #'equal))n))\"No\"\"Yes\"))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 139, "memory_kb": 16096}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s320858421", "group_id": "codeNet:p03261", "input_text": "(defvar *n* (read))\n\n(defun check-first-and-last (lst)\n  (let ((count 0)\n        (previous nil)\n        (check t))\n    (dolist (s lst)\n      (let* ((tmp (concatenate 'list s))\n             (size (length tmp)))\n        (if (= count 0)\n            (progn (setq previous (nth (- size 1) tmp))\n                   (incf count))\n            (if (not (eql previous (car tmp)))\n                (setq check nil)\n                (setq previous (nth (- size 1) tmp))))))\n    check))\n\n(defun word-count (lst)\n  (let ((tmp (sort lst 'string<))\n        (previous nil)\n        (check t))\n    (dolist (s tmp)\n      (if (null previous)\n          (setq previous s)\n          (if (string= previous s)\n              (setq check nil)\n              (setq previous s))))\n    check))\n\n(defun main ()\n  (let ((lst (list nil)))\n    (dotimes (x *n*)\n      (push (read-line) lst))\n    (setq lst (cdr (reverse lst)))\n    (if (null (check-first-and-last lst))\n        (format t \"No~%\")\n        (if (null (word-count lst))\n            (format t \"No~%\")\n            (format t \"Yes~%\")))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1536461015, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lisp/s320858421.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s320858421", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(defvar *n* (read))\n\n(defun check-first-and-last (lst)\n  (let ((count 0)\n        (previous nil)\n        (check t))\n    (dolist (s lst)\n      (let* ((tmp (concatenate 'list s))\n             (size (length tmp)))\n        (if (= count 0)\n            (progn (setq previous (nth (- size 1) tmp))\n                   (incf count))\n            (if (not (eql previous (car tmp)))\n                (setq check nil)\n                (setq previous (nth (- size 1) tmp))))))\n    check))\n\n(defun word-count (lst)\n  (let ((tmp (sort lst 'string<))\n        (previous nil)\n        (check t))\n    (dolist (s tmp)\n      (if (null previous)\n          (setq previous s)\n          (if (string= previous s)\n              (setq check nil)\n              (setq previous s))))\n    check))\n\n(defun main ()\n  (let ((lst (list nil)))\n    (dotimes (x *n*)\n      (push (read-line) lst))\n    (setq lst (cdr (reverse lst)))\n    (if (null (check-first-and-last lst))\n        (format t \"No~%\")\n        (if (null (word-count lst))\n            (format t \"No~%\")\n            (format t \"Yes~%\")))))\n\n(main)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1064, "cpu_time_ms": 24, "memory_kb": 6756}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s319232108", "group_id": "codeNet:p03261", "input_text": "(defvar *n* (read))\n\n(defun check-first-and-last (lst)\n  (let ((count 0)\n        (previous nil)\n        (check t))\n    (dolist (s lst)\n      (if (= count 0)\n          (let* ((tmp (concatenate 'list s))\n                 (size (length tmp)))\n            (setq previous (nth (- size 1) tmp))\n            (incf count))\n          (let* ((tmp (concatenate 'list s))\n                 (size (length tmp)))\n            (if (eql previous (car tmp))\n                (setq check nil)\n                (setq previous (nth (- size 1) tmp))))))\n    check))\n\n(defun word-count (lst)\n  (let ((tmp (sort lst 'string<))\n        (previous nil)\n        (check t))\n    (dolist (s tmp)\n      (if (null previous)\n          (setq previous s)\n          (if (string= previous s)\n              (setq check nil)\n              (setq previous s))))\n    check))\n\n(defun main ()\n  (let ((lst (list nil)))\n    (dotimes (x *n*)\n      (push (read-line) lst))\n    (setq lst (cdr (reverse lst)))\n    (if (null (check-first-and-last lst))\n        (format t \"No~%\")\n        (if (null (word-count lst))\n            (format t \"No~%\")\n            (format t \"Yes~%\")))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1536460435, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lisp/s319232108.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s319232108", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(defvar *n* (read))\n\n(defun check-first-and-last (lst)\n  (let ((count 0)\n        (previous nil)\n        (check t))\n    (dolist (s lst)\n      (if (= count 0)\n          (let* ((tmp (concatenate 'list s))\n                 (size (length tmp)))\n            (setq previous (nth (- size 1) tmp))\n            (incf count))\n          (let* ((tmp (concatenate 'list s))\n                 (size (length tmp)))\n            (if (eql previous (car tmp))\n                (setq check nil)\n                (setq previous (nth (- size 1) tmp))))))\n    check))\n\n(defun word-count (lst)\n  (let ((tmp (sort lst 'string<))\n        (previous nil)\n        (check t))\n    (dolist (s tmp)\n      (if (null previous)\n          (setq previous s)\n          (if (string= previous s)\n              (setq check nil)\n              (setq previous s))))\n    check))\n\n(defun main ()\n  (let ((lst (list nil)))\n    (dotimes (x *n*)\n      (push (read-line) lst))\n    (setq lst (cdr (reverse lst)))\n    (if (null (check-first-and-last lst))\n        (format t \"No~%\")\n        (if (null (word-count lst))\n            (format t \"No~%\")\n            (format t \"Yes~%\")))))\n\n(main)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1133, "cpu_time_ms": 277, "memory_kb": 15712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s915634469", "group_id": "codeNet:p03261", "input_text": "(defvar *n* (read))\n\n(defun check-first-and-last (lst)\n  (let ((count 0)\n        (previous nil))\n    (dolist (s lst)\n      (if (= count 0)\n          (let* ((tmp (concatenate 'list s))\n                 (size (length tmp)))\n            (setq previous (nth (- size 1) tmp))\n            (incf count))\n          (let* ((tmp (concatenate 'list s))\n                 (size (length tmp)))\n            (if (eql previous (car tmp))\n                (return-from nil)\n                (setq previous (nth (- size 1) tmp)))))))\n  t)\n\n(defun word-count (lst)\n  (let ((tmp (sort lst 'string<))\n        (previous nil)\n        (check t))\n    (dolist (s tmp)\n      (if (null previous)\n          (setq previous s)\n          (if (string= previous s)\n              (setq check nil)\n              (setq previous s))))\n    check))\n\n(defun main ()\n  (let ((lst (list nil)))\n    (dotimes (x *n*)\n      (push (read-line) lst))\n    (setq lst (cdr (reverse lst)))\n    (if (null (check-first-and-last lst))\n        (format t \"No~%\")\n        (if (null (word-count lst))\n            (format t \"No~%\")\n            (format t \"Yes~%\")))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1536460383, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lisp/s915634469.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s915634469", "user_id": "u631655863"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(defvar *n* (read))\n\n(defun check-first-and-last (lst)\n  (let ((count 0)\n        (previous nil))\n    (dolist (s lst)\n      (if (= count 0)\n          (let* ((tmp (concatenate 'list s))\n                 (size (length tmp)))\n            (setq previous (nth (- size 1) tmp))\n            (incf count))\n          (let* ((tmp (concatenate 'list s))\n                 (size (length tmp)))\n            (if (eql previous (car tmp))\n                (return-from nil)\n                (setq previous (nth (- size 1) tmp)))))))\n  t)\n\n(defun word-count (lst)\n  (let ((tmp (sort lst 'string<))\n        (previous nil)\n        (check t))\n    (dolist (s tmp)\n      (if (null previous)\n          (setq previous s)\n          (if (string= previous s)\n              (setq check nil)\n              (setq previous s))))\n    check))\n\n(defun main ()\n  (let ((lst (list nil)))\n    (dotimes (x *n*)\n      (push (read-line) lst))\n    (setq lst (cdr (reverse lst)))\n    (if (null (check-first-and-last lst))\n        (format t \"No~%\")\n        (if (null (word-count lst))\n            (format t \"No~%\")\n            (format t \"Yes~%\")))))\n\n(main)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1110, "cpu_time_ms": 278, "memory_kb": 15588}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s192429227", "group_id": "codeNet:p03261", "input_text": "(let ((n (read))\n      (a (make-array 0 :element-type 'string\n                       :fill-pointer 0\n                       :adjustable t))\n      temp\n      lst\n      (flg t))\n  (setf temp (read-line))\n  (loop repeat (1- n) do\n        (vector-push-extend temp a)\n        (setf lst (char temp (1- (length temp))))\n        (setf temp (read-line))\n        (if (not (equal lst (char temp 0))) (setf flg nil))\n        (loop for i across a do\n              (if (equal i temp) (setf flg nil))))\n  (princ (if flg \"Yes\" \"No\")))\n", "language": "Lisp", "metadata": {"date": 1536460327, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lisp/s192429227.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s192429227", "user_id": "u994767958"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(let ((n (read))\n      (a (make-array 0 :element-type 'string\n                       :fill-pointer 0\n                       :adjustable t))\n      temp\n      lst\n      (flg t))\n  (setf temp (read-line))\n  (loop repeat (1- n) do\n        (vector-push-extend temp a)\n        (setf lst (char temp (1- (length temp))))\n        (setf temp (read-line))\n        (if (not (equal lst (char temp 0))) (setf flg nil))\n        (loop for i across a do\n              (if (equal i temp) (setf flg nil))))\n  (princ (if flg \"Yes\" \"No\")))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 519, "cpu_time_ms": 152, "memory_kb": 16484}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s733346264", "group_id": "codeNet:p03261", "input_text": "(defun main ()\n  (defparameter s_list (loop :for a :from 1 :upto (read) collect(read-line)))\n  (if (equal s_list (remove-duplicates s_list :test #'equal))\n      (if (loop :for k :from 1 :upto (1- (length s_list)) always(equal (car (last (concatenate 'list (nth (1- k) s_list)))) (char (nth k s_list) 0)))\n          \"Yes\"\n          \"No\")\n      \"No\")\n  )\n(format t \"~A\" (main))", "language": "Lisp", "metadata": {"date": 1536460036, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lisp/s733346264.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s733346264", "user_id": "u610490393"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(defun main ()\n  (defparameter s_list (loop :for a :from 1 :upto (read) collect(read-line)))\n  (if (equal s_list (remove-duplicates s_list :test #'equal))\n      (if (loop :for k :from 1 :upto (1- (length s_list)) always(equal (car (last (concatenate 'list (nth (1- k) s_list)))) (char (nth k s_list) 0)))\n          \"Yes\"\n          \"No\")\n      \"No\")\n  )\n(format t \"~A\" (main))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 375, "cpu_time_ms": 15, "memory_kb": 4072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s498080362", "group_id": "codeNet:p03261", "input_text": "(defun main ()\n  (defparameter s_list (loop :for a :from 1 :upto (read) collect(read-line)))\n  (if (equal s_list (remove-duplicates s_list))\n      (if (loop :for k :from 1 :upto (1- (length s_list)) always(equal (car (last (concatenate 'list (nth (1- k) s_list)))) (char (nth k s_list) 0)))\n          \"Yes\"\n          \"No\")\n      \"No\")\n  )\n(format t \"~A\" (main))\n", "language": "Lisp", "metadata": {"date": 1536456419, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Lisp/s498080362.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s498080362", "user_id": "u610490393"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "(defun main ()\n  (defparameter s_list (loop :for a :from 1 :upto (read) collect(read-line)))\n  (if (equal s_list (remove-duplicates s_list))\n      (if (loop :for k :from 1 :upto (1- (length s_list)) always(equal (car (last (concatenate 'list (nth (1- k) s_list)))) (char (nth k s_list) 0)))\n          \"Yes\"\n          \"No\")\n      \"No\")\n  )\n(format t \"~A\" (main))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 362, "cpu_time_ms": 249, "memory_kb": 13540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s274692603", "group_id": "codeNet:p03262", "input_text": "(defun abc109c ()\n  (let* ((n (read))\n\t (x (read))\n\t (xs (loop for i below n collect (read))))\n    (format t \"~a~%\"\n\t    (reduce #'gcd (mapcar (lambda (a) (abs (- a x))) xs)\n\t\t    :initial-value 0))))\n\n(abc109c)", "language": "Lisp", "metadata": {"date": 1586653685, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lisp/s274692603.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s274692603", "user_id": "u652695471"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun abc109c ()\n  (let* ((n (read))\n\t (x (read))\n\t (xs (loop for i below n collect (read))))\n    (format t \"~a~%\"\n\t    (reduce #'gcd (mapcar (lambda (a) (abs (- a x))) xs)\n\t\t    :initial-value 0))))\n\n(abc109c)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 290, "memory_kb": 59748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s525738177", "group_id": "codeNet:p03262", "input_text": "(let* ((n (read))\n       (m (read))\n       (lst (loop :repeat n :collect (read))))\n  (push m lst)\n  (setf lst (sort lst #'<))\n  (princ (apply #'gcd (mapcar #'- (cdr lst) lst))))", "language": "Lisp", "metadata": {"date": 1579336300, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lisp/s525738177.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s525738177", "user_id": "u610490393"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (lst (loop :repeat n :collect (read))))\n  (push m lst)\n  (setf lst (sort lst #'<))\n  (princ (apply #'gcd (mapcar #'- (cdr lst) lst))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 177, "cpu_time_ms": 312, "memory_kb": 59748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s371116573", "group_id": "codeNet:p03262", "input_text": "(princ(apply'gcd(loop repeat(read)with x =(read)collect(-(read)x))))", "language": "Lisp", "metadata": {"date": 1549575248, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lisp/s371116573.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s371116573", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(princ(apply'gcd(loop repeat(read)with x =(read)collect(-(read)x))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 68, "cpu_time_ms": 309, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s817853483", "group_id": "codeNet:p03262", "input_text": "(princ(reduce'gcd(loop repeat(read)with x =(read)collect(-(read)x))))", "language": "Lisp", "metadata": {"date": 1549575110, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lisp/s817853483.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s817853483", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(princ(reduce'gcd(loop repeat(read)with x =(read)collect(-(read)x))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 69, "cpu_time_ms": 299, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s146142837", "group_id": "codeNet:p03262", "input_text": "(princ(reduce'gcd(loop repeat(read)with x =(read)collect(abs(-(read)x)))))", "language": "Lisp", "metadata": {"date": 1549574774, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lisp/s146142837.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s146142837", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(princ(reduce'gcd(loop repeat(read)with x =(read)collect(abs(-(read)x)))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 74, "cpu_time_ms": 303, "memory_kb": 57700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s202872666", "group_id": "codeNet:p03262", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline split-ints-into-vector))\n(defun split-ints-into-vector (string dest-vector &key (offset 0) (key #'identity))\n  (declare (string string)\n           (function key)\n           ((array * (*)) dest-vector)\n           ((integer 0 #.most-positive-fixnum) offset))\n  (loop with position = 0\n        for idx from offset below (length dest-vector)\n        do (setf (values (aref dest-vector idx) position)\n                 (parse-integer string :start position :junk-allowed t))\n           (setf (aref dest-vector idx) (funcall key (aref dest-vector idx)))\n        finally (return dest-vector)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Hauptteil\n\n(defun main ()\n  (let* ((n (read))\n         (x (read))\n         (xs (make-array n :element-type 'uint32)))\n    (split-ints-into-vector (read-line) xs)\n    (dotimes (i n)\n      (setf (aref xs i) (abs (- (aref xs i) x))))\n    (println (reduce #'gcd xs))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1549572445, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lisp/s202872666.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s202872666", "user_id": "u352600849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (inline split-ints-into-vector))\n(defun split-ints-into-vector (string dest-vector &key (offset 0) (key #'identity))\n  (declare (string string)\n           (function key)\n           ((array * (*)) dest-vector)\n           ((integer 0 #.most-positive-fixnum) offset))\n  (loop with position = 0\n        for idx from offset below (length dest-vector)\n        do (setf (values (aref dest-vector idx) position)\n                 (parse-integer string :start position :junk-allowed t))\n           (setf (aref dest-vector idx) (funcall key (aref dest-vector idx)))\n        finally (return dest-vector)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(defmacro println (obj &optional (stream '*standard-output*))\n  `(let ((*read-default-float-format* 'double-float))\n     (prog1 (princ ,obj ,stream) (terpri ,stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Hauptteil\n\n(defun main ()\n  (let* ((n (read))\n         (x (read))\n         (xs (make-array n :element-type 'uint32)))\n    (split-ints-into-vector (read-line) xs)\n    (dotimes (i n)\n      (setf (aref xs i) (abs (- (aref xs i) x))))\n    (println (reduce #'gcd xs))))\n\n#-swank(main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1791, "cpu_time_ms": 209, "memory_kb": 21736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s151262579", "group_id": "codeNet:p03262", "input_text": "(let((s 0)(n(read))(a(read)))(princ(dotimes(i n s)(setq s(gcd(-(read)a)s)))))", "language": "Lisp", "metadata": {"date": 1536460663, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lisp/s151262579.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s151262579", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let((s 0)(n(read))(a(read)))(princ(dotimes(i n s)(setq s(gcd(-(read)a)s)))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 77, "cpu_time_ms": 299, "memory_kb": 57704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s348200275", "group_id": "codeNet:p03262", "input_text": "(let ((n (read))\n      (x (read))\n      (ans (read)))\n  (setf ans (abs (- ans x)))\n  (loop repeat (1- n) do\n        (setf ans (gcd ans (abs (- x (read))))))\n  (princ ans))\n", "language": "Lisp", "metadata": {"date": 1536460620, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Lisp/s348200275.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s348200275", "user_id": "u994767958"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let ((n (read))\n      (x (read))\n      (ans (read)))\n  (setf ans (abs (- ans x)))\n  (loop repeat (1- n) do\n        (setf ans (gcd ans (abs (- x (read))))))\n  (princ ans))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 172, "cpu_time_ms": 281, "memory_kb": 57700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s222160728", "group_id": "codeNet:p03324", "input_text": "(let ((d (read))\n      (n (read)))\n\n  (format t \"~A~%\"\n          (if (and (= n 100) (= d 2))\n            (* (expt 100 2) * 101)\n            (* (expt 100 d) n))))\n", "language": "Lisp", "metadata": {"date": 1599193403, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s222160728.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s222160728", "user_id": "u336541610"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let ((d (read))\n      (n (read)))\n\n  (format t \"~A~%\"\n          (if (and (= n 100) (= d 2))\n            (* (expt 100 2) * 101)\n            (* (expt 100 d) n))))\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 162, "cpu_time_ms": 39, "memory_kb": 26528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s409778798", "group_id": "codeNet:p03324", "input_text": "(let* ((d (read))\n       (n (read))\n       (l (loop for i from 1 to (+ n 2)\n                collect (* i (expt 100 d))))\n       (l2 (set-difference l (if (= n 2) '(10000 100000 1000000)))))\n\n  (format t \"~A~%\"\n          (nth (1- n) l2)))\n", "language": "Lisp", "metadata": {"date": 1599192494, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s409778798.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s409778798", "user_id": "u336541610"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let* ((d (read))\n       (n (read))\n       (l (loop for i from 1 to (+ n 2)\n                collect (* i (expt 100 d))))\n       (l2 (set-difference l (if (= n 2) '(10000 100000 1000000)))))\n\n  (format t \"~A~%\"\n          (nth (1- n) l2)))\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 238, "cpu_time_ms": 16, "memory_kb": 24316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s183588814", "group_id": "codeNet:p03324", "input_text": "(let ((d (read))\n      (n (read)))\n\n  (format t \"~A~%\"\n            (* n (expt 100 d))))\n", "language": "Lisp", "metadata": {"date": 1599032979, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s183588814.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s183588814", "user_id": "u336541610"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let ((d (read))\n      (n (read)))\n\n  (format t \"~A~%\"\n            (* n (expt 100 d))))\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 88, "cpu_time_ms": 15, "memory_kb": 24088}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s302765686", "group_id": "codeNet:p03324", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defmacro aif (expr then else)\n  `(let ((it ,expr))\n     (if it ,then ,else)))\n\n(defmacro awhen (expr &rest then)\n  `(aif ,expr (progn ,@then) nil))\n\n(defun comulative (function list &key base)\n  (if base\n      (comulative function (cons base list))\n      (do ((lst (cdr list) (cdr lst))\n           (acc (list (car list))))\n          ((null lst) (reverse acc))\n        (push (funcall function (car acc) (car lst)) acc))))\n\n(defun binary-search (function left right\n                      &optional\n                        (eps 1)\n                        (average-function (lambda (x y) (ash (+ x y) -1))))\n  (if (<= (abs (- left right)) eps)\n      right\n      (let ((mid (funcall average-function left right)))\n        (if (funcall function mid)\n            (binary-search function left mid eps average-function)\n            (binary-search function mid right eps average-function)))))\n\n(defun arithmetic-mean (&rest body)\n  (/ (apply #'+ body) (length body)))\n\n(defvar +MOD+ (+ (expt 10 9) 7))\n\n(defun mapa-b (fn a b &optional (step 1))\n  (do ((i a (+ i step))\n       (result nil))\n      ((> i b) (nreverse result))\n    (push (funcall fn i) result)))\n\n(defun map0-n (fn n)\n  (mapa-b fn 0 n))\n\n(defun map1-n (fn n)\n  (mapa-b fn 1 n))\n\n(defun read-string (&optional (stream *standard-input*))\n  (labels ((is-empty (x)\n             (or (char= x #\\space) (char= x #\\newline))))\n    (loop for char = (read-char stream)\n          with result\n          when (is-empty char)\n            do (return (concatenate 'string (nreverse result)))\n          do (push char result))))\n\n(defun main (d n)\n  (* (expt 100 d) n))\n\n(princ (main (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1589146170, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s302765686.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s302765686", "user_id": "u493610446"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defmacro aif (expr then else)\n  `(let ((it ,expr))\n     (if it ,then ,else)))\n\n(defmacro awhen (expr &rest then)\n  `(aif ,expr (progn ,@then) nil))\n\n(defun comulative (function list &key base)\n  (if base\n      (comulative function (cons base list))\n      (do ((lst (cdr list) (cdr lst))\n           (acc (list (car list))))\n          ((null lst) (reverse acc))\n        (push (funcall function (car acc) (car lst)) acc))))\n\n(defun binary-search (function left right\n                      &optional\n                        (eps 1)\n                        (average-function (lambda (x y) (ash (+ x y) -1))))\n  (if (<= (abs (- left right)) eps)\n      right\n      (let ((mid (funcall average-function left right)))\n        (if (funcall function mid)\n            (binary-search function left mid eps average-function)\n            (binary-search function mid right eps average-function)))))\n\n(defun arithmetic-mean (&rest body)\n  (/ (apply #'+ body) (length body)))\n\n(defvar +MOD+ (+ (expt 10 9) 7))\n\n(defun mapa-b (fn a b &optional (step 1))\n  (do ((i a (+ i step))\n       (result nil))\n      ((> i b) (nreverse result))\n    (push (funcall fn i) result)))\n\n(defun map0-n (fn n)\n  (mapa-b fn 0 n))\n\n(defun map1-n (fn n)\n  (mapa-b fn 1 n))\n\n(defun read-string (&optional (stream *standard-input*))\n  (labels ((is-empty (x)\n             (or (char= x #\\space) (char= x #\\newline))))\n    (loop for char = (read-char stream)\n          with result\n          when (is-empty char)\n            do (return (concatenate 'string (nreverse result)))\n          do (push char result))))\n\n(defun main (d n)\n  (* (expt 100 d) n))\n\n(princ (main (read) (read)))\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2676, "cpu_time_ms": 49, "memory_kb": 11576}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s189232334", "group_id": "codeNet:p03324", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun binary-search (l r f &aux (m (ash (+ l r) -1)))\n  \"f の結果がtになる最小の値を見つけます\"\n  (if (= l r)\n      l\n      (if (funcall f m)\n          (binary-search l m f)\n          (binary-search (1+ m) r f))))\n\n(defmacro aif (expr then else)\n    `(let ((it ,expr))\n       ,then\n       ,else))\n\n(defun main (a b)\n  (* b (expt 100 a)))\n\n#-swank\n(princ (main (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1587158007, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s189232334.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s189232334", "user_id": "u493610446"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n        (cons (subseq str 0 pos)\n              (split x (subseq str (+ pos size))))\n        (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun binary-search (l r f &aux (m (ash (+ l r) -1)))\n  \"f の結果がtになる最小の値を見つけます\"\n  (if (= l r)\n      l\n      (if (funcall f m)\n          (binary-search l m f)\n          (binary-search (1+ m) r f))))\n\n(defmacro aif (expr then else)\n    `(let ((it ,expr))\n       ,then\n       ,else))\n\n(defun main (a b)\n  (* b (expt 100 a)))\n\n#-swank\n(princ (main (read) (read)))\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1434, "cpu_time_ms": 157, "memory_kb": 19000}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s710025870", "group_id": "codeNet:p03324", "input_text": "(setq d (read) n (read))\n\n(if (= n 100) (princ (* (expt 100 d) (+ n 1))) (princ (* (expt 100 d) n)))\n", "language": "Lisp", "metadata": {"date": 1563310521, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s710025870.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s710025870", "user_id": "u480300350"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(setq d (read) n (read))\n\n(if (= n 100) (princ (* (expt 100 d) (+ n 1))) (princ (* (expt 100 d) n)))\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 101, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s153902046", "group_id": "codeNet:p03324", "input_text": "(let* ((a (read))\n       (b (read)))\n  (if (= b 100) (setf b 101))\n  (princ (* b (expt 100 a))))", "language": "Lisp", "metadata": {"date": 1560454541, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s153902046.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s153902046", "user_id": "u610490393"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let* ((a (read))\n       (b (read)))\n  (if (= b 100) (setf b 101))\n  (princ (* b (expt 100 a))))", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 120, "memory_kb": 10852}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s048728816", "group_id": "codeNet:p03324", "input_text": "(defun abc100b ()\n  (let* ((d (read))\n\t (n (read))\n\t (x (expt 100 d)))\n    (if (= n 100)\n\t(print (+ (* x n) x))\n\t(print (* x n)))))\n(abc100b)", "language": "Lisp", "metadata": {"date": 1559351679, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s048728816.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s048728816", "user_id": "u777551961"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(defun abc100b ()\n  (let* ((d (read))\n\t (n (read))\n\t (x (expt 100 d)))\n    (if (= n 100)\n\t(print (+ (* x n) x))\n\t(print (* x n)))))\n(abc100b)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 141, "cpu_time_ms": 115, "memory_kb": 11108}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s332858373", "group_id": "codeNet:p03324", "input_text": "(defun abc100b ()\n  (let* ((d (read))\n\t (n (read))\n\t (x (expt 100 d)))\n    (if (and (= d 0) (= n 100))\n\t(print (+ (* x n) 1))\n\t(print (* x n)))))\n\n(abc100b)", "language": "Lisp", "metadata": {"date": 1559351522, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s332858373.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s332858373", "user_id": "u777551961"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(defun abc100b ()\n  (let* ((d (read))\n\t (n (read))\n\t (x (expt 100 d)))\n    (if (and (= d 0) (= n 100))\n\t(print (+ (* x n) 1))\n\t(print (* x n)))))\n\n(abc100b)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 156, "cpu_time_ms": 124, "memory_kb": 11360}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s920602696", "group_id": "codeNet:p03324", "input_text": "(format t \"~A\" (* (expt 100 (read)) (read)))", "language": "Lisp", "metadata": {"date": 1539365543, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s920602696.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s920602696", "user_id": "u610490393"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(format t \"~A\" (* (expt 100 (read)) (read)))", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 44, "cpu_time_ms": 5, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s463401650", "group_id": "codeNet:p03324", "input_text": "(let ((d (read))\n      (n (read)))\n  (princ (* (+ n (floor (1- n) 99)) (expt 100 d))))", "language": "Lisp", "metadata": {"date": 1533764642, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s463401650.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s463401650", "user_id": "u913204306"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let ((d (read))\n      (n (read)))\n  (princ (* (+ n (floor (1- n) 99)) (expt 100 d))))", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 12, "memory_kb": 3688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s453104602", "group_id": "codeNet:p03324", "input_text": "(let ((d (read))\n      (n (read)))\n  (princ (* (if (< n 100) n 101) (expt 100 d))))", "language": "Lisp", "metadata": {"date": 1533764349, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s453104602.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s453104602", "user_id": "u913204306"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let ((d (read))\n      (n (read)))\n  (princ (* (if (< n 100) n 101) (expt 100 d))))", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 109, "memory_kb": 11108}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s272390715", "group_id": "codeNet:p03324", "input_text": "(declaim (ftype (function (string &optional character) (values (vector string *) &optional)) split))\n(defun split (text &optional (delim #\\Space))\n    (let* ((result (make-array 0\n                               :element-type 'string\n                               :adjustable t\n                               :fill-pointer 0)))\n          (loop :for c character :across text\n                :with temp = \"\"\n                :do\n                (cond ((char= c delim)\n                       (vector-push-extend temp result)\n                       (setf temp \"\"))\n                    (t\n                     (setf temp (concatenate 'string temp (string c)))))\n                :finally\n                (vector-push-extend temp result))\n          result))\n\n(declaim (ftype (function (integer integer) (values integer &optional)) solve))\n(defun solve (d n)\n    (cond ((not (= n 100))\n           (* (expt 100 d) n))\n        (t (+ (expt 100 (+ d 1)) (expt 100 d)))))\n\n(defun main ()\n    (let* ((input (map 'vector #'parse-integer (split (read-line))))\n           (d (aref input 0))\n           (n (aref input 1)))\n          (format t \"~A~%\" (solve d n))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1529604599, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s272390715.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s272390715", "user_id": "u080486097"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(declaim (ftype (function (string &optional character) (values (vector string *) &optional)) split))\n(defun split (text &optional (delim #\\Space))\n    (let* ((result (make-array 0\n                               :element-type 'string\n                               :adjustable t\n                               :fill-pointer 0)))\n          (loop :for c character :across text\n                :with temp = \"\"\n                :do\n                (cond ((char= c delim)\n                       (vector-push-extend temp result)\n                       (setf temp \"\"))\n                    (t\n                     (setf temp (concatenate 'string temp (string c)))))\n                :finally\n                (vector-push-extend temp result))\n          result))\n\n(declaim (ftype (function (integer integer) (values integer &optional)) solve))\n(defun solve (d n)\n    (cond ((not (= n 100))\n           (* (expt 100 d) n))\n        (t (+ (expt 100 (+ d 1)) (expt 100 d)))))\n\n(defun main ()\n    (let* ((input (map 'vector #'parse-integer (split (read-line))))\n           (d (aref input 0))\n           (n (aref input 1)))\n          (format t \"~A~%\" (solve d n))))\n\n(main)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1153, "cpu_time_ms": 170, "memory_kb": 17376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s975133605", "group_id": "codeNet:p03324", "input_text": "\n(defun answer (d n)\n  (labels ((inner (k rv)\n             (cond\n               ((zerop (mod rv 100))\n                (inner k (1+ rv)))\n               ((= k n)\n                rv)\n               (t\n                (inner (1+ k) (1+ rv))))))\n    (* (inner 1 1) (expt 100 d))))\n\n\n(princ (answer (read) (read)))", "language": "Lisp", "metadata": {"date": 1529268098, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s975133605.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s975133605", "user_id": "u396817842"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "\n(defun answer (d n)\n  (labels ((inner (k rv)\n             (cond\n               ((zerop (mod rv 100))\n                (inner k (1+ rv)))\n               ((= k n)\n                rv)\n               (t\n                (inner (1+ k) (1+ rv))))))\n    (* (inner 1 1) (expt 100 d))))\n\n\n(princ (answer (read) (read)))", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 309, "cpu_time_ms": 45, "memory_kb": 5728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s860820685", "group_id": "codeNet:p03324", "input_text": "(let ((d (read)) (n (read))) (format t \"~a~%\" (* (expt 100 d) (if (= n 100) (1+ n) n))))\n", "language": "Lisp", "metadata": {"date": 1529229400, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s860820685.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s860820685", "user_id": "u994767958"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let ((d (read)) (n (read))) (format t \"~a~%\" (* (expt 100 d) (if (= n 100) (1+ n) n))))\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 89, "cpu_time_ms": 104, "memory_kb": 11748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s322544513", "group_id": "codeNet:p03324", "input_text": "(let ((d (read))\n      (n (read)))\n  (princ (* n (expt 100 d))))", "language": "Lisp", "metadata": {"date": 1529198170, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Lisp/s322544513.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s322544513", "user_id": "u956039157"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let ((d (read))\n      (n (read)))\n  (princ (* n (expt 100 d))))", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 64, "cpu_time_ms": 102, "memory_kb": 10216}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s824023307", "group_id": "codeNet:p03448", "input_text": "(defun main ()\n    (let* ((a (read)) (b (read)) (c (read)) (x (read)))\n        (format t \"~A~%\"\n            (loop for i from 0 to a sum\n                (loop for j from 0 to b sum\n                    (loop for k from 0 to c \n                        when (= (+ (* i 500)\n                                   (* j 100)\n                                   (* k  50)) x)\n                        count k))))))\n(main)", "language": "Lisp", "metadata": {"date": 1590245468, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s824023307.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s824023307", "user_id": "u652695471"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun main ()\n    (let* ((a (read)) (b (read)) (c (read)) (x (read)))\n        (format t \"~A~%\"\n            (loop for i from 0 to a sum\n                (loop for j from 0 to b sum\n                    (loop for k from 0 to c \n                        when (= (+ (* i 500)\n                                   (* j 100)\n                                   (* k  50)) x)\n                        count k))))))\n(main)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 408, "cpu_time_ms": 134, "memory_kb": 13408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s934759874", "group_id": "codeNet:p03448", "input_text": "(defun main ()\n    (let* ((a (read)) (b (read)) (c (read)) (x (read)))\n        (loop for i from 0 to a sum\n            (loop for j from 0 to b sum\n                (loop for k from 0 to c \n                    when (= (+ (* i 500)\n                               (* j 100)\n                               (* k  50)) x)\n                    count k)))))\n(main)", "language": "Lisp", "metadata": {"date": 1590245403, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s934759874.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s934759874", "user_id": "u652695471"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun main ()\n    (let* ((a (read)) (b (read)) (c (read)) (x (read)))\n        (loop for i from 0 to a sum\n            (loop for j from 0 to b sum\n                (loop for k from 0 to c \n                    when (= (+ (* i 500)\n                               (* j 100)\n                               (* k  50)) x)\n                    count k)))))\n(main)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 354, "cpu_time_ms": 134, "memory_kb": 12512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s700095794", "group_id": "codeNet:p03448", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (str)\n  (count #\\1 str))\n\n(defun main (a b c x)\n  (loop for i from 0 to a\n        sum\n        (loop for j from 0 to b\n              sum\n              (let ((rem (- x (* i 500) (* j 100))))\n                (if (zerop (mod rem 50))\n                    (if (>= c (/ rem 50) 0) 1 0)\n                    0)))))\n\n(princ (main (read) (read) (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1586232066, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s700095794.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s700095794", "user_id": "u493610446"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (str)\n  (count #\\1 str))\n\n(defun main (a b c x)\n  (loop for i from 0 to a\n        sum\n        (loop for j from 0 to b\n              sum\n              (let ((rem (- x (* i 500) (* j 100))))\n                (if (zerop (mod rem 50))\n                    (if (>= c (/ rem 50) 0) 1 0)\n                    0)))))\n\n(princ (main (read) (read) (read) (read)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1396, "cpu_time_ms": 181, "memory_kb": 19640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s165007204", "group_id": "codeNet:p03448", "input_text": "(defun coins ()\n  (let ((a (read))\n        (b (read))\n        (c (read))\n        (x (read))\n        (ans 0))\n    (dotimes (i (1+ a))\n      (dotimes (j (1+ b))\n        (dotimes (k (1+ c))\n          (if (= x (+ (* 500 i) (* 100 j) (* 50 k)))\n              (incf ans)))))\n    ans))\n\n\n(format t \"~D~%\" (coins))", "language": "Lisp", "metadata": {"date": 1583846473, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s165007204.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s165007204", "user_id": "u091381267"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun coins ()\n  (let ((a (read))\n        (b (read))\n        (c (read))\n        (x (read))\n        (ans 0))\n    (dotimes (i (1+ a))\n      (dotimes (j (1+ b))\n        (dotimes (k (1+ c))\n          (if (= x (+ (* 500 i) (* 100 j) (* 50 k)))\n              (incf ans)))))\n    ans))\n\n\n(format t \"~D~%\" (coins))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 306, "cpu_time_ms": 402, "memory_kb": 27108}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s850223505", "group_id": "codeNet:p03448", "input_text": "(defun main ()\n  (let ((a (read))\n\t(b (read))\n\t(c (read))\n\t(s (read)))\n    (format t \"~&~D ~S~%\" (+ a b c) s)))\n\n(main)", "language": "Lisp", "metadata": {"date": 1579735125, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s850223505.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s850223505", "user_id": "u091381267"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun main ()\n  (let ((a (read))\n\t(b (read))\n\t(c (read))\n\t(s (read)))\n    (format t \"~&~D ~S~%\" (+ a b c) s)))\n\n(main)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 119, "cpu_time_ms": 11, "memory_kb": 3560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s532439071", "group_id": "codeNet:p03448", "input_text": "(princ (loop :for x :from 0 :upto (read) :with b := (read) :with c := (read)\n             :with k := (read)\n             :sum(loop :for y :from 0 :upto b\n                       :sum(loop :for z :from 0 :upto c\n                                 :count(= k (+ (* x 500) (* y 100) (* z 50)))))))", "language": "Lisp", "metadata": {"date": 1579655607, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s532439071.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s532439071", "user_id": "u610490393"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(princ (loop :for x :from 0 :upto (read) :with b := (read) :with c := (read)\n             :with k := (read)\n             :sum(loop :for y :from 0 :upto b\n                       :sum(loop :for z :from 0 :upto c\n                                 :count(= k (+ (* x 500) (* y 100) (* z 50)))))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 291, "cpu_time_ms": 114, "memory_kb": 12516}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s180361414", "group_id": "codeNet:p03448", "input_text": "(defun coins (a b c x)\n  (let ((res 0)\n        (total 0))\n    (dotimes (i (+ a 1))\n      (dotimes (j (+ b 1))\n        (dotimes (k (+ c 1))\n          (setf total (+ (* 500 i) (* 100 j) (* 50 k)))\n          (if (= total x) (incf res)))))\n    res))\n\n(format t \"~A~%\" (coins (read) (read) (read) (read)))", "language": "Lisp", "metadata": {"date": 1555088256, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s180361414.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s180361414", "user_id": "u418126641"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun coins (a b c x)\n  (let ((res 0)\n        (total 0))\n    (dotimes (i (+ a 1))\n      (dotimes (j (+ b 1))\n        (dotimes (k (+ c 1))\n          (setf total (+ (* 500 i) (* 100 j) (* 50 k)))\n          (if (= total x) (incf res)))))\n    res))\n\n(format t \"~A~%\" (coins (read) (read) (read) (read)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 300, "cpu_time_ms": 29, "memory_kb": 4964}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s168644852", "group_id": "codeNet:p03448", "input_text": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (k (read))\n      (ans 0))\n  (loop :for x :from 0 :upto a :do\n    (loop :for y :from 0 :upto b :do\n      (loop :for z :from 0 :upto c :do(if (= k (+ (* x 500) (* y 100) (* z 50)))\n                                          (incf ans)))))\n  (princ ans))", "language": "Lisp", "metadata": {"date": 1553758705, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s168644852.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s168644852", "user_id": "u610490393"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (k (read))\n      (ans 0))\n  (loop :for x :from 0 :upto a :do\n    (loop :for y :from 0 :upto b :do\n      (loop :for z :from 0 :upto c :do(if (= k (+ (* x 500) (* y 100) (* z 50)))\n                                          (incf ans)))))\n  (princ ans))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 307, "cpu_time_ms": 114, "memory_kb": 12260}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s327867097", "group_id": "codeNet:p03448", "input_text": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (k (read))\n      (ans 0))\n  (loop :for x :from 0 :upto a :do\n    (loop :for y :from 0 :upto b :do\n      (loop :for z :from 0 :upto c :do(if (+ (* x 500) (* y 100) (* c 50)) (incf\n                                                                            ans)))))\n  (princ ans))", "language": "Lisp", "metadata": {"date": 1553758504, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s327867097.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s327867097", "user_id": "u610490393"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (k (read))\n      (ans 0))\n  (loop :for x :from 0 :upto a :do\n    (loop :for y :from 0 :upto b :do\n      (loop :for z :from 0 :upto c :do(if (+ (* x 500) (* y 100) (* c 50)) (incf\n                                                                            ans)))))\n  (princ ans))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 335, "cpu_time_ms": 124, "memory_kb": 12132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s622715462", "group_id": "codeNet:p03448", "input_text": "(defun coins (a b c x)\n  (let ((res 0)\n\t(total 0))\n    (dotimes (i (+ a 1))\n      (dotimes (j (+ b 1))\n\t(dotimes (k (+ c 1))\n\t  (setf total (+ (* 500 i) (* 100 j) (* 50 k)))\n\t  (if (= total x)\n\t      (incf res)))))))\n\n(format t \"~A~%\" (coins (read) (read) (read) (read))))\n", "language": "Lisp", "metadata": {"date": 1542771098, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s622715462.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s622715462", "user_id": "u761519515"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun coins (a b c x)\n  (let ((res 0)\n\t(total 0))\n    (dotimes (i (+ a 1))\n      (dotimes (j (+ b 1))\n\t(dotimes (k (+ c 1))\n\t  (setf total (+ (* 500 i) (* 100 j) (* 50 k)))\n\t  (if (= total x)\n\t      (incf res)))))))\n\n(format t \"~A~%\" (coins (read) (read) (read) (read))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 273, "cpu_time_ms": 169, "memory_kb": 15464}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s747825714", "group_id": "codeNet:p03448", "input_text": "(defun solver ()\n  (let ((a (read)) (b (read)) (c (read))\n        (x (read))\n        (count 0))\n    (loop for i from 0 to a do\n          (loop for j from 0 to b do\n                (loop for k from 0 to c do\n                      (when (= (+ (* 500 i) (* 100 j) (* 50 k)) x)\n                        (incf count)))))\n    count))\n\n(solver)", "language": "Lisp", "metadata": {"date": 1519995136, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s747825714.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s747825714", "user_id": "u183015556"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun solver ()\n  (let ((a (read)) (b (read)) (c (read))\n        (x (read))\n        (count 0))\n    (loop for i from 0 to a do\n          (loop for j from 0 to b do\n                (loop for k from 0 to c do\n                      (when (= (+ (* 500 i) (* 100 j) (* 50 k)) x)\n                        (incf count)))))\n    count))\n\n(solver)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 336, "cpu_time_ms": 16, "memory_kb": 4068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s266333404", "group_id": "codeNet:p03448", "input_text": "(let ((A (read))\n      (B (read))\n      (C (read))\n      (X (read)))\n  (format t \"~A~%\"\n          (loop for k upto A with totalA\n             do\n               (setf totalA (* k 500))\n             sum (loop for m upto B with totalB\n                    do\n                      (setf totalB (+ totalA (* 100 m)))\n                    sum (loop for n upto C\n                           count (= (+ totalB (* 50 n))\n                                    X))))))\n", "language": "Lisp", "metadata": {"date": 1518663526, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s266333404.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s266333404", "user_id": "u845061132"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let ((A (read))\n      (B (read))\n      (C (read))\n      (X (read)))\n  (format t \"~A~%\"\n          (loop for k upto A with totalA\n             do\n               (setf totalA (* k 500))\n             sum (loop for m upto B with totalB\n                    do\n                      (setf totalB (+ totalA (* 100 m)))\n                    sum (loop for n upto C\n                           count (= (+ totalB (* 50 n))\n                                    X))))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 455, "cpu_time_ms": 169, "memory_kb": 14692}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s996408857", "group_id": "codeNet:p03448", "input_text": "(let ((A (read))\n      (B (read))\n      (C (read))\n      (X (read)))\n  (format t \"~A~%\"\n          (loop for k upto A with totalA = 0\n             do\n               (setf totalA (* k 500))\n             when (> totalA X) return ans1\n             sum (loop for m upto B with totalB\n                    do\n                      (setf totalB (+ totalA (* 100 m)))\n                    when (> totalB X) return ans2\n                    sum (loop for n upto C with totalC\n                           do\n                             (setf totalC (+ totalB (* 50 n)))\n                           when (> totalC X) return ans3\n                           count (= totalC X) into ans3\n                           finally (return ans3))\n                    into ans2\n                    finally (return ans2))\n             into ans1\n             finally (return ans1))))\n", "language": "Lisp", "metadata": {"date": 1518663306, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s996408857.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s996408857", "user_id": "u845061132"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let ((A (read))\n      (B (read))\n      (C (read))\n      (X (read)))\n  (format t \"~A~%\"\n          (loop for k upto A with totalA = 0\n             do\n               (setf totalA (* k 500))\n             when (> totalA X) return ans1\n             sum (loop for m upto B with totalB\n                    do\n                      (setf totalB (+ totalA (* 100 m)))\n                    when (> totalB X) return ans2\n                    sum (loop for n upto C with totalC\n                           do\n                             (setf totalC (+ totalB (* 50 n)))\n                           when (> totalC X) return ans3\n                           count (= totalC X) into ans3\n                           finally (return ans3))\n                    into ans2\n                    finally (return ans2))\n             into ans1\n             finally (return ans1))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 854, "cpu_time_ms": 144, "memory_kb": 15460}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s379979476", "group_id": "codeNet:p03448", "input_text": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (x (read))\n      (sum 0))\n  (loop for i below (+ a 1)\n        do (loop for j below (+ b 1)\n                 do (loop for k below (+ c 1)\n                          if (equal (+ (* i 500) (* j 100) (* k 50)) x) do (setf sum (+ sum 1)))))\n  (format t \"~A~%\" sum))\n", "language": "Lisp", "metadata": {"date": 1517716358, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Lisp/s379979476.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s379979476", "user_id": "u994767958"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let ((a (read))\n      (b (read))\n      (c (read))\n      (x (read))\n      (sum 0))\n  (loop for i below (+ a 1)\n        do (loop for j below (+ b 1)\n                 do (loop for k below (+ c 1)\n                          if (equal (+ (* i 500) (* j 100) (* k 50)) x) do (setf sum (+ sum 1)))))\n  (format t \"~A~%\" sum))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 318, "cpu_time_ms": 133, "memory_kb": 13412}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s339928784", "group_id": "codeNet:p03455", "input_text": "(let ((x (* (read) (read))))\n  (format t \"~A~%\"\n          (if (oddp x)\n            \"Odd\"\n            \"Even\")))\n\n", "language": "Lisp", "metadata": {"date": 1597963382, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s339928784.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s339928784", "user_id": "u336541610"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(let ((x (* (read) (read))))\n  (format t \"~A~%\"\n          (if (oddp x)\n            \"Odd\"\n            \"Even\")))\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 112, "cpu_time_ms": 16, "memory_kb": 24124}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s954173006", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n    \"Even\"\n    \"Odd\"\n    ))\n\n(format t \"~A~%\" (product (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1595379616, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s954173006.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s954173006", "user_id": "u860463295"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n    \"Even\"\n    \"Odd\"\n    ))\n\n(format t \"~A~%\" (product (read) (read)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 122, "cpu_time_ms": 18, "memory_kb": 24216}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s012063368", "group_id": "codeNet:p03455", "input_text": "(princ (if (oddp (* (read) (read)))\n           \"Odd\"\n           \"Even\"))", "language": "Lisp", "metadata": {"date": 1590887618, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s012063368.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s012063368", "user_id": "u448702251"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(princ (if (oddp (* (read) (read)))\n           \"Odd\"\n           \"Even\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 72, "cpu_time_ms": 20, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s335858206", "group_id": "codeNet:p03455", "input_text": "(defun main()\n    (let* ((a (read))\n           (b (read)))\n        (format t \"~A~%\" \n            (if (zerop (rem (* a b) 2)) \"Even\" \"Odd\"))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1590241318, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s335858206.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s335858206", "user_id": "u652695471"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun main()\n    (let* ((a (read))\n           (b (read)))\n        (format t \"~A~%\" \n            (if (zerop (rem (* a b) 2)) \"Even\" \"Odd\"))))\n\n(main)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 149, "cpu_time_ms": 120, "memory_kb": 12644}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s695775820", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1589125612, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s695775820.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s695775820", "user_id": "u975073965"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 23, "memory_kb": 4584}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s036668617", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1589125501, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s036668617.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s036668617", "user_id": "u975073965"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 23, "memory_kb": 4452}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s550347013", "group_id": "codeNet:p03455", "input_text": "(defun fun (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (fun (read) (read)))", "language": "Lisp", "metadata": {"date": 1587929994, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s550347013.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s550347013", "user_id": "u136500538"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun fun (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (fun (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 112, "cpu_time_ms": 364, "memory_kb": 25060}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s516178518", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"\n))\n\n(format t \"~A~%\" (product (read) (read)))", "language": "Lisp", "metadata": {"date": 1587755150, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s516178518.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s516178518", "user_id": "u425762225"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"\n))\n\n(format t \"~A~%\" (product (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 34, "memory_kb": 5224}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s886703397", "group_id": "codeNet:p03455", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(princ (if (oddp (* (read) (read))) \"Odd\" \"Even\"))\n", "language": "Lisp", "metadata": {"date": 1586231379, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s886703397.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s886703397", "user_id": "u493610446"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(princ (if (oddp (* (read) (read))) \"Odd\" \"Even\"))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1085, "cpu_time_ms": 155, "memory_kb": 18488}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s983525257", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "language": "Lisp", "metadata": {"date": 1585853267, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s983525257.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s983525257", "user_id": "u123011403"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 116, "memory_kb": 11880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s395262309", "group_id": "codeNet:p03455", "input_text": "(format t \"~A ~A\" (+ (read) (read) (read)) (read))", "language": "Lisp", "metadata": {"date": 1584192172, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s395262309.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s395262309", "user_id": "u334552723"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(format t \"~A ~A\" (+ (read) (read) (read)) (read))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 50, "cpu_time_ms": 26, "memory_kb": 4196}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s787270308", "group_id": "codeNet:p03455", "input_text": "(defun product ()\n  (let ((a (read))\n        (b (read))\n        (ans \"Odd\"))\n    (if (zerop (rem (* a b) 2))\n        (setf ans \"Even\"))\n    ans))\n\n\n(format t \"~A~%\" (product))", "language": "Lisp", "metadata": {"date": 1583756592, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s787270308.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s787270308", "user_id": "u091381267"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product ()\n  (let ((a (read))\n        (b (read))\n        (ans \"Odd\"))\n    (if (zerop (rem (* a b) 2))\n        (setf ans \"Even\"))\n    ans))\n\n\n(format t \"~A~%\" (product))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 175, "cpu_time_ms": 114, "memory_kb": 11748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s230061968", "group_id": "codeNet:p03455", "input_text": "(princ (if (oddp (* (read) (read)))\n           \"Odd\"\n           \"Even\"))", "language": "Lisp", "metadata": {"date": 1580833208, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s230061968.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s230061968", "user_id": "u848054939"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(princ (if (oddp (* (read) (read)))\n           \"Odd\"\n           \"Even\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 72, "cpu_time_ms": 33, "memory_kb": 3688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s759471672", "group_id": "codeNet:p03455", "input_text": "(format t \"~[Even~;Odd~;~]\" (mod (* (read) (read)) 2))", "language": "Lisp", "metadata": {"date": 1580248867, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s759471672.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s759471672", "user_id": "u610490393"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(format t \"~[Even~;Odd~;~]\" (mod (* (read) (read)) 2))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 54, "cpu_time_ms": 28, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s216443224", "group_id": "codeNet:p03455", "input_text": "(format t \"~[Even~;Odd~;~]\" (mod (read) 2))", "language": "Lisp", "metadata": {"date": 1580248809, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s216443224.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s216443224", "user_id": "u610490393"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(format t \"~[Even~;Odd~;~]\" (mod (read) 2))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 43, "cpu_time_ms": 23, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s081141820", "group_id": "codeNet:p03455", "input_text": "(loop :for k :from 1 :upto 1 :if (evenp (* (read) (read))) :do(princ \"Even\") :else :do(princ \"Odd\"))", "language": "Lisp", "metadata": {"date": 1579652787, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s081141820.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s081141820", "user_id": "u610490393"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(loop :for k :from 1 :upto 1 :if (evenp (* (read) (read))) :do(princ \"Even\") :else :do(princ \"Odd\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 100, "cpu_time_ms": 121, "memory_kb": 12900}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s003604010", "group_id": "codeNet:p03455", "input_text": "(let ((a (parse-integer (remove #\\space (read-line)))))\n  (if (= a (expt (floor (sqrt a)) 2))\n      (princ \"Yes\")\n      (princ \"No\")))\n", "language": "Lisp", "metadata": {"date": 1578290152, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s003604010.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s003604010", "user_id": "u245103825"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(let ((a (parse-integer (remove #\\space (read-line)))))\n  (if (= a (expt (floor (sqrt a)) 2))\n      (princ \"Yes\")\n      (princ \"No\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 135, "cpu_time_ms": 145, "memory_kb": 13800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s127297474", "group_id": "codeNet:p03455", "input_text": "(let ((a (read-from-string (concatenate 'string \"(\" (read-line) \")\"))))\n  (if (evenp (apply #'* a))\n      (princ \"Even\")\n      (princ \"Odd\")))\n", "language": "Lisp", "metadata": {"date": 1578288133, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s127297474.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s127297474", "user_id": "u245103825"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(let ((a (read-from-string (concatenate 'string \"(\" (read-line) \")\"))))\n  (if (evenp (apply #'* a))\n      (princ \"Even\")\n      (princ \"Odd\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 143, "cpu_time_ms": 128, "memory_kb": 11616}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s462669967", "group_id": "codeNet:p03455", "input_text": "(let ((a (read-from-string (concatenate 'string \"(\" (read-line) \")\"))))\n  (if (evenp (apply #'+ a))\n      (princ \"Even\")\n      (princ \"Odd\")))\n", "language": "Lisp", "metadata": {"date": 1578288090, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s462669967.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s462669967", "user_id": "u245103825"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(let ((a (read-from-string (concatenate 'string \"(\" (read-line) \")\"))))\n  (if (evenp (apply #'+ a))\n      (princ \"Even\")\n      (princ \"Odd\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 143, "cpu_time_ms": 11, "memory_kb": 3560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s422579460", "group_id": "codeNet:p03455", "input_text": "(defun func (a)\n  (if (oddp a)\n\t\"Odd\"\n\t\"Even\"))\n\n(princ (func (* (read) (read))))\n", "language": "Lisp", "metadata": {"date": 1576894034, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s422579460.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s422579460", "user_id": "u493610446"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun func (a)\n  (if (oddp a)\n\t\"Odd\"\n\t\"Even\"))\n\n(princ (func (* (read) (read))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 82, "cpu_time_ms": 21, "memory_kb": 4068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s166620017", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "language": "Lisp", "metadata": {"date": 1571264823, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s166620017.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s166620017", "user_id": "u775418159"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 15, "memory_kb": 3684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s630020573", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (= 0 (mod (* a b) 2))\n    \"EVEN\"\n    \"ODD\"))\n\n(format t \"~A\" (product (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1571264674, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s630020573.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s630020573", "user_id": "u775418159"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (= 0 (mod (* a b) 2))\n    \"EVEN\"\n    \"ODD\"))\n\n(format t \"~A\" (product (read) (read)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 113, "cpu_time_ms": 128, "memory_kb": 12388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s519675456", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (= 0 (mod (* a b) 2))\n\t\"EVEN\"\n\t\"ODD\"))\n\n(format t \"~A~%\" (product (read) (read)))", "language": "Lisp", "metadata": {"date": 1571264349, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s519675456.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s519675456", "user_id": "u775418159"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (= 0 (mod (* a b) 2))\n\t\"EVEN\"\n\t\"ODD\"))\n\n(format t \"~A~%\" (product (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 108, "cpu_time_ms": 16, "memory_kb": 3936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s436931377", "group_id": "codeNet:p03455", "input_text": "(format \n t\n \"~A~%\"\n (let ((a (read))\n       (b (read)))\n   (if (eq 0 (mod (* a b) 2))\n       \"Even\"\n     \"Odd\")))", "language": "Lisp", "metadata": {"date": 1565324549, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s436931377.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s436931377", "user_id": "u643747754"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(format \n t\n \"~A~%\"\n (let ((a (read))\n       (b (read)))\n   (if (eq 0 (mod (* a b) 2))\n       \"Even\"\n     \"Odd\")))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 114, "cpu_time_ms": 138, "memory_kb": 12132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s436939191", "group_id": "codeNet:p03455", "input_text": "(format \n t\n \"~A~%\"\n (let ((a (read))\n      (b (read)))\n \t    (if (eq 0 (mod (* a b) 2))\n         \"Even\"\n         \"Odd\"))))", "language": "Lisp", "metadata": {"date": 1565324465, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s436939191.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s436939191", "user_id": "u643747754"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(format \n t\n \"~A~%\"\n (let ((a (read))\n      (b (read)))\n \t    (if (eq 0 (mod (* a b) 2))\n         \"Even\"\n         \"Odd\"))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 123, "cpu_time_ms": 172, "memory_kb": 14820}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s693479008", "group_id": "codeNet:p03455", "input_text": "(defparameter a (read))\n(defparameter b (read))\n \n(if (or (evenp a)\n        (evenp b))\n    (format t \"Even\")\n    (format t \"Odd\"))", "language": "Lisp", "metadata": {"date": 1564972370, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s693479008.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s693479008", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defparameter a (read))\n(defparameter b (read))\n \n(if (or (evenp a)\n        (evenp b))\n    (format t \"Even\")\n    (format t \"Odd\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 130, "cpu_time_ms": 94, "memory_kb": 10720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s261172621", "group_id": "codeNet:p03455", "input_text": "(defparameter a (read))\n(defparameter b (read))\n\n(if (or (evenp a)\n        (evenp b))\n    (format t \"Even\")\n    (format t \"Odd))", "language": "Lisp", "metadata": {"date": 1564972335, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s261172621.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s261172621", "user_id": "u425317134"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defparameter a (read))\n(defparameter b (read))\n\n(if (or (evenp a)\n        (evenp b))\n    (format t \"Even\")\n    (format t \"Odd))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 87, "memory_kb": 9064}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s918508973", "group_id": "codeNet:p03455", "input_text": "(defun solve (a b)\n    (if (zerop (rem (* a b) 2))\n    \"Even\" \"Odd\"))\n(format t \"~A~%\" (solve (read) (read)))", "language": "Lisp", "metadata": {"date": 1563394509, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s918508973.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s918508973", "user_id": "u570018655"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun solve (a b)\n    (if (zerop (rem (* a b) 2))\n    \"Even\" \"Odd\"))\n(format t \"~A~%\" (solve (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 109, "cpu_time_ms": 114, "memory_kb": 11872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s544596684", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"\n      ))\n\n(format t \"~A~%\" (product (read) (read)))\n      ", "language": "Lisp", "metadata": {"date": 1561233115, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s544596684.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s544596684", "user_id": "u347678565"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"\n      ))\n\n(format t \"~A~%\" (product (read) (read)))\n      ", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 134, "cpu_time_ms": 31, "memory_kb": 4964}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s655912397", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "language": "Lisp", "metadata": {"date": 1559624854, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s655912397.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s655912397", "user_id": "u469063372"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 130, "memory_kb": 11748}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s797643229", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n    \"Even\"\n    \"Odd\"))\n\n(format t \"~A~% (product (read) (read))\")", "language": "Lisp", "metadata": {"date": 1559624327, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s797643229.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s797643229", "user_id": "u469063372"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n    \"Even\"\n    \"Odd\"))\n\n(format t \"~A~% (product (read) (read))\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 116, "cpu_time_ms": 62, "memory_kb": 7016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s179653957", "group_id": "codeNet:p03455", "input_text": "(if (evenp(* (read) (read))) (format t \"Even\") (format t \"Odd\"))", "language": "Lisp", "metadata": {"date": 1559286740, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s179653957.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s179653957", "user_id": "u192442087"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(if (evenp(* (read) (read))) (format t \"Even\") (format t \"Odd\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 64, "cpu_time_ms": 6, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s915031133", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n (cond\n  ((or (/=(mod a 2)1)(/=(mod b 2)1))\"Even\")\n  (t \"Odd\")))\n\n(format t \"~A~%\" (product (read) (read)))", "language": "Lisp", "metadata": {"date": 1557971634, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s915031133.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s915031133", "user_id": "u229235826"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n (cond\n  ((or (/=(mod a 2)1)(/=(mod b 2)1))\"Even\")\n  (t \"Odd\")))\n\n(format t \"~A~%\" (product (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 112, "memory_kb": 10976}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s530653026", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n (cond\n  ((or (/=(mod a 2)0)(/=(mod b 2)0))\"Even\")\n  (t \"Odd\")))", "language": "Lisp", "metadata": {"date": 1557971367, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s530653026.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s530653026", "user_id": "u229235826"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n (cond\n  ((or (/=(mod a 2)0)(/=(mod b 2)0))\"Even\")\n  (t \"Odd\")))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 85, "cpu_time_ms": 164, "memory_kb": 13412}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s856196267", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n (cond\n  ((or (/=(mod a 2)1)(/=(mod b 2)1))\"Even\")\n  (t \"Odd\")))", "language": "Lisp", "metadata": {"date": 1557971317, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s856196267.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s856196267", "user_id": "u229235826"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n (cond\n  ((or (/=(mod a 2)1)(/=(mod b 2)1))\"Even\")\n  (t \"Odd\")))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 85, "cpu_time_ms": 13, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s565869609", "group_id": "codeNet:p03455", "input_text": "(defun main()\n  (if (oddp (* (read) (read)))\n      (format t \"Odd\")\n      (format t \"Even\")))\n(main)", "language": "Lisp", "metadata": {"date": 1555040992, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s565869609.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s565869609", "user_id": "u418126641"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun main()\n  (if (oddp (* (read) (read)))\n      (format t \"Odd\")\n      (format t \"Even\")))\n(main)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 100, "cpu_time_ms": 42, "memory_kb": 5860}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s902214548", "group_id": "codeNet:p03455", "input_text": "(defun pro (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (pro (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1551842276, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s902214548.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s902214548", "user_id": "u546338529"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun pro (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (pro (read) (read)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 113, "cpu_time_ms": 142, "memory_kb": 11876}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s490797733", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "language": "Lisp", "metadata": {"date": 1542679220, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s490797733.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s490797733", "user_id": "u761519515"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 116, "memory_kb": 11876}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s278301762", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n    (if (zerop (rem (* a b) 2))\n        \"Even\"\n        \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "language": "Lisp", "metadata": {"date": 1542583386, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s278301762.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s278301762", "user_id": "u671264502"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n    (if (zerop (rem (* a b) 2))\n        \"Even\"\n        \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 126, "cpu_time_ms": 128, "memory_kb": 11872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s779988226", "group_id": "codeNet:p03455", "input_text": "(if (oddp (* (read) (read))) (princ \"Odd\") (princ \"Even\"))", "language": "Lisp", "metadata": {"date": 1541737989, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s779988226.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s779988226", "user_id": "u610490393"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(if (oddp (* (read) (read))) (princ \"Odd\") (princ \"Even\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 58, "cpu_time_ms": 5, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s094836129", "group_id": "codeNet:p03455", "input_text": "(defun hey (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"\n      ))\n(format t \"~A~%\" (hey (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1540949542, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s094836129.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s094836129", "user_id": "u250664216"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun hey (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"\n      ))\n(format t \"~A~%\" (hey (read) (read)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 119, "cpu_time_ms": 124, "memory_kb": 11880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s426522222", "group_id": "codeNet:p03455", "input_text": "(princ(if(>(mod(*(read)(read))2)0)\"Odd\"\"Even\"))", "language": "Lisp", "metadata": {"date": 1528524487, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s426522222.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s426522222", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(princ(if(>(mod(*(read)(read))2)0)\"Odd\"\"Even\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 47, "cpu_time_ms": 5, "memory_kb": 2792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s817444157", "group_id": "codeNet:p03455", "input_text": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "language": "Lisp", "metadata": {"date": 1521663223, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s817444157.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s817444157", "user_id": "u711147786"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(defun product (a b)\n  (if (zerop (rem (* a b) 2))\n      \"Even\"\n      \"Odd\"))\n\n(format t \"~A~%\" (product (read) (read)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 116, "memory_kb": 11880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s712386787", "group_id": "codeNet:p03455", "input_text": "(if (oddp (* (read) (read)))\n    (format t \"Odd~%\")\n    (format t \"Even~%\"))", "language": "Lisp", "metadata": {"date": 1520089968, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s712386787.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s712386787", "user_id": "u183015556"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(if (oddp (* (read) (read)))\n    (format t \"Odd~%\")\n    (format t \"Even~%\"))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 76, "cpu_time_ms": 20, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s202903046", "group_id": "codeNet:p03455", "input_text": "(let ((a (read))\n      (b (read)))\n  (format t \"~a~%\" (if (= (mod (* a b) 2) 0) \"Even\" \"Odd\")))\n", "language": "Lisp", "metadata": {"date": 1518931666, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s202903046.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s202903046", "user_id": "u994767958"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(let ((a (read))\n      (b (read)))\n  (format t \"~a~%\" (if (= (mod (* a b) 2) 0) \"Even\" \"Odd\")))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 151, "memory_kb": 13028}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s792797729", "group_id": "codeNet:p03455", "input_text": "(let* ((a (read))\n       (b (read))\n       (p (* a b)))\n  (format t \"~A~%\" (if (evenp p) \"Even\" \"Odd\")))", "language": "Lisp", "metadata": {"date": 1517878014, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Lisp/s792797729.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s792797729", "user_id": "u275710783"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "(let* ((a (read))\n       (b (read))\n       (p (* a b)))\n  (format t \"~A~%\" (if (evenp p) \"Even\" \"Odd\")))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 136, "memory_kb": 13028}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s062551067", "group_id": "codeNet:p03471", "input_text": "(defun main ()\n  (let* ((n (read))\n         (y (read)))\n    (format t \"~A~%\"\n      (loop named outer\n        for i from 0 to n \n        finally (return-from outer (format nil \"~a ~a ~a\" -1 -1 -1))\n        do\n        (loop for j from 0 to (- n i) do\n            (if (= y (+ (* i 10000)\n                        (* j 5000)\n                        (* (- n i j) 1000)))\n                (return-from outer (format nil \"~a ~a ~a\" i j (- n i j)))))))))\n(main)", "language": "Lisp", "metadata": {"date": 1590350764, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s062551067.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s062551067", "user_id": "u652695471"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (y (read)))\n    (format t \"~A~%\"\n      (loop named outer\n        for i from 0 to n \n        finally (return-from outer (format nil \"~a ~a ~a\" -1 -1 -1))\n        do\n        (loop for j from 0 to (- n i) do\n            (if (= y (+ (* i 10000)\n                        (* j 5000)\n                        (* (- n i j) 1000)))\n                (return-from outer (format nil \"~a ~a ~a\" i j (- n i j)))))))))\n(main)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 451, "cpu_time_ms": 148, "memory_kb": 15976}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s463421055", "group_id": "codeNet:p03471", "input_text": "(defun main ()\n  (let* ((n (read))\n         (y (read)))\n    (format t \"~A~%\"\n      (loop named outer\n        for i from 0 to n \n        finally (return-from outer (format nil \"~a ~a ~a\" -1 -1 -1))\n        do\n        (loop for j from 0 to (- n i) do\n          (loop for k from 0 to (- n i j) do\n            (if (= y (+ (* i 1000)\n                        (* j 5000)\n                        (* k 10000)))\n                (return-from outer (format nil \"~a ~a ~a\" k j i)))))))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1590348550, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s463421055.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s463421055", "user_id": "u652695471"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (y (read)))\n    (format t \"~A~%\"\n      (loop named outer\n        for i from 0 to n \n        finally (return-from outer (format nil \"~a ~a ~a\" -1 -1 -1))\n        do\n        (loop for j from 0 to (- n i) do\n          (loop for k from 0 to (- n i j) do\n            (if (= y (+ (* i 1000)\n                        (* j 5000)\n                        (* k 10000)))\n                (return-from outer (format nil \"~a ~a ~a\" k j i)))))))))\n\n(main)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 482, "cpu_time_ms": 2104, "memory_kb": 15844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s501133893", "group_id": "codeNet:p03471", "input_text": "(defun main ()\n  (let* ((n (read))\n         (y (read)))\n    (format t \"~A~%\"\n      (loop named outer\n        for i from 0 to n \n        finally (return-from outer (format nil \"~a ~a ~a\" -1 -1 -1))\n        do\n        (loop for j from 0 to (- n i) do\n          (loop for k from 0 to (- n i j) do\n            (if (= y (+ (* i 1000)\n                        (* j 5000)\n                        (* k 10000)))\n                (return-from outer (format nil \"~a ~a ~a\" k j i)))))))))", "language": "Lisp", "metadata": {"date": 1590348533, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s501133893.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s501133893", "user_id": "u652695471"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (y (read)))\n    (format t \"~A~%\"\n      (loop named outer\n        for i from 0 to n \n        finally (return-from outer (format nil \"~a ~a ~a\" -1 -1 -1))\n        do\n        (loop for j from 0 to (- n i) do\n          (loop for k from 0 to (- n i j) do\n            (if (= y (+ (* i 1000)\n                        (* j 5000)\n                        (* k 10000)))\n                (return-from outer (format nil \"~a ~a ~a\" k j i)))))))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 474, "cpu_time_ms": 139, "memory_kb": 15844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s515714799", "group_id": "codeNet:p03471", "input_text": "(defun calc (n yen)\n  (let* ((m10 (floor (/ yen 10000)))\n         (m5 (floor (/ (- yen (* 10000 m10)) 5000)))\n         (m1 (floor (/ (- yen (* 10000 m10) (* 5000 m5)) 1000))))\n        (if (<= n (+ m10 m5 m1))\n            (format t \"-1 -1 -1\")\n            (format t \"~A ~A ~A\" m10 m5 m1))))\n\n(let ((n (read))\n      (yen (read)))\n     (calc n yen))\n", "language": "Lisp", "metadata": {"date": 1588565793, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s515714799.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s515714799", "user_id": "u425317134"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defun calc (n yen)\n  (let* ((m10 (floor (/ yen 10000)))\n         (m5 (floor (/ (- yen (* 10000 m10)) 5000)))\n         (m1 (floor (/ (- yen (* 10000 m10) (* 5000 m5)) 1000))))\n        (if (<= n (+ m10 m5 m1))\n            (format t \"-1 -1 -1\")\n            (format t \"~A ~A ~A\" m10 m5 m1))))\n\n(let ((n (read))\n      (yen (read)))\n     (calc n yen))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 347, "cpu_time_ms": 125, "memory_kb": 16484}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s220998943", "group_id": "codeNet:p03471", "input_text": "(defvar N (read))\n(defvar y (/ (read) 1000))\n\n\n(loop for A from (mod (- y N) 4) to (/ y 10) by 4\n      with B = (/ (- y N (* 9 A)) 4) with C = (- N A B)\n      unless (some #'minusp (list A B C))\n      return (format t \"~A ~A ~A\" A B C)\n      do (decf B 9) (incf C 5)\n      finally (princ \"-1 -1 -1\"))", "language": "Lisp", "metadata": {"date": 1587918784, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s220998943.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s220998943", "user_id": "u334552723"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defvar N (read))\n(defvar y (/ (read) 1000))\n\n\n(loop for A from (mod (- y N) 4) to (/ y 10) by 4\n      with B = (/ (- y N (* 9 A)) 4) with C = (- N A B)\n      unless (some #'minusp (list A B C))\n      return (format t \"~A ~A ~A\" A B C)\n      do (decf B 9) (incf C 5)\n      finally (princ \"-1 -1 -1\"))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 300, "cpu_time_ms": 20, "memory_kb": 6504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s842463891", "group_id": "codeNet:p03471", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (str)\n  (count #\\1 str))\n\n\n(defun main(n yen)\n  (loop for i from 0 to n\n        do\n           (loop for j from 0 to (- n i)\n                 for k = (- n i j)\n                 when (= (+ (* i 10000) (* j 5000) (* k 1000)) yen)\n                   do\n                 (return-from main (format nil \"~a ~a ~a~%\" i j k))))\n  \"-1 -1 -1\")\n\n(princ (main (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1586233941, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s842463891.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s842463891", "user_id": "u493610446"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (str)\n  (count #\\1 str))\n\n\n(defun main(n yen)\n  (loop for i from 0 to n\n        do\n           (loop for j from 0 to (- n i)\n                 for k = (- n i j)\n                 when (= (+ (* i 10000) (* j 5000) (* k 1000)) yen)\n                   do\n                 (return-from main (format nil \"~a ~a ~a~%\" i j k))))\n  \"-1 -1 -1\")\n\n(princ (main (read) (read)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1409, "cpu_time_ms": 78, "memory_kb": 12212}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s269600181", "group_id": "codeNet:p03471", "input_text": "(loop :named n-loop :with n := (read)\n      :do (loop :for j :upto n :with y := (read)\n                :do (loop :for k :upto (- n j)\n                          :if (= y (+ (* 10000 j) (* 5000 k) (* 1000 (- n j k))))\n                            :do (format t \"~A ~A ~A\" j k (- n j k))\n                            :and\n                              :do (return-from n-loop))\n                :finally (princ \"-1 -1 -1\")))", "language": "Lisp", "metadata": {"date": 1583630990, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s269600181.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s269600181", "user_id": "u610490393"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(loop :named n-loop :with n := (read)\n      :do (loop :for j :upto n :with y := (read)\n                :do (loop :for k :upto (- n j)\n                          :if (= y (+ (* 10000 j) (* 5000 k) (* 1000 (- n j k))))\n                            :do (format t \"~A ~A ~A\" j k (- n j k))\n                            :and\n                              :do (return-from n-loop))\n                :finally (princ \"-1 -1 -1\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 418, "cpu_time_ms": 132, "memory_kb": 13416}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s718536695", "group_id": "codeNet:p03471", "input_text": "(loop :named j-loop :with n := (read)\n      :do (loop :for j :upto n :with y := (read)\n                :do (loop :for k :upto (- n j)\n                          :if (= y (+ (* 10000 j) (* 5000 k) (* 1000 (- n j k))))\n                            :do (format t \"~A ~A ~A\" j k (- n j k))\n                                :and\n                            :do (return-from j-loop))\n                :finally (princ \"-1 -1 -1\")))", "language": "Lisp", "metadata": {"date": 1583626661, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s718536695.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s718536695", "user_id": "u610490393"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(loop :named j-loop :with n := (read)\n      :do (loop :for j :upto n :with y := (read)\n                :do (loop :for k :upto (- n j)\n                          :if (= y (+ (* 10000 j) (* 5000 k) (* 1000 (- n j k))))\n                            :do (format t \"~A ~A ~A\" j k (- n j k))\n                                :and\n                            :do (return-from j-loop))\n                :finally (princ \"-1 -1 -1\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 420, "cpu_time_ms": 263, "memory_kb": 13288}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s131503736", "group_id": "codeNet:p03471", "input_text": "(defun solve (n y)\n  (loop for a from n downto 0\n        for m = (- n a)\n        do (loop for b from m downto 0\n                 for c = (- m b)\n                 when (= (+ (* 1000 c)\n                            (* 5000 b)\n                            (* 10000 a))\n                         y)\n                 do (return-from solve (list a b c)))\n        finally\n           (return (list -1 -1 -1))))\n\n#-swank\n(let* ((n (read))\n       (y (read)))\n  (format t \"~{~A~^ ~}~%\" (solve n y)))\n", "language": "Lisp", "metadata": {"date": 1579822978, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s131503736.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s131503736", "user_id": "u202886318"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defun solve (n y)\n  (loop for a from n downto 0\n        for m = (- n a)\n        do (loop for b from m downto 0\n                 for c = (- m b)\n                 when (= (+ (* 1000 c)\n                            (* 5000 b)\n                            (* 10000 a))\n                         y)\n                 do (return-from solve (list a b c)))\n        finally\n           (return (list -1 -1 -1))))\n\n#-swank\n(let* ((n (read))\n       (y (read)))\n  (format t \"~{~A~^ ~}~%\" (solve n y)))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 486, "cpu_time_ms": 213, "memory_kb": 16096}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s643552967", "group_id": "codeNet:p03471", "input_text": "(defmacro for ((var from to) &body body)\n  `(do ((,var ,from (1+ ,var)))\n       ((> ,var ,to))\n     ,@body))\n\n(defun valid-p (n y)\n  (for (a 0 n)\n    (for (b 0 (- n a))\n      (let* ((c (- n a b))\n             (sum (+ (* a 10000)\n                     (* b 5000)\n                     (* c 1000))))\n        (when (= y sum)\n          (return-from valid-p (values a b c))))))\n  (values -1 -1 -1))\n\n(defun main ()\n  (let ((n (read))\n        (y (read)))\n    (multiple-value-bind (a b c)\n        (valid-p n y)\n      (format t \"~A ~A ~A~%\" a b c))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1577075510, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s643552967.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s643552967", "user_id": "u115747274"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defmacro for ((var from to) &body body)\n  `(do ((,var ,from (1+ ,var)))\n       ((> ,var ,to))\n     ,@body))\n\n(defun valid-p (n y)\n  (for (a 0 n)\n    (for (b 0 (- n a))\n      (let* ((c (- n a b))\n             (sum (+ (* a 10000)\n                     (* b 5000)\n                     (* c 1000))))\n        (when (= y sum)\n          (return-from valid-p (values a b c))))))\n  (values -1 -1 -1))\n\n(defun main ()\n  (let ((n (read))\n        (y (read)))\n    (multiple-value-bind (a b c)\n        (valid-p n y)\n      (format t \"~A ~A ~A~%\" a b c))))\n\n#-swank (main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 557, "cpu_time_ms": 169, "memory_kb": 15720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s593167555", "group_id": "codeNet:p03471", "input_text": "(defmacro for ((var from to) &body body)\n  `(do ((,var ,from (1+ ,var)))\n       ((>= ,var ,to))\n     ,@body))\n\n(defun valid-p (n y)\n  (for (a 0 n)\n    (for (b 0 (- n a))\n      (let* ((c (- n a b))\n             (sum (+ (* a 10000)\n                     (* b 5000)\n                     (* c 1000))))\n        (cond ((= y sum)\n               (return-from valid-p (values a b c)))))))\n  (values -1 -1 -1))\n\n(defun main ()\n  (let ((n (read))\n        (y (read)))\n    (multiple-value-bind (a b c)\n        (valid-p n y)\n      (format t \"~A ~A ~A~%\" a b c))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1577075417, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s593167555.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s593167555", "user_id": "u115747274"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defmacro for ((var from to) &body body)\n  `(do ((,var ,from (1+ ,var)))\n       ((>= ,var ,to))\n     ,@body))\n\n(defun valid-p (n y)\n  (for (a 0 n)\n    (for (b 0 (- n a))\n      (let* ((c (- n a b))\n             (sum (+ (* a 10000)\n                     (* b 5000)\n                     (* c 1000))))\n        (cond ((= y sum)\n               (return-from valid-p (values a b c)))))))\n  (values -1 -1 -1))\n\n(defun main ()\n  (let ((n (read))\n        (y (read)))\n    (multiple-value-bind (a b c)\n        (valid-p n y)\n      (format t \"~A ~A ~A~%\" a b c))))\n\n#-swank (main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 565, "cpu_time_ms": 145, "memory_kb": 16104}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s664734984", "group_id": "codeNet:p03471", "input_text": "(defmacro for ((var from to) &body body)\n  `(do ((,var ,from (1+ ,var)))\n       ((>= ,var ,to))\n     ,@body))\n\n(defun valid-p (n y)\n  (for (a 0 n)\n    (for (b 0 n)\n      (for (c 0 (- n (+ a b)))\n        (let ((sum (+ (* a 10000)\n                      (* b 5000)\n                      (* c 1000))))\n          (cond ((= y sum)\n                 (return-from valid-p (values a b c)))))))))\n\n(defun main ()\n  (let ((n (read))\n        (y (read)))\n    (multiple-value-bind (a b c)\n        (valid-p n y)\n      (format t \"~A ~A ~A~%\" a b c))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1577075164, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s664734984.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s664734984", "user_id": "u115747274"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defmacro for ((var from to) &body body)\n  `(do ((,var ,from (1+ ,var)))\n       ((>= ,var ,to))\n     ,@body))\n\n(defun valid-p (n y)\n  (for (a 0 n)\n    (for (b 0 n)\n      (for (c 0 (- n (+ a b)))\n        (let ((sum (+ (* a 10000)\n                      (* b 5000)\n                      (* c 1000))))\n          (cond ((= y sum)\n                 (return-from valid-p (values a b c)))))))))\n\n(defun main ()\n  (let ((n (read))\n        (y (read)))\n    (multiple-value-bind (a b c)\n        (valid-p n y)\n      (format t \"~A ~A ~A~%\" a b c))))\n\n#-swank (main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 551, "cpu_time_ms": 2104, "memory_kb": 16104}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s750565296", "group_id": "codeNet:p03471", "input_text": "(defun valid-p (n y)\n  (dotimes (a n)\n    (unless (< y (* a 10000))\n      (dotimes (b n)\n        (unless (< y (* a 10000) (* b 5000))\n          (dotimes (c n)\n            (let ((sum (+ (* a 10000)\n                          (* b 5000)\n                          (* c 1000))))\n              (cond ((= y sum)\n                     (return-from valid-p (values a b c)))\n                    ((< y sum)\n                     (return))))))))))\n\n(defun main ()\n  (let ((n (read))\n        (y (read)))\n    (multiple-value-bind (a b c)\n        (valid-p n y)\n      (format t \"~A ~A ~A~%\" a b c))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1577074981, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s750565296.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s750565296", "user_id": "u115747274"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defun valid-p (n y)\n  (dotimes (a n)\n    (unless (< y (* a 10000))\n      (dotimes (b n)\n        (unless (< y (* a 10000) (* b 5000))\n          (dotimes (c n)\n            (let ((sum (+ (* a 10000)\n                          (* b 5000)\n                          (* c 1000))))\n              (cond ((= y sum)\n                     (return-from valid-p (values a b c)))\n                    ((< y sum)\n                     (return))))))))))\n\n(defun main ()\n  (let ((n (read))\n        (y (read)))\n    (multiple-value-bind (a b c)\n        (valid-p n y)\n      (format t \"~A ~A ~A~%\" a b c))))\n\n#-swank (main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 599, "cpu_time_ms": 2104, "memory_kb": 6504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s997645727", "group_id": "codeNet:p03471", "input_text": "(defun valid-p (n y)\n  (declare (fixnum n y)\n           (optimize (speed 3) (safety 0) (debug 0)))\n  (labels ((f (n sum a b c)\n             (declare (fixnum n sum a b c))\n             (cond ((< y n))\n                   ((= n 0)\n                    (if (= sum y)\n                        (return-from valid-p (values a b c))))\n                   (t\n                    (f (1- n) (+ sum 10000) (1+ a) b c)\n                    (f (1- n) (+ sum 5000) a (1+ b) c)\n                    (f (1- n) (+ sum 1000) a b (1+ c))))))\n    (f n 0 0 0 0)\n    (values -1 -1 -1)))\n\n(defun main ()\n  (let ((n (read))\n        (y (read)))\n    (multiple-value-bind (a b c)\n        (valid-p n y)\n      (format t \"~A ~A ~A~%\" a b c))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1577074479, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s997645727.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s997645727", "user_id": "u115747274"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defun valid-p (n y)\n  (declare (fixnum n y)\n           (optimize (speed 3) (safety 0) (debug 0)))\n  (labels ((f (n sum a b c)\n             (declare (fixnum n sum a b c))\n             (cond ((< y n))\n                   ((= n 0)\n                    (if (= sum y)\n                        (return-from valid-p (values a b c))))\n                   (t\n                    (f (1- n) (+ sum 10000) (1+ a) b c)\n                    (f (1- n) (+ sum 5000) a (1+ b) c)\n                    (f (1- n) (+ sum 1000) a b (1+ c))))))\n    (f n 0 0 0 0)\n    (values -1 -1 -1)))\n\n(defun main ()\n  (let ((n (read))\n        (y (read)))\n    (multiple-value-bind (a b c)\n        (valid-p n y)\n      (format t \"~A ~A ~A~%\" a b c))))\n\n(main)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 715, "cpu_time_ms": 2104, "memory_kb": 12388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s392663202", "group_id": "codeNet:p03471", "input_text": "(let* ((n (read))\n       (m (read))\n       (ans (loop :for x :from 0 :upto n\n                    :thereis (loop :for y :from 0 :upto n\n                                     :thereis (if (and (<= 0 (- n x y)) (= m (+ (* 10000 x) (* 5000 y) (* (- n x y) 1000))) )\n                                                  (list x y (- n x y)))))))\n  (if ans\n      (format t \"~A ~A ~A\" (first ans) (second ans) (third ans))\n      (format t \"-1 -1 -1\")))", "language": "Lisp", "metadata": {"date": 1575647780, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s392663202.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s392663202", "user_id": "u610490393"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (ans (loop :for x :from 0 :upto n\n                    :thereis (loop :for y :from 0 :upto n\n                                     :thereis (if (and (<= 0 (- n x y)) (= m (+ (* 10000 x) (* 5000 y) (* (- n x y) 1000))) )\n                                                  (list x y (- n x y)))))))\n  (if ans\n      (format t \"~A ~A ~A\" (first ans) (second ans) (third ans))\n      (format t \"-1 -1 -1\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 441, "cpu_time_ms": 271, "memory_kb": 15844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s784327071", "group_id": "codeNet:p03471", "input_text": "(let* ((n (read))\n       (m (read))\n       (ans (loop :for x :from 0 :upto n\n                    :thereis (loop :for y :from 0 :upto n\n                                     :thereis (if (= m (+ (* 10000 x) (* 5000 y) (* (- n x y) 1000)))\n                                                  (list x y (- n x y)))))))\n  (if ans\n      (format t \"~A ~A ~A\" (first ans) (second ans) (third ans))\n      (format t \"-1 -1 -1\")))", "language": "Lisp", "metadata": {"date": 1575647675, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s784327071.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s784327071", "user_id": "u610490393"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (ans (loop :for x :from 0 :upto n\n                    :thereis (loop :for y :from 0 :upto n\n                                     :thereis (if (= m (+ (* 10000 x) (* 5000 y) (* (- n x y) 1000)))\n                                                  (list x y (- n x y)))))))\n  (if ans\n      (format t \"~A ~A ~A\" (first ans) (second ans) (third ans))\n      (format t \"-1 -1 -1\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 417, "cpu_time_ms": 143, "memory_kb": 15716}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s847441899", "group_id": "codeNet:p03471", "input_text": "(let* ((n (read))\n       (m (read)))\n  (defun f (price lst)\n    (if (= (+ price (* (- n (length lst)) 1000)) m)\n        lst\n        (if (or (> (+ price (* (- n (length lst)) 1000)) m) (< (- n (length lst)) 0))\n            nil\n            (cond ((f (+ price 10000) (cons 10000 lst)))\n                  ((f (+ price 5000) (cons 5000 lst)))))))\n  (let* ((k (f 0 nil)))\n    (if k\n        (format t \"~A ~A ~A\" (count 10000 k) (count 5000 k) (- n (length k)))\n        (format t \"-1 -1 -1\"))))", "language": "Lisp", "metadata": {"date": 1567457860, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s847441899.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s847441899", "user_id": "u610490393"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read)))\n  (defun f (price lst)\n    (if (= (+ price (* (- n (length lst)) 1000)) m)\n        lst\n        (if (or (> (+ price (* (- n (length lst)) 1000)) m) (< (- n (length lst)) 0))\n            nil\n            (cond ((f (+ price 10000) (cons 10000 lst)))\n                  ((f (+ price 5000) (cons 5000 lst)))))))\n  (let* ((k (f 0 nil)))\n    (if k\n        (format t \"~A ~A ~A\" (count 10000 k) (count 5000 k) (- n (length k)))\n        (format t \"-1 -1 -1\"))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 486, "cpu_time_ms": 2104, "memory_kb": 57700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s769957977", "group_id": "codeNet:p03471", "input_text": "(let* ((n (read))\n       (m (read)))\n  (defun f (price lst)\n    (if (= (+ price (* (- n (length lst)) 1000)) m)\n        lst\n        (if (or (> (+ price (* (- n (length lst)) 1000)) m) (< (- n (length lst)) 0))\n            nil\n            (cond ((f (+ price 10000) (cons 10000 lst)))\n                  ((f (+ price 5000) (cons 5000 lst)))))))\n  (let* ((k (f 0 nil)))\n    (if (minusp (- n (length k)))\n        (format t \"-1 -1 -1\")\n        (format t \"~A ~A ~A\" (count 10000 k) (count 5000 k) (- n (length k))))))", "language": "Lisp", "metadata": {"date": 1567457750, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s769957977.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s769957977", "user_id": "u610490393"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read)))\n  (defun f (price lst)\n    (if (= (+ price (* (- n (length lst)) 1000)) m)\n        lst\n        (if (or (> (+ price (* (- n (length lst)) 1000)) m) (< (- n (length lst)) 0))\n            nil\n            (cond ((f (+ price 10000) (cons 10000 lst)))\n                  ((f (+ price 5000) (cons 5000 lst)))))))\n  (let* ((k (f 0 nil)))\n    (if (minusp (- n (length k)))\n        (format t \"-1 -1 -1\")\n        (format t \"~A ~A ~A\" (count 10000 k) (count 5000 k) (- n (length k))))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 510, "cpu_time_ms": 2104, "memory_kb": 57700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s252535886", "group_id": "codeNet:p03471", "input_text": "(let* ((n (read))\n       (m (read)))\n  (defun f (price lst)\n    ;(format t \"~A ~A~%\" price lst)\n    (if (= (+ price (* (- n (length lst)) 1000)) m)\n        lst\n        (if (> (+ price (* (- n (length lst)) 1000)) m)\n            nil\n            (cond ((f (+ price 10000) (cons 10000 lst)))\n                  ((f (+ price 5000) (cons 5000 lst)))))))\n  (let* ((k (f 0 nil)))\n    (if (minusp (- n (length k)))\n        (format t \"-1 -1 -1\")\n        (format t \"~A ~A ~A\" (count 10000 k) (count 5000 k) (- n (length k))))))", "language": "Lisp", "metadata": {"date": 1567457633, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s252535886.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s252535886", "user_id": "u610490393"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read)))\n  (defun f (price lst)\n    ;(format t \"~A ~A~%\" price lst)\n    (if (= (+ price (* (- n (length lst)) 1000)) m)\n        lst\n        (if (> (+ price (* (- n (length lst)) 1000)) m)\n            nil\n            (cond ((f (+ price 10000) (cons 10000 lst)))\n                  ((f (+ price 5000) (cons 5000 lst)))))))\n  (let* ((k (f 0 nil)))\n    (if (minusp (- n (length k)))\n        (format t \"-1 -1 -1\")\n        (format t \"~A ~A ~A\" (count 10000 k) (count 5000 k) (- n (length k))))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 516, "cpu_time_ms": 116, "memory_kb": 13540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s562985221", "group_id": "codeNet:p03471", "input_text": "(let* ((n (read))\n       (m (read))\n       (res '(1000 5000 10000))\n       (ans '(0 0 0)))\n  (setf m (- m (* n (first res))))\n  (multiple-value-bind (x y) (floor m (- (third res) (first res)))\n    (setf ans (list (- n (+ x y)) y x)))\n  (if (equal nil (remove-if-not #'minusp ans))\n      (format t \"~{~A ~}~%\" (reverse ans))\n      (format t \"-1 -1 -1~%\")))", "language": "Lisp", "metadata": {"date": 1561155366, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s562985221.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s562985221", "user_id": "u610490393"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (res '(1000 5000 10000))\n       (ans '(0 0 0)))\n  (setf m (- m (* n (first res))))\n  (multiple-value-bind (x y) (floor m (- (third res) (first res)))\n    (setf ans (list (- n (+ x y)) y x)))\n  (if (equal nil (remove-if-not #'minusp ans))\n      (format t \"~{~A ~}~%\" (reverse ans))\n      (format t \"-1 -1 -1~%\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 355, "cpu_time_ms": 148, "memory_kb": 16232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s633478461", "group_id": "codeNet:p03471", "input_text": "(let* ((n (read))\n       (m (read))\n       (x 0)\n       (y 0)\n       (z (floor m 1000)))\n  (defun f-5000 ()\n    (cond ((= (+ x y z) n) t)\n          ((or (> 5 (- n x y z)) (minusp (- z 5))) nil)\n          (t (progn (incf y) (setq z (- z 5)) (f-5000)))))\n  (defun f-10000 ()\n    (cond ((= (+ x y z) n) t)\n          ((or (not (> 10 (- n x y z))) (not (minusp (- z 10)))) (progn (incf x) (setq z (- z 10)) (f-10000)))\n          ((or (not (> 2 (- n x y z))) (not (minusp (- y 2)))) (progn (incf x) (setq y (- z 2)) (f-10000)))\n          (t nil)))\n\n  (if (or (not (< (* n 1000) m (* n 10000))) (not (= 0 (mod m 1000))))\n      (setf x -1 y -1 z -1)\n      (progn (f-5000) (f-10000)))\n  (format t \"~A ~A ~A\" x y z ))", "language": "Lisp", "metadata": {"date": 1553496511, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s633478461.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s633478461", "user_id": "u610490393"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (x 0)\n       (y 0)\n       (z (floor m 1000)))\n  (defun f-5000 ()\n    (cond ((= (+ x y z) n) t)\n          ((or (> 5 (- n x y z)) (minusp (- z 5))) nil)\n          (t (progn (incf y) (setq z (- z 5)) (f-5000)))))\n  (defun f-10000 ()\n    (cond ((= (+ x y z) n) t)\n          ((or (not (> 10 (- n x y z))) (not (minusp (- z 10)))) (progn (incf x) (setq z (- z 10)) (f-10000)))\n          ((or (not (> 2 (- n x y z))) (not (minusp (- y 2)))) (progn (incf x) (setq y (- z 2)) (f-10000)))\n          (t nil)))\n\n  (if (or (not (< (* n 1000) m (* n 10000))) (not (= 0 (mod m 1000))))\n      (setf x -1 y -1 z -1)\n      (progn (f-5000) (f-10000)))\n  (format t \"~A ~A ~A\" x y z ))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 707, "cpu_time_ms": 2105, "memory_kb": 7784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s714248189", "group_id": "codeNet:p03471", "input_text": "(defun otoshidama (n y)\n  (let ((res10000 -1)\n        (res5000 -1)\n        (res1000 -1)\n        (c 0)\n        (total 0))\n    (dotimes (a n)\n      (dotimes (b (- n a))\n        (setf c (- n a b))\n        (setf total (+ (* 10000 a) (* 5000 b) (* 1000 c)))\n        (if (= total y)\n            (progn\n              (setf res10000 a)\n              (setf res5000 b)\n              (setf res1000 c)))))\n    (values res10000 res5000 res1000)))\n\n(multiple-value-bind (res10000 res5000 res1000) (otoshidama (read) (read))\n  (format t \"~A ~A ~A~%\" res10000 res5000 res1000))", "language": "Lisp", "metadata": {"date": 1521663503, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s714248189.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s714248189", "user_id": "u711147786"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defun otoshidama (n y)\n  (let ((res10000 -1)\n        (res5000 -1)\n        (res1000 -1)\n        (c 0)\n        (total 0))\n    (dotimes (a n)\n      (dotimes (b (- n a))\n        (setf c (- n a b))\n        (setf total (+ (* 10000 a) (* 5000 b) (* 1000 c)))\n        (if (= total y)\n            (progn\n              (setf res10000 a)\n              (setf res5000 b)\n              (setf res1000 c)))))\n    (values res10000 res5000 res1000)))\n\n(multiple-value-bind (res10000 res5000 res1000) (otoshidama (read) (read))\n  (format t \"~A ~A ~A~%\" res10000 res5000 res1000))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 561, "cpu_time_ms": 65, "memory_kb": 6504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s157276642", "group_id": "codeNet:p03471", "input_text": "(defun sum (a b c)\n  (+ (* 10000 a) (* 5000 b) (* 1000 c)))\n\n(defun solver ()\n  (let ((n (read)) (y (read)) (flag 0) (money 0) k)\n    (loop named outer for i from n downto 0 do\n          (loop named inner for j from (- n i) downto 0 do\n                (setf k (- n i j) money (sum i j k))\n                (when (= y money)\n                  (incf flag)\n                  (return-from outer (format t \"~a ~a ~a~%\" i j k)))))\n    (when (= flag 0) (format t \"-1 -1 -1~%\"))))\n\n(solver)\n", "language": "Lisp", "metadata": {"date": 1520100188, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s157276642.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s157276642", "user_id": "u183015556"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defun sum (a b c)\n  (+ (* 10000 a) (* 5000 b) (* 1000 c)))\n\n(defun solver ()\n  (let ((n (read)) (y (read)) (flag 0) (money 0) k)\n    (loop named outer for i from n downto 0 do\n          (loop named inner for j from (- n i) downto 0 do\n                (setf k (- n i j) money (sum i j k))\n                (when (= y money)\n                  (incf flag)\n                  (return-from outer (format t \"~a ~a ~a~%\" i j k)))))\n    (when (= flag 0) (format t \"-1 -1 -1~%\"))))\n\n(solver)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 482, "cpu_time_ms": 135, "memory_kb": 15588}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s276855216", "group_id": "codeNet:p03471", "input_text": "(defun solver ()\n  (let ((n (read)) (y (read)) (flag 0))\n    (loop named outer for i from n downto 0 do\n          (loop for j from (- n i) downto 0 do\n                (loop for k from (- n i j) downto 0 do\n                      (let ((money (+ (* 10000 i) (* 5000 j) (* 1000 k))))\n                        (when (= y money)\n                          (incf flag)\n                          (return-from outer (format t \"~a ~a ~a~%\" i j k)))\n                        (when (> y money) (return-from outer))))))\n    (when (= flag 0) (format t \"-1 -1 -1~%\"))))\n\n(solver)", "language": "Lisp", "metadata": {"date": 1520097563, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s276855216.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s276855216", "user_id": "u183015556"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defun solver ()\n  (let ((n (read)) (y (read)) (flag 0))\n    (loop named outer for i from n downto 0 do\n          (loop for j from (- n i) downto 0 do\n                (loop for k from (- n i j) downto 0 do\n                      (let ((money (+ (* 10000 i) (* 5000 j) (* 1000 k))))\n                        (when (= y money)\n                          (incf flag)\n                          (return-from outer (format t \"~a ~a ~a~%\" i j k)))\n                        (when (> y money) (return-from outer))))))\n    (when (= flag 0) (format t \"-1 -1 -1~%\"))))\n\n(solver)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 562, "cpu_time_ms": 2104, "memory_kb": 15840}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s348484426", "group_id": "codeNet:p03471", "input_text": "(defun solve-bezout (m n d)\n  (if (not (= (gcd m n) d))\n      nil\n      (loop for k in (if (>= m n)\n\t\t\t (euclidean-alg m n)\n\t\t\t (euclidean-alg n m))\n\t for x = 0 then (+ (* 0 x) (* 1 u))\n\t and y = 1 then (+ (* 0 y) (* 1 v))\n\t and u = 1 then (+ (* 1 x) (* (- k) u))\n\t and v = (- k) then (+ (* 1 y) (* (- k) v))\n\t finally (return (if (>= m n)\n\t\t\t     (cons x y)\n\t\t\t     (cons y x))))))\n\n(defun euclidean-alg (m n)\n  (let ((rem (mod m n)))\n    (if (zerop rem)\n\t(list (/ m n))\n\t(cons (/ (- m rem) n)\n\t      (euclidean-alg n rem)))))\n\n;; Es sucht k in Z, so dass x+k*alpha ist das kleinste nicht negative Nummer.\n(defun get-minimum-factor (x alpha)\n  (funcall (if (plusp alpha) #'ceiling #' floor)\n\t   (/ (- x) alpha)))\n\n(defun sign (x) (cond ((> x 0) 1) ((= x 0) 0) (t -1)))\n\n;; Es sucht eine ganzzahlige Lösung, so dass\n;; m*x+n*y=d, 0<=x, 0<=y, x+y<=sup.\n(defun solve-bezout-positive (m n d sup)\n  (let ((gcdmn (gcd m n)))\n    (if (/= (mod d gcdmn) 0)\n\tnil\n\t(let* ((root (solve-bezout m n gcdmn))\n\t       (factor (/ d gcdmn))\n\t       (x0 (* (car root) factor))\n\t       (y0 (* (cdr root) factor))\n\t       (deltax (/ n gcdmn))\n\t       (deltay (/ m gcdmn)))\n\t  ;; (format t \"(~A + k * ~A, ~A - k * ~A)~%\" x0 deltax y0 deltay)\n\t  (let* ((k-min1 (get-minimum-factor x0 deltax))\n\t\t (k-min2 (get-minimum-factor y0 (- deltay)))\n\t\t (x1 (+ x0 (* k-min1 deltax)))\n\t\t (y1 (- y0 (* k-min1 deltay)))\n\t\t (x2 (+ x0 (* k-min2 deltax)))\n\t\t (y2 (- y0 (* k-min2 deltay))))\n\t    ;; (format t \"k-min1=~A, k-min2=~A~%\" k-min1 k-min2)\n\t    ;; (format t \"deltax=~A, deltay=~A~%\" deltax deltay)\n\t    (if (and (>= y1 0) (<= (+ x1 y1) sup))\n\t\t(cons x1 y1)\n\t\t(if (and (>= x2 0) (<= (+ x2 y2) sup))\n\t\t    (cons x2 y2)\n\t\t    nil)))))))\n\n\n;; Sei y=1000y'. Wir lösen folgende ganzahlige Gleichungen:\n;; 10i + 5j + k = y',\n;; i + j + k = n,\n;; i, j, k >= 0.\n\n;; Sie sind wie folgt reduziert:\n;; 9i + 4j = y' - n,\n;; i, j >= 0, i + j <= n.\n\n;; Es ist eine so gennnte Bézout-Gleichung: y'-n soll ein Vielfaches von gcd(9, 4) sein.\n\n\n(defun judge-solve-print (n y)\n  (let* ((ij (solve-bezout-positive 9 4 (- (/ y 1000) n) n)))\n    ;; (format t \"9i+4j=~A~%\" (- (/ y 1000) n))\n    (if (null ij)\n\t(format t \"-1 -1 -1\")\n\t(format t \"~A ~A ~A~%\" (car ij) (cdr ij) (- n (car ij) (cdr ij))))))\n\n(judge-solve-print (read) (read))\n", "language": "Lisp", "metadata": {"date": 1515435336, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Lisp/s348484426.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s348484426", "user_id": "u352600849"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "(defun solve-bezout (m n d)\n  (if (not (= (gcd m n) d))\n      nil\n      (loop for k in (if (>= m n)\n\t\t\t (euclidean-alg m n)\n\t\t\t (euclidean-alg n m))\n\t for x = 0 then (+ (* 0 x) (* 1 u))\n\t and y = 1 then (+ (* 0 y) (* 1 v))\n\t and u = 1 then (+ (* 1 x) (* (- k) u))\n\t and v = (- k) then (+ (* 1 y) (* (- k) v))\n\t finally (return (if (>= m n)\n\t\t\t     (cons x y)\n\t\t\t     (cons y x))))))\n\n(defun euclidean-alg (m n)\n  (let ((rem (mod m n)))\n    (if (zerop rem)\n\t(list (/ m n))\n\t(cons (/ (- m rem) n)\n\t      (euclidean-alg n rem)))))\n\n;; Es sucht k in Z, so dass x+k*alpha ist das kleinste nicht negative Nummer.\n(defun get-minimum-factor (x alpha)\n  (funcall (if (plusp alpha) #'ceiling #' floor)\n\t   (/ (- x) alpha)))\n\n(defun sign (x) (cond ((> x 0) 1) ((= x 0) 0) (t -1)))\n\n;; Es sucht eine ganzzahlige Lösung, so dass\n;; m*x+n*y=d, 0<=x, 0<=y, x+y<=sup.\n(defun solve-bezout-positive (m n d sup)\n  (let ((gcdmn (gcd m n)))\n    (if (/= (mod d gcdmn) 0)\n\tnil\n\t(let* ((root (solve-bezout m n gcdmn))\n\t       (factor (/ d gcdmn))\n\t       (x0 (* (car root) factor))\n\t       (y0 (* (cdr root) factor))\n\t       (deltax (/ n gcdmn))\n\t       (deltay (/ m gcdmn)))\n\t  ;; (format t \"(~A + k * ~A, ~A - k * ~A)~%\" x0 deltax y0 deltay)\n\t  (let* ((k-min1 (get-minimum-factor x0 deltax))\n\t\t (k-min2 (get-minimum-factor y0 (- deltay)))\n\t\t (x1 (+ x0 (* k-min1 deltax)))\n\t\t (y1 (- y0 (* k-min1 deltay)))\n\t\t (x2 (+ x0 (* k-min2 deltax)))\n\t\t (y2 (- y0 (* k-min2 deltay))))\n\t    ;; (format t \"k-min1=~A, k-min2=~A~%\" k-min1 k-min2)\n\t    ;; (format t \"deltax=~A, deltay=~A~%\" deltax deltay)\n\t    (if (and (>= y1 0) (<= (+ x1 y1) sup))\n\t\t(cons x1 y1)\n\t\t(if (and (>= x2 0) (<= (+ x2 y2) sup))\n\t\t    (cons x2 y2)\n\t\t    nil)))))))\n\n\n;; Sei y=1000y'. Wir lösen folgende ganzahlige Gleichungen:\n;; 10i + 5j + k = y',\n;; i + j + k = n,\n;; i, j, k >= 0.\n\n;; Sie sind wie folgt reduziert:\n;; 9i + 4j = y' - n,\n;; i, j >= 0, i + j <= n.\n\n;; Es ist eine so gennnte Bézout-Gleichung: y'-n soll ein Vielfaches von gcd(9, 4) sein.\n\n\n(defun judge-solve-print (n y)\n  (let* ((ij (solve-bezout-positive 9 4 (- (/ y 1000) n) n)))\n    ;; (format t \"9i+4j=~A~%\" (- (/ y 1000) n))\n    (if (null ij)\n\t(format t \"-1 -1 -1\")\n\t(format t \"~A ~A ~A~%\" (car ij) (cdr ij) (- n (car ij) (cdr ij))))))\n\n(judge-solve-print (read) (read))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2284, "cpu_time_ms": 150, "memory_kb": 17248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s832795009", "group_id": "codeNet:p03472", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT\n           (inline sort))\n  (let* ((n (read))\n         (h (read))\n         (as (make-array n :element-type 'uint32))\n         (bs (make-array n :element-type 'uint32)))\n    (declare (uint32 n h))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)\n            (aref bs i) (read-fixnum)))\n    (setq bs (sort bs #'>))\n    (let ((max-a (reduce #'max as)))\n      (loop for i below n\n            for b = (aref bs i)\n            while (and (> b max-a) (> h 0))\n            do (setq h (max 0 (- h b)))\n            finally (println (+ i (ceiling h max-a)))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1 10\n3 5\n\"\n    \"3\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 10\n3 5\n2 6\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\"\n    \"860000004\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\"\n    \"9\n\")))\n", "language": "Lisp", "metadata": {"date": 1585672301, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lisp/s832795009.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s832795009", "user_id": "u352600849"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (declare #.OPT)\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare #.OPT\n           (inline sort))\n  (let* ((n (read))\n         (h (read))\n         (as (make-array n :element-type 'uint32))\n         (bs (make-array n :element-type 'uint32)))\n    (declare (uint32 n h))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)\n            (aref bs i) (read-fixnum)))\n    (setq bs (sort bs #'>))\n    (let ((max-a (reduce #'max as)))\n      (loop for i below n\n            for b = (aref bs i)\n            while (and (> b max-a) (> h 0))\n            do (setq h (max 0 (- h b)))\n            finally (println (+ i (ceiling h max-a)))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1 10\n3 5\n\"\n    \"3\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 10\n3 5\n2 6\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\"\n    \"860000004\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\"\n    \"9\n\")))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5533, "cpu_time_ms": 143, "memory_kb": 21096}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s315342127", "group_id": "codeNet:p03472", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare (inline sort))\n  (let* ((n (read))\n         (h (read))\n         (as (make-array n :element-type 'uint32))\n         (bs (make-array n :element-type 'uint32)))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)\n            (aref bs i) (read-fixnum)))\n    (setq bs (sort bs #'>))\n    (let ((max-a (reduce #'max as)))\n      (loop for i below n\n            for b = (aref bs i)\n            while (and (> b max-a) (> h 0))\n            do (decf h b)\n            finally (println (+ i (ceiling h max-a)))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1 10\n3 5\n\"\n    \"3\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 10\n3 5\n2 6\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\"\n    \"860000004\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\"\n    \"9\n\")))\n", "language": "Lisp", "metadata": {"date": 1585672060, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lisp/s315342127.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s315342127", "user_id": "u352600849"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (sb-int:defconstant-eqx OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0))\n    #'equal)\n  #+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)\n  #-swank (set-dispatch-macro-character\n           ;; enclose the form with VALUES to avoid being captured by LOOP macro\n           #\\# #\\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t)))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n#-swank (disable-debugger) ; for CS Academy\n\n;; BEGIN_INSERTED_CONTENTS\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  \"NOTE: cannot read -2^62\"\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\\Nul) nil))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48)\n                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))\n                                         result))))\n              (return (if minus (- result) result))))))))\n\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;;;\n;;; Body\n;;;\n\n(defun main ()\n  (declare (inline sort))\n  (let* ((n (read))\n         (h (read))\n         (as (make-array n :element-type 'uint32))\n         (bs (make-array n :element-type 'uint32)))\n    (dotimes (i n)\n      (setf (aref as i) (read-fixnum)\n            (aref bs i) (read-fixnum)))\n    (setq bs (sort bs #'>))\n    (let ((max-a (reduce #'max as)))\n      (loop for i below n\n            for b = (aref bs i)\n            while (and (> b max-a) (> h 0))\n            do (decf h b)\n            finally (println (+ i (ceiling h max-a)))))))\n\n#-swank (main)\n\n;;;\n;;; Test and benchmark\n;;;\n\n#+swank\n(defun io-equal (in-string out-string &key (function #'main) (test #'equal))\n  \"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if\nthe string output to *STANDARD-OUTPUT* is equal to OUT-STRING.\"\n  (labels ((ensure-last-lf (s)\n             (if (eql (uiop:last-char s) #\\Linefeed)\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (funcall test\n             (ensure-last-lf out-string)\n             (with-output-to-string (out)\n               (let ((*standard-output* out))\n                 (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                   (funcall function)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"powershell.exe\" '(\"-Command\" \"Get-Clipboard\") :output out :search t)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  \"THING := null | string | symbol | pathname\n\nnull: run #'MAIN using the text on clipboard as input.\nstring: run #'MAIN using the string as input.\nsymbol: alias of FIVEAM:RUN!.\npathname: run #'MAIN using the text file as input.\"\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"1 10\n3 5\n\"\n    \"3\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"2 10\n3 5\n2 6\n\"\n    \"2\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\"\n    \"860000004\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\"\n    \"9\n\")))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5457, "cpu_time_ms": 253, "memory_kb": 33384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s410480605", "group_id": "codeNet:p03472", "input_text": "(let* ((n (read))\n       (h (read))\n       (lst (loop :repeat n :collect (cons (read) (read))))\n       (tw (reduce #'+ lst :key #'cdr)))\n  (princ (if (< h tw)\n             (1+ (loop :for k :in (sort lst #'> :key #'cdr)\n                       :with a = 0 :count (if (< (+ a (cdr k)) h)\n                                              (incf a (cdr k)))))\n             (let* ((mx (reduce #'max lst :key #'car))\n                    (x (mapcar #'cdr (remove-if (lambda (k) (< k mx)) lst :key #'cdr))))\n               (+ (length x) (ceiling (- h (reduce #'+ x)) mx))))))", "language": "Lisp", "metadata": {"date": 1574361988, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lisp/s410480605.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s410480605", "user_id": "u610490393"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (h (read))\n       (lst (loop :repeat n :collect (cons (read) (read))))\n       (tw (reduce #'+ lst :key #'cdr)))\n  (princ (if (< h tw)\n             (1+ (loop :for k :in (sort lst #'> :key #'cdr)\n                       :with a = 0 :count (if (< (+ a (cdr k)) h)\n                                              (incf a (cdr k)))))\n             (let* ((mx (reduce #'max lst :key #'car))\n                    (x (mapcar #'cdr (remove-if (lambda (k) (< k mx)) lst :key #'cdr))))\n               (+ (length x) (ceiling (- h (reduce #'+ x)) mx))))))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 562, "cpu_time_ms": 623, "memory_kb": 61800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s240520049", "group_id": "codeNet:p03472", "input_text": "(let* ((n (read))\n       (h (read))\n       (lst (loop :repeat n :collect (cons (read) (read))))\n       (tw (reduce #'+ lst :key #'cdr)))\n  (princ (if (< h tw)\n             (1+ (loop :for k :in lst :with a = 0 :count (if (< (+ a (cdr k)) h)\n                                                         (incf a (cdr k)))))\n             (+ n (ceiling (- h tw) (reduce #'max lst :key #'car))))))", "language": "Lisp", "metadata": {"date": 1574360387, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lisp/s240520049.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s240520049", "user_id": "u610490393"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(let* ((n (read))\n       (h (read))\n       (lst (loop :repeat n :collect (cons (read) (read))))\n       (tw (reduce #'+ lst :key #'cdr)))\n  (princ (if (< h tw)\n             (1+ (loop :for k :in lst :with a = 0 :count (if (< (+ a (cdr k)) h)\n                                                         (incf a (cdr k)))))\n             (+ n (ceiling (- h tw) (reduce #'max lst :key #'car))))))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 387, "cpu_time_ms": 620, "memory_kb": 61800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s486200155", "group_id": "codeNet:p03472", "input_text": ";; -*- coding:utf-8 -*-\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter O3 '(optimize (speed 3) (safety 0) (debug 0)))\n  (defparameter O2 '(optimize (speed 3) (safety 1))))\n\n(defmacro print-line (obj &optional (stream '*standard-output*))\n  `(prog1 (princ ,obj ,stream) (terpri ,stream)))\n\n\n;; Hauptteil\n\n(defmacro split-and-bind (arg-lst string &body body)\n  (let ((pos1 (gensym \"POS\"))\n\t(pos2 (gensym \"POS\"))\n\t(str-evaled (gensym \"STR\")))\n    (labels ((expand (arg-lst &optional (init-pos1 t))\n\t       (if (null arg-lst)\n\t\t   body\n\t\t   `((let* ((,pos1 ,(if init-pos1 0 `(1+ ,pos2)))\n\t\t\t    (,pos2 (position #\\space ,str-evaled :start ,pos1 :test #'char=))\n\t\t\t    (,(car arg-lst) (parse-integer ,str-evaled :start ,pos1 :end ,pos2)))\n\t\t       ,@(expand (cdr arg-lst) nil))))))\n      `(let ((,str-evaled ,string))\n\t ,@(expand arg-lst)))))\n\n(deftype unum () '(integer 0 1000000000))\n\n(defun qsort (arr)\n  (declare #.O3\n\t   ((simple-array unum) arr))\n  (labels ((quicksort (arr lo hi)\n\t     (declare (unum hi lo)\n\t\t      ((simple-array unum) arr))\n\t     (if (> hi lo)\n\t\t (let* ((mid (round (+ lo hi) 2))\n\t\t\t(i lo)\n\t\t\t(j (+ hi 1))\n\t\t\t(p (aref arr mid)))\n\t\t   (declare (unum i j))\n\t\t   (rotatef (aref arr mid) (aref arr lo))\n\t\t   (loop\n\t\t      (loop do (incf i)\n\t\t\t until (or (> i hi)\n\t\t\t\t   (> p (aref arr i)))) ; beliebige Präd.\n\t\t      (loop do (decf j)\n\t\t\t until (or (<= j lo)\n\t\t\t\t   (> (aref arr j) p))) ; beliebige Präd.\n\t\t      (if (< j i) (return))\n\t\t      (rotatef (aref arr i)(aref arr j)))\n\t\t   (rotatef (aref arr lo) (aref arr j))\n\t\t   (quicksort arr lo (- j 1))\n\t\t   (quicksort arr i hi)))\n\t     arr))\n    (quicksort arr 0 (- (length arr) 1))))\n\n(defun main ()\n  (declare #.O3)\n  (let* ((n (the unum (read)))\n\t (init-hp (read))\n\t (max-a 0)\n\t (arr-b (make-array n :element-type 'unum)))\n    (dotimes (idx n)\n      (split-and-bind (a b) (the string (read-line))\n\t(declare (unum a b))\n\t(when (>= a max-a) (setf max-a a))\n\t(setf (aref arr-b idx) b)))\n    (let* ((arr-b (qsort arr-b)))\n      (declare ((simple-array unum) arr-b))\n      (print-line\n       (loop with hp of-type fixnum = init-hp\n\t  for idx of-type unum from 0 below n\n\t  until (> max-a (aref arr-b idx))\n\t  do (decf hp (aref arr-b idx))\n\t    (when (<= hp 0)\n\t      (return (+ idx 1)))\n\t  finally (return (+ idx\n\t\t\t     (ceiling (max hp 0) max-a))))))))\n\n#-swank(main)\n\n\n;; Für Test\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n(defun test ()\n  (with-input-from-string (*standard-input* (delete #\\return (get-clipbrd)))\n    (main)))\n\n\n;; Für Benchmark\n(defparameter *file-path* *load-pathname*)\n(defparameter *dir-path* (pathname (directory-namestring *file-path*)))\n(defparameter *dat-path* (merge-pathnames \"test.dat\" *dir-path*))\n\n#+swank\n(with-open-file (out *dat-path*\n\t\t     :direction :output :if-exists :supersede)\n  )\n\n(defun bench ()\n  (let ((*standard-output* (make-broadcast-stream)))\n    (with-open-file (*standard-input* *dat-path*)\n      (time (main)))))\n", "language": "Lisp", "metadata": {"date": 1519982625, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lisp/s486200155.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s486200155", "user_id": "u352600849"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": ";; -*- coding:utf-8 -*-\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter O3 '(optimize (speed 3) (safety 0) (debug 0)))\n  (defparameter O2 '(optimize (speed 3) (safety 1))))\n\n(defmacro print-line (obj &optional (stream '*standard-output*))\n  `(prog1 (princ ,obj ,stream) (terpri ,stream)))\n\n\n;; Hauptteil\n\n(defmacro split-and-bind (arg-lst string &body body)\n  (let ((pos1 (gensym \"POS\"))\n\t(pos2 (gensym \"POS\"))\n\t(str-evaled (gensym \"STR\")))\n    (labels ((expand (arg-lst &optional (init-pos1 t))\n\t       (if (null arg-lst)\n\t\t   body\n\t\t   `((let* ((,pos1 ,(if init-pos1 0 `(1+ ,pos2)))\n\t\t\t    (,pos2 (position #\\space ,str-evaled :start ,pos1 :test #'char=))\n\t\t\t    (,(car arg-lst) (parse-integer ,str-evaled :start ,pos1 :end ,pos2)))\n\t\t       ,@(expand (cdr arg-lst) nil))))))\n      `(let ((,str-evaled ,string))\n\t ,@(expand arg-lst)))))\n\n(deftype unum () '(integer 0 1000000000))\n\n(defun qsort (arr)\n  (declare #.O3\n\t   ((simple-array unum) arr))\n  (labels ((quicksort (arr lo hi)\n\t     (declare (unum hi lo)\n\t\t      ((simple-array unum) arr))\n\t     (if (> hi lo)\n\t\t (let* ((mid (round (+ lo hi) 2))\n\t\t\t(i lo)\n\t\t\t(j (+ hi 1))\n\t\t\t(p (aref arr mid)))\n\t\t   (declare (unum i j))\n\t\t   (rotatef (aref arr mid) (aref arr lo))\n\t\t   (loop\n\t\t      (loop do (incf i)\n\t\t\t until (or (> i hi)\n\t\t\t\t   (> p (aref arr i)))) ; beliebige Präd.\n\t\t      (loop do (decf j)\n\t\t\t until (or (<= j lo)\n\t\t\t\t   (> (aref arr j) p))) ; beliebige Präd.\n\t\t      (if (< j i) (return))\n\t\t      (rotatef (aref arr i)(aref arr j)))\n\t\t   (rotatef (aref arr lo) (aref arr j))\n\t\t   (quicksort arr lo (- j 1))\n\t\t   (quicksort arr i hi)))\n\t     arr))\n    (quicksort arr 0 (- (length arr) 1))))\n\n(defun main ()\n  (declare #.O3)\n  (let* ((n (the unum (read)))\n\t (init-hp (read))\n\t (max-a 0)\n\t (arr-b (make-array n :element-type 'unum)))\n    (dotimes (idx n)\n      (split-and-bind (a b) (the string (read-line))\n\t(declare (unum a b))\n\t(when (>= a max-a) (setf max-a a))\n\t(setf (aref arr-b idx) b)))\n    (let* ((arr-b (qsort arr-b)))\n      (declare ((simple-array unum) arr-b))\n      (print-line\n       (loop with hp of-type fixnum = init-hp\n\t  for idx of-type unum from 0 below n\n\t  until (> max-a (aref arr-b idx))\n\t  do (decf hp (aref arr-b idx))\n\t    (when (<= hp 0)\n\t      (return (+ idx 1)))\n\t  finally (return (+ idx\n\t\t\t     (ceiling (max hp 0) max-a))))))))\n\n#-swank(main)\n\n\n;; Für Test\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n(defun test ()\n  (with-input-from-string (*standard-input* (delete #\\return (get-clipbrd)))\n    (main)))\n\n\n;; Für Benchmark\n(defparameter *file-path* *load-pathname*)\n(defparameter *dir-path* (pathname (directory-namestring *file-path*)))\n(defparameter *dat-path* (merge-pathnames \"test.dat\" *dir-path*))\n\n#+swank\n(with-open-file (out *dat-path*\n\t\t     :direction :output :if-exists :supersede)\n  )\n\n(defun bench ()\n  (let ((*standard-output* (make-broadcast-stream)))\n    (with-open-file (*standard-input* *dat-path*)\n      (time (main)))))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3055, "cpu_time_ms": 348, "memory_kb": 53736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s467698385", "group_id": "codeNet:p03472", "input_text": ";; -*- coding:utf-8 -*-\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter O3 '(optimize (speed 3) (safety 0) (debug 0)))\n  (defparameter O2 '(optimize (speed 3) (safety 1))))\n\n(defmacro print-line (obj &optional (stream '*standard-output*))\n  `(prog1 (princ ,obj ,stream) (terpri ,stream)))\n\n\n;; Hauptteil\n\n(defmacro split-and-bind (arg-lst string &body body)\n  (let ((pos1 (gensym \"POS\"))\n\t(pos2 (gensym \"POS\"))\n\t(str-evaled (gensym \"STR\")))\n    (labels ((expand (arg-lst &optional (init-pos1 t))\n\t       (if (null arg-lst)\n\t\t   body\n\t\t   `((let* ((,pos1 ,(if init-pos1 0 `(1+ ,pos2)))\n\t\t\t    (,pos2 (position #\\space ,str-evaled :start ,pos1 :test #'char=))\n\t\t\t    (,(car arg-lst) (parse-integer ,str-evaled :start ,pos1 :end ,pos2)))\n\t\t       ,@(expand (cdr arg-lst) nil))))))\n      `(let ((,str-evaled ,string))\n\t ,@(expand arg-lst)))))\n\n(deftype unum () '(integer 0 1000000000))\n(defun main ()\n  (declare #.O3)\n  (let* ((n (the unum (read)))\n\t (init-hp (read))\n\t (max-a 0)\n\t (lst-b nil))\n    (dotimes (idx n)\n      (split-and-bind (a b) (the string (read-line))\n\t(declare (unum a b))\n\t(when (>= a max-a) (setf max-a a))\n\t(push b lst-b)))\n    (let* ((lst-b (sort lst-b #'>)))\n      (print-line\n       (loop with hp of-type fixnum = init-hp\n\t  with b-throw of-type unum = 0\n\t  for b of-type unum in lst-b\n\t  until (> max-a b)\n\t  do (incf b-throw)\n\t    (decf hp b)\n\t  until (<= hp 0)\n\t  finally (return (+ b-throw\n\t\t\t     (ceiling (max hp 0) max-a))))))))\n\n#-swank(main)\n\n\n;; Für Test\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n(defun test ()\n  (with-input-from-string (*standard-input* (delete #\\return (get-clipbrd)))\n    (main)))\n\n\n;; Für Benchmark\n(defparameter *file-path* *load-pathname*)\n(defparameter *dir-path* (pathname (directory-namestring *file-path*)))\n(defparameter *dat-path* (merge-pathnames \"test.dat\" *dir-path*))\n\n#+swank\n(with-open-file (out *dat-path*\n\t\t     :direction :output :if-exists :supersede)\n  )\n\n(defun bench ()\n  (let ((*standard-output* (make-broadcast-stream)))\n    (with-open-file (*standard-input* *dat-path*)\n      (time (main)))))\n", "language": "Lisp", "metadata": {"date": 1519974265, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lisp/s467698385.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s467698385", "user_id": "u352600849"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": ";; -*- coding:utf-8 -*-\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter O3 '(optimize (speed 3) (safety 0) (debug 0)))\n  (defparameter O2 '(optimize (speed 3) (safety 1))))\n\n(defmacro print-line (obj &optional (stream '*standard-output*))\n  `(prog1 (princ ,obj ,stream) (terpri ,stream)))\n\n\n;; Hauptteil\n\n(defmacro split-and-bind (arg-lst string &body body)\n  (let ((pos1 (gensym \"POS\"))\n\t(pos2 (gensym \"POS\"))\n\t(str-evaled (gensym \"STR\")))\n    (labels ((expand (arg-lst &optional (init-pos1 t))\n\t       (if (null arg-lst)\n\t\t   body\n\t\t   `((let* ((,pos1 ,(if init-pos1 0 `(1+ ,pos2)))\n\t\t\t    (,pos2 (position #\\space ,str-evaled :start ,pos1 :test #'char=))\n\t\t\t    (,(car arg-lst) (parse-integer ,str-evaled :start ,pos1 :end ,pos2)))\n\t\t       ,@(expand (cdr arg-lst) nil))))))\n      `(let ((,str-evaled ,string))\n\t ,@(expand arg-lst)))))\n\n(deftype unum () '(integer 0 1000000000))\n(defun main ()\n  (declare #.O3)\n  (let* ((n (the unum (read)))\n\t (init-hp (read))\n\t (max-a 0)\n\t (lst-b nil))\n    (dotimes (idx n)\n      (split-and-bind (a b) (the string (read-line))\n\t(declare (unum a b))\n\t(when (>= a max-a) (setf max-a a))\n\t(push b lst-b)))\n    (let* ((lst-b (sort lst-b #'>)))\n      (print-line\n       (loop with hp of-type fixnum = init-hp\n\t  with b-throw of-type unum = 0\n\t  for b of-type unum in lst-b\n\t  until (> max-a b)\n\t  do (incf b-throw)\n\t    (decf hp b)\n\t  until (<= hp 0)\n\t  finally (return (+ b-throw\n\t\t\t     (ceiling (max hp 0) max-a))))))))\n\n#-swank(main)\n\n\n;; Für Test\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n(defun test ()\n  (with-input-from-string (*standard-input* (delete #\\return (get-clipbrd)))\n    (main)))\n\n\n;; Für Benchmark\n(defparameter *file-path* *load-pathname*)\n(defparameter *dir-path* (pathname (directory-namestring *file-path*)))\n(defparameter *dat-path* (merge-pathnames \"test.dat\" *dir-path*))\n\n#+swank\n(with-open-file (out *dat-path*\n\t\t     :direction :output :if-exists :supersede)\n  )\n\n(defun bench ()\n  (let ((*standard-output* (make-broadcast-stream)))\n    (with-open-file (*standard-input* *dat-path*)\n      (time (main)))))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2187, "cpu_time_ms": 320, "memory_kb": 49640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s558837529", "group_id": "codeNet:p03472", "input_text": ";; -*- coding:utf-8 -*-\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter O3 '(optimize (speed 3) (safety 0) (debug 0)))\n  (defparameter O2 '(optimize (speed 3) (safety 1))))\n\n(defmacro print-line (obj &optional (stream '*standard-output*))\n  `(prog1 (princ ,obj ,stream) (terpri ,stream)))\n\n\n;; Hauptteil\n\n(defmacro split-and-bind (arg-lst string &body body)\n  (let ((pos1 (gensym \"POS\"))\n\t(pos2 (gensym \"POS\"))\n\t(str-evaled (gensym \"STR\")))\n    (labels ((expand (arg-lst &optional (init-pos1 t))\n\t       (if (null arg-lst)\n\t\t   `(progn ,@body)\n\t\t   `(let* ((,pos1 ,(if init-pos1 0 `(1+ ,pos2)))\n\t\t\t   (,pos2 (position #\\space ,str-evaled :start ,pos1 :test #'char=))\n\t\t\t   (,(car arg-lst) (parse-integer ,str-evaled :start ,pos1 :end ,pos2)))\n\t\t      ,(expand (cdr arg-lst) nil)))))\n      `(let ((,str-evaled ,string))\n\t ,(expand arg-lst)))))\n\n(deftype unum () '(integer 0 1000000000))\n(defun main ()\n  (declare #.O3)\n  (let* ((n (read))\n\t (init-hp (read))\n\t (arr-a (make-array n :element-type 'fixnum))\n\t (arr-b (make-array n :element-type 'fixnum)))\n    (dotimes (idx n)\n      (split-and-bind (a b) (the string (read-line))\n\t(setf (aref arr-a idx) a\n\t      (aref arr-b idx) b)))\n    (let* ((max-a (loop for idx from 0 below n maximize (aref arr-a idx)))\n\t   (arr-b (sort arr-b #'>=))\n\t   (end-idx (loop for idx from 0\n\t\t       do (cond ((= idx n) (return n))\n\t\t\t\t((> max-a (aref arr-b idx))\n\t\t\t\t (return idx))))))\n      (print-line\n       (loop for idx of-type unum from 0 below end-idx\n\t  and hp of-type fixnum = init-hp then (- hp (aref arr-b idx))\n\t  until (<= hp 0)\n\t  finally (return (+ idx\n\t\t\t     (ceiling (max hp 0) max-a))))))))\n\n#-swank(main)\n\n\n;; Für Test\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n(defun test ()\n  (with-input-from-string (*standard-input* (delete #\\return (get-clipbrd)))\n    (main)))\n\n\n;; Für Benchmark\n(defparameter *file-path* *load-pathname*)\n(defparameter *dir-path* (pathname (directory-namestring *file-path*)))\n(defparameter *dat-path* (merge-pathnames \"test.dat\" *dir-path*))\n\n#+swank\n(with-open-file (out *dat-path*\n\t\t     :direction :output :if-exists :supersede)\n  )\n\n(defun bench ()\n  (let ((*standard-output* (make-broadcast-stream)))\n    (with-open-file (*standard-input* *dat-path*)\n      (time (main)))))\n", "language": "Lisp", "metadata": {"date": 1519964341, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Lisp/s558837529.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s558837529", "user_id": "u352600849"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": ";; -*- coding:utf-8 -*-\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter O3 '(optimize (speed 3) (safety 0) (debug 0)))\n  (defparameter O2 '(optimize (speed 3) (safety 1))))\n\n(defmacro print-line (obj &optional (stream '*standard-output*))\n  `(prog1 (princ ,obj ,stream) (terpri ,stream)))\n\n\n;; Hauptteil\n\n(defmacro split-and-bind (arg-lst string &body body)\n  (let ((pos1 (gensym \"POS\"))\n\t(pos2 (gensym \"POS\"))\n\t(str-evaled (gensym \"STR\")))\n    (labels ((expand (arg-lst &optional (init-pos1 t))\n\t       (if (null arg-lst)\n\t\t   `(progn ,@body)\n\t\t   `(let* ((,pos1 ,(if init-pos1 0 `(1+ ,pos2)))\n\t\t\t   (,pos2 (position #\\space ,str-evaled :start ,pos1 :test #'char=))\n\t\t\t   (,(car arg-lst) (parse-integer ,str-evaled :start ,pos1 :end ,pos2)))\n\t\t      ,(expand (cdr arg-lst) nil)))))\n      `(let ((,str-evaled ,string))\n\t ,(expand arg-lst)))))\n\n(deftype unum () '(integer 0 1000000000))\n(defun main ()\n  (declare #.O3)\n  (let* ((n (read))\n\t (init-hp (read))\n\t (arr-a (make-array n :element-type 'fixnum))\n\t (arr-b (make-array n :element-type 'fixnum)))\n    (dotimes (idx n)\n      (split-and-bind (a b) (the string (read-line))\n\t(setf (aref arr-a idx) a\n\t      (aref arr-b idx) b)))\n    (let* ((max-a (loop for idx from 0 below n maximize (aref arr-a idx)))\n\t   (arr-b (sort arr-b #'>=))\n\t   (end-idx (loop for idx from 0\n\t\t       do (cond ((= idx n) (return n))\n\t\t\t\t((> max-a (aref arr-b idx))\n\t\t\t\t (return idx))))))\n      (print-line\n       (loop for idx of-type unum from 0 below end-idx\n\t  and hp of-type fixnum = init-hp then (- hp (aref arr-b idx))\n\t  until (<= hp 0)\n\t  finally (return (+ idx\n\t\t\t     (ceiling (max hp 0) max-a))))))))\n\n#-swank(main)\n\n\n;; Für Test\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n(defun test ()\n  (with-input-from-string (*standard-input* (delete #\\return (get-clipbrd)))\n    (main)))\n\n\n;; Für Benchmark\n(defparameter *file-path* *load-pathname*)\n(defparameter *dir-path* (pathname (directory-namestring *file-path*)))\n(defparameter *dat-path* (merge-pathnames \"test.dat\" *dir-path*))\n\n#+swank\n(with-open-file (out *dat-path*\n\t\t     :direction :output :if-exists :supersede)\n  )\n\n(defun bench ()\n  (let ((*standard-output* (make-broadcast-stream)))\n    (with-open-file (*standard-input* *dat-path*)\n      (time (main)))))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2371, "cpu_time_ms": 397, "memory_kb": 49636}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s787001479", "group_id": "codeNet:p03478", "input_text": "(defun find-sum (n)\n  (let ((sum 0))\n    (while (> n 0)\n      (setf sum (+ sum (rem n 10)))\n      (setf n (floor n 10)))\n    sum))\n\n(defun some-sums (n a b)\n  (let ((ans 0)\n        (sum 0))\n    (dotimes (i (+ n 1))\n      (setf sum (find-sum i))\n      (if (and (>= sum a) (<= sum b))\n        (setf ans (+ ans i))))\n    ans))\n\n(format t \"~A~%\" (some-sums (read) (read) (read)))", "language": "Lisp", "metadata": {"date": 1590714647, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s787001479.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s787001479", "user_id": "u136500538"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defun find-sum (n)\n  (let ((sum 0))\n    (while (> n 0)\n      (setf sum (+ sum (rem n 10)))\n      (setf n (floor n 10)))\n    sum))\n\n(defun some-sums (n a b)\n  (let ((ans 0)\n        (sum 0))\n    (dotimes (i (+ n 1))\n      (setf sum (find-sum i))\n      (if (and (>= sum a) (<= sum b))\n        (setf ans (+ ans i))))\n    ans))\n\n(format t \"~A~%\" (some-sums (read) (read) (read)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 375, "cpu_time_ms": 46, "memory_kb": 7904}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s623359922", "group_id": "codeNet:p03478", "input_text": "(defmacro while (test &body body)\n  `(do ()\n       ((not ,test))\n     ,@body))\n\n(defun find-sum (n)\n\t(let ((sum 0))\n\t\t(while (> n 0)\n\t\t\t(setf sum (+ sum (rem n 10)))\n\t\t\t(setf n (floor n 10))\n\t\t)\n\tsum\n\t)\n)\n\n(defun some-sums (n a b)\n\t(let ((ans 0) (sum 0))\n\t(dotimes (i (+ n 1))\n\t\t(setf sum (find-sum (i)))\n\t\t(if (and (>= sum a) (<= sum b))\n\t\t\t(setf ans (+ ans i))\n\t\t)\n\t)\n\tans\n\t)\n)\n\n(format t \"~A~%\" (some-sums ((read) (read) (read))))", "language": "Lisp", "metadata": {"date": 1590705331, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s623359922.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s623359922", "user_id": "u136500538"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defmacro while (test &body body)\n  `(do ()\n       ((not ,test))\n     ,@body))\n\n(defun find-sum (n)\n\t(let ((sum 0))\n\t\t(while (> n 0)\n\t\t\t(setf sum (+ sum (rem n 10)))\n\t\t\t(setf n (floor n 10))\n\t\t)\n\tsum\n\t)\n)\n\n(defun some-sums (n a b)\n\t(let ((ans 0) (sum 0))\n\t(dotimes (i (+ n 1))\n\t\t(setf sum (find-sum (i)))\n\t\t(if (and (>= sum a) (<= sum b))\n\t\t\t(setf ans (+ ans i))\n\t\t)\n\t)\n\tans\n\t)\n)\n\n(format t \"~A~%\" (some-sums ((read) (read) (read))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 433, "cpu_time_ms": 35, "memory_kb": 7400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s756214161", "group_id": "codeNet:p03478", "input_text": "(defun some-sums (n a b)\n\t(let ((ans 0 sum 0))\n\t(dotimes (i (+ n 1))\n\t\t(setf sum (finds-some (i)))\n\t\t(if (and (>= sum a) (<= sum b) )\n\t\t\t(setf total (+ total i))\n\t\t)\n\t)\n\ttotal\n\t)\n)\n\n(defun find-sum (n)\n\t(let ((sum 0))\n\t\t(while (> n 0)\n\t\t\t(setf sum (+ sum (rem n 10)))\n\t\t\t(setf n (floor n 10))\n\t\t)\n\tsum\n\t)\n)\n\n(format t \"~D~%\" (some-sums (read) (read) (read)))", "language": "Lisp", "metadata": {"date": 1590704429, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s756214161.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s756214161", "user_id": "u136500538"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defun some-sums (n a b)\n\t(let ((ans 0 sum 0))\n\t(dotimes (i (+ n 1))\n\t\t(setf sum (finds-some (i)))\n\t\t(if (and (>= sum a) (<= sum b) )\n\t\t\t(setf total (+ total i))\n\t\t)\n\t)\n\ttotal\n\t)\n)\n\n(defun find-sum (n)\n\t(let ((sum 0))\n\t\t(while (> n 0)\n\t\t\t(setf sum (+ sum (rem n 10)))\n\t\t\t(setf n (floor n 10))\n\t\t)\n\tsum\n\t)\n)\n\n(format t \"~D~%\" (some-sums (read) (read) (read)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 30, "memory_kb": 5476}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s092445651", "group_id": "codeNet:p03478", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (str)\n  (count #\\1 str))\n\n(defun func (x)\n  (loop for x across (write-to-string x)\n        sum (- (char-code x) (char-code #\\0))))\n\n(defun main (n min max)\n  (loop for i from 1 to n\n        for v = (func i)\n        when (<= min v max)\n          sum i))\n\n(princ (main (read) (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1586232568, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s092445651.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s092445651", "user_id": "u493610446"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (str)\n  (count #\\1 str))\n\n(defun func (x)\n  (loop for x across (write-to-string x)\n        sum (- (char-code x) (char-code #\\0))))\n\n(defun main (n min max)\n  (loop for i from 1 to n\n        for v = (func i)\n        when (<= min v max)\n          sum i))\n\n(princ (main (read) (read) (read)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1336, "cpu_time_ms": 51, "memory_kb": 15928}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s908165733", "group_id": "codeNet:p03478", "input_text": "(defvar N)\n(setf N (read))\n\n(defun range (m n &optional l)\n  (if (< n m) l\n      (range m (1- n) (cons n l)) ))\n\n(defun sum_digit (N)\n  (reduce #'(lambda (sum s)\n                    (+ sum (digit-char-p s)))\n          (write-to-string N) :initial-value 0))\n\n(let ((a (read))\n      (b (read)))\n     (defun in[a.b] (x) (and (<= a x) (<= x b))))\n\n(princ\n (reduce #'+\n         (remove-if-not\n          (lambda (x) (in[a.b] (sum_digit x)))\n         (range 1 N))\n :initial-value 0 ))", "language": "Lisp", "metadata": {"date": 1585314545, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s908165733.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s908165733", "user_id": "u334552723"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defvar N)\n(setf N (read))\n\n(defun range (m n &optional l)\n  (if (< n m) l\n      (range m (1- n) (cons n l)) ))\n\n(defun sum_digit (N)\n  (reduce #'(lambda (sum s)\n                    (+ sum (digit-char-p s)))\n          (write-to-string N) :initial-value 0))\n\n(let ((a (read))\n      (b (read)))\n     (defun in[a.b] (x) (and (<= a x) (<= x b))))\n\n(princ\n (reduce #'+\n         (remove-if-not\n          (lambda (x) (in[a.b] (sum_digit x)))\n         (range 1 N))\n :initial-value 0 ))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 477, "cpu_time_ms": 23, "memory_kb": 10600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s779460986", "group_id": "codeNet:p03478", "input_text": "(princ (loop :for k :from 1 :upto (read) :with a := (read) :with b := (read)\n             :for x := (loop :for l :from (1+ (floor (log k 10))) :downto 1\n                             :for j := k :then (mod j (expt 10 l))\n                             :sum (floor j (expt 10 (1- l))))\n             :if (<= a x b) :sum k))", "language": "Lisp", "metadata": {"date": 1583616113, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s779460986.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s779460986", "user_id": "u610490393"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(princ (loop :for k :from 1 :upto (read) :with a := (read) :with b := (read)\n             :for x := (loop :for l :from (1+ (floor (log k 10))) :downto 1\n                             :for j := k :then (mod j (expt 10 l))\n                             :sum (floor j (expt 10 (1- l))))\n             :if (<= a x b) :sum k))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 318, "cpu_time_ms": 168, "memory_kb": 30560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s330764968", "group_id": "codeNet:p03478", "input_text": "(defun counting (n)\n  (if (eq n 0)\n      0\n      (+ (rem n 10) (counting (floor n 10)))))\n\n(defun some-sums (n a b)\n  (if (and\n       (<= a (counting n))\n       (>= b (counting n)))\n      (+ n (some-sums (1- n) a b))\n      (some-sums (1- n) a b)))\n      \n(format t \"~A~%\" (some-sums (read) (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1576960203, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s330764968.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s330764968", "user_id": "u691380397"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defun counting (n)\n  (if (eq n 0)\n      0\n      (+ (rem n 10) (counting (floor n 10)))))\n\n(defun some-sums (n a b)\n  (if (and\n       (<= a (counting n))\n       (>= b (counting n)))\n      (+ n (some-sums (1- n) a b))\n      (some-sums (1- n) a b)))\n      \n(format t \"~A~%\" (some-sums (read) (read) (read)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 306, "cpu_time_ms": 422, "memory_kb": 44772}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s843402138", "group_id": "codeNet:p03478", "input_text": "(defmacro while (condition &body body)\n  `(do ()\n       ((not ,condition))\n     ,@body))\n\n(defun counting (n)\n  (let ((sum 0))\n    (while (> n 0)\n      (setf sum (+ sum (rem n 10)))\n      (setf n (floor n 10)))\n    sum))\n\n(defun some-sums ()\n    (let ((n (1+ (read)))\n\t  (a (read))\n\t  (b (read))\n\t  (ans 0))\n      (dotimes (i n)\n\t(if (and\n\t     (>= (counting i) a)\n\t     (<= (counting i) b))\n\t    (setf ans (+ ans i))))\n      ans))\n      \n(format t \"~A~%\" (some-sums))", "language": "Lisp", "metadata": {"date": 1576959941, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s843402138.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s843402138", "user_id": "u691380397"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defmacro while (condition &body body)\n  `(do ()\n       ((not ,condition))\n     ,@body))\n\n(defun counting (n)\n  (let ((sum 0))\n    (while (> n 0)\n      (setf sum (+ sum (rem n 10)))\n      (setf n (floor n 10)))\n    sum))\n\n(defun some-sums ()\n    (let ((n (1+ (read)))\n\t  (a (read))\n\t  (b (read))\n\t  (ans 0))\n      (dotimes (i n)\n\t(if (and\n\t     (>= (counting i) a)\n\t     (<= (counting i) b))\n\t    (setf ans (+ ans i))))\n      ans))\n      \n(format t \"~A~%\" (some-sums))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 468, "cpu_time_ms": 128, "memory_kb": 14944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s621860942", "group_id": "codeNet:p03478", "input_text": "(defmacro while (condition &body body)\n  `(do ()\n       ((not ,condition))\n     ,@body))\n\n(defun counting (n)\n  (let ((sum 0))\n    (while (> n 0)\n      (setf sum (+ sum (rem n 10)))\n      (setf n (floor n 10)))\n    sum))\n\n(defun some-sums ()\n    (let ((n (1+ (read)))\n\t  (a (read))\n\t  (b (read))\n\t  (ans 0))\n      (dotimes (i n)\n\t(if (and\n\t     (>= (counting i) a)\n\t     (<= (counting i) b))\n\t    (incf ans)))\n      ans))\n      \n(format t \"~A~%\" (some-sums))", "language": "Lisp", "metadata": {"date": 1576959842, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s621860942.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s621860942", "user_id": "u691380397"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defmacro while (condition &body body)\n  `(do ()\n       ((not ,condition))\n     ,@body))\n\n(defun counting (n)\n  (let ((sum 0))\n    (while (> n 0)\n      (setf sum (+ sum (rem n 10)))\n      (setf n (floor n 10)))\n    sum))\n\n(defun some-sums ()\n    (let ((n (1+ (read)))\n\t  (a (read))\n\t  (b (read))\n\t  (ans 0))\n      (dotimes (i n)\n\t(if (and\n\t     (>= (counting i) a)\n\t     (<= (counting i) b))\n\t    (incf ans)))\n      ans))\n      \n(format t \"~A~%\" (some-sums))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 458, "cpu_time_ms": 153, "memory_kb": 16104}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s011422623", "group_id": "codeNet:p03478", "input_text": "(defun sum (x)\n  (let ((ret 0))\n    (loop\n       (if (zerop x) (return))\n       (setf ret (+ ret (rem x 10)))\n       (setf x (floor x 10)))\n    ret))\n\n(defun fun (n a b)\n  (let ((ans 0)\n\t(x 0))\n    (dotimes (i (1+ n))\n      (setf x (sum i))\n      (if (and\n\t   (<= a x)\n\t   (>= b x))\n\t  (setf ans (+ ans x))))\n    ans))\n\n(format t \"~A~%\" (fun (read) (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1576725031, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s011422623.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s011422623", "user_id": "u691380397"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defun sum (x)\n  (let ((ret 0))\n    (loop\n       (if (zerop x) (return))\n       (setf ret (+ ret (rem x 10)))\n       (setf x (floor x 10)))\n    ret))\n\n(defun fun (n a b)\n  (let ((ans 0)\n\t(x 0))\n    (dotimes (i (1+ n))\n      (setf x (sum i))\n      (if (and\n\t   (<= a x)\n\t   (>= b x))\n\t  (setf ans (+ ans x))))\n    ans))\n\n(format t \"~A~%\" (fun (read) (read) (read)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 365, "cpu_time_ms": 146, "memory_kb": 15840}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s006898929", "group_id": "codeNet:p03478", "input_text": "(defun sum (x)\n  (let ((ret 0))\n    (loop\n       (if (zerop x) (return))\n       (setf ret (+ ret (rem x 10)))\n       (setf x (floor x 10)))\n    ret))\n\n(defun fun (n a b)\n  (let ((ans 0)\n\t(x 0))\n    (dotimes (i (1+ n))\n      (setf x (sum i))\n      (if (and\n\t   (<= a x)\n\t   (>= b x))\n\t  (incf ans)))\n    ans))\n\n(format t \"~A~%\" (fun (read) (read) (read)))\n", "language": "Lisp", "metadata": {"date": 1576724908, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s006898929.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s006898929", "user_id": "u691380397"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defun sum (x)\n  (let ((ret 0))\n    (loop\n       (if (zerop x) (return))\n       (setf ret (+ ret (rem x 10)))\n       (setf x (floor x 10)))\n    ret))\n\n(defun fun (n a b)\n  (let ((ans 0)\n\t(x 0))\n    (dotimes (i (1+ n))\n      (setf x (sum i))\n      (if (and\n\t   (<= a x)\n\t   (>= b x))\n\t  (incf ans)))\n    ans))\n\n(format t \"~A~%\" (fun (read) (read) (read)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 355, "cpu_time_ms": 132, "memory_kb": 15844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s154251468", "group_id": "codeNet:p03478", "input_text": "(defun f(x)\n    (if (< x 10) \n        x\n        (+ (rem x 10) (f (floor (/ x 10))))))\n(defun g (x a b)\n    (and (>= x a) (<= x b)))\n(let ((n (read))\n      (a (read))\n      (b (read))\n      (ans 0))\n      \n\n      (loop :for i :from 1 :to n :do (when (g (f i) a b) (setf ans (+ ans i))))\n      (princ ans)\n      )", "language": "Lisp", "metadata": {"date": 1574400040, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s154251468.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s154251468", "user_id": "u923606520"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defun f(x)\n    (if (< x 10) \n        x\n        (+ (rem x 10) (f (floor (/ x 10))))))\n(defun g (x a b)\n    (and (>= x a) (<= x b)))\n(let ((n (read))\n      (a (read))\n      (b (read))\n      (ans 0))\n      \n\n      (loop :for i :from 1 :to n :do (when (g (f i) a b) (setf ans (+ ans i))))\n      (princ ans)\n      )", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 311, "cpu_time_ms": 125, "memory_kb": 13668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s035667895", "group_id": "codeNet:p03478", "input_text": "(defun f (k)\n  (+ (loop :for a :from 4 :downto 1 :sum(mod (floor k (* 10 a)) (* 10 a))) (mod k 10)))\n(let ((n (read))\n      (a (read))\n      (b (read)))\n  (princ (reduce #'+ (remove-if-not (lambda (q) (<= a (f q) b)) (loop :for x :from 1 :upto n :collect x)))))", "language": "Lisp", "metadata": {"date": 1557753692, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s035667895.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s035667895", "user_id": "u610490393"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defun f (k)\n  (+ (loop :for a :from 4 :downto 1 :sum(mod (floor k (* 10 a)) (* 10 a))) (mod k 10)))\n(let ((n (read))\n      (a (read))\n      (b (read)))\n  (princ (reduce #'+ (remove-if-not (lambda (q) (<= a (f q) b)) (loop :for x :from 1 :upto n :collect x)))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 261, "cpu_time_ms": 149, "memory_kb": 16100}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s798306680", "group_id": "codeNet:p03478", "input_text": "(let((n(read))(a(read))(b(read))(s 0))\n  (loop for i from 1 to n do\n\t\t(setq m(apply #'+(mapcar #'(lambda(c)(-(char-int c)48))(concatenate 'list (princ-to-string i)))))\n\t\t(if(and(>= m a)(<= m b))(incf s i)))\n  (princ s))\n", "language": "Lisp", "metadata": {"date": 1534287134, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s798306680.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s798306680", "user_id": "u657913472"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(let((n(read))(a(read))(b(read))(s 0))\n  (loop for i from 1 to n do\n\t\t(setq m(apply #'+(mapcar #'(lambda(c)(-(char-int c)48))(concatenate 'list (princ-to-string i)))))\n\t\t(if(and(>= m a)(<= m b))(incf s i)))\n  (princ s))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 220, "cpu_time_ms": 199, "memory_kb": 22112}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s114828155", "group_id": "codeNet:p03478", "input_text": "(defmacro while (test &body body)\n  `(do ()\n       ((not ,test))\n     ,@body))\n\n(defun find-sum-of-digits (n)\n  (let ((sum 0))\n    (while (> n 0)\n      (setf sum (+ sum (rem n 10)))\n      (setf n (floor n 10)))\n    sum))\n\n(defun some-sums (n a b)\n  (let ((total 0)\n        (sum 0))\n    (dotimes (i (+ n 1))\n      (setf sum (find-sum-of-digits i))\n      (if (and (>= sum a) (<= sum b))\n          (setf total (+ total i))))\n    total))\n\n(format t \"~A~%\" (some-sums (read) (read) (read)))", "language": "Lisp", "metadata": {"date": 1521663402, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s114828155.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s114828155", "user_id": "u711147786"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "(defmacro while (test &body body)\n  `(do ()\n       ((not ,test))\n     ,@body))\n\n(defun find-sum-of-digits (n)\n  (let ((sum 0))\n    (while (> n 0)\n      (setf sum (+ sum (rem n 10)))\n      (setf n (floor n 10)))\n    sum))\n\n(defun some-sums (n a b)\n  (let ((total 0)\n        (sum 0))\n    (dotimes (i (+ n 1))\n      (setf sum (find-sum-of-digits i))\n      (if (and (>= sum a) (<= sum b))\n          (setf total (+ total i))))\n    total))\n\n(format t \"~A~%\" (some-sums (read) (read) (read)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 485, "cpu_time_ms": 29, "memory_kb": 6880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s737865799", "group_id": "codeNet:p03478", "input_text": "\n(defun digit-sum (n)\n  (labels ((inner (m rv)\n             (cond\n               ((zerop m) rv)\n               (t\n                (multiple-value-bind (q r) (floor m 10)\n                  (inner q (+ rv r)))))))\n    (inner n 0)))\n\n(defparameter sums\n  (loop for n from 0 upto 10000\n        collect `(,n ,(digit-sum n))))\n\n(defun filter-sum (n a b)\n  (let ((k (if (< 10001 n)\n               10001\n               (1+ n))))\n    (remove-if-not #'(lambda (m) (<= a m b))\n                   (subseq sums 0 k)\n                   :key #'cadr)))\n\n(defun answer (n a b)\n  (loop for k in (filter-sum n a b)\n        sum (car k)))\n\n(let ((n (read)) (a (read)) (b (read)))\n  (format t \"~a~%\" (answer n a b)))", "language": "Lisp", "metadata": {"date": 1514178969, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Lisp/s737865799.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s737865799", "user_id": "u396817842"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "\n(defun digit-sum (n)\n  (labels ((inner (m rv)\n             (cond\n               ((zerop m) rv)\n               (t\n                (multiple-value-bind (q r) (floor m 10)\n                  (inner q (+ rv r)))))))\n    (inner n 0)))\n\n(defparameter sums\n  (loop for n from 0 upto 10000\n        collect `(,n ,(digit-sum n))))\n\n(defun filter-sum (n a b)\n  (let ((k (if (< 10001 n)\n               10001\n               (1+ n))))\n    (remove-if-not #'(lambda (m) (<= a m b))\n                   (subseq sums 0 k)\n                   :key #'cadr)))\n\n(defun answer (n a b)\n  (loop for k in (filter-sum n a b)\n        sum (car k)))\n\n(let ((n (read)) (a (read)) (b (read)))\n  (format t \"~a~%\" (answer n a b)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 694, "cpu_time_ms": 150, "memory_kb": 16100}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s191940564", "group_id": "codeNet:p03493", "input_text": "(format t \"~A~%\" (loop for s across (read-line)\n      count (eq s #\\1)))", "language": "Lisp", "metadata": {"date": 1590888712, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s191940564.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s191940564", "user_id": "u448702251"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(format t \"~A~%\" (loop for s across (read-line)\n      count (eq s #\\1)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 72, "cpu_time_ms": 15, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s890314722", "group_id": "codeNet:p03493", "input_text": "(defun placing-marbles (s)\n  (let ((counter 0))\n    (loop :for c :across s\n          :do (if (string= c \"1\") (incf counter)))\n    counter))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "language": "Lisp", "metadata": {"date": 1587759541, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s890314722.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s890314722", "user_id": "u425762225"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun placing-marbles (s)\n  (let ((counter 0))\n    (loop :for c :across s\n          :do (if (string= c \"1\") (incf counter)))\n    counter))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 164, "memory_kb": 12388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s304597385", "group_id": "codeNet:p03493", "input_text": "(defun placing-marbles (s)\n  (loop :for c :across s\n        :count (char= c #\\1)))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "language": "Lisp", "metadata": {"date": 1587759506, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s304597385.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s304597385", "user_id": "u425762225"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun placing-marbles (s)\n  (loop :for c :across s\n        :count (char= c #\\1)))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 131, "cpu_time_ms": 157, "memory_kb": 12644}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s416667724", "group_id": "codeNet:p03493", "input_text": "(defun placing-marbles (s)\n  (loop :for c\n        :across s\n        :count (=string c \"1\")))\n \n(format t \"~A~%\" (placing-marbles (read-line)))(defun placing-marbles (s)\n  (loop :for c\n        :across s\n        :count (=char c #\\1)))\n \n(format t \"~A~%\" (placing-marbles (read-line)))", "language": "Lisp", "metadata": {"date": 1587759330, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s416667724.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s416667724", "user_id": "u425762225"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun placing-marbles (s)\n  (loop :for c\n        :across s\n        :count (=string c \"1\")))\n \n(format t \"~A~%\" (placing-marbles (read-line)))(defun placing-marbles (s)\n  (loop :for c\n        :across s\n        :count (=char c #\\1)))\n \n(format t \"~A~%\" (placing-marbles (read-line)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 282, "cpu_time_ms": 179, "memory_kb": 13792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s951201213", "group_id": "codeNet:p03493", "input_text": "(defun placing-marbles ()\n  (let ((s (read-line))\n        (counter 0))\n    (loop for i across s\n       do (if (string= i \"1\") (incf counter)))\n    counter))\n\n(format t \"~D~%\" (placing-marbles))", "language": "Lisp", "metadata": {"date": 1583776063, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s951201213.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s951201213", "user_id": "u091381267"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun placing-marbles ()\n  (let ((s (read-line))\n        (counter 0))\n    (loop for i across s\n       do (if (string= i \"1\") (incf counter)))\n    counter))\n\n(format t \"~D~%\" (placing-marbles))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 193, "cpu_time_ms": 25, "memory_kb": 4452}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s098463841", "group_id": "codeNet:p03493", "input_text": "(defun placing-marbles (s)\n  (let ((counter 0))\n    (loop :for c :across s\n          :do (if (string= c \"1\") (incf counter)))\n    counter))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "language": "Lisp", "metadata": {"date": 1582562841, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s098463841.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s098463841", "user_id": "u324761590"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun placing-marbles (s)\n  (let ((counter 0))\n    (loop :for c :across s\n          :do (if (string= c \"1\") (incf counter)))\n    counter))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 128, "memory_kb": 12388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s079590055", "group_id": "codeNet:p03493", "input_text": "(princ (loop :for k :across (read-line) :count (char= #\\1 k)))", "language": "Lisp", "metadata": {"date": 1579654305, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s079590055.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s079590055", "user_id": "u610490393"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(princ (loop :for k :across (read-line) :count (char= #\\1 k)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 62, "cpu_time_ms": 31, "memory_kb": 4964}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s619079658", "group_id": "codeNet:p03493", "input_text": "(princ (count #\\1 (read-line)))\n", "language": "Lisp", "metadata": {"date": 1578292167, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s619079658.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s619079658", "user_id": "u245103825"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(princ (count #\\1 (read-line)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 32, "cpu_time_ms": 11, "memory_kb": 3168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s228068389", "group_id": "codeNet:p03493", "input_text": "(defun fun (s)\n  (loop :for c :across s\n     :count (char= c #\\1)))\n\n(format t \"~A~%\" (fun (read-line)))\n", "language": "Lisp", "metadata": {"date": 1576692134, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s228068389.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s228068389", "user_id": "u691380397"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun fun (s)\n  (loop :for c :across s\n     :count (char= c #\\1)))\n\n(format t \"~A~%\" (fun (read-line)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 105, "cpu_time_ms": 11, "memory_kb": 3560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s328206052", "group_id": "codeNet:p03493", "input_text": "(defun fun (s)\n  (loop :for c :across s\n     :count (char= c #\\1)))\n\n(format t \"~A~%\" (fun (read)))\n", "language": "Lisp", "metadata": {"date": 1576557859, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s328206052.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s328206052", "user_id": "u691380397"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun fun (s)\n  (loop :for c :across s\n     :count (char= c #\\1)))\n\n(format t \"~A~%\" (fun (read)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 100, "cpu_time_ms": 146, "memory_kb": 14312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s931312622", "group_id": "codeNet:p03493", "input_text": "(defun func (x)\n\t(if x\n\t\t(+\n\t\t\t(if (string= (car x) \"0\")\n\t\t\t\t0\n\t\t\t\t1)\n\t\t\t(func (cdr x)))\n\t\t0))\n\n(write (func (concatenate 'list (read-line))))\n", "language": "Lisp", "metadata": {"date": 1572098156, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s931312622.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s931312622", "user_id": "u493610446"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun func (x)\n\t(if x\n\t\t(+\n\t\t\t(if (string= (car x) \"0\")\n\t\t\t\t0\n\t\t\t\t1)\n\t\t\t(func (cdr x)))\n\t\t0))\n\n(write (func (concatenate 'list (read-line))))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 143, "cpu_time_ms": 115, "memory_kb": 10472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s820677377", "group_id": "codeNet:p03493", "input_text": "(defparameter N (read-line))\n\n(format t \"~a\" (count-if #'oddp\n                         (map 'list (lambda (x) (digit-char-p x 16)) \n                              N)))", "language": "Lisp", "metadata": {"date": 1564972942, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s820677377.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s820677377", "user_id": "u425317134"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defparameter N (read-line))\n\n(format t \"~a\" (count-if #'oddp\n                         (map 'list (lambda (x) (digit-char-p x 16)) \n                              N)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 166, "cpu_time_ms": 58, "memory_kb": 7136}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s332146968", "group_id": "codeNet:p03493", "input_text": "(defun placing-marbels (s)\n\t(let ((counter 0))\n\t\t(loop :for c :across s\n\t\t\t  :do (if (string= c \"1\") (incf counter)))\n\t\tcounter))\n\n(format t \"~A~%\" (placing-marbels (read-line)))", "language": "Lisp", "metadata": {"date": 1561233331, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s332146968.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s332146968", "user_id": "u347678565"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun placing-marbels (s)\n\t(let ((counter 0))\n\t\t(loop :for c :across s\n\t\t\t  :do (if (string= c \"1\") (incf counter)))\n\t\tcounter))\n\n(format t \"~A~%\" (placing-marbels (read-line)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 178, "cpu_time_ms": 54, "memory_kb": 6884}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s145992274", "group_id": "codeNet:p03493", "input_text": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n(deftype int32 () '(signed-byte 32))\n(deftype int64 () '(signed-byte 64))\n\n\n;;macros\n(defmacro println (n)\n  `(format t \"~a~%\" ,n))\n(defmacro vint-out (vec)\n  `(progn\n     (rep i (length ,vec)\n          (princ (vref ,vec i))\n          (princ \" \"))\n     (fresh-line)))\n(defmacro aif (test-form then-form &optional else-form)\n  `(let ((it ,test-form))\n     (if it ,then-form ,else-form)))\n\n;;vector\n(defmacro vec (type &optional (num 100) (val 0))\n  (let* ((g (gensym)))\n    `(let* ((,g ,num))\n       (make-array ,g :element-type ',type :initial-element ,val\n                   :adjustable nil :fill-pointer ,g))))\n\n(defmacro double-vec (type &optional (dim1 100) (dim2 100) (val 0))\n  `(make-array '(,dim1 ,dim2) :element-type ',type :initial-element ,val))\n\n(defmacro vint (&optional (num 0) (val 0))\n  `(vec int32 ,num ,val))\n\n(defmacro double-vec (type &optional (dim1 100) (dim2 100) (val 0))\n  `(make-array '(,dim1 ,dim2) :element-type ',type :initial-element ,val))\n\n(defmacro vref (vector pos &optional value)\n  (let ((g (gensym)))\n    `(let ((,g ,value))\n       (if ,g\n           (setf (aref ,vector ,pos) ,g)\n           (aref ,vector ,pos)))))\n\n(defmacro chvar (sym comp predicate)\n  (let ((g (gensym)))\n    `(let ((,g ,comp))\n       (if (or (null ,sym) (not (funcall ,predicate ,sym ,g)))\n           (setf ,sym ,g)))))\n\n(defmacro chmax (sym comp &optional (predicate #'>))\n  `(chvar ,sym ,comp ,predicate))\n\n(defmacro chmin (sym comp &optional (predicate #'<))\n  `(chvar ,sym ,comp ,predicate))\n\n(defmacro defchangef (name op default-val)\n  `(defmacro ,name (var &optional (val ,default-val))\n     `(setq ,var (,',op ,val ,var))))\n(defmacro read-str ()\n  `(write-to-string (read)))\n\n;;本体\n(defun ctoi (c)\n  (- (char-code c) (char-code #\\0)))\n(defun main()\n  (println (reduce #'+ (map 'list #'ctoi (read-str)))))\n\n#-swank(main)\n", "language": "Lisp", "metadata": {"date": 1559768976, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s145992274.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s145992274", "user_id": "u432998668"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print))))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n(deftype int32 () '(signed-byte 32))\n(deftype int64 () '(signed-byte 64))\n\n\n;;macros\n(defmacro println (n)\n  `(format t \"~a~%\" ,n))\n(defmacro vint-out (vec)\n  `(progn\n     (rep i (length ,vec)\n          (princ (vref ,vec i))\n          (princ \" \"))\n     (fresh-line)))\n(defmacro aif (test-form then-form &optional else-form)\n  `(let ((it ,test-form))\n     (if it ,then-form ,else-form)))\n\n;;vector\n(defmacro vec (type &optional (num 100) (val 0))\n  (let* ((g (gensym)))\n    `(let* ((,g ,num))\n       (make-array ,g :element-type ',type :initial-element ,val\n                   :adjustable nil :fill-pointer ,g))))\n\n(defmacro double-vec (type &optional (dim1 100) (dim2 100) (val 0))\n  `(make-array '(,dim1 ,dim2) :element-type ',type :initial-element ,val))\n\n(defmacro vint (&optional (num 0) (val 0))\n  `(vec int32 ,num ,val))\n\n(defmacro double-vec (type &optional (dim1 100) (dim2 100) (val 0))\n  `(make-array '(,dim1 ,dim2) :element-type ',type :initial-element ,val))\n\n(defmacro vref (vector pos &optional value)\n  (let ((g (gensym)))\n    `(let ((,g ,value))\n       (if ,g\n           (setf (aref ,vector ,pos) ,g)\n           (aref ,vector ,pos)))))\n\n(defmacro chvar (sym comp predicate)\n  (let ((g (gensym)))\n    `(let ((,g ,comp))\n       (if (or (null ,sym) (not (funcall ,predicate ,sym ,g)))\n           (setf ,sym ,g)))))\n\n(defmacro chmax (sym comp &optional (predicate #'>))\n  `(chvar ,sym ,comp ,predicate))\n\n(defmacro chmin (sym comp &optional (predicate #'<))\n  `(chvar ,sym ,comp ,predicate))\n\n(defmacro defchangef (name op default-val)\n  `(defmacro ,name (var &optional (val ,default-val))\n     `(setq ,var (,',op ,val ,var))))\n(defmacro read-str ()\n  `(write-to-string (read)))\n\n;;本体\n(defun ctoi (c)\n  (- (char-code c) (char-code #\\0)))\n(defun main()\n  (println (reduce #'+ (map 'list #'ctoi (read-str)))))\n\n#-swank(main)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2134, "cpu_time_ms": 155, "memory_kb": 19424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s319910563", "group_id": "codeNet:p03493", "input_text": ";; 写経\n(defun placing-marbles (s)\n  (let ((counter 0))\n    (loop :for c :across s\n\t  :do (if (string= c \"1\") (incf counter)))\n    counter))\n\n(defun placing-marbles2 (s)\n  (loop :for c :across s\n\t:count (char= c #\\1)))\n\n\n(format t \"~a~%\" (placing-marbles2 (read-line)))\n", "language": "Lisp", "metadata": {"date": 1556044569, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s319910563.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s319910563", "user_id": "u839737417"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": ";; 写経\n(defun placing-marbles (s)\n  (let ((counter 0))\n    (loop :for c :across s\n\t  :do (if (string= c \"1\") (incf counter)))\n    counter))\n\n(defun placing-marbles2 (s)\n  (loop :for c :across s\n\t:count (char= c #\\1)))\n\n\n(format t \"~a~%\" (placing-marbles2 (read-line)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 272, "cpu_time_ms": 154, "memory_kb": 13668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s184467524", "group_id": "codeNet:p03493", "input_text": "(defun placing-marbles (s)\n  (count #\\1 (read-line)))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "language": "Lisp", "metadata": {"date": 1546538619, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s184467524.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s184467524", "user_id": "u711147786"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun placing-marbles (s)\n  (count #\\1 (read-line)))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 102, "cpu_time_ms": 78, "memory_kb": 8288}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s123570662", "group_id": "codeNet:p03493", "input_text": "(format t \"~A~%\" (count #\\1 (read-line)))", "language": "Lisp", "metadata": {"date": 1546391584, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s123570662.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s123570662", "user_id": "u711147786"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(format t \"~A~%\" (count #\\1 (read-line)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 41, "cpu_time_ms": 8, "memory_kb": 2916}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s766738820", "group_id": "codeNet:p03493", "input_text": "(defun count_one (str index)\n  (if (<= (length str) index) 0\n    (if (equal (elt str index) #\\0) \n      (count_one str (+ index 1))\n      (+ 1 (count_one str (+ index 1)))\n      )))\n\n(format t \"~A~%\" (count_one (read-line) 0))\n", "language": "Lisp", "metadata": {"date": 1524339650, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s766738820.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s766738820", "user_id": "u605917063"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun count_one (str index)\n  (if (<= (length str) index) 0\n    (if (equal (elt str index) #\\0) \n      (count_one str (+ index 1))\n      (+ 1 (count_one str (+ index 1)))\n      )))\n\n(format t \"~A~%\" (count_one (read-line) 0))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 227, "cpu_time_ms": 396, "memory_kb": 12388}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s764301678", "group_id": "codeNet:p03493", "input_text": "(defun placing-marbles (s)\n  (loop :for c :across s\n        :count (char= c #\\1)))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "language": "Lisp", "metadata": {"date": 1521982787, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s764301678.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s764301678", "user_id": "u711147786"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun placing-marbles (s)\n  (loop :for c :across s\n        :count (char= c #\\1)))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 131, "cpu_time_ms": 279, "memory_kb": 24676}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s269502101", "group_id": "codeNet:p03493", "input_text": "(defun placing-marbles (s)\n  (let ((counter 0))\n    (loop :for c :across s\n          :do (if (string= c \"1\") (incf counter)))\n    counter))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "language": "Lisp", "metadata": {"date": 1521663284, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s269502101.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s269502101", "user_id": "u711147786"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(defun placing-marbles (s)\n  (let ((counter 0))\n    (loop :for c :across s\n          :do (if (string= c \"1\") (incf counter)))\n    counter))\n\n(format t \"~A~%\" (placing-marbles (read-line)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 29, "memory_kb": 4708}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s622090697", "group_id": "codeNet:p03493", "input_text": "(setq a (read))\n(setq b (+ (truncate (/ a 100)) (mod (truncate (/ a 10)) 10) (mod a 10)))\n(print b)", "language": "Lisp", "metadata": {"date": 1515363471, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s622090697.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s622090697", "user_id": "u648138491"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(setq a (read))\n(setq b (+ (truncate (/ a 100)) (mod (truncate (/ a 10)) 10) (mod a 10)))\n(print b)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 99, "cpu_time_ms": 26, "memory_kb": 4836}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s779944636", "group_id": "codeNet:p03493", "input_text": "(let ((s (read-line)))\n  (format t \"~A~%\"\n          (loop for ch across s sum (- (char-code ch)\n                                       (char-code #\\0)))))", "language": "Lisp", "metadata": {"date": 1512957970, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Lisp/s779944636.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s779944636", "user_id": "u275710783"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(let ((s (read-line)))\n  (format t \"~A~%\"\n          (loop for ch across s sum (- (char-code ch)\n                                       (char-code #\\0)))))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 154, "cpu_time_ms": 437, "memory_kb": 12648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s993565049", "group_id": "codeNet:p03565", "input_text": "(let* ((n (read-line))\n       (s (read-line))\n       (a nil))\n  (defun f-equal (a b)\n    (reduce (lambda (x y) (and x y))\n            (map 'list (lambda (x y) (if (char= #\\? x)\n                                               t (char= x y))) a b)))\n  (setf a (position t (loop :for k :from 0 :to (- (length n) (length s)) :collect (f-equal (subseq n k (+ k (length s))) s)) :from-end t))\n  (if a\n      (princ (map 'string (lambda (k) (if (char= #\\? k) #\\a k)) (concatenate 'string (subseq n 0 a) s (subseq n (+ a (length s)))) ))\n      (princ \"UNRESTORABLE\")))", "language": "Lisp", "metadata": {"date": 1567479116, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Lisp/s993565049.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s993565049", "user_id": "u610490393"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "(let* ((n (read-line))\n       (s (read-line))\n       (a nil))\n  (defun f-equal (a b)\n    (reduce (lambda (x y) (and x y))\n            (map 'list (lambda (x y) (if (char= #\\? x)\n                                               t (char= x y))) a b)))\n  (setf a (position t (loop :for k :from 0 :to (- (length n) (length s)) :collect (f-equal (subseq n k (+ k (length s))) s)) :from-end t))\n  (if a\n      (princ (map 'string (lambda (k) (if (char= #\\? k) #\\a k)) (concatenate 'string (subseq n 0 a) s (subseq n (+ a (length s)))) ))\n      (princ \"UNRESTORABLE\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 558, "cpu_time_ms": 210, "memory_kb": 17380}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s449981713", "group_id": "codeNet:p03574", "input_text": "(let* ((h (read))\n    (w (read))\n    (s (make-array (list (+ h 2) (+ w 2)) :initial-element \"0\")))\n\n    (loop for i below h do\n        (let ((a (read-line)))\n            (loop for j below w do\n                (setf (aref s (+ i 1) (+ j 1)) (char a j))\n            )\n        )\n    )\n    (loop for i from 1 to h do\n        (loop for j from 1 to w do\n            (let ((ans 0))\n                (if (string= (aref s i j) \".\")\n                    (progn\n                        (loop for k from (- i 1) to (+ i 1) do\n                            (loop for l from (- j 1) to (+ j 1) do\n                                (if (string= (aref s k l) \"#\")\n                                    (incf ans)\n                                )\n                            )\n                        )\n                        (format t \"~D\" ans)\n                    )\n                    (format t \"#\")\n                )\n            )\n        )\n        (format t \"~%\")\n    )\n)", "language": "Lisp", "metadata": {"date": 1598652041, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Lisp/s449981713.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s449981713", "user_id": "u136500538"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "(let* ((h (read))\n    (w (read))\n    (s (make-array (list (+ h 2) (+ w 2)) :initial-element \"0\")))\n\n    (loop for i below h do\n        (let ((a (read-line)))\n            (loop for j below w do\n                (setf (aref s (+ i 1) (+ j 1)) (char a j))\n            )\n        )\n    )\n    (loop for i from 1 to h do\n        (loop for j from 1 to w do\n            (let ((ans 0))\n                (if (string= (aref s i j) \".\")\n                    (progn\n                        (loop for k from (- i 1) to (+ i 1) do\n                            (loop for l from (- j 1) to (+ j 1) do\n                                (if (string= (aref s k l) \"#\")\n                                    (incf ans)\n                                )\n                            )\n                        )\n                        (format t \"~D\" ans)\n                    )\n                    (format t \"#\")\n                )\n            )\n        )\n        (format t \"~%\")\n    )\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 953, "cpu_time_ms": 19, "memory_kb": 25072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s845547084", "group_id": "codeNet:p03574", "input_text": "(defun split (x str)\n  (let ((size (length x))\n\t(retval nil))\n    (loop\n       :with pos = (search x str)\n       :if pos\n       :do\n\t (push (subseq str 0 pos) retval)\n\t (setq str (subseq str (+ size pos)))\n\t (setq pos (search x str))\n       :else\n       :do (return (reverse (push str retval))))))\n\n(defun numbers-by-readline ()\n  (mapcar #'parse-integer (split \" \" (read-line))))\n\n(defconstant blank 0)\n(defconstant mine 1)\n\n(defun neighbors (pos w)\n  (remove-if #'null\n\t     (list (if (= (mod pos w) 0) nil (- pos w 1))\n\t\t   (- pos w)\n\t\t   (if (= (mod pos w) (1- w)) nil (- pos w -1))\n\t\t   (if (= (mod pos w) 0) nil (- pos 1))\n\t\t   (if (= (mod pos w) (1- w)) nil (+ pos 1))\n\t\t   (if (= (mod pos w) 0) nil (+ pos w -1))\n\t\t   (+ pos w)\n\t\t   (if (= (mod pos w) (1- w)) nil (+ pos w 1)))))\n\n(defun full-inputs ()\n  (let ((size (numbers-by-readline)))\n    (values\n     size\n     (format nil \"~{~A~}\" (loop :repeat (car size) :collect (read-line))))))\n\n(defun find-mine (board w)\n  (loop\n     :for i :below (length board)\n     :collect\n       (if (equal (aref board i) #\\#)\n\t   #\\#\n\t   (mapcar #'(lambda (x)\n\t\t       (if (equal (aref board x) #\\#)\n\t\t\t   mine\n\t\t\t   blank))\n\t\t   (remove-if #'(lambda (x)\n\t\t\t\t  (or (< x 0) (>= x (length board))))\n\t\t\t      (neighbors i w))))))\n\n(defun reshape (l)\n  (mapcar #'(lambda (x)\n\t      (if (listp x)\n\t\t  (reduce #'+ x)\n\t\t  x))\n\t  l))\n\n(defun show-result (s w)\n  (labels ((f (w)\n\t     (concatenate 'string \"~{~<~%~,\" (princ-to-string w) \":;~A~>~}\")))\n    (format t (f w) s)))\n\n(defun mine-sweeper ()\n  (multiple-value-bind (s b) (full-inputs)\n    (show-result (reshape (find-mine b (cadr s))) (cadr s))))\n\n(mine-sweeper)", "language": "Lisp", "metadata": {"date": 1596246307, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Lisp/s845547084.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s845547084", "user_id": "u916630177"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "(defun split (x str)\n  (let ((size (length x))\n\t(retval nil))\n    (loop\n       :with pos = (search x str)\n       :if pos\n       :do\n\t (push (subseq str 0 pos) retval)\n\t (setq str (subseq str (+ size pos)))\n\t (setq pos (search x str))\n       :else\n       :do (return (reverse (push str retval))))))\n\n(defun numbers-by-readline ()\n  (mapcar #'parse-integer (split \" \" (read-line))))\n\n(defconstant blank 0)\n(defconstant mine 1)\n\n(defun neighbors (pos w)\n  (remove-if #'null\n\t     (list (if (= (mod pos w) 0) nil (- pos w 1))\n\t\t   (- pos w)\n\t\t   (if (= (mod pos w) (1- w)) nil (- pos w -1))\n\t\t   (if (= (mod pos w) 0) nil (- pos 1))\n\t\t   (if (= (mod pos w) (1- w)) nil (+ pos 1))\n\t\t   (if (= (mod pos w) 0) nil (+ pos w -1))\n\t\t   (+ pos w)\n\t\t   (if (= (mod pos w) (1- w)) nil (+ pos w 1)))))\n\n(defun full-inputs ()\n  (let ((size (numbers-by-readline)))\n    (values\n     size\n     (format nil \"~{~A~}\" (loop :repeat (car size) :collect (read-line))))))\n\n(defun find-mine (board w)\n  (loop\n     :for i :below (length board)\n     :collect\n       (if (equal (aref board i) #\\#)\n\t   #\\#\n\t   (mapcar #'(lambda (x)\n\t\t       (if (equal (aref board x) #\\#)\n\t\t\t   mine\n\t\t\t   blank))\n\t\t   (remove-if #'(lambda (x)\n\t\t\t\t  (or (< x 0) (>= x (length board))))\n\t\t\t      (neighbors i w))))))\n\n(defun reshape (l)\n  (mapcar #'(lambda (x)\n\t      (if (listp x)\n\t\t  (reduce #'+ x)\n\t\t  x))\n\t  l))\n\n(defun show-result (s w)\n  (labels ((f (w)\n\t     (concatenate 'string \"~{~<~%~,\" (princ-to-string w) \":;~A~>~}\")))\n    (format t (f w) s)))\n\n(defun mine-sweeper ()\n  (multiple-value-bind (s b) (full-inputs)\n    (show-result (reshape (find-mine b (cadr s))) (cadr s))))\n\n(mine-sweeper)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1655, "cpu_time_ms": 23, "memory_kb": 28920}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s578663882", "group_id": "codeNet:p03574", "input_text": "(defparameter *dx-dy*\n  '((-1 . -1)\n    (-1 . 0)\n    (-1 . 1)\n    (0 . -1)\n    (0 . 1)\n    (1 . -1)\n    (1 . 0)\n    (1 . 1)))\n\n\n\n(defun solve (h w board)\n  (declare (optimize speed))\n  (labels ((count-mine (y x board &optional (cnt 0))\n             (dotimes (d 8 cnt)\n               (let ((nx (+ x (first (nth d *dx-dy*))))\n                     (ny (+ y (rest (nth d *dx-dy*)))))\n                 (when (and (<= 0 nx (1- w))\n                            (<= 0 ny (1- h))\n                            (char-equal (aref (aref board ny) nx) #\\#))\n                   (incf cnt))))))\n    (dotimes (i h)\n      (dotimes (j w)\n        (unless (char-equal (aref (aref board i) j) #\\#)\n          (setf (aref (aref board i) j) (digit-char (count-mine i j board))))))\n    board))\n\n(defun main ()\n  (declare (optimize speed))\n  (let* ((h (read))\n         (w (read))\n         (board (make-array h :initial-element \"\")))\n    (dotimes (i h)\n      (setf (aref board i) (read-line)))\n    (let ((ans (solve h w board)))\n      (dotimes (i h)\n        (fresh-line)\n        (princ (aref ans i))))\n    (fresh-line)))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1594648591, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Lisp/s578663882.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s578663882", "user_id": "u425762225"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "(defparameter *dx-dy*\n  '((-1 . -1)\n    (-1 . 0)\n    (-1 . 1)\n    (0 . -1)\n    (0 . 1)\n    (1 . -1)\n    (1 . 0)\n    (1 . 1)))\n\n\n\n(defun solve (h w board)\n  (declare (optimize speed))\n  (labels ((count-mine (y x board &optional (cnt 0))\n             (dotimes (d 8 cnt)\n               (let ((nx (+ x (first (nth d *dx-dy*))))\n                     (ny (+ y (rest (nth d *dx-dy*)))))\n                 (when (and (<= 0 nx (1- w))\n                            (<= 0 ny (1- h))\n                            (char-equal (aref (aref board ny) nx) #\\#))\n                   (incf cnt))))))\n    (dotimes (i h)\n      (dotimes (j w)\n        (unless (char-equal (aref (aref board i) j) #\\#)\n          (setf (aref (aref board i) j) (digit-char (count-mine i j board))))))\n    board))\n\n(defun main ()\n  (declare (optimize speed))\n  (let* ((h (read))\n         (w (read))\n         (board (make-array h :initial-element \"\")))\n    (dotimes (i h)\n      (setf (aref board i) (read-line)))\n    (let ((ans (solve h w board)))\n      (dotimes (i h)\n        (fresh-line)\n        (princ (aref ans i))))\n    (fresh-line)))\n\n(main)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1099, "cpu_time_ms": 18, "memory_kb": 24556}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s352792581", "group_id": "codeNet:p03574", "input_text": "(defparameter *dx-dy*\n  '((-1 . -1)\n    (-1 . 0)\n    (-1 . 1)\n    (0 . -1)\n    (0 . 1)\n    (1 . -1)\n    (1 . 0)\n    (1 . 1)))\n\n\n\n(defun solve (h w board)\n  (labels ((count-mine (y x board &optional (cnt 0))\n             (dotimes (d 8 cnt)\n               (let ((nx (+ x (first (nth d *dx-dy*))))\n                     (ny (+ y (rest (nth d *dx-dy*)))))\n                 (when (and (<= 0 nx (1- w))\n                            (<= 0 ny (1- h))\n                            (char-equal (aref (aref board ny) nx) #\\#))\n                   (incf cnt))))))\n    (dotimes (i h)\n      (dotimes (j w)\n        (unless (char-equal (aref (aref board i) j) #\\#)\n          (setf (aref (aref board i) j) (digit-char (count-mine i j board))))))\n    board))\n\n(defun main ()\n  (let* ((h (read))\n         (w (read))\n         (board (make-array h :initial-element \"\")))\n    (dotimes (i h)\n      (setf (aref board i) (read-line)))\n    (let ((ans (solve h w board)))\n      (dotimes (i h)\n        (fresh-line)\n        (princ (aref ans i))))\n    (fresh-line)))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1594648279, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Lisp/s352792581.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s352792581", "user_id": "u425762225"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "(defparameter *dx-dy*\n  '((-1 . -1)\n    (-1 . 0)\n    (-1 . 1)\n    (0 . -1)\n    (0 . 1)\n    (1 . -1)\n    (1 . 0)\n    (1 . 1)))\n\n\n\n(defun solve (h w board)\n  (labels ((count-mine (y x board &optional (cnt 0))\n             (dotimes (d 8 cnt)\n               (let ((nx (+ x (first (nth d *dx-dy*))))\n                     (ny (+ y (rest (nth d *dx-dy*)))))\n                 (when (and (<= 0 nx (1- w))\n                            (<= 0 ny (1- h))\n                            (char-equal (aref (aref board ny) nx) #\\#))\n                   (incf cnt))))))\n    (dotimes (i h)\n      (dotimes (j w)\n        (unless (char-equal (aref (aref board i) j) #\\#)\n          (setf (aref (aref board i) j) (digit-char (count-mine i j board))))))\n    board))\n\n(defun main ()\n  (let* ((h (read))\n         (w (read))\n         (board (make-array h :initial-element \"\")))\n    (dotimes (i h)\n      (setf (aref board i) (read-line)))\n    (let ((ans (solve h w board)))\n      (dotimes (i h)\n        (fresh-line)\n        (princ (aref ans i))))\n    (fresh-line)))\n\n(main)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1041, "cpu_time_ms": 20, "memory_kb": 24552}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s771588513", "group_id": "codeNet:p03574", "input_text": "(defun get-input-array-string (n)\n  (let ((input-array (make-array n)))\n    (dotimes (i n)\n      (setf (aref input-array i) (read-line)))\n    input-array))\n\n(defun main (h w)\n  (let* ((rst 0)\n         (input-array (get-input-array-string h)))\n    (loop for x from 0 to (- h 1)\n          do (loop for y from 0 to (- w 1)\n                   do (setf rst 0)\n                   if (string= (aref (aref input-array x) y) #\\.)\n                   do (progn (loop for dx from (- x 1) to (+ x 1)\n                                   do (loop for dy from (- y 1) to (+ y 1)\n                                            if (and (>= dx 0) (<= dx (- h 1)) (>= dy 0) (<= dy (- w 1)))\n                                            do (progn (if (string= (aref (aref input-array dx) dy) #\\#)\n                                                          (incf rst)))))\n                        (setf (aref (aref input-array x) y) \n                              (aref (write-to-string rst) 0)))\n                   ))\n    input-array))\n\n  (let* ((h (read))\n         (result (main h (read))))\n    (dotimes (i h)\n      (format t \"~A~%\" (aref result i))))\n", "language": "Lisp", "metadata": {"date": 1579402542, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Lisp/s771588513.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s771588513", "user_id": "u237057875"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "(defun get-input-array-string (n)\n  (let ((input-array (make-array n)))\n    (dotimes (i n)\n      (setf (aref input-array i) (read-line)))\n    input-array))\n\n(defun main (h w)\n  (let* ((rst 0)\n         (input-array (get-input-array-string h)))\n    (loop for x from 0 to (- h 1)\n          do (loop for y from 0 to (- w 1)\n                   do (setf rst 0)\n                   if (string= (aref (aref input-array x) y) #\\.)\n                   do (progn (loop for dx from (- x 1) to (+ x 1)\n                                   do (loop for dy from (- y 1) to (+ y 1)\n                                            if (and (>= dx 0) (<= dx (- h 1)) (>= dy 0) (<= dy (- w 1)))\n                                            do (progn (if (string= (aref (aref input-array dx) dy) #\\#)\n                                                          (incf rst)))))\n                        (setf (aref (aref input-array x) y) \n                              (aref (write-to-string rst) 0)))\n                   ))\n    input-array))\n\n  (let* ((h (read))\n         (result (main h (read))))\n    (dotimes (i h)\n      (format t \"~A~%\" (aref result i))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1125, "cpu_time_ms": 171, "memory_kb": 19296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s934607802", "group_id": "codeNet:p03574", "input_text": "(let* ((n (read))\n       (m (read))\n       (lst (make-array (list n m) :initial-contents (loop :repeat n :collect (concatenate 'list (read-line)))))\n       (ans (make-array (list n m) :initial-element 0)))\n  (defun accessor (x y)\n    (if (and (<= 0 x (1- n)) (<= 0 y (1- m)))\n        (if (char= #\\. (aref lst x y))\n            (incf (aref ans x y))\n            (setf (aref ans x y) #\\#))))\n  (loop :for y :from 0 :upto (1- m)\n        :do(loop :for x :from 0 :upto (1- n) :do(if (char= #\\# (aref lst x y))\n                                               (loop :for p :from (1- y) :upto (1+ y)\n                                                     :do(loop :for q :from (1- x) :upto (1+ x) :do(accessor q p))))))\n  (loop :for x :from 0 :upto (1- n) :do(loop :for y :from 0 :upto (1- m) :do(princ (aref ans x y))) :do (format t \"~%\")))", "language": "Lisp", "metadata": {"date": 1558369583, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Lisp/s934607802.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s934607802", "user_id": "u610490393"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (lst (make-array (list n m) :initial-contents (loop :repeat n :collect (concatenate 'list (read-line)))))\n       (ans (make-array (list n m) :initial-element 0)))\n  (defun accessor (x y)\n    (if (and (<= 0 x (1- n)) (<= 0 y (1- m)))\n        (if (char= #\\. (aref lst x y))\n            (incf (aref ans x y))\n            (setf (aref ans x y) #\\#))))\n  (loop :for y :from 0 :upto (1- m)\n        :do(loop :for x :from 0 :upto (1- n) :do(if (char= #\\# (aref lst x y))\n                                               (loop :for p :from (1- y) :upto (1+ y)\n                                                     :do(loop :for q :from (1- x) :upto (1+ x) :do(accessor q p))))))\n  (loop :for x :from 0 :upto (1- n) :do(loop :for y :from 0 :upto (1- m) :do(princ (aref ans x y))) :do (format t \"~%\")))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 830, "cpu_time_ms": 196, "memory_kb": 20832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s693342951", "group_id": "codeNet:p03606", "input_text": "(defun read-list (x &optional ret)\n  (if (< x 1)\n    ret\n    (read-list (1- x) (cons (read) (cons (read) ret)))))\n\n(defun count-people (lst &optional (ans 0))\n  (if (null lst)\n    ans\n    (count-people (cddr lst) (+ (1+ (- (cadr lst) (car lst))) ans))))\n\n(let* ((n (read))\n       (l (read-list n)))\n\n  (format t \"~A~%\"\n          (count-people l)))\n", "language": "Lisp", "metadata": {"date": 1595198810, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03606.html", "problem_id": "p03606", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03606/input.txt", "sample_output_relpath": "derived/input_output/data/p03606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03606/Lisp/s693342951.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s693342951", "user_id": "u336541610"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "(defun read-list (x &optional ret)\n  (if (< x 1)\n    ret\n    (read-list (1- x) (cons (read) (cons (read) ret)))))\n\n(defun count-people (lst &optional (ans 0))\n  (if (null lst)\n    ans\n    (count-people (cddr lst) (+ (1+ (- (cadr lst) (car lst))) ans))))\n\n(let* ((n (read))\n       (l (read-list n)))\n\n  (format t \"~A~%\"\n          (count-people l)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "sample_input": "1\n24 30\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03606", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 348, "cpu_time_ms": 19, "memory_kb": 25348}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s357674553", "group_id": "codeNet:p03606", "input_text": "(defun read-list (x &optional ret)\n  (if (< x 1)\n    ret\n    (read-list (1- x) (cons (read) (cons (read) ret)))))\n\n(defun count-people (lst &optional (ans 0))\n  (if (null lst)\n    ans\n    (count-people (cddr lst) (+ (1+ (- (cadr lst) (car lst))) ans))))\n\n(let* ((n (read))\n       (l (read-list n)))\n\n  (format t \"~A~%\" l)\n\n  (format t \"~A~%\"\n          (count-people l)))\n", "language": "Lisp", "metadata": {"date": 1595198763, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03606.html", "problem_id": "p03606", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03606/input.txt", "sample_output_relpath": "derived/input_output/data/p03606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03606/Lisp/s357674553.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s357674553", "user_id": "u336541610"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "(defun read-list (x &optional ret)\n  (if (< x 1)\n    ret\n    (read-list (1- x) (cons (read) (cons (read) ret)))))\n\n(defun count-people (lst &optional (ans 0))\n  (if (null lst)\n    ans\n    (count-people (cddr lst) (+ (1+ (- (cadr lst) (car lst))) ans))))\n\n(let* ((n (read))\n       (l (read-list n)))\n\n  (format t \"~A~%\" l)\n\n  (format t \"~A~%\"\n          (count-people l)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "sample_input": "1\n24 30\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03606", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 371, "cpu_time_ms": 22, "memory_kb": 25476}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s571549752", "group_id": "codeNet:p03606", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n\t:unix-status\n\t(process-exit-code\n\t  (run-program *runtime-pathname*\n\t\t\t\t   `(\"--control-stack-size\" \"128MB\"\n\t\t\t\t\t \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n\t\t\t\t\t \"--eval\" \"(push :child-sbcl *features*)\"\n\t\t\t\t\t \"--script\" ,(namestring *load-pathname*))\n\t\t\t\t   :output t :error t :input t))))\n\n(let ((n (read)))\n  (princ (loop repeat n sum (- 1 (- (read) (read))))))\n", "language": "Lisp", "metadata": {"date": 1579985980, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03606.html", "problem_id": "p03606", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03606/input.txt", "sample_output_relpath": "derived/input_output/data/p03606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03606/Lisp/s571549752.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s571549752", "user_id": "u493610446"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n\t:unix-status\n\t(process-exit-code\n\t  (run-program *runtime-pathname*\n\t\t\t\t   `(\"--control-stack-size\" \"128MB\"\n\t\t\t\t\t \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n\t\t\t\t\t \"--eval\" \"(push :child-sbcl *features*)\"\n\t\t\t\t\t \"--script\" ,(namestring *load-pathname*))\n\t\t\t\t   :output t :error t :input t))))\n\n(let ((n (read)))\n  (princ (loop repeat n sum (- 1 (- (read) (read))))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "sample_input": "1\n24 30\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03606", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 455, "cpu_time_ms": 140, "memory_kb": 18356}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s579793399", "group_id": "codeNet:p03606", "input_text": "(princ (loop :repeat (read) :sum (+ (* -1 (read)) (read) 1)))", "language": "Lisp", "metadata": {"date": 1552929298, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03606.html", "problem_id": "p03606", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03606/input.txt", "sample_output_relpath": "derived/input_output/data/p03606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03606/Lisp/s579793399.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s579793399", "user_id": "u610490393"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "(princ (loop :repeat (read) :sum (+ (* -1 (read)) (read) 1)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "sample_input": "1\n24 30\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03606", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 61, "cpu_time_ms": 188, "memory_kb": 15328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s870198589", "group_id": "codeNet:p03606", "input_text": "(let* ((n (read))\n       (total 0))\n  (dotimes (i n)\n    (incf total (1+ (abs (- (read) (read))))))\n  (format t \"~A~%\" total))\n", "language": "Lisp", "metadata": {"date": 1511281634, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03606.html", "problem_id": "p03606", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03606/input.txt", "sample_output_relpath": "derived/input_output/data/p03606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03606/Lisp/s870198589.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s870198589", "user_id": "u275710783"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "(let* ((n (read))\n       (total 0))\n  (dotimes (i n)\n    (incf total (1+ (abs (- (read) (read))))))\n  (format t \"~A~%\" total))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "sample_input": "1\n24 30\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03606", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 127, "cpu_time_ms": 130, "memory_kb": 15076}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s741570032", "group_id": "codeNet:p03606", "input_text": "(loop repeat (read)\n      sum (1+ (+ (- (read)) (read))) into ans\n      finally (format t \"~A~%\" ans))", "language": "Lisp", "metadata": {"date": 1505005624, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03606.html", "problem_id": "p03606", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03606/input.txt", "sample_output_relpath": "derived/input_output/data/p03606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03606/Lisp/s741570032.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s741570032", "user_id": "u140665374"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "(loop repeat (read)\n      sum (1+ (+ (- (read)) (read))) into ans\n      finally (format t \"~A~%\" ans))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "sample_input": "1\n24 30\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03606", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 102, "cpu_time_ms": 886, "memory_kb": 15840}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s575174747", "group_id": "codeNet:p03624", "input_text": "(let ((s (sort (remove-duplicates (concatenate 'list (read-line))\n                                  :test #'char=)\n               #'char-lessp))\n      (alp (concatenate 'list \"abcdefghijklmnopqrstuvwxyz\")))\n\n  (defun f (lst1 lst2)\n    (if (null lst2)\n      \"None\"\n      (if (null lst1)\n        (car lst2)\n        (if (not (char= (car lst1) (car lst2)))\n          (car lst2)\n          (f (cdr lst1) (cdr lst2))))))\n\n  (format t \"~A~%\"\n          (f s alp)))\n\n", "language": "Lisp", "metadata": {"date": 1595191120, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lisp/s575174747.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s575174747", "user_id": "u336541610"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "(let ((s (sort (remove-duplicates (concatenate 'list (read-line))\n                                  :test #'char=)\n               #'char-lessp))\n      (alp (concatenate 'list \"abcdefghijklmnopqrstuvwxyz\")))\n\n  (defun f (lst1 lst2)\n    (if (null lst2)\n      \"None\"\n      (if (null lst1)\n        (car lst2)\n        (if (not (char= (car lst1) (car lst2)))\n          (car lst2)\n          (f (cdr lst1) (cdr lst2))))))\n\n  (format t \"~A~%\"\n          (f s alp)))\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 457, "cpu_time_ms": 40, "memory_kb": 27296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s662284115", "group_id": "codeNet:p03624", "input_text": "(let ((s (sort (remove-duplicates (concatenate 'list (read-line))\n                                  :test #'char=)\n               #'char-lessp))\n      (alp (concatenate 'list \"abcdefghijklmnopqrstuvwxyz\")))\n\n\n  (defun f (lst1 lst2)\n    (if (null lst1)\n      \"None\"\n      (if (not (char= (car lst1) (car lst2)))\n        (car lst2)\n        (f (cdr lst1) (cdr lst2)))))\n\n  (format t \"~A~%\"\n          (f s alp)))\n\n", "language": "Lisp", "metadata": {"date": 1595190412, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lisp/s662284115.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s662284115", "user_id": "u336541610"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "(let ((s (sort (remove-duplicates (concatenate 'list (read-line))\n                                  :test #'char=)\n               #'char-lessp))\n      (alp (concatenate 'list \"abcdefghijklmnopqrstuvwxyz\")))\n\n\n  (defun f (lst1 lst2)\n    (if (null lst1)\n      \"None\"\n      (if (not (char= (car lst1) (car lst2)))\n        (car lst2)\n        (f (cdr lst1) (cdr lst2)))))\n\n  (format t \"~A~%\"\n          (f s alp)))\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 410, "cpu_time_ms": 43, "memory_kb": 27172}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s879644705", "group_id": "codeNet:p03624", "input_text": "(let ((lst (mapcar #'char-code (concatenate 'list (read-line)))))\n  (defun f (k)\n    (cond ((= k 123) (princ \"None\"))\n          (t (if (find k lst) (f (1+ k)) (princ (code-char k))))))\n  (f 97))", "language": "Lisp", "metadata": {"date": 1557158313, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lisp/s879644705.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s879644705", "user_id": "u610490393"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "(let ((lst (mapcar #'char-code (concatenate 'list (read-line)))))\n  (defun f (k)\n    (cond ((= k 123) (princ \"None\"))\n          (t (if (find k lst) (f (1+ k)) (princ (code-char k))))))\n  (f 97))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 194, "cpu_time_ms": 120, "memory_kb": 13280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s900175871", "group_id": "codeNet:p03624", "input_text": "(let((s(read-line))(c\"None\"))\n  (loop for i from 122 downto 97 do(if(find(code-char i)s)()(setq c(string(code-char i)))))\n  (princ c))", "language": "Lisp", "metadata": {"date": 1534852692, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lisp/s900175871.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s900175871", "user_id": "u657913472"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "(let((s(read-line))(c\"None\"))\n  (loop for i from 122 downto 97 do(if(find(code-char i)s)()(setq c(string(code-char i)))))\n  (princ c))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 134, "cpu_time_ms": 21, "memory_kb": 6372}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s686951561", "group_id": "codeNet:p03624", "input_text": "(defun alphabet-index (ch)\n  (- (char-code ch) (char-code #\\a)))\n\n(let ((s (read-line))\n      (seq (make-array 26 :initial-element nil)))\n  (dotimes (i (length s))\n    (let ((ch (char s i)))\n      (setf (aref seq (alphabet-index ch))\n            t)))\n  (loop for i from 0 below 26\n        unless (aref seq i) do\n        (format t \"~A~%\" (code-char (+ (char-code #\\a) i)))\n        (return)\n        finally (format t \"None~%\")))\n", "language": "Lisp", "metadata": {"date": 1511366674, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lisp/s686951561.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s686951561", "user_id": "u275710783"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "(defun alphabet-index (ch)\n  (- (char-code ch) (char-code #\\a)))\n\n(let ((s (read-line))\n      (seq (make-array 26 :initial-element nil)))\n  (dotimes (i (length s))\n    (let ((ch (char s i)))\n      (setf (aref seq (alphabet-index ch))\n            t)))\n  (loop for i from 0 below 26\n        unless (aref seq i) do\n        (format t \"~A~%\" (code-char (+ (char-code #\\a) i)))\n        (return)\n        finally (format t \"None~%\")))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 427, "cpu_time_ms": 147, "memory_kb": 17508}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s769644626", "group_id": "codeNet:p03624", "input_text": "(defun alphabet-index (ch)\n  (- (char-code ch) (char-code #\\a)))\n\n(let ((s (read-line))\n      (seq (make-array 26 :initial-element nil)))\n  (dotimes (i (length s))\n    (let ((ch (char s i)))\n      (setf (aref seq (alphabet-index ch))\n            t)))\n  (let ((end nil))\n    (loop until end\n          for i from 25 downto 0\n          when (aref seq i) do\n          (setf end i))\n    (loop for i from 0 below end\n          unless (aref seq i) do\n          (format t \"~A~%\" (code-char (+ (char-code #\\a) i)))\n          (return)\n          finally (format t \"None~%\"))))\n", "language": "Lisp", "metadata": {"date": 1511366569, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lisp/s769644626.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s769644626", "user_id": "u275710783"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "(defun alphabet-index (ch)\n  (- (char-code ch) (char-code #\\a)))\n\n(let ((s (read-line))\n      (seq (make-array 26 :initial-element nil)))\n  (dotimes (i (length s))\n    (let ((ch (char s i)))\n      (setf (aref seq (alphabet-index ch))\n            t)))\n  (let ((end nil))\n    (loop until end\n          for i from 25 downto 0\n          when (aref seq i) do\n          (setf end i))\n    (loop for i from 0 below end\n          unless (aref seq i) do\n          (format t \"~A~%\" (code-char (+ (char-code #\\a) i)))\n          (return)\n          finally (format t \"None~%\"))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 566, "cpu_time_ms": 176, "memory_kb": 17380}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s005933348", "group_id": "codeNet:p03624", "input_text": "(defun alphabet-index (ch)\n  (- (char-code ch) (char-code #\\a)))\n\n(let ((s (read-line))\n      (seq (make-array 26 :initial-element nil)))\n  (dotimes (i (length s))\n    (let ((ch (char s i)))\n      (setf (aref seq (alphabet-index ch))\n            t)))\n  (let ((start nil)\n        (end nil))\n    (loop until start\n          for i from 0 below 26\n          when (aref seq i) do\n          (setf start i))\n    (loop until end\n          for i from 25 downto 0\n          when (aref seq i) do\n          (setf end i))\n    (loop for i from start below end\n          unless (aref seq i) do\n          (format t \"~A~%\" (code-char (+ (char-code #\\a) i)))\n          (return)\n          finally (format t \"None~%\"))))\n", "language": "Lisp", "metadata": {"date": 1511365931, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lisp/s005933348.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s005933348", "user_id": "u275710783"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "(defun alphabet-index (ch)\n  (- (char-code ch) (char-code #\\a)))\n\n(let ((s (read-line))\n      (seq (make-array 26 :initial-element nil)))\n  (dotimes (i (length s))\n    (let ((ch (char s i)))\n      (setf (aref seq (alphabet-index ch))\n            t)))\n  (let ((start nil)\n        (end nil))\n    (loop until start\n          for i from 0 below 26\n          when (aref seq i) do\n          (setf start i))\n    (loop until end\n          for i from 25 downto 0\n          when (aref seq i) do\n          (setf end i))\n    (loop for i from start below end\n          unless (aref seq i) do\n          (format t \"~A~%\" (code-char (+ (char-code #\\a) i)))\n          (return)\n          finally (format t \"None~%\"))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 701, "cpu_time_ms": 185, "memory_kb": 17380}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s305436579", "group_id": "codeNet:p03624", "input_text": "(format t \"~A~%\" (let* ((S (coerce (read-line) 'list))\n                       (a (find-if-not (lambda (x)\n                                         (member x S))\n                                       (loop for n from 97 to 122\n                                             collect (code-char n)))))\n                      (if a\n                          a\n                          \"None\")))", "language": "Lisp", "metadata": {"date": 1504223176, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lisp/s305436579.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s305436579", "user_id": "u140665374"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "(format t \"~A~%\" (let* ((S (coerce (read-line) 'list))\n                       (a (find-if-not (lambda (x)\n                                         (member x S))\n                                       (loop for n from 97 to 122\n                                             collect (code-char n)))))\n                      (if a\n                          a\n                          \"None\")))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 389, "cpu_time_ms": 60, "memory_kb": 8424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s046187267", "group_id": "codeNet:p03624", "input_text": "(defun main ()\n  (let ((S (read-line))\n        (arr (make-array 26 :element-type 'fixnum))\n        (a-int (char-int #\\a)))\n    (loop for c across S do\n      (incf (aref arr (- (char-int c) a-int))))\n    (if (zerop (count-if #'zerop arr))\n        (format t \"None~%\")\n        (format t \"~A~%\" (code-char (+ (position-if #'zerop arr) a-int))))))\n\n(main)", "language": "Lisp", "metadata": {"date": 1503773840, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Lisp/s046187267.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s046187267", "user_id": "u876257701"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "(defun main ()\n  (let ((S (read-line))\n        (arr (make-array 26 :element-type 'fixnum))\n        (a-int (char-int #\\a)))\n    (loop for c across S do\n      (incf (aref arr (- (char-int c) a-int))))\n    (if (zerop (count-if #'zerop arr))\n        (format t \"None~%\")\n        (format t \"~A~%\" (code-char (+ (position-if #'zerop arr) a-int))))))\n\n(main)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 350, "cpu_time_ms": 171, "memory_kb": 18148}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s910455202", "group_id": "codeNet:p03705", "input_text": "(let ((n (read))\n    (a (read))\n    (b (read))\n    (ans 0))\n    (if (= a b)\n        (setq ans 1)\n        (if (and (< a b) (> n 1))\n            (setq ans (+ (* (- n 2) (- b a)) 1))\n        )\n    )\n    (format t \"~D~%\" ans)\n)", "language": "Lisp", "metadata": {"date": 1601385955, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lisp/s910455202.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s910455202", "user_id": "u136500538"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let ((n (read))\n    (a (read))\n    (b (read))\n    (ans 0))\n    (if (= a b)\n        (setq ans 1)\n        (if (and (< a b) (> n 1))\n            (setq ans (+ (* (- n 2) (- b a)) 1))\n        )\n    )\n    (format t \"~D~%\" ans)\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 223, "cpu_time_ms": 20, "memory_kb": 24244}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s108512537", "group_id": "codeNet:p03705", "input_text": "(let ((n (read))\n    (a (read))\n    (b (read))\n    (ans 0))\n    (if (= a b)\n        (setq ans 1)\n        (if (< a b)\n            (setq ans (+ (* (- n 2) (- b a)) 1))\n        )\n    )\n    (format t \"~D~%\" ans)\n)", "language": "Lisp", "metadata": {"date": 1601385892, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lisp/s108512537.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s108512537", "user_id": "u136500538"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let ((n (read))\n    (a (read))\n    (b (read))\n    (ans 0))\n    (if (= a b)\n        (setq ans 1)\n        (if (< a b)\n            (setq ans (+ (* (- n 2) (- b a)) 1))\n        )\n    )\n    (format t \"~D~%\" ans)\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 209, "cpu_time_ms": 18, "memory_kb": 24436}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s247042601", "group_id": "codeNet:p03705", "input_text": ";;; Utils (quoted from https://competitive12.blogspot.com/2020/03/common-lisp.html)\n\n\n;; Read fixnum\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n;; fast read-line\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n             ,(if (member :swank *features*)\n                  `(read-char ,in nil #\\Newline) ; on SLIME\n                `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n             (return (values ,buffer ,idx))))))\n\n\n;;; invoke child process\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n    :unix-status\n    (process-exit-code\n      (run-program *runtime-pathname*\n                   `(\"--control-stack-size\" \"128MB\"\n                     \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                     \"--eval\" \"(push :child-sbcl *features*)\"\n                     \"--script\" ,(namestring *load-pathname*))\n                                                                 :output t :error t :input t))))\n\n\n\n;-------------------\n; Write code here\n;-------------------\n\n\n\n(defun solve (n a b)\n  (if (> a b)\n      0\n      (if (= n 1)\n          (if (= a b)\n              1\n              0)\n          (let ((s_min (+ b (* (1- n) a)))\n                (s_max (+ a (* (1- n) b))))\n            (1+ (- s_max s_min))))))\n\n(defun main ()\n  (let ((n (read))\n        (a (read))\n        (b (read)))\n    (princ (solve n a b))\n    (fresh-line)))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1595683218, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Lisp/s247042601.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s247042601", "user_id": "u425762225"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": ";;; Utils (quoted from https://competitive12.blogspot.com/2020/03/common-lisp.html)\n\n\n;; Read fixnum\n\n(declaim (ftype (function * (values fixnum &optional)) read-fixnum))\n(defun read-fixnum (&optional (in *standard-input*))\n  (declare (inline read-byte)\n           #-swank (sb-kernel:ansi-stream in))\n  (macrolet ((%read-byte ()\n               `(the (unsigned-byte 8)\n                     #+swank (char-code (read-char in nil #\\Nul))\n                     #-swank (read-byte in nil 0))))\n    (let* ((minus nil)\n           (result (loop (let ((byte (%read-byte)))\n                           (cond ((<= 48 byte 57)\n                                  (return (- byte 48)))\n                                 ((zerop byte) ; #\\Nul\n                                  (error \"Read EOF or #\\Nul.\"))\n                                 ((= byte #.(char-code #\\-))\n                                  (setq minus t)))))))\n      (declare ((integer 0 #.most-positive-fixnum) result))\n      (loop\n        (let* ((byte (%read-byte)))\n          (if (<= 48 byte 57)\n              (setq result (+ (- byte 48) (the (integer 0 #.(floor most-positive-fixnum 10)) (* result 10))))\n              (return (if minus (- result) result))))))))\n\n;; fast read-line\n\n(defmacro buffered-read-line (&optional (buffer-size 30) (in '*standard-input*) (term-char #\\Space))\n  (let ((buffer (gensym))\n        (character (gensym))\n        (idx (gensym)))\n    `(let* ((,buffer (load-time-value (make-string ,buffer-size :element-type 'base-char))))\n       (declare (simple-base-string ,buffer)\n                (inline read-byte))\n       (loop for ,character of-type base-char =\n             ,(if (member :swank *features*)\n                  `(read-char ,in nil #\\Newline) ; on SLIME\n                `(code-char (read-byte ,in nil #.(char-code #\\Newline))))\n             for ,idx from 0\n             until (char= ,character #\\Newline)\n             do (setf (schar ,buffer ,idx) ,character)\n             finally (when (< ,idx ,buffer-size)\n                       (setf (schar ,buffer ,idx) ,term-char))\n             (return (values ,buffer ,idx))))))\n\n\n;;; invoke child process\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n    :unix-status\n    (process-exit-code\n      (run-program *runtime-pathname*\n                   `(\"--control-stack-size\" \"128MB\"\n                     \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                     \"--eval\" \"(push :child-sbcl *features*)\"\n                     \"--script\" ,(namestring *load-pathname*))\n                                                                 :output t :error t :input t))))\n\n\n\n;-------------------\n; Write code here\n;-------------------\n\n\n\n(defun solve (n a b)\n  (if (> a b)\n      0\n      (if (= n 1)\n          (if (= a b)\n              1\n              0)\n          (let ((s_min (+ b (* (1- n) a)))\n                (s_max (+ a (* (1- n) b))))\n            (1+ (- s_max s_min))))))\n\n(defun main ()\n  (let ((n (read))\n        (a (read))\n        (b (read)))\n    (princ (solve n a b))\n    (fresh-line)))\n\n(main)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3068, "cpu_time_ms": 33, "memory_kb": 25620}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s220158828", "group_id": "codeNet:p03714", "input_text": "(defun make-pq (alist)\n  (sort (copy-alist alist) (lambda (a b) (< (car a) (car b)))))\n\n(define-modify-macro insert-pq (pair)\n                     (lambda (pq pair) (sort (cons pair pq) (lambda (a b) (< (car a) (car b))))))\n\n(define-modify-macro remove-pq-aux () cdr)\n\n(defmacro remove-pq (pq)\n  `(let ((aux (copy-alist ,pq)))\n     (REMOVE-PQ-AUX ,pq)\n     (car aux)))\n\n(let* ((n (read))\n       (alen (* 3 n))\n       (seq (make-array alen :initial-contents (loop repeat alen collect (read))))\n       (ibpq (make-pq (loop for i from 0 below n\n                            for a = (aref seq i)\n                            collect (cons a a))))\n       (ispq (make-pq (loop for i from 0 below n\n                            for a = (aref seq (- alen i 1))\n                            collect (cons (- a) a))))\n       (res 0))\n  (setf res\n    (loop for k from 0 to n\n          with bpq = nil\n          with spq = nil do\n          (setq bpq (copy-alist ibpq)\n                spq (copy-alist ispq))\n          (dotimes (i k)\n            (let ((a (aref seq (1- (+ n k)))))\n              (insert-pq bpq `(,a . ,a))\n              (remove-pq bpq)))\n          (dotimes (i (- n k))\n            (let ((a (aref seq (- (- alen n 1) i))))\n              (insert-pq spq `(,(- a) . ,a))\n              (remove-pq spq)))\n          maximize (- (loop for (x . y) in bpq sum y)\n                      (loop for (x . y) in spq sum y))))\n  (format t \"~A~%\" res))", "language": "Lisp", "metadata": {"date": 1511806548, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lisp/s220158828.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s220158828", "user_id": "u275710783"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun make-pq (alist)\n  (sort (copy-alist alist) (lambda (a b) (< (car a) (car b)))))\n\n(define-modify-macro insert-pq (pair)\n                     (lambda (pq pair) (sort (cons pair pq) (lambda (a b) (< (car a) (car b))))))\n\n(define-modify-macro remove-pq-aux () cdr)\n\n(defmacro remove-pq (pq)\n  `(let ((aux (copy-alist ,pq)))\n     (REMOVE-PQ-AUX ,pq)\n     (car aux)))\n\n(let* ((n (read))\n       (alen (* 3 n))\n       (seq (make-array alen :initial-contents (loop repeat alen collect (read))))\n       (ibpq (make-pq (loop for i from 0 below n\n                            for a = (aref seq i)\n                            collect (cons a a))))\n       (ispq (make-pq (loop for i from 0 below n\n                            for a = (aref seq (- alen i 1))\n                            collect (cons (- a) a))))\n       (res 0))\n  (setf res\n    (loop for k from 0 to n\n          with bpq = nil\n          with spq = nil do\n          (setq bpq (copy-alist ibpq)\n                spq (copy-alist ispq))\n          (dotimes (i k)\n            (let ((a (aref seq (1- (+ n k)))))\n              (insert-pq bpq `(,a . ,a))\n              (remove-pq bpq)))\n          (dotimes (i (- n k))\n            (let ((a (aref seq (- (- alen n 1) i))))\n              (insert-pq spq `(,(- a) . ,a))\n              (remove-pq spq)))\n          maximize (- (loop for (x . y) in bpq sum y)\n                      (loop for (x . y) in spq sum y))))\n  (format t \"~A~%\" res))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1431, "cpu_time_ms": 2105, "memory_kb": 68004}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s882784819", "group_id": "codeNet:p03714", "input_text": "(defun make-pq (alist)\n  (sort (copy-alist alist) (lambda (a b) (< (car a) (car b)))))\n\n(define-modify-macro insert-pq (pair)\n                     (lambda (pq pair) (sort (cons pair pq) (lambda (a b) (< (car a) (car b))))))\n\n(define-modify-macro remove-pq-aux () cdr)\n\n(defmacro remove-pq (pq)\n  `(let ((aux (copy-alist ,pq)))\n     (REMOVE-PQ-AUX ,pq)\n     (car aux)))\n\n(let* ((n (read))\n       (alen (* 3 n))\n       (seq (make-array alen))\n       (res 0))\n  (dotimes (i alen) (setf (aref seq i) (read)))\n  (setf res\n    (loop for k from 0 to n\n          with bpq = nil\n          with spq = nil do\n          (setf bpq (make-pq nil)\n                spq (make-pq nil))\n          (dotimes (i n)\n            (let ((a (aref seq i)))\n              (insert-pq bpq `(,a . ,a))))\n          (dotimes (i n)\n            (let ((a (aref seq (- (1- alen) i))))\n              (insert-pq spq `(,(- a) . ,a))))\n          (dotimes (i k)\n            (let ((a (aref seq (1- (+ n k)))))\n              (insert-pq bpq `(,a . ,a))\n              (remove-pq bpq)))\n          (dotimes (i (- n k))\n            (let ((a (aref seq (- (- alen n 1) i))))\n              (insert-pq spq `(,(- a) . ,a))\n              (remove-pq spq)))\n          maximize (- (loop for (x . y) in bpq sum y)\n                      (loop for (x . y) in spq sum y))))\n  (format t \"~A~%\" res))", "language": "Lisp", "metadata": {"date": 1511805868, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Lisp/s882784819.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s882784819", "user_id": "u275710783"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(defun make-pq (alist)\n  (sort (copy-alist alist) (lambda (a b) (< (car a) (car b)))))\n\n(define-modify-macro insert-pq (pair)\n                     (lambda (pq pair) (sort (cons pair pq) (lambda (a b) (< (car a) (car b))))))\n\n(define-modify-macro remove-pq-aux () cdr)\n\n(defmacro remove-pq (pq)\n  `(let ((aux (copy-alist ,pq)))\n     (REMOVE-PQ-AUX ,pq)\n     (car aux)))\n\n(let* ((n (read))\n       (alen (* 3 n))\n       (seq (make-array alen))\n       (res 0))\n  (dotimes (i alen) (setf (aref seq i) (read)))\n  (setf res\n    (loop for k from 0 to n\n          with bpq = nil\n          with spq = nil do\n          (setf bpq (make-pq nil)\n                spq (make-pq nil))\n          (dotimes (i n)\n            (let ((a (aref seq i)))\n              (insert-pq bpq `(,a . ,a))))\n          (dotimes (i n)\n            (let ((a (aref seq (- (1- alen) i))))\n              (insert-pq spq `(,(- a) . ,a))))\n          (dotimes (i k)\n            (let ((a (aref seq (1- (+ n k)))))\n              (insert-pq bpq `(,a . ,a))\n              (remove-pq bpq)))\n          (dotimes (i (- n k))\n            (let ((a (aref seq (- (- alen n 1) i))))\n              (insert-pq spq `(,(- a) . ,a))\n              (remove-pq spq)))\n          maximize (- (loop for (x . y) in bpq sum y)\n                      (loop for (x . y) in spq sum y))))\n  (format t \"~A~%\" res))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1334, "cpu_time_ms": 2105, "memory_kb": 63876}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s789506329", "group_id": "codeNet:p03814", "input_text": "(let* ((s (concatenate 'list (read-line)))\n       (lst (member #\\A s))\n       (lst2 '()))\n\n  (loop for i from 0 to (1- (length lst))\n        if (char= (nth i lst) #\\Z) do (push (subseq lst 0 (1+ i)) lst2))\n\n  (format t \"~A~%\"\n          (apply #'max (mapcar #'length lst2))))\n", "language": "Lisp", "metadata": {"date": 1572497381, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lisp/s789506329.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s789506329", "user_id": "u336541610"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let* ((s (concatenate 'list (read-line)))\n       (lst (member #\\A s))\n       (lst2 '()))\n\n  (loop for i from 0 to (1- (length lst))\n        if (char= (nth i lst) #\\Z) do (push (subseq lst 0 (1+ i)) lst2))\n\n  (format t \"~A~%\"\n          (apply #'max (mapcar #'length lst2))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 275, "cpu_time_ms": 2124, "memory_kb": 942564}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s758486819", "group_id": "codeNet:p03814", "input_text": "(let ((a (read-line)))\n  (princ (length (subseq a (position #\\A a) (1+ (position #\\Z a :from-end t))))))", "language": "Lisp", "metadata": {"date": 1553759687, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lisp/s758486819.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s758486819", "user_id": "u610490393"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let ((a (read-line)))\n  (princ (length (subseq a (position #\\A a) (1+ (position #\\Z a :from-end t))))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 29, "memory_kb": 8424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s039097485", "group_id": "codeNet:p03814", "input_text": "(let ((s (read-line))\n      (a 300000)\n      (z 0))\n     (loop for i from 0 below (length s) do\n           (if (eq #\\A (char s i)) (setf a (min a i)))\n           (if (eq #\\Z (char s i)) (setf z (max z i))))\n     (princ (1+ (- z a))))", "language": "Lisp", "metadata": {"date": 1550807292, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lisp/s039097485.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s039097485", "user_id": "u994767958"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let ((s (read-line))\n      (a 300000)\n      (z 0))\n     (loop for i from 0 below (length s) do\n           (if (eq #\\A (char s i)) (setf a (min a i)))\n           (if (eq #\\Z (char s i)) (setf z (max z i))))\n     (princ (1+ (- z a))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 233, "cpu_time_ms": 105, "memory_kb": 12644}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s353538446", "group_id": "codeNet:p03814", "input_text": "(princ(1+(-(position #\\Z(setq s(read-line)):from-end t)(position #\\A s))))", "language": "Lisp", "metadata": {"date": 1535433153, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lisp/s353538446.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s353538446", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(princ(1+(-(position #\\Z(setq s(read-line)):from-end t)(position #\\A s))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 74, "cpu_time_ms": 80, "memory_kb": 8928}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s446856536", "group_id": "codeNet:p03814", "input_text": "(let ((string (read-line)))\n  (princ (length (subseq string\n\t\t\t (position #\\A string)\n\t\t\t (1+ (position #\\Z string :from-end t))))))", "language": "Lisp", "metadata": {"date": 1505019808, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lisp/s446856536.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s446856536", "user_id": "u158834201"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let ((string (read-line)))\n  (princ (length (subseq string\n\t\t\t (position #\\A string)\n\t\t\t (1+ (position #\\Z string :from-end t))))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 132, "cpu_time_ms": 30, "memory_kb": 8424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s170419589", "group_id": "codeNet:p03814", "input_text": "(format t \"~A~%\" (let ((s (read-line)))\n                   (1+ (- (position #\\Z s :from-end t)\n                          (position #\\A s)))))", "language": "Lisp", "metadata": {"date": 1504720473, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lisp/s170419589.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s170419589", "user_id": "u140665374"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(format t \"~A~%\" (let ((s (read-line)))\n                   (1+ (- (position #\\Z s :from-end t)\n                          (position #\\A s)))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 141, "cpu_time_ms": 138, "memory_kb": 10724}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s683671374", "group_id": "codeNet:p03814", "input_text": "(let* ((in (read-line))\n       (ap 0)\n       (zp (1- (length in))))\n  (loop while (not (eq (char in ap) #\\A))\n        do (incf ap))\n  (loop while (not (eq (char in zp) #\\Z))\n        do (decf zp))\n  (format t \"~A~%\" (1+ (- zp ap))))", "language": "Lisp", "metadata": {"date": 1485656807, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Lisp/s683671374.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s683671374", "user_id": "u275710783"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(let* ((in (read-line))\n       (ap 0)\n       (zp (1- (length in))))\n  (loop while (not (eq (char in ap) #\\A))\n        do (incf ap))\n  (loop while (not (eq (char in zp) #\\Z))\n        do (decf zp))\n  (format t \"~A~%\" (1+ (- zp ap))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 231, "cpu_time_ms": 723, "memory_kb": 10344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s232566049", "group_id": "codeNet:p03835", "input_text": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(let ((k (read))\n      (s (read)))\n\n  (declare (type fixnum k))\n  (declare (type fixnum s))\n\n  (format t \"~A~%\"\n          (loop for i from 0 to k\n                sum (loop for j from 0 to k\n                          count (and (>= (the fixnum (- s i j)) 0) (<= (the fixnum (- s i j)) k))))))\n", "language": "Lisp", "metadata": {"date": 1594680459, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lisp/s232566049.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s232566049", "user_id": "u336541610"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(let ((k (read))\n      (s (read)))\n\n  (declare (type fixnum k))\n  (declare (type fixnum s))\n\n  (format t \"~A~%\"\n          (loop for i from 0 to k\n                sum (loop for j from 0 to k\n                          count (and (>= (the fixnum (- s i j)) 0) (<= (the fixnum (- s i j)) k))))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 344, "cpu_time_ms": 34, "memory_kb": 24420}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s706230310", "group_id": "codeNet:p03835", "input_text": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(let ((k (read))\n      (s (read)))\n\n  (declare (type fixnum k))\n  (declare (type fixnum s))\n\n  (format t \"~A~%\"\n          (loop for i from 0 to k\n                sum (loop for j from 0 to k\n                          count (and (>= (the fixnum (- s i j)) 0) (<= (the fixnum (- s i j)) k))))))\n", "language": "Lisp", "metadata": {"date": 1594679790, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lisp/s706230310.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s706230310", "user_id": "u336541610"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "(declaim (optimize (speed 3) (debug 0) (safety 0)))\n(let ((k (read))\n      (s (read)))\n\n  (declare (type fixnum k))\n  (declare (type fixnum s))\n\n  (format t \"~A~%\"\n          (loop for i from 0 to k\n                sum (loop for j from 0 to k\n                          count (and (>= (the fixnum (- s i j)) 0) (<= (the fixnum (- s i j)) k))))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 344, "cpu_time_ms": 31, "memory_kb": 24456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s334365865", "group_id": "codeNet:p03835", "input_text": "(let ((k (read))\n      (s (read)))\n\n  (format t \"~A~%\"\n          (loop for i from 0 to k\n                sum (loop for j from 0 to k\n                          count (<= 0 (- s i j) k)))))\n", "language": "Lisp", "metadata": {"date": 1594678849, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lisp/s334365865.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334365865", "user_id": "u336541610"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "(let ((k (read))\n      (s (read)))\n\n  (format t \"~A~%\"\n          (loop for i from 0 to k\n                sum (loop for j from 0 to k\n                          count (<= 0 (- s i j) k)))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 84, "memory_kb": 24276}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s448133675", "group_id": "codeNet:p03835", "input_text": "(defvar K (read))\n(defvar S (read))\n\n(princ\n(loop for x downfrom K to 0\n      sum (loop for y downfrom K to 0 with z\n                do (setf z (- S x y))\n                if (and (<= 0 z)\n                        (<= z K))\n                count 1)))", "language": "Lisp", "metadata": {"date": 1588180387, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lisp/s448133675.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s448133675", "user_id": "u334552723"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "(defvar K (read))\n(defvar S (read))\n\n(princ\n(loop for x downfrom K to 0\n      sum (loop for y downfrom K to 0 with z\n                do (setf z (- S x y))\n                if (and (<= 0 z)\n                        (<= z K))\n                count 1)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 248, "cpu_time_ms": 126, "memory_kb": 6368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s073851776", "group_id": "codeNet:p03835", "input_text": "(defun main ()\n  (let ((k (read))\n        (s (read))\n        (ans 0))\n    (dotimes (x (1+ k))\n      (dotimes (y (1+ k))\n        (if (and (<= (- s x y) k) (<= 0 (- s x y)))\n            (incf ans))))\n    ans))\n\n(format t \"~d~%\" (main))\n", "language": "Lisp", "metadata": {"date": 1585934479, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lisp/s073851776.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s073851776", "user_id": "u091381267"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "(defun main ()\n  (let ((k (read))\n        (s (read))\n        (ans 0))\n    (dotimes (x (1+ k))\n      (dotimes (y (1+ k))\n        (if (and (<= (- s x y) k) (<= 0 (- s x y)))\n            (incf ans))))\n    ans))\n\n(format t \"~d~%\" (main))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 234, "cpu_time_ms": 153, "memory_kb": 6496}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s467476785", "group_id": "codeNet:p03835", "input_text": "(defun main ()\n  (let ((k (read))\n        (s (read))\n        (ans 0))\n    (dotimes (x (1+ k))\n      (dotimes (y (1+ k))\n        (dotimes (z (1+ k))\n          (if (= (+ x y z) s)\n            (incf ans)))))\n    ans))\n\n(format t \"~d~%\" (main))\n", "language": "Lisp", "metadata": {"date": 1585933421, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lisp/s467476785.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s467476785", "user_id": "u091381267"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "(defun main ()\n  (let ((k (read))\n        (s (read))\n        (ans 0))\n    (dotimes (x (1+ k))\n      (dotimes (y (1+ k))\n        (dotimes (z (1+ k))\n          (if (= (+ x y z) s)\n            (incf ans)))))\n    ans))\n\n(format t \"~d~%\" (main))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 241, "cpu_time_ms": 2104, "memory_kb": 11872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s501858924", "group_id": "codeNet:p03835", "input_text": "(defun solve (k s)\n  (loop for x from 0 to (min k s)\n        sum (loop for y from 0 to (min k (- s x))\n                  count (<= (- s x y) k))))\n\n#-swank\n(let* ((k (read))\n       (s (read)))\n  (format t \"~A~%\" (solve k s)))\n", "language": "Lisp", "metadata": {"date": 1579821792, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lisp/s501858924.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s501858924", "user_id": "u202886318"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "(defun solve (k s)\n  (loop for x from 0 to (min k s)\n        sum (loop for y from 0 to (min k (- s x))\n                  count (<= (- s x y) k))))\n\n#-swank\n(let* ((k (read))\n       (s (read)))\n  (format t \"~A~%\" (solve k s)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 226, "cpu_time_ms": 154, "memory_kb": 13160}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s933572355", "group_id": "codeNet:p03835", "input_text": "(let ((k (read))\n      (s (read)))\n\n  (format t \"~A~%\"\n          (loop for i from 0 to k\n                sum (loop for j from 0 to k\n                          count (<= 0 (- s i j) k)))))\n", "language": "Lisp", "metadata": {"date": 1572487208, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lisp/s933572355.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s933572355", "user_id": "u336541610"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "(let ((k (read))\n      (s (read)))\n\n  (format t \"~A~%\"\n          (loop for i from 0 to k\n                sum (loop for j from 0 to k\n                          count (<= 0 (- s i j) k)))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 126, "memory_kb": 12772}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s415736095", "group_id": "codeNet:p03835", "input_text": "(defun count-pairs (k s)\n  (let ((mx (if (>= k s)\n              s\n              k))\n        (mn (if (>= k s)\n              0\n              (- s k))))\n    (if (<= mn mx)\n      (+ (- mx mn) 1)\n      0)))\n\n(defun solv (k s)\n    (loop for i below (+ k 1)\n        sum (count-pairs k (- s i))))\n \n(defparameter k (read))\n(defparameter s (read))\n(defparameter ans (solv k s))\n(princ ans)\n", "language": "Lisp", "metadata": {"date": 1566779735, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lisp/s415736095.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s415736095", "user_id": "u652695471"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "(defun count-pairs (k s)\n  (let ((mx (if (>= k s)\n              s\n              k))\n        (mn (if (>= k s)\n              0\n              (- s k))))\n    (if (<= mn mx)\n      (+ (- mx mn) 1)\n      0)))\n\n(defun solv (k s)\n    (loop for i below (+ k 1)\n        sum (count-pairs k (- s i))))\n \n(defparameter k (read))\n(defparameter s (read))\n(defparameter ans (solv k s))\n(princ ans)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 62, "memory_kb": 7396}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s738193440", "group_id": "codeNet:p03835", "input_text": "(let ((k (read))\n      (s (read))\n      (ans 0))\n  (defun lp (a b c)\n    (if (= (+ a b c) s)\n        (setq ans (1+ ans))\n        nil))\n  (loop :for a :from 0 :upto k :do\n    (loop :for b :from 0 :upto k :do\n      (loop :for c :from 0 :upto k :do(lp a b c))))\n  (princ ans))", "language": "Lisp", "metadata": {"date": 1543599853, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Lisp/s738193440.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s738193440", "user_id": "u610490393"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "(let ((k (read))\n      (s (read))\n      (ans 0))\n  (defun lp (a b c)\n    (if (= (+ a b c) s)\n        (setq ans (1+ ans))\n        nil))\n  (loop :for a :from 0 :upto k :do\n    (loop :for b :from 0 :upto k :do\n      (loop :for c :from 0 :upto k :do(lp a b c))))\n  (princ ans))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 273, "cpu_time_ms": 2104, "memory_kb": 12260}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s026554709", "group_id": "codeNet:p03854", "input_text": "#|\n------------------------------------\n|               Utils               |\n------------------------------------\n|#\n\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n(defconstant +mod+ 1000000007)\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n\n#|\n------------------------------------\n|               Body               |\n------------------------------------\n|#\n\n\n(defparameter *word-list*\n  (mapcar #'reverse\n          '(\"erase\"\n            \"eraser\"\n            \"dream\"\n            \"dreamer\")))\n\n\n(defun judge (xs str)\n  (if (< (length xs)\n         (length str))\n      nil\n      (equal (concatenate 'string (subseq xs 0 (length str))) str)))\n\n\n\n\n(defun solve (xs)\n  (let ((xs (nreverse xs)))\n    (labels ((sub (xs)\n               (if (null xs)\n                   t\n                   (loop for str in *word-list* do\n                        (when (judge xs str)\n                          (return (sub (nthcdr (length str) xs))))\n                      finally\n                        (return nil)))))\n      (if (sub xs)\n          \"YES\"\n          \"NO\"))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((s (concatenate 'list (read-line))))\n    (format t \"~a~&\" (solve s))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600182413, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s026554709.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s026554709", "user_id": "u425762225"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#|\n------------------------------------\n|               Utils               |\n------------------------------------\n|#\n\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n(defconstant +mod+ 1000000007)\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n\n#|\n------------------------------------\n|               Body               |\n------------------------------------\n|#\n\n\n(defparameter *word-list*\n  (mapcar #'reverse\n          '(\"erase\"\n            \"eraser\"\n            \"dream\"\n            \"dreamer\")))\n\n\n(defun judge (xs str)\n  (if (< (length xs)\n         (length str))\n      nil\n      (equal (concatenate 'string (subseq xs 0 (length str))) str)))\n\n\n\n\n(defun solve (xs)\n  (let ((xs (nreverse xs)))\n    (labels ((sub (xs)\n               (if (null xs)\n                   t\n                   (loop for str in *word-list* do\n                        (when (judge xs str)\n                          (return (sub (nthcdr (length str) xs))))\n                      finally\n                        (return nil)))))\n      (if (sub xs)\n          \"YES\"\n          \"NO\"))))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((s (concatenate 'list (read-line))))\n    (format t \"~a~&\" (solve s))))\n\n#-swank (main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3986, "cpu_time_ms": 2206, "memory_kb": 30964}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s855399575", "group_id": "codeNet:p03854", "input_text": "#|\n------------------------------------\n|               Utils               |\n------------------------------------\n|#\n\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n(defconstant +mod+ 1000000007)\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n\n#|\n------------------------------------\n|               Body               |\n------------------------------------\n|#\n\n\n(defun judge (xs str)\n  (if (< (length xs)\n         (length str))\n      nil\n      (equal (concatenate 'string (subseq xs 0 (length str))) str)))\n\n(defun solve (xs)\n  (labels ((sub (xs)\n             (cond\n               ((null xs) t)\n               ((judge xs \"dreamer\") (or (sub (nthcdr 7 xs))\n                                         (sub (nthcdr 5 xs))))\n               ((judge xs \"dream\")   (sub (nthcdr 5 xs)))\n               ((judge xs \"eraser\")  (sub (nthcdr 6 xs)))\n               ((judge xs \"erase\")   (sub (nthcdr 5 xs)))\n               (t nil))))\n    (if (sub xs)\n        \"YES\"\n        \"NO\")))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((s (concatenate 'list (read-line))))\n    (format t \"~a~&\" (solve s))))\n\n#-swank (main)\n", "language": "Lisp", "metadata": {"date": 1600141460, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s855399575.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s855399575", "user_id": "u425762225"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#|\n------------------------------------\n|               Utils               |\n------------------------------------\n|#\n\n\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n\n\n(defconstant +mod+ 1000000007)\n\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~a\" b)) () '(signed-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~a\" b)) () '(unsigned-byte ,b))) bits)))\n\n(define-int-types 2 4 8 16 32 64)\n\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1\n        (write obj :stream stream)\n      (fresh-line stream))))\n\n\n(defmacro safe-sort (list test &key (key #'identity))\n  `(progn\n    (declaim (inline sort sb-impl::stable-sort-list))\n    (sort (copy-seq ,list) ,test :key ,key)))\n\n\n(defmacro read-numbers-to-list (size)\n  `(loop repeat ,size collect (read)))\n\n\n(defmacro read-numbers-to-array (size)\n  (let ((i (gensym))\n        (arr (gensym)))\n    `(let ((,arr (make-array ,size\n                             :element-type 'fixnum)))\n       (declare ((array fixnum 1) ,arr))\n       (loop for ,i of-type fixnum below ,size do\n            (setf (aref ,arr ,i) (read))\n          finally\n            (return ,arr)))))\n\n(defmacro read-characters-to-board (row-size column-size)\n  (let ((board (gensym))\n        (r (gensym))\n        (c (gensym))\n        (tmp (gensym)))\n    `(let ((,board (make-array '(,row-size ,column-size) :element-type 'character :adjustable nil)))\n       (dotimes (,r ,row-size ,board)\n         (let ((,tmp (read-line)))\n           (dotimes (,c ,column-size)\n             (setf (aref ,board ,r ,c) (char ,tmp ,c))))))))\n\n(defmethod princ-for-each-line ((sequence list))\n  (format t \"~{~a~&~}\" sequence))\n\n(defmethod princ-for-each-line ((sequence vector))\n  (loop for i below (length sequence) do\n       (princ (aref sequence i))\n       (fresh-line)))\n\n(defun unwrap (list)\n  (format nil \"~{~a~^ ~}\" list))\n\n\n\n(defmacro with-buffered-stdout (&body body)\n  (let ((out (gensym)))\n    `(let ((,out (make-string-output-stream :element-type 'base-char)))\n       (let ((*standard-output* ,out))\n         ,@body)\n       (write-string (get-output-stream-string ,out)))))\n\n\n\n\n\n#|\n------------------------------------\n|               Body               |\n------------------------------------\n|#\n\n\n(defun judge (xs str)\n  (if (< (length xs)\n         (length str))\n      nil\n      (equal (concatenate 'string (subseq xs 0 (length str))) str)))\n\n(defun solve (xs)\n  (labels ((sub (xs)\n             (cond\n               ((null xs) t)\n               ((judge xs \"dreamer\") (or (sub (nthcdr 7 xs))\n                                         (sub (nthcdr 5 xs))))\n               ((judge xs \"dream\")   (sub (nthcdr 5 xs)))\n               ((judge xs \"eraser\")  (sub (nthcdr 6 xs)))\n               ((judge xs \"erase\")   (sub (nthcdr 5 xs)))\n               (t nil))))\n    (if (sub xs)\n        \"YES\"\n        \"NO\")))\n\n\n(defun main ()\n  (declare #.OPT)\n  (let ((s (concatenate 'list (read-line))))\n    (format t \"~a~&\" (solve s))))\n\n#-swank (main)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3900, "cpu_time_ms": 2206, "memory_kb": 31020}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s781038534", "group_id": "codeNet:p03854", "input_text": "(defun solve (s)\n  (let ((solved nil))\n    (labels\n      ((f (s)\n               (if (loop for word in '(\"dream\" \"dreamer\" \"erase\" \"eraser\") do\n                      (let ((mismatch (mismatch s word)))\n                        (cond ((not mismatch) (setf solved t))\n                               ((= mismatch (length word)) \n                                (f (subseq s (length word)))))))\n                  t nil)))\n      (f s))\n      (format t \"~A~%\" (if solved \"YES\" \"NO\"))))\n\n(defun main ()\n  (solve (read-line)))\n\n(main)", "language": "Lisp", "metadata": {"date": 1590876300, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s781038534.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s781038534", "user_id": "u652695471"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(defun solve (s)\n  (let ((solved nil))\n    (labels\n      ((f (s)\n               (if (loop for word in '(\"dream\" \"dreamer\" \"erase\" \"eraser\") do\n                      (let ((mismatch (mismatch s word)))\n                        (cond ((not mismatch) (setf solved t))\n                               ((= mismatch (length word)) \n                                (f (subseq s (length word)))))))\n                  t nil)))\n      (f s))\n      (format t \"~A~%\" (if solved \"YES\" \"NO\"))))\n\n(defun main ()\n  (solve (read-line)))\n\n(main)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 524, "cpu_time_ms": 2134, "memory_kb": 1006236}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s190092379", "group_id": "codeNet:p03854", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (str)\n  (count #\\1 str))\n\n(defun prefix-equal (str1 str2)\n  (unless str1 (return-from prefix-equal t))\n  (unless str2 (return-from prefix-equal nil))\n  (and (char= (car str1) (car str2)) (prefix-equal (cdr str1) (cdr str2))))\n\n(defun main (str)\n  (let ((names (mapcar (lambda (x)\n                         (coerce (reverse x) 'list)) (list \"dream\" \"dreamer\" \"erase\" \"eraser\")))\n        (rts (coerce (reverse str) 'list)))\n    (labels ((f (lst)\n               (unless lst\n                 (return-from f t))\n               (loop for name in names\n                     when (prefix-equal name lst)\n                       do\n                          (return-from f (f (subseq lst (length name)))))\n               nil))\n      (f rts))))\n\n(princ (if (main (read-line)) \"YES\" \"NO\"))\n", "language": "Lisp", "metadata": {"date": 1586235595, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s190092379.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s190092379", "user_id": "u493610446"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (str)\n  (count #\\1 str))\n\n(defun prefix-equal (str1 str2)\n  (unless str1 (return-from prefix-equal t))\n  (unless str2 (return-from prefix-equal nil))\n  (and (char= (car str1) (car str2)) (prefix-equal (cdr str1) (cdr str2))))\n\n(defun main (str)\n  (let ((names (mapcar (lambda (x)\n                         (coerce (reverse x) 'list)) (list \"dream\" \"dreamer\" \"erase\" \"eraser\")))\n        (rts (coerce (reverse str) 'list)))\n    (labels ((f (lst)\n               (unless lst\n                 (return-from f t))\n               (loop for name in names\n                     when (prefix-equal name lst)\n                       do\n                          (return-from f (f (subseq lst (length name)))))\n               nil))\n      (f rts))))\n\n(princ (if (main (read-line)) \"YES\" \"NO\"))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1823, "cpu_time_ms": 2116, "memory_kb": 91200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s985240046", "group_id": "codeNet:p03854", "input_text": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (str)\n  (count #\\1 str))\n\n(defun prefix-equal (str1 str2)\n  (unless str1 (return-from prefix-equal t))\n  (unless str2 (return-from prefix-equal nil))\n  (and (char= (car str1) (car str2)) (prefix-equal (cdr str1) (cdr str2))))\n\n(defun main (str)\n  (let ((names (mapcar (lambda (x)\n                         (coerce (reverse x) 'list)) (list \"dream\" \"dreamer\" \"erase\" \"eraser\")))\n        (rts (coerce (reverse str) 'list))\n        (n (length str)))\n    (labels ((f (lst)\n               (unless lst\n                 (return-from f t))\n               (loop for name in names\n                     when (prefix-equal name lst)\n                       do\n                          (return-from f (subseq lst (length name))))\n               nil))\n      (f rts))))\n\n(princ (if (main (read-line)) \"YES\" \"NO\"))\n", "language": "Lisp", "metadata": {"date": 1586234843, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s985240046.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s985240046", "user_id": "u493610446"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#-swank\n(unless (member :child-sbcl *features*)\n  (quit\n   :unix-status\n   (process-exit-code\n    (run-program *runtime-pathname*\n                 `(\"--control-stack-size\" \"128MB\"\n                   \"--noinform\" \"--disable-ldb\" \"--lose-on-corruption\" \"--end-runtime-options\"\n                   \"--eval\" \"(push :child-sbcl *features*)\"\n                   \"--script\" ,(namestring *load-pathname*))\n                 :output t :error t :input t))))\n(defmacro dp (name args memo-size &body body)\n  (let ((memo (gensym)))\n    `(let ((,memo (make-array ,memo-size :initial-element nil)))\n       (defun ,name ,args\n         (or (aref ,memo ,@args)\n             (setf (aref ,memo ,@args)\n                   ,@body))))))\n\n(defun split (x str)\n  (let ((pos (search x str))\n        (size (length x)))\n    (if pos\n      (cons (subseq str 0 pos)\n            (split x (subseq str (+ pos size))))\n      (list str))))\n\n(defmacro collect-times (time body)\n  `(loop repeat ,time collect ,body))\n\n(defun read-times (time)\n  (collect-times time (read)))\n\n(defun main (str)\n  (count #\\1 str))\n\n(defun prefix-equal (str1 str2)\n  (unless str1 (return-from prefix-equal t))\n  (unless str2 (return-from prefix-equal nil))\n  (and (char= (car str1) (car str2)) (prefix-equal (cdr str1) (cdr str2))))\n\n(defun main (str)\n  (let ((names (mapcar (lambda (x)\n                         (coerce (reverse x) 'list)) (list \"dream\" \"dreamer\" \"erase\" \"eraser\")))\n        (rts (coerce (reverse str) 'list))\n        (n (length str)))\n    (labels ((f (lst)\n               (unless lst\n                 (return-from f t))\n               (loop for name in names\n                     when (prefix-equal name lst)\n                       do\n                          (return-from f (subseq lst (length name))))\n               nil))\n      (f rts))))\n\n(princ (if (main (read-line)) \"YES\" \"NO\"))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1844, "cpu_time_ms": 42, "memory_kb": 15420}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s096388422", "group_id": "codeNet:p03854", "input_text": "(loop :with n := (read-line)\n      :for s :upto (length n)\n      :for k :on (concatenate 'list n \"0000000\")\n      :for dp :on (cons 1 (loop :repeat (+ (length n) 6) :collect 0))\n      :with j := (loop :for x :in '(\"dream\" \"dreamer\" \"erase\" \"eraser\")\n                       :collect (concatenate 'list x))\n      :if (char= #\\0 (car k))\n        :if (= 1 (car dp)) :do (princ \"YES\")\n          :else :do (princ \"NO\")\n      :if (= 1 (car dp))\n        :if (equal (subseq k 0 5) (car j)) :do (setf (elt dp 5) 1) :end :and\n        :if (equal (subseq k 0 7) (cadr j)) :do (setf (elt dp 7) 1) :end :and\n        :if (equal (subseq k 0 5) (caddr j)) :do (setf (elt dp 5) 1) :end :and\n        :if (equal (subseq k 0 6) (cadddr j)) :do (setf (elt dp 6) 1))", "language": "Lisp", "metadata": {"date": 1584015567, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s096388422.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s096388422", "user_id": "u610490393"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(loop :with n := (read-line)\n      :for s :upto (length n)\n      :for k :on (concatenate 'list n \"0000000\")\n      :for dp :on (cons 1 (loop :repeat (+ (length n) 6) :collect 0))\n      :with j := (loop :for x :in '(\"dream\" \"dreamer\" \"erase\" \"eraser\")\n                       :collect (concatenate 'list x))\n      :if (char= #\\0 (car k))\n        :if (= 1 (car dp)) :do (princ \"YES\")\n          :else :do (princ \"NO\")\n      :if (= 1 (car dp))\n        :if (equal (subseq k 0 5) (car j)) :do (setf (elt dp 5) 1) :end :and\n        :if (equal (subseq k 0 7) (cadr j)) :do (setf (elt dp 7) 1) :end :and\n        :if (equal (subseq k 0 5) (caddr j)) :do (setf (elt dp 5) 1) :end :and\n        :if (equal (subseq k 0 6) (cadddr j)) :do (setf (elt dp 6) 1))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 742, "cpu_time_ms": 70, "memory_kb": 22880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s179132001", "group_id": "codeNet:p03854", "input_text": "(loop :named n-loop :with n := (read)\n      :do (loop :for j :upto n :with y := (read)\n                :do (loop :for k :upto (- n j)\n                          :if (= y (+ (* 10000 j) (* 5000 k) (* 1000 (- n j k))))\n                            :do (format t \"~A ~A ~A\" j k (- n j k))\n                            :and\n                              :do (return-from n-loop))\n                :finally (princ \"-1 -1 -1\")))", "language": "Lisp", "metadata": {"date": 1583630932, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s179132001.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s179132001", "user_id": "u610490393"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(loop :named n-loop :with n := (read)\n      :do (loop :for j :upto n :with y := (read)\n                :do (loop :for k :upto (- n j)\n                          :if (= y (+ (* 10000 j) (* 5000 k) (* 1000 (- n j k))))\n                            :do (format t \"~A ~A ~A\" j k (- n j k))\n                            :and\n                              :do (return-from n-loop))\n                :finally (princ \"-1 -1 -1\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 418, "cpu_time_ms": 32, "memory_kb": 7524}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s879321402", "group_id": "codeNet:p03854", "input_text": "    (loop :named n-loop :with n := (read)\n          :do (loop :for j :upto n :with y := (read)\n                    :do (loop :for k :upto (- n j)\n                              :if (= y (+ (* 10000 j) (* 5000 k) (* 1000 (- n j k))))\n                                :do (format t \"~A ~A ~A\" j k (- n j k))\n                                    :and\n                                :do (return-from n-loop))\n                    :finally (princ \"-1 -1 -1\")))", "language": "Lisp", "metadata": {"date": 1583630875, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s879321402.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s879321402", "user_id": "u610490393"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "    (loop :named n-loop :with n := (read)\n          :do (loop :for j :upto n :with y := (read)\n                    :do (loop :for k :upto (- n j)\n                              :if (= y (+ (* 10000 j) (* 5000 k) (* 1000 (- n j k))))\n                                :do (format t \"~A ~A ~A\" j k (- n j k))\n                                    :and\n                                :do (return-from n-loop))\n                    :finally (princ \"-1 -1 -1\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 452, "cpu_time_ms": 32, "memory_kb": 7528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s556981430", "group_id": "codeNet:p03854", "input_text": "(let* ((str (reverse (read-line))))\n  (defun f (str-f)\n    (if (not (string= str-f \"\"))\n        (cond ((and (<= 6 (length str-f)) (string= (subseq str-f 0 6) \"resare\")) (f (subseq str-f 6)))\n            ((and (<= 5 (length str-f)) (string= (subseq str-f 0 5) \"esare\")) (f (subseq str-f 5)))\n            ((and (<= 7 (length str-f)) (string= (subseq str-f 0 7) \"remaerd\")) (f (subseq str-f 7)))\n            ((and (<= 5 (length str-f)) (string= (subseq str-f 0 5) \"maerd\")) (f (subseq str-f 5)))\n            (t nil))\n        t))\n  (if (f str) (princ \"YES\") (princ \"NO\")))", "language": "Lisp", "metadata": {"date": 1573589489, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s556981430.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s556981430", "user_id": "u610490393"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(let* ((str (reverse (read-line))))\n  (defun f (str-f)\n    (if (not (string= str-f \"\"))\n        (cond ((and (<= 6 (length str-f)) (string= (subseq str-f 0 6) \"resare\")) (f (subseq str-f 6)))\n            ((and (<= 5 (length str-f)) (string= (subseq str-f 0 5) \"esare\")) (f (subseq str-f 5)))\n            ((and (<= 7 (length str-f)) (string= (subseq str-f 0 7) \"remaerd\")) (f (subseq str-f 7)))\n            ((and (<= 5 (length str-f)) (string= (subseq str-f 0 5) \"maerd\")) (f (subseq str-f 5)))\n            (t nil))\n        t))\n  (if (f str) (princ \"YES\") (princ \"NO\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 568, "cpu_time_ms": 1501, "memory_kb": 86372}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s375144259", "group_id": "codeNet:p03854", "input_text": "(let* ((str (read-line)))\n  (defun eval-f (a)\n    (if (<= (length a) (length str))\n        (and (string= a (subseq str 0 (length a))) (f a))))\n  (defun f (a)\n    (cond ((string= a str))\n          ((eval-f (concatenate 'string a \"dream\")))\n          ((eval-f (concatenate 'string a \"dreamer\")))\n          ((eval-f (concatenate 'string a \"erase\")))\n          ((eval-f (concatenate 'string a \"eraser\")))))\n  (if (f \"\") (princ \"YES\") (princ \"NO\")))", "language": "Lisp", "metadata": {"date": 1568906291, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s375144259.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s375144259", "user_id": "u610490393"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(let* ((str (read-line)))\n  (defun eval-f (a)\n    (if (<= (length a) (length str))\n        (and (string= a (subseq str 0 (length a))) (f a))))\n  (defun f (a)\n    (cond ((string= a str))\n          ((eval-f (concatenate 'string a \"dream\")))\n          ((eval-f (concatenate 'string a \"dreamer\")))\n          ((eval-f (concatenate 'string a \"erase\")))\n          ((eval-f (concatenate 'string a \"eraser\")))))\n  (if (f \"\") (princ \"YES\") (princ \"NO\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 444, "cpu_time_ms": 2145, "memory_kb": 552376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s568103076", "group_id": "codeNet:p03854", "input_text": "(defparameter +divide+\n  (make-array '(4)\n              :initial-contents\n              '(\"dream\" \"dreamer\" \"erase\" \"eraser\")))\n\n(defmacro while (test &body body)\n  `(do ()\n       ((not ,test))\n     ,@body))\n\n(defun daydream (s)\n  (let ((can1 t)\n        can2\n        (l (length s))\n        (j 0)\n        buff\n        d)\n\n    (setf s (reverse s))\n    (dotimes (i 4)\n      (setf (aref +divide+ i) (reverse (aref +divide+ i))))\n\n    (while (< j l)\n      (setf can2 nil)\n      (dotimes (k 4)\n        (setf d (aref +divide+ k))\n        (if (>= l (+ (length d) j))\n            (setf buff (subseq s j (+ (length d) j)))\n            (setf buff (subseq s j)))\n        (when (string= buff d)\n          (setf can2 t)\n          (setf j (+ j (length d)))\n          (return)))\n      (when (not (eq can2 t))\n        (setf can1 nil)\n        (return)))\n\n    (if (eq can1 t)\n        \"YES\"\n        \"NO\")))\n\n(format t \"~A~%\" (daydream (read-line)))", "language": "Lisp", "metadata": {"date": 1521663820, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s568103076.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s568103076", "user_id": "u711147786"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(defparameter +divide+\n  (make-array '(4)\n              :initial-contents\n              '(\"dream\" \"dreamer\" \"erase\" \"eraser\")))\n\n(defmacro while (test &body body)\n  `(do ()\n       ((not ,test))\n     ,@body))\n\n(defun daydream (s)\n  (let ((can1 t)\n        can2\n        (l (length s))\n        (j 0)\n        buff\n        d)\n\n    (setf s (reverse s))\n    (dotimes (i 4)\n      (setf (aref +divide+ i) (reverse (aref +divide+ i))))\n\n    (while (< j l)\n      (setf can2 nil)\n      (dotimes (k 4)\n        (setf d (aref +divide+ k))\n        (if (>= l (+ (length d) j))\n            (setf buff (subseq s j (+ (length d) j)))\n            (setf buff (subseq s j)))\n        (when (string= buff d)\n          (setf can2 t)\n          (setf j (+ j (length d)))\n          (return)))\n      (when (not (eq can2 t))\n        (setf can1 nil)\n        (return)))\n\n    (if (eq can1 t)\n        \"YES\"\n        \"NO\")))\n\n(format t \"~A~%\" (daydream (read-line)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 928, "cpu_time_ms": 39, "memory_kb": 10600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s201005197", "group_id": "codeNet:p03854", "input_text": "(let ((s (nreverse (read-line))))\n  (labels ((f (str)\n             (cond ((string= \"\" str) t)\n                   ((and (>= (length str) 7)\n                         (string= \"remaerd\" str :end2 7)) (f (subseq str 7)))\n                   ((and (>= (length str) 6) \n                         (string= \"resare\" str :end2 6)) (f (subseq str 6)))\n                   ((and (>= (length str) 5)\n                         (string= \"maerd\" str :end2 5)) (f (subseq str 5)))\n                   ((and (>= (length str) 5)\n                         (string= \"esare\" str :end2 5)) (f (subseq str 5)))\n                   (t nil))))\n    (format t \"~A~%\" (if (f s) 'yes 'no))))", "language": "Lisp", "metadata": {"date": 1505325782, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s201005197.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s201005197", "user_id": "u140665374"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(let ((s (nreverse (read-line))))\n  (labels ((f (str)\n             (cond ((string= \"\" str) t)\n                   ((and (>= (length str) 7)\n                         (string= \"remaerd\" str :end2 7)) (f (subseq str 7)))\n                   ((and (>= (length str) 6) \n                         (string= \"resare\" str :end2 6)) (f (subseq str 6)))\n                   ((and (>= (length str) 5)\n                         (string= \"maerd\" str :end2 5)) (f (subseq str 5)))\n                   ((and (>= (length str) 5)\n                         (string= \"esare\" str :end2 5)) (f (subseq str 5)))\n                   (t nil))))\n    (format t \"~A~%\" (if (f s) 'yes 'no))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 655, "cpu_time_ms": 1489, "memory_kb": 86184}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s972480418", "group_id": "codeNet:p03854", "input_text": "(let ((s (read-line)))\n  (labels ((f (str)\n             (cond ((string= \"\" str) t)\n                   ((and (>= (length str) 7)\n                         (string= \"dreamer\" str :end2 7)) (f (subseq str 7)))\n                   ((and (>= (length str) 6) \n                         (string= \"eraser\" str :end2 6)) (f (subseq str 6)))\n                   ((and (>= (length str) 5)\n                         (string= \"dream\" str :end2 5)) (f (subseq str 5)))\n                   ((and (>= (length str) 5)\n                         (string= \"erase\" str :end2 5)) (f (subseq str 5)))\n                   (t nil))))\n    (format t \"~A~%\" (if (f s) 'yes 'no))))", "language": "Lisp", "metadata": {"date": 1505325471, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s972480418.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s972480418", "user_id": "u140665374"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(let ((s (read-line)))\n  (labels ((f (str)\n             (cond ((string= \"\" str) t)\n                   ((and (>= (length str) 7)\n                         (string= \"dreamer\" str :end2 7)) (f (subseq str 7)))\n                   ((and (>= (length str) 6) \n                         (string= \"eraser\" str :end2 6)) (f (subseq str 6)))\n                   ((and (>= (length str) 5)\n                         (string= \"dream\" str :end2 5)) (f (subseq str 5)))\n                   ((and (>= (length str) 5)\n                         (string= \"erase\" str :end2 5)) (f (subseq str 5)))\n                   (t nil))))\n    (format t \"~A~%\" (if (f s) 'yes 'no))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 644, "cpu_time_ms": 117, "memory_kb": 20836}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s694970196", "group_id": "codeNet:p03854", "input_text": "(let ((s (read-line)))\n  (labels ((f (str)\n             (cond ((string= \"\" str) t)\n                   ((and (>= (length str) 7)\n                         (string= \"dreamer\" str :end2 7)) (f (subseq str 7)))\n                   ((and (>= (length str) 6) \n                         (string= \"eraser\" str :end2 6)) (f (subseq str 6)))\n                   ((and (>= (length str) 5)\n                         (string= \"dream\" str :end2 5)) (f (subseq str 5)))\n                   ((and (>= (length str) 5)\n                         (string= \"erase\" str :end2 5)) (f (subseq str 5)))\n                   (t nil))))\n    (if (f s) 'yes 'no)))", "language": "Lisp", "metadata": {"date": 1505325412, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s694970196.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s694970196", "user_id": "u140665374"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(let ((s (read-line)))\n  (labels ((f (str)\n             (cond ((string= \"\" str) t)\n                   ((and (>= (length str) 7)\n                         (string= \"dreamer\" str :end2 7)) (f (subseq str 7)))\n                   ((and (>= (length str) 6) \n                         (string= \"eraser\" str :end2 6)) (f (subseq str 6)))\n                   ((and (>= (length str) 5)\n                         (string= \"dream\" str :end2 5)) (f (subseq str 5)))\n                   ((and (>= (length str) 5)\n                         (string= \"erase\" str :end2 5)) (f (subseq str 5)))\n                   (t nil))))\n    (if (f s) 'yes 'no)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 626, "cpu_time_ms": 100, "memory_kb": 18656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s451214703", "group_id": "codeNet:p03854", "input_text": "(defmacro let-if (nv c true false)\n  `(let (,nv) (if ,c ,true ,false)))\n\n(defun daydream-with (str start)\n  (let-if (len (- (length str) start))\n    (< len 5)\n    nil\n    (let-if (dream (string= #.(reverse \"dream\")\n                       (subseq str start (+ start 5))))\n      dream 5\n      (let-if (erase (string= #.(reverse \"erase\")\n                       (subseq str start (+ start 5))))\n        erase 5\n        (if (< len 6)\n          nil\n          (let-if (eraser (string= #.(reverse \"eraser\")\n                            (subseq str start (+ start 6))))\n            eraser 6\n            (if (< len 7)\n              nil\n              (let-if (dreamer (string= #.(reverse \"dreamer\")\n                                 (subseq str start (+ start 7))))\n                dreamer 7\n                nil))))))))\n\n(let* ((s (reverse (read-line)))\n       (len (length s))\n       (r 0))\n  (loop for i = (daydream-with s r)\n        if (null i) do (return)\n        else do (incf r i)\n        while (>= len r))\n  (if (>= r len)\n    (format t \"YES~%\")\n    (format t \"NO~%\")))", "language": "Lisp", "metadata": {"date": 1481948971, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s451214703.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s451214703", "user_id": "u275710783"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(defmacro let-if (nv c true false)\n  `(let (,nv) (if ,c ,true ,false)))\n\n(defun daydream-with (str start)\n  (let-if (len (- (length str) start))\n    (< len 5)\n    nil\n    (let-if (dream (string= #.(reverse \"dream\")\n                       (subseq str start (+ start 5))))\n      dream 5\n      (let-if (erase (string= #.(reverse \"erase\")\n                       (subseq str start (+ start 5))))\n        erase 5\n        (if (< len 6)\n          nil\n          (let-if (eraser (string= #.(reverse \"eraser\")\n                            (subseq str start (+ start 6))))\n            eraser 6\n            (if (< len 7)\n              nil\n              (let-if (dreamer (string= #.(reverse \"dreamer\")\n                                 (subseq str start (+ start 7))))\n                dreamer 7\n                nil))))))))\n\n(let* ((s (reverse (read-line)))\n       (len (length s))\n       (r 0))\n  (loop for i = (daydream-with s r)\n        if (null i) do (return)\n        else do (incf r i)\n        while (>= len r))\n  (if (>= r len)\n    (format t \"YES~%\")\n    (format t \"NO~%\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1063, "cpu_time_ms": 164, "memory_kb": 12772}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s870649053", "group_id": "codeNet:p03854", "input_text": "(defmacro let-if (nv c true false)\n  `(let (,nv) (if ,c ,true ,false)))\n\n(defun daydream-with (str start)\n  (let-if (len (- (length str) start))\n    (< len 5)\n    nil\n    (let-if (dream (string= #.(reverse \"dream\")\n                       (subseq str start (+ start 5))))\n      dream 5\n      (let-if (erase (string= #.(reverse \"erase\")\n                       (subseq str start (+ start 5))))\n        erase 5\n        (if (< len 6)\n          nil\n          (let-if (eraser (string= #.(reverse \"eraser\")\n                            (subseq str start (+ start 6))))\n            eraser 6\n            (if (< len 7)\n              nil\n              (let-if (dreamer (string= #.(reverse \"dreamer\")\n                                 (subseq str start (+ start 7))))\n                erase 7\n                nil))))))))\n\n(let* ((s (reverse (read-line)))\n       (len (length s))\n       (r 0))\n  (loop for i = (daydream-with s r)\n        if (null i) do (return)\n        else do (incf r i)\n        while (>= len r))\n  (if (>= r len)\n    (format t \"YES~%\")\n    (format t \"NO~%\")))", "language": "Lisp", "metadata": {"date": 1481948333, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s870649053.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s870649053", "user_id": "u275710783"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(defmacro let-if (nv c true false)\n  `(let (,nv) (if ,c ,true ,false)))\n\n(defun daydream-with (str start)\n  (let-if (len (- (length str) start))\n    (< len 5)\n    nil\n    (let-if (dream (string= #.(reverse \"dream\")\n                       (subseq str start (+ start 5))))\n      dream 5\n      (let-if (erase (string= #.(reverse \"erase\")\n                       (subseq str start (+ start 5))))\n        erase 5\n        (if (< len 6)\n          nil\n          (let-if (eraser (string= #.(reverse \"eraser\")\n                            (subseq str start (+ start 6))))\n            eraser 6\n            (if (< len 7)\n              nil\n              (let-if (dreamer (string= #.(reverse \"dreamer\")\n                                 (subseq str start (+ start 7))))\n                erase 7\n                nil))))))))\n\n(let* ((s (reverse (read-line)))\n       (len (length s))\n       (r 0))\n  (loop for i = (daydream-with s r)\n        if (null i) do (return)\n        else do (incf r i)\n        while (>= len r))\n  (if (>= r len)\n    (format t \"YES~%\")\n    (format t \"NO~%\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1061, "cpu_time_ms": 51, "memory_kb": 5608}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s208623190", "group_id": "codeNet:p03854", "input_text": "(defun daydream-with (str start)\n  (let* ((len (min 7 (- (length str) start)))\n         (seven (subseq str start (+ start len)))\n         (dreamer (string>= \"dreamer\" seven)))\n    (if (and dreamer (= dreamer 7))\n      7\n      (if (and dreamer (= dreamer 5))\n        5\n        (let ((eraser (string>= \"eraser\" seven)))\n          (if (and eraser (= eraser 6))\n            6\n            (if (and eraser (= eraser 5))\n              5\n              nil)))))))\n\n(let* ((s (read-line))\n       (len (length s))\n       (r 0))\n  (loop for i = (daydream-with s r)\n        if (null i) do (return)\n        else do (incf r i)\n        while (>= len r))\n  (if (>= r len)\n    (format t \"YES~%\")\n    (format t \"NO~%\")))", "language": "Lisp", "metadata": {"date": 1481945457, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Lisp/s208623190.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s208623190", "user_id": "u275710783"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(defun daydream-with (str start)\n  (let* ((len (min 7 (- (length str) start)))\n         (seven (subseq str start (+ start len)))\n         (dreamer (string>= \"dreamer\" seven)))\n    (if (and dreamer (= dreamer 7))\n      7\n      (if (and dreamer (= dreamer 5))\n        5\n        (let ((eraser (string>= \"eraser\" seven)))\n          (if (and eraser (= eraser 6))\n            6\n            (if (and eraser (= eraser 5))\n              5\n              nil)))))))\n\n(let* ((s (read-line))\n       (len (length s))\n       (r 0))\n  (loop for i = (daydream-with s r)\n        if (null i) do (return)\n        else do (incf r i)\n        while (>= len r))\n  (if (>= r len)\n    (format t \"YES~%\")\n    (format t \"NO~%\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 701, "cpu_time_ms": 160, "memory_kb": 11872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s183520457", "group_id": "codeNet:p03856", "input_text": "(let* ((str (read-line)))\n  (defun eval-f (a)\n    (print a)\n    (if (<= (length a) (length str))\n        (and (string= a (subseq str 0 (length a))) (f a))))\n  (defun f (a)\n    (cond ((string= a str))\n          ((eval-f (concatenate 'string a \"dream\")))\n          ((eval-f (concatenate 'string a \"dreamer\")))\n          ((eval-f (concatenate 'string a \"erase\")))\n          ((eval-f (concatenate 'string a \"eraser\")))))\n  (if (f \"\") (princ \"YES\") (princ \"NO\")))", "language": "Lisp", "metadata": {"date": 1568080122, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03856.html", "problem_id": "p03856", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03856/input.txt", "sample_output_relpath": "derived/input_output/data/p03856/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03856/Lisp/s183520457.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s183520457", "user_id": "u610490393"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(let* ((str (read-line)))\n  (defun eval-f (a)\n    (print a)\n    (if (<= (length a) (length str))\n        (and (string= a (subseq str 0 (length a))) (f a))))\n  (defun f (a)\n    (cond ((string= a str))\n          ((eval-f (concatenate 'string a \"dream\")))\n          ((eval-f (concatenate 'string a \"dreamer\")))\n          ((eval-f (concatenate 'string a \"erase\")))\n          ((eval-f (concatenate 'string a \"eraser\")))))\n  (if (f \"\") (princ \"YES\") (princ \"NO\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03856", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 458, "cpu_time_ms": 2105, "memory_kb": 154216}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s864462950", "group_id": "codeNet:p03856", "input_text": "(let* ((str (read-line)))\n  (defun eval-f (a)\n    (if (<= (length a) (length str))\n        (string= a (subseq str 0 (length a)))))\n  (defun f (a)\n    (cond ((string= a str))\n          ((eval-f (concatenate 'string a \"dream\")) (f (concatenate 'string a \"dream\")))\n          ((eval-f (concatenate 'string a \"dreamer\")) (f (concatenate 'string a \"dreamer\")))\n          ((eval-f (concatenate 'string a \"erase\")) (f (concatenate 'string a \"erase\")))\n          ((eval-f (concatenate 'string a \"eraser\")) (f (concatenate 'string a \"eraser\")))))\n  (if (f \"\") (princ \"YES\") (princ \"NO\")))", "language": "Lisp", "metadata": {"date": 1568079490, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03856.html", "problem_id": "p03856", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03856/input.txt", "sample_output_relpath": "derived/input_output/data/p03856/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03856/Lisp/s864462950.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s864462950", "user_id": "u610490393"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(let* ((str (read-line)))\n  (defun eval-f (a)\n    (if (<= (length a) (length str))\n        (string= a (subseq str 0 (length a)))))\n  (defun f (a)\n    (cond ((string= a str))\n          ((eval-f (concatenate 'string a \"dream\")) (f (concatenate 'string a \"dream\")))\n          ((eval-f (concatenate 'string a \"dreamer\")) (f (concatenate 'string a \"dreamer\")))\n          ((eval-f (concatenate 'string a \"erase\")) (f (concatenate 'string a \"erase\")))\n          ((eval-f (concatenate 'string a \"eraser\")) (f (concatenate 'string a \"eraser\")))))\n  (if (f \"\") (princ \"YES\") (princ \"NO\")))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03856", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 579, "cpu_time_ms": 146, "memory_kb": 12640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s638241185", "group_id": "codeNet:p03941", "input_text": "https://billscheatworld.com/BrawlStarsHackUltimate/ \nor \n<a href=\"https://artelis.pl/autor/profil/181738/regisone\">site</a> \nMARCH UPDATED!!! Free Gems and Coins for BRAWL STARS Game for all COUNTRIES!!! \n \n \nKW: \nBrawl Stars Hack Yeuapk March \nBrawl Stars Brawlbox Hack 2019 March \nBrawl Stars Hack Tool March \nBrawl Stars Hack Apk 14.118 \nBrawl Stars Brawlbox Hack 2019 March \nBrawl Stars Hack Deutsch \nBrawl Stars Hack Without Verification \nBrawl Stars Hack Apk 2019 Mega Mod March \nHow To Hack Brawl Stars On iOS 2019", "language": "Lisp", "metadata": {"date": 1552629485, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s638241185.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s638241185", "user_id": "u210211818"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://billscheatworld.com/BrawlStarsHackUltimate/ \nor \n<a href=\"https://artelis.pl/autor/profil/181738/regisone\">site</a> \nMARCH UPDATED!!! Free Gems and Coins for BRAWL STARS Game for all COUNTRIES!!! \n \n \nKW: \nBrawl Stars Hack Yeuapk March \nBrawl Stars Brawlbox Hack 2019 March \nBrawl Stars Hack Tool March \nBrawl Stars Hack Apk 14.118 \nBrawl Stars Brawlbox Hack 2019 March \nBrawl Stars Hack Deutsch \nBrawl Stars Hack Without Verification \nBrawl Stars Hack Apk 2019 Mega Mod March \nHow To Hack Brawl Stars On iOS 2019", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 521, "cpu_time_ms": 20, "memory_kb": 4196}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s356469917", "group_id": "codeNet:p03941", "input_text": "hello i am new user thanks for approved :)", "language": "Lisp", "metadata": {"date": 1552323527, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s356469917.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s356469917", "user_id": "u210211818"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "hello i am new user thanks for approved :)", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 42, "cpu_time_ms": 83, "memory_kb": 8036}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s266126757", "group_id": "codeNet:p03941", "input_text": "http://fp.icontool.com/go.php?url=https://onlinecasino.us.org/  http://www.battlegreenresearch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://healthclick.tc/__media__/js/trademark.php?d=onlinecasino.us.org   http://www.stclairbaptist.org/System/UserProfile.asp?id=44602&func=signup&referer=https://onlinecasino.us.org  http://fa.arannews.com/?pageid=1&MID=22&url=https://onlinecasino.us.org   http://dermalight.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.poetrytogo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://drdelange.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.narrateconferences.org/go.php?redir=https://onlinecasino.us.org \nhttp://therapyswings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bonuskins.com/kak-skraftit-ak-47-krasnaya-liniya-v-ks-go/https://onlinecasino.us.org   http://investinbaltimore.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://creditunionlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://longtermculture.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://troyanassociates.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ruralhealthpilot.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.divhost.ru/go.php?go=https://onlinecasino.us.org   http://dreamit-buildit.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://autoconfig.ru/redirect.php?url=onlinecasino.us.org  http://www.rhythmking.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lexiconbranding.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.forsimpler.com/comment/comment?newsid=3129786&encoding=UTF-8&data=AC_BugAAABUAAC__AAAAAQBL44CK5pWw5a2X5raI6LS55Ye654mI6aKE5rWL44CL5oql5ZGK77ya5YWo55CD57q45aqS5Y-R5bGV6IO95Yqb5oiW6KKr5L2O5LywAAAAAAAAAAAAAAAvMC0CFF3KYM68TrEtSMNjD2npyA8wZnX7AhUAhbhWbrTnVA-XsqElaHgqPCNavAs.&referer=https://onlinecasino.us.org  http://amedicinalmind.libsyn.com/website?referer=https://onlinecasino.us.org   http://edgetoronto.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://westofchicagonow.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pyonta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sphreg.asiaone.com/RegAuth2/stsSignUp.html?goto=https://onlinecasino.us.org \nhttp://server.dorama-fan.ru/go/?https://onlinecasino.us.org  http://sicari.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cabinetarchitect.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tactilewood.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.impaacthiv.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ccmargarita.com/phpinfo.php?a<>=<a+href=https://onlinecasino.us.org  http://www.blitz-performance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pxd.cvstarr.tw/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.freeadultwebcams.org/cgi-bin/at3/out.cgi?s=70&l=thumb&c=1&u=https://onlinecasino.us.org \nhttp://hearing-aids-ohio.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tranchecellars.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://continuumtochrist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://indiagoldpolicycentre.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://boobsandboospodcast.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.resl-trk.com/redirect.php?client=1363595270-27428&url=https://onlinecasino.us.org  http://www.toponlinedegree.sale/cgi-bin/atx/out.cgi?c=0&l=gal&u=/onlinecasino.us.org  http://gasolinemoney.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gbcode.ofca.gov.hk/TuniS/onlinecasino.us.org \nhttp://bankmortgageservices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://uc.sjedu.cn/uchome/link.php?url=https://onlinecasino.us.org   http://kredit-pod-zalog.narod.ru/go?https://onlinecasino.us.org   http://carmelinsider.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://asianteentube.net/cgi-bin/crtr/out.cgi?url=https://onlinecasino.us.org/   http://tripwow.ru/go.php?url=https://onlinecasino.us.org  http://epnet.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://parentnetwork.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nextraqstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mingle.im/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://touchcheats.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://76.ru/feedback/mailto.php?m=li%2B2E9sMVU%2BSnv8MahWG5A%3D%3D&u=0QqRZytY0z8USbvoif9qDq6kjTMtd3pTm%2FcjdbDrzj1uW7zpwTlwqrOVKTNlGHGZkxkTHU%2BkxDM%3D&referer=https://onlinecasino.us.org   http://www.junic.ca/en/envoiami/index.php?url=https://onlinecasino.us.org  http://preferredvoices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bbs.qidian.ca/redirect.php?tid=23938&goto=onlinecasino.us.org  http://ecastcovers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://maryfrieloconnor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mmjames.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://freepressphotos.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kvu.su/bitrix/rk.php?id=276&site_id=s1&event1=banner&event2=click&event3=17+%2F+%5B276%5D+%5BA1%5D+%D0%A1%D1%82%D0%B0%D0%B6%D0%B5%D1%80&goto=https://onlinecasino.us.org   http://www.wzdq123.com/go.php?url=https://onlinecasino.us.org   http://kosairchildrenscharity.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://axoft.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org   http://jackteklimited.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nationstarsloan.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.5minute.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://postfach.biz/exchweb/bin/redir.asp?url=https://onlinecasino.us.org \nhttp://ygd.animelyric.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://razdelbittexno.biz-market.ru/jump.php?url=https://onlinecasino.us.org   http://intellomotive.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.schanghai.info/?p=&sl=cn&cjjobid=16354&partner=onlinecasino.us.org  http://nancyamvaughn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://terikehkeloonga.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.jewishmonumentforless.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ravendev.lt/DasBlog/ct.ashx?id=c89e2c07-f2f7-4e21-9507-4d044311c77d&url=https://onlinecasino.us.org   http://www.travels-guide.net/ref_gamer_com/redir.php?url=https://onlinecasino.us.org \nhttp://lbsreview.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lasvegasmagazine.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://virtualmanaging.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://greeningarkansas.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.highrisestyle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://girlsofthepacten.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cluttertherapy.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://insurancemgas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://foodtoyou.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://anasozu.com/bu-bokluklardan-tarafimizi-kim-paklayacek/#comment-9291\nhttp://forum.sonturkrpg.org/showthread.php?tid=99599&pid=157341#pid157341\nhttps://lavoroabergamo.it/index.php?topic=664397.new#new\nhttps://forum.itabcabc.ru/viewtopic.php?f=5&t=233935\nhttp://sifasudan.org/forum/showthread.php?tid=25073&pid=52541#pid52541\n", "language": "Lisp", "metadata": {"date": 1552037343, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s266126757.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s266126757", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://fp.icontool.com/go.php?url=https://onlinecasino.us.org/  http://www.battlegreenresearch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://healthclick.tc/__media__/js/trademark.php?d=onlinecasino.us.org   http://www.stclairbaptist.org/System/UserProfile.asp?id=44602&func=signup&referer=https://onlinecasino.us.org  http://fa.arannews.com/?pageid=1&MID=22&url=https://onlinecasino.us.org   http://dermalight.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.poetrytogo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://drdelange.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.narrateconferences.org/go.php?redir=https://onlinecasino.us.org \nhttp://therapyswings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bonuskins.com/kak-skraftit-ak-47-krasnaya-liniya-v-ks-go/https://onlinecasino.us.org   http://investinbaltimore.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://creditunionlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://longtermculture.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://troyanassociates.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ruralhealthpilot.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.divhost.ru/go.php?go=https://onlinecasino.us.org   http://dreamit-buildit.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://autoconfig.ru/redirect.php?url=onlinecasino.us.org  http://www.rhythmking.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lexiconbranding.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.forsimpler.com/comment/comment?newsid=3129786&encoding=UTF-8&data=AC_BugAAABUAAC__AAAAAQBL44CK5pWw5a2X5raI6LS55Ye654mI6aKE5rWL44CL5oql5ZGK77ya5YWo55CD57q45aqS5Y-R5bGV6IO95Yqb5oiW6KKr5L2O5LywAAAAAAAAAAAAAAAvMC0CFF3KYM68TrEtSMNjD2npyA8wZnX7AhUAhbhWbrTnVA-XsqElaHgqPCNavAs.&referer=https://onlinecasino.us.org  http://amedicinalmind.libsyn.com/website?referer=https://onlinecasino.us.org   http://edgetoronto.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://westofchicagonow.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pyonta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sphreg.asiaone.com/RegAuth2/stsSignUp.html?goto=https://onlinecasino.us.org \nhttp://server.dorama-fan.ru/go/?https://onlinecasino.us.org  http://sicari.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cabinetarchitect.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tactilewood.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.impaacthiv.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ccmargarita.com/phpinfo.php?a<>=<a+href=https://onlinecasino.us.org  http://www.blitz-performance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pxd.cvstarr.tw/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.freeadultwebcams.org/cgi-bin/at3/out.cgi?s=70&l=thumb&c=1&u=https://onlinecasino.us.org \nhttp://hearing-aids-ohio.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tranchecellars.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://continuumtochrist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://indiagoldpolicycentre.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://boobsandboospodcast.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.resl-trk.com/redirect.php?client=1363595270-27428&url=https://onlinecasino.us.org  http://www.toponlinedegree.sale/cgi-bin/atx/out.cgi?c=0&l=gal&u=/onlinecasino.us.org  http://gasolinemoney.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gbcode.ofca.gov.hk/TuniS/onlinecasino.us.org \nhttp://bankmortgageservices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://uc.sjedu.cn/uchome/link.php?url=https://onlinecasino.us.org   http://kredit-pod-zalog.narod.ru/go?https://onlinecasino.us.org   http://carmelinsider.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://asianteentube.net/cgi-bin/crtr/out.cgi?url=https://onlinecasino.us.org/   http://tripwow.ru/go.php?url=https://onlinecasino.us.org  http://epnet.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://parentnetwork.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nextraqstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mingle.im/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://touchcheats.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://76.ru/feedback/mailto.php?m=li%2B2E9sMVU%2BSnv8MahWG5A%3D%3D&u=0QqRZytY0z8USbvoif9qDq6kjTMtd3pTm%2FcjdbDrzj1uW7zpwTlwqrOVKTNlGHGZkxkTHU%2BkxDM%3D&referer=https://onlinecasino.us.org   http://www.junic.ca/en/envoiami/index.php?url=https://onlinecasino.us.org  http://preferredvoices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bbs.qidian.ca/redirect.php?tid=23938&goto=onlinecasino.us.org  http://ecastcovers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://maryfrieloconnor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mmjames.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://freepressphotos.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kvu.su/bitrix/rk.php?id=276&site_id=s1&event1=banner&event2=click&event3=17+%2F+%5B276%5D+%5BA1%5D+%D0%A1%D1%82%D0%B0%D0%B6%D0%B5%D1%80&goto=https://onlinecasino.us.org   http://www.wzdq123.com/go.php?url=https://onlinecasino.us.org   http://kosairchildrenscharity.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://axoft.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org   http://jackteklimited.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nationstarsloan.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.5minute.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://postfach.biz/exchweb/bin/redir.asp?url=https://onlinecasino.us.org \nhttp://ygd.animelyric.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://razdelbittexno.biz-market.ru/jump.php?url=https://onlinecasino.us.org   http://intellomotive.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.schanghai.info/?p=&sl=cn&cjjobid=16354&partner=onlinecasino.us.org  http://nancyamvaughn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://terikehkeloonga.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.jewishmonumentforless.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ravendev.lt/DasBlog/ct.ashx?id=c89e2c07-f2f7-4e21-9507-4d044311c77d&url=https://onlinecasino.us.org   http://www.travels-guide.net/ref_gamer_com/redir.php?url=https://onlinecasino.us.org \nhttp://lbsreview.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lasvegasmagazine.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://virtualmanaging.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://greeningarkansas.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.highrisestyle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://girlsofthepacten.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cluttertherapy.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://insurancemgas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://foodtoyou.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://anasozu.com/bu-bokluklardan-tarafimizi-kim-paklayacek/#comment-9291\nhttp://forum.sonturkrpg.org/showthread.php?tid=99599&pid=157341#pid157341\nhttps://lavoroabergamo.it/index.php?topic=664397.new#new\nhttps://forum.itabcabc.ru/viewtopic.php?f=5&t=233935\nhttp://sifasudan.org/forum/showthread.php?tid=25073&pid=52541#pid52541\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8073, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s911647771", "group_id": "codeNet:p03941", "input_text": "http://www.twobrutal.co.uk/forum/blog.php?b=12&goto=onlinecasino.us.org  http://horrorproject.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bbs.21art.cn/redirect.php?fid=4&tid=694&goto=onlinecasino.us.org   http://www.sdyojoy.com:1108/uchome/link.php?url=onlinecasino.us.org  http://poconotrails.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://toddcory.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://newmutualist.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sumikzabrze.pl/redirect.php?action=url&goto=https://onlinecasino.us.org   http://corporatehigh.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.affordablecebu.com/go?https://onlinecasino.us.org  http://filastylematters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://bbs.mctalks.com/index.php?c=login&&referer=https://onlinecasino.us.org   http://www.01happy.com/redirect.php?u=https://onlinecasino.us.org  http://www.htzkj.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://www.lanebryantcreditcard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://everythinggoesbooks.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://testdkimhosting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.xpressreg.net/EmailRedirect.asp?rid=30956755&url=https://onlinecasino.us.org/ \nhttp://foodworldworkersunite.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ballhockeymontreal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myturbines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://renter-reviews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.volleyballsonthofen.de/cms/?redirect&url=https://onlinecasino.us.org   http://www.odkupieniemiast.pl/cgi-bin/ucj/c.cgi?url=https://onlinecasino.us.org  http://www.stsaviourhampstead.org.uk/goto-link.php?link_id=12&url=https://onlinecasino.us.org  http://www.wyominghealthmatters.org/redir.php?url=https://onlinecasino.us.org   http://www.tishler.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.fatalbert.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vsp-france.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.geekepisodes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://capitolford.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://qualityplannedcommunity.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://net.shisu.edu.cn/LinkClick.aspx?link=https://onlinecasino.us.org  http://pearlslife.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vnf.ortax.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jaffon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://digitalmediaeducationlibrary.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://isherweapons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://enews2.sfera.net/newsletter/redirect.php?id=pd.circolomecenate@gmail.com_0000009927_144&link=https://onlinecasino.us.org   http://balmolod.ru/link.php?url=https://onlinecasino.us.org  http://ad.itweb.co.za/adclick.php?bannerid=30982&zoneid=&source=&dest=https://onlinecasino.us.org   http://bestnightinnmotel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://abetterengineeringjob.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.ddlang.com/wp-content/themes/begin-lts/inc/go.php?url=https://onlinecasino.us.org   http://www.aneta.dev.senzaparty.net/redir.php?link=https://onlinecasino.us.org \nhttp://www.avadl.me/goto/https://onlinecasino.us.org  http://www.edi-software.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bluearrowone.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://niconese.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://599salon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://havrehilinerealty.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://amazon4a.appspot.com/www.bats.org.uk/download_info.php?id=1181&file=Halloween_Fundraising_for_Bats.pdf&referer=https://onlinecasino.us.org  http://blueyarn.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lkv.ptarmigan.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://omgeoconnect.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.phaser.me/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://www.hotwebamateurs.com/cgi-bin/tlists/top100/out.cgi?id=Andee&url=https://onlinecasino.us.org   http://alkahlout.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://zapazit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://grossepointemag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nilesandcompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.afn360.com/go-to-source.php?url=https://onlinecasino.us.org   http://adroitlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://tuning-garage.ru/go.php?https://onlinecasino.us.org/  http://www.grandslamfantasytennis.com/news.php?newsaddress=https://onlinecasino.us.org   http://shoppinginsights.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://job-application-online.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://avto-for.ru/forum/go.php?https://onlinecasino.us.org/   http://blog.siol.net/agregat/redirect_post/?url=https://onlinecasino.us.org  http://donungonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://saora.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://174133862.r.bat.bing.com/?ld=d3a1zNWdlDeflMQNcWmUS-tjVUCUxhjvc6AtqIf_Wl7AsmDX8hMdKmXZIYb3snSL3QDrb3B7IF_DljSjepJr6sPsO6kRBmW9EwlZtWErzDGiCvk6pghprkGF6gnYFayHfV8b6WTOF0pzRFO_IwXg0sV_gCdACYd4L4bri_sBN69ryOSmf9&u=https://onlinecasino.us.org \nhttp://www.homepageexpo.com/redirect.php?url=https://onlinecasino.us.org  https://www.findproductmanuals.com/go.php?link=https://onlinecasino.us.org   http://radiocommunications-usa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://esteronews.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hardtickets.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://usedprivateplanes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jqp.tippytoe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://728.familydollar.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ppcoverview.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://juleslennon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://georgewbushfreedomcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lww.coreskatemag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ihategreatlakes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.dmzy8.com/wp-content/themes/begin4.6-1/inc/go.php?url=https://onlinecasino.us.org   http://nautilus-gurzuf.ru/go.php?url=https://onlinecasino.us.org  http://a6forum.pl/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fa6forum.pl%2F2-0-tdi-cr-vcds-wypalanie-dpf-a-t2174.html&code=28fc132629cfec526a928078ec160118&board_url=https://onlinecasino.us.org  http://sambastore.com/en/mandeparaumamigo.php?url=https://onlinecasino.us.org   http://techticket.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://kokifilmaziureti.lt/2016/07/24/we-need-to-talk-about-kevin-2011/\nhttp://niklever.com/spritoon/forum/viewtopic.php?f=5&t=349839\nhttps://weechookeong.com/2018/05/30/masa-sekarang-menungggu-mu-part-5-tourism-msias-rm99-694-mil-speedy-gonzales-contract/\nhttp://chs.my/forum/viewtopic.php?f=4&t=90705&p=285209#p285209\nhttp://alanlauwatch.com/forum/viewtopic.php?f=2&t=177058\n", "language": "Lisp", "metadata": {"date": 1552031424, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s911647771.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s911647771", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.twobrutal.co.uk/forum/blog.php?b=12&goto=onlinecasino.us.org  http://horrorproject.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bbs.21art.cn/redirect.php?fid=4&tid=694&goto=onlinecasino.us.org   http://www.sdyojoy.com:1108/uchome/link.php?url=onlinecasino.us.org  http://poconotrails.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://toddcory.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://newmutualist.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sumikzabrze.pl/redirect.php?action=url&goto=https://onlinecasino.us.org   http://corporatehigh.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.affordablecebu.com/go?https://onlinecasino.us.org  http://filastylematters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://bbs.mctalks.com/index.php?c=login&&referer=https://onlinecasino.us.org   http://www.01happy.com/redirect.php?u=https://onlinecasino.us.org  http://www.htzkj.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://www.lanebryantcreditcard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://everythinggoesbooks.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://testdkimhosting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.xpressreg.net/EmailRedirect.asp?rid=30956755&url=https://onlinecasino.us.org/ \nhttp://foodworldworkersunite.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ballhockeymontreal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myturbines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://renter-reviews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.volleyballsonthofen.de/cms/?redirect&url=https://onlinecasino.us.org   http://www.odkupieniemiast.pl/cgi-bin/ucj/c.cgi?url=https://onlinecasino.us.org  http://www.stsaviourhampstead.org.uk/goto-link.php?link_id=12&url=https://onlinecasino.us.org  http://www.wyominghealthmatters.org/redir.php?url=https://onlinecasino.us.org   http://www.tishler.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.fatalbert.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vsp-france.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.geekepisodes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://capitolford.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://qualityplannedcommunity.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://net.shisu.edu.cn/LinkClick.aspx?link=https://onlinecasino.us.org  http://pearlslife.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vnf.ortax.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jaffon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://digitalmediaeducationlibrary.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://isherweapons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://enews2.sfera.net/newsletter/redirect.php?id=pd.circolomecenate@gmail.com_0000009927_144&link=https://onlinecasino.us.org   http://balmolod.ru/link.php?url=https://onlinecasino.us.org  http://ad.itweb.co.za/adclick.php?bannerid=30982&zoneid=&source=&dest=https://onlinecasino.us.org   http://bestnightinnmotel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://abetterengineeringjob.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.ddlang.com/wp-content/themes/begin-lts/inc/go.php?url=https://onlinecasino.us.org   http://www.aneta.dev.senzaparty.net/redir.php?link=https://onlinecasino.us.org \nhttp://www.avadl.me/goto/https://onlinecasino.us.org  http://www.edi-software.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bluearrowone.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://niconese.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://599salon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://havrehilinerealty.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://amazon4a.appspot.com/www.bats.org.uk/download_info.php?id=1181&file=Halloween_Fundraising_for_Bats.pdf&referer=https://onlinecasino.us.org  http://blueyarn.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lkv.ptarmigan.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://omgeoconnect.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.phaser.me/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://www.hotwebamateurs.com/cgi-bin/tlists/top100/out.cgi?id=Andee&url=https://onlinecasino.us.org   http://alkahlout.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://zapazit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://grossepointemag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nilesandcompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.afn360.com/go-to-source.php?url=https://onlinecasino.us.org   http://adroitlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://tuning-garage.ru/go.php?https://onlinecasino.us.org/  http://www.grandslamfantasytennis.com/news.php?newsaddress=https://onlinecasino.us.org   http://shoppinginsights.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://job-application-online.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://avto-for.ru/forum/go.php?https://onlinecasino.us.org/   http://blog.siol.net/agregat/redirect_post/?url=https://onlinecasino.us.org  http://donungonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://saora.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://174133862.r.bat.bing.com/?ld=d3a1zNWdlDeflMQNcWmUS-tjVUCUxhjvc6AtqIf_Wl7AsmDX8hMdKmXZIYb3snSL3QDrb3B7IF_DljSjepJr6sPsO6kRBmW9EwlZtWErzDGiCvk6pghprkGF6gnYFayHfV8b6WTOF0pzRFO_IwXg0sV_gCdACYd4L4bri_sBN69ryOSmf9&u=https://onlinecasino.us.org \nhttp://www.homepageexpo.com/redirect.php?url=https://onlinecasino.us.org  https://www.findproductmanuals.com/go.php?link=https://onlinecasino.us.org   http://radiocommunications-usa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://esteronews.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hardtickets.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://usedprivateplanes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jqp.tippytoe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://728.familydollar.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ppcoverview.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://juleslennon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://georgewbushfreedomcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lww.coreskatemag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ihategreatlakes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.dmzy8.com/wp-content/themes/begin4.6-1/inc/go.php?url=https://onlinecasino.us.org   http://nautilus-gurzuf.ru/go.php?url=https://onlinecasino.us.org  http://a6forum.pl/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fa6forum.pl%2F2-0-tdi-cr-vcds-wypalanie-dpf-a-t2174.html&code=28fc132629cfec526a928078ec160118&board_url=https://onlinecasino.us.org  http://sambastore.com/en/mandeparaumamigo.php?url=https://onlinecasino.us.org   http://techticket.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://kokifilmaziureti.lt/2016/07/24/we-need-to-talk-about-kevin-2011/\nhttp://niklever.com/spritoon/forum/viewtopic.php?f=5&t=349839\nhttps://weechookeong.com/2018/05/30/masa-sekarang-menungggu-mu-part-5-tourism-msias-rm99-694-mil-speedy-gonzales-contract/\nhttp://chs.my/forum/viewtopic.php?f=4&t=90705&p=285209#p285209\nhttp://alanlauwatch.com/forum/viewtopic.php?f=2&t=177058\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8080, "cpu_time_ms": 96, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s776255553", "group_id": "codeNet:p03941", "input_text": "http://www.schoolsmemorychampionships.com/absolutecontent/r.asp?u=https://onlinecasino.us.org  http://canyoncreekll.org/Goto.asp?url=https://onlinecasino.us.org   http://stadiumseatdepot.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://searchmonster.net/redirect.php?url=https://onlinecasino.us.org  http://lemoteurquitrouve.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hhk.badboyworldwidegroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wikipills.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mycourses.ntua.gr/document/goto/?url=onlinecasino.us.org   http://southamptonlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://horoskoopit.world-federation-exchanges.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thevirtualshaman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.compclubs.ru/redirect.php?url=https://onlinecasino.us.org   http://sns.zaoche168.com/link.php?url=https://onlinecasino.us.org  http://coursofppt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://southlandsolutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jplayer-generator.live-streams.nl/index.php?filename=29843792.jpg&stationurl=https://onlinecasino.us.org  http://diobpt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://davini.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.johnlogan.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://203.186.61.70/gate/gb/onlinecasino.us.org/   http://tennisintegrityunit.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hindifilmnews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www45.atpages.jp/redirect/redirect.php?u=https://onlinecasino.us.org   http://gototechnology.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://m.vitalmx.com/redirect?url=https://onlinecasino.us.org  http://bigtirehouse.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elevator-pitch-olympics.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.safaviehrugs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://planetverification.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bors.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://eqsoftwares.com/languages/setlanguage?LanguageSign=en&redirect=https://onlinecasino.us.org  http://cott2.freebbs.tw/redirect.php?tid=31973&goto=onlinecasino.us.org   http://lrheart.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mbmggroup.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://addictcars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yogahorseware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.jaynestars.com/?go=https://onlinecasino.us.org  http://redpointvc.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://garycharlesjones.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://slutscome.in/str/out.php?l=0s.0.18.16813.18488&u=/onlinecasino.us.org  http://lincolnsudbury.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.home-chef.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.liyixiang.com/link.php?url=https://onlinecasino.us.org  http://navigationdrone.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myperimeter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.rustrahovka.ru/bitrix/rk.php?goto=https://onlinecasino.us.org  http://www.telechange.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lxq.cps-agr.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.hub2317.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bigimagination.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://styple.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wolframpedia.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://cest-la-vie.ru/go/go.php?to=https://onlinecasino.us.org   http://www.roberttyler.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.gratislink.it/top/go.php?name=http://www.garganovacanze.it&?s=https://onlinecasino.us.org  http://toyotire.com.mx/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fmisrael.com/Error.aspx?url=https://onlinecasino.us.org   http://rehabilitation-en.tbzmed.ac.ir/?pageid=1&MID=22&url=https://onlinecasino.us.org  http://kuehnenterprises.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://m.shopinlosangeles.net/redirect.aspx?url=https://onlinecasino.us.org  http://design.binarybrains.com/redirect.php?url=https://onlinecasino.us.org  http://kfl.internets.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tasteoffreedom.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ledyachtlighting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.xlietou.com/link.php?url=https://onlinecasino.us.org   http://drinking4causes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://redirect.crackitindonesia.com/?url=https://onlinecasino.us.org  http://mystaffingindustry.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vkirove.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org  https://forum.freeadvice.com/redirect-to/?redirect=https://onlinecasino.us.org  http://pxphd.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://catalog-goroda.ru/redirect.php?url=onlinecasino.us.org \nhttp://maumeecomputerrepair.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://blog.hunterridgejewelry.com/page/5/?go=https://onlinecasino.us.org   http://www.keyfora.com/site/onlinecasino.us.org   http://youngadulttoday.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thegrandlife.me/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mukawil.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://louisanalist.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://f1rstclaim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://home.dadunet.com/link.php?url=https://onlinecasino.us.org \nhttp://atretailmarketingcareers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.isnt-it-romantic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.goblinstube.com/cgi-bin/atx/out.cgi?id=14&tag=toplistbtm&trade=https://onlinecasino.us.org   http://sportodontic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://brkhsoa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bentvoice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://copperschocolate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://neogeia.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://msbluesride.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://forum.lakshmi-food.ru/viewtopic.php?f=3&t=400909\nhttps://yancearizona.net/2010/04/17/pendaftaran-wilayah-adat-belum-jelas/\nhttp://vestiro.ro/forum/index.php/topic,68216.new.html#new\nhttp://exo-team.ru/forum/viewtopic.php?pid=836942#p836942\nhttp://sentosariversidedanang.com/?contact-form-id=65021&contact-form-sent=138555&contact-form-hash=7b9eb1e8172cd6626a9505197d4ae3613604e072&_wpnonce=8835a51acf\n", "language": "Lisp", "metadata": {"date": 1552002133, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s776255553.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s776255553", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.schoolsmemorychampionships.com/absolutecontent/r.asp?u=https://onlinecasino.us.org  http://canyoncreekll.org/Goto.asp?url=https://onlinecasino.us.org   http://stadiumseatdepot.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://searchmonster.net/redirect.php?url=https://onlinecasino.us.org  http://lemoteurquitrouve.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hhk.badboyworldwidegroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wikipills.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mycourses.ntua.gr/document/goto/?url=onlinecasino.us.org   http://southamptonlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://horoskoopit.world-federation-exchanges.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thevirtualshaman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.compclubs.ru/redirect.php?url=https://onlinecasino.us.org   http://sns.zaoche168.com/link.php?url=https://onlinecasino.us.org  http://coursofppt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://southlandsolutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jplayer-generator.live-streams.nl/index.php?filename=29843792.jpg&stationurl=https://onlinecasino.us.org  http://diobpt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://davini.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.johnlogan.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://203.186.61.70/gate/gb/onlinecasino.us.org/   http://tennisintegrityunit.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hindifilmnews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www45.atpages.jp/redirect/redirect.php?u=https://onlinecasino.us.org   http://gototechnology.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://m.vitalmx.com/redirect?url=https://onlinecasino.us.org  http://bigtirehouse.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elevator-pitch-olympics.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.safaviehrugs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://planetverification.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bors.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://eqsoftwares.com/languages/setlanguage?LanguageSign=en&redirect=https://onlinecasino.us.org  http://cott2.freebbs.tw/redirect.php?tid=31973&goto=onlinecasino.us.org   http://lrheart.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mbmggroup.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://addictcars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yogahorseware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.jaynestars.com/?go=https://onlinecasino.us.org  http://redpointvc.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://garycharlesjones.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://slutscome.in/str/out.php?l=0s.0.18.16813.18488&u=/onlinecasino.us.org  http://lincolnsudbury.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.home-chef.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.liyixiang.com/link.php?url=https://onlinecasino.us.org  http://navigationdrone.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myperimeter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.rustrahovka.ru/bitrix/rk.php?goto=https://onlinecasino.us.org  http://www.telechange.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lxq.cps-agr.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.hub2317.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bigimagination.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://styple.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wolframpedia.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://cest-la-vie.ru/go/go.php?to=https://onlinecasino.us.org   http://www.roberttyler.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.gratislink.it/top/go.php?name=http://www.garganovacanze.it&?s=https://onlinecasino.us.org  http://toyotire.com.mx/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fmisrael.com/Error.aspx?url=https://onlinecasino.us.org   http://rehabilitation-en.tbzmed.ac.ir/?pageid=1&MID=22&url=https://onlinecasino.us.org  http://kuehnenterprises.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://m.shopinlosangeles.net/redirect.aspx?url=https://onlinecasino.us.org  http://design.binarybrains.com/redirect.php?url=https://onlinecasino.us.org  http://kfl.internets.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tasteoffreedom.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ledyachtlighting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.xlietou.com/link.php?url=https://onlinecasino.us.org   http://drinking4causes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://redirect.crackitindonesia.com/?url=https://onlinecasino.us.org  http://mystaffingindustry.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vkirove.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org  https://forum.freeadvice.com/redirect-to/?redirect=https://onlinecasino.us.org  http://pxphd.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://catalog-goroda.ru/redirect.php?url=onlinecasino.us.org \nhttp://maumeecomputerrepair.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://blog.hunterridgejewelry.com/page/5/?go=https://onlinecasino.us.org   http://www.keyfora.com/site/onlinecasino.us.org   http://youngadulttoday.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thegrandlife.me/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mukawil.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://louisanalist.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://f1rstclaim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://home.dadunet.com/link.php?url=https://onlinecasino.us.org \nhttp://atretailmarketingcareers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.isnt-it-romantic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.goblinstube.com/cgi-bin/atx/out.cgi?id=14&tag=toplistbtm&trade=https://onlinecasino.us.org   http://sportodontic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://brkhsoa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bentvoice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://copperschocolate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://neogeia.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://msbluesride.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://forum.lakshmi-food.ru/viewtopic.php?f=3&t=400909\nhttps://yancearizona.net/2010/04/17/pendaftaran-wilayah-adat-belum-jelas/\nhttp://vestiro.ro/forum/index.php/topic,68216.new.html#new\nhttp://exo-team.ru/forum/viewtopic.php?pid=836942#p836942\nhttp://sentosariversidedanang.com/?contact-form-id=65021&contact-form-sent=138555&contact-form-hash=7b9eb1e8172cd6626a9505197d4ae3613604e072&_wpnonce=8835a51acf\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7611, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s018177752", "group_id": "codeNet:p03941", "input_text": "http://abbeyfield.gs/__media__/js/trademark.php?d=onlinecasino.us.org  http://greystonemortgagecapital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://thebrinkmans.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lucys-city.de/thread.php?goto=onlinecasino.us.org  http://barkatecture.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fulhamsw6.com/default.asp?section=info&link=https://onlinecasino.us.org  http://www.betsefernet.com/main/redir.asp?https://onlinecasino.us.org  http://usaidgcctraining.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://redir.yy.duowan.com/warning.php?url=https://onlinecasino.us.org \nhttps://www.muztang.ru/bitrix/rk.php?id=23&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B23%5D+%5Bmain_page_slider%5D+%D0%91%D0%B0%D0%BD%D0%BD%D0%B5%D1%80+%D1%80%D0%B0%D1%81%D0%BF%D1%80%D0%BE%D0%B4%D0%B0%D0%B6%D0%B0+HI-WATT&goto=onlinecasino.us.org  http://dudakia.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hybridblimps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brokersandattorneys.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.oldi.ru/bitrix/rk.php?id=2267&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B2267%5D+%5BINDEX_BIG%5D+%CC%D4%D3+HP+%E2+%EF%EE%E4%E0%F0%EE%EA&goto=onlinecasino.us.org   http://road.vg/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://northwestmls.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://deseretfulfillmentservices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://originalclassiccars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wheelblaster.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hazardswake.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://malayalam.deepikaglobal.com/redirectadvt.asp?cid=icons/calendar_2010.gif&URL=https://onlinecasino.us.org   http://peopleprofitingfromplrcontent.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hypnobabies-central.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://feathervision.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nation-star-orange-county.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://markhatcher.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.orbitcargo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://de.filmzitate.info/index-link.php?link=https://onlinecasino.us.org  http://fscc-calledtobe.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://filmsforthehumanities.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://esbs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://linker2.worldcat.org/?jHome=https://onlinecasino.us.org   http://www.laslomasd.tk/out.php?l=https://onlinecasino.us.org  http://pricebargain.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.eighteensound.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://www.pigbrother.at/index.php?id=22&url=https://onlinecasino.us.org \nhttp://fountainheadcapital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hobodataloggers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://abeerqurashi.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.diyzn.cc/wp-content/themes/beginlts/inc/go.php?url=https://onlinecasino.us.org  https://www.linkhaitao.com/index.php?mod=lhdeal&track=1c64_b8M5qx9heaNRLUOXE_bvVbRh9kX_b30IewSZrLdUl5fEbN9HSaA2iCRM3z&tag=_s139172_&new=https://onlinecasino.us.org   http://turkishairlinescars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://svwrestling.com/Goto.asp?url=https://onlinecasino.us.org  http://yummycrunch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nstar-spb.ru/bitrix/rk.php?id=220&event1=banner&event2=click&event3=1+%2F+%5B220%5D+%5Bright8%5D+%AB%D2%F0%E8+%E2%E5%EA%E0+%EA%EB%E0%F1%F1%E8%F7%E5%F1%EA%EE%E3%EE+%F0%EE%EC%E0%ED%F1%E0%BB&goto=https://onlinecasino.us.org \nhttp://thecoingroup.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sushiboom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.tuitionfundingsources.com/plog.php?u=https://onlinecasino.us.org   http://www.tetechercheuse.ca/redirect.php?url=https://onlinecasino.us.org  http://myestorefront.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://easivent.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://centralpanasonic.com.mx/bitrix/rk.php?id=24&event1=banner&event2=click&event3=1+%2F+%5B24%5D+%5B670x120%5D+App+Blu-ray&goto=https://onlinecasino.us.org  http://about-spas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://shop.rshaarlem.nl/redirect.php?action=url&goto=onlinecasino.us.org \nhttp://silliker-estar.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://guzmopb2.ru/go.php?url=https://onlinecasino.us.org   http://www.?????.tw/pro/redirect.php?url=https://onlinecasino.us.org   http://people4success.co.nz/ra.asp?m=66203&p=&url=https://onlinecasino.us.org  http://my.otvetim.com.ua/go/url=https://onlinecasino.us.org   http://smith.suparegistration.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://advanceamericavisa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mooseheadlakecabins.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://longviewfibre.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://irwinsaviersballard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cafgroup.napkinnipper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ultimate-dream.co/index.php?thememode=full;redirect=https://onlinecasino.us.org   http://zxm.telcosystems.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://japanesestaffingconnection.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nesudba.net/go/url=onlinecasino.us.org  http://us.zilok.com/item/redirect/?url=https://onlinecasino.us.org  http://www.masonlight.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://prcy.ru/seo/onlinecasino.us.org \nhttp://sobermagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.wildmaineadventures.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://planerwelt.tip-f1.net/index.php?a<>=<a+href=https://onlinecasino.us.org   http://zitem.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gmredtagpricing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://apmcomm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://digitallandrun.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://interpol-s.ru/go/url=https://onlinecasino.us.org   http://bretten.schachvereine.de/gbook133e/go.php?url=https://onlinecasino.us.org \nhttp://havajob.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://websiteanalise.studiodigital.ws/redirect.php?url=https://onlinecasino.us.org   http://austinfurniturerental.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://firstbaptistloeb.org/System/ForgotPassword.asp?id=42182&referer=https://onlinecasino.us.org  http://vahomeloans101.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://montereycannabiscompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.wifisukien.com.vn/v2/url?u=https://onlinecasino.us.org  http://jctcuonline.org/redirect.php?link=https://onlinecasino.us.org   http://dentegrainsurance.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://forum.asdrlabels.com/index.php?topic=401731.new#new\nhttp://forum.venture.com.bd/index.php?topic=2936.new#new\nhttps://primeaque.com/forum/index.php?topic=90095.new#new\nhttp://greenegreene.com/GGwp/2015/11/14/hello-world/?unapproved=80764&moderation-hash=a1d4e49bf5c2c01203a792190a2673c8#comment-80764\nhttps://forumgalaxy.net/viewtopic.php?f=5&t=9436\n", "language": "Lisp", "metadata": {"date": 1551966654, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s018177752.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s018177752", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://abbeyfield.gs/__media__/js/trademark.php?d=onlinecasino.us.org  http://greystonemortgagecapital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://thebrinkmans.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lucys-city.de/thread.php?goto=onlinecasino.us.org  http://barkatecture.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fulhamsw6.com/default.asp?section=info&link=https://onlinecasino.us.org  http://www.betsefernet.com/main/redir.asp?https://onlinecasino.us.org  http://usaidgcctraining.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://redir.yy.duowan.com/warning.php?url=https://onlinecasino.us.org \nhttps://www.muztang.ru/bitrix/rk.php?id=23&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B23%5D+%5Bmain_page_slider%5D+%D0%91%D0%B0%D0%BD%D0%BD%D0%B5%D1%80+%D1%80%D0%B0%D1%81%D0%BF%D1%80%D0%BE%D0%B4%D0%B0%D0%B6%D0%B0+HI-WATT&goto=onlinecasino.us.org  http://dudakia.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hybridblimps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brokersandattorneys.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.oldi.ru/bitrix/rk.php?id=2267&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B2267%5D+%5BINDEX_BIG%5D+%CC%D4%D3+HP+%E2+%EF%EE%E4%E0%F0%EE%EA&goto=onlinecasino.us.org   http://road.vg/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://northwestmls.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://deseretfulfillmentservices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://originalclassiccars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wheelblaster.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hazardswake.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://malayalam.deepikaglobal.com/redirectadvt.asp?cid=icons/calendar_2010.gif&URL=https://onlinecasino.us.org   http://peopleprofitingfromplrcontent.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hypnobabies-central.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://feathervision.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nation-star-orange-county.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://markhatcher.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.orbitcargo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://de.filmzitate.info/index-link.php?link=https://onlinecasino.us.org  http://fscc-calledtobe.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://filmsforthehumanities.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://esbs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://linker2.worldcat.org/?jHome=https://onlinecasino.us.org   http://www.laslomasd.tk/out.php?l=https://onlinecasino.us.org  http://pricebargain.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.eighteensound.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://www.pigbrother.at/index.php?id=22&url=https://onlinecasino.us.org \nhttp://fountainheadcapital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hobodataloggers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://abeerqurashi.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.diyzn.cc/wp-content/themes/beginlts/inc/go.php?url=https://onlinecasino.us.org  https://www.linkhaitao.com/index.php?mod=lhdeal&track=1c64_b8M5qx9heaNRLUOXE_bvVbRh9kX_b30IewSZrLdUl5fEbN9HSaA2iCRM3z&tag=_s139172_&new=https://onlinecasino.us.org   http://turkishairlinescars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://svwrestling.com/Goto.asp?url=https://onlinecasino.us.org  http://yummycrunch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nstar-spb.ru/bitrix/rk.php?id=220&event1=banner&event2=click&event3=1+%2F+%5B220%5D+%5Bright8%5D+%AB%D2%F0%E8+%E2%E5%EA%E0+%EA%EB%E0%F1%F1%E8%F7%E5%F1%EA%EE%E3%EE+%F0%EE%EC%E0%ED%F1%E0%BB&goto=https://onlinecasino.us.org \nhttp://thecoingroup.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sushiboom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.tuitionfundingsources.com/plog.php?u=https://onlinecasino.us.org   http://www.tetechercheuse.ca/redirect.php?url=https://onlinecasino.us.org  http://myestorefront.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://easivent.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://centralpanasonic.com.mx/bitrix/rk.php?id=24&event1=banner&event2=click&event3=1+%2F+%5B24%5D+%5B670x120%5D+App+Blu-ray&goto=https://onlinecasino.us.org  http://about-spas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://shop.rshaarlem.nl/redirect.php?action=url&goto=onlinecasino.us.org \nhttp://silliker-estar.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://guzmopb2.ru/go.php?url=https://onlinecasino.us.org   http://www.?????.tw/pro/redirect.php?url=https://onlinecasino.us.org   http://people4success.co.nz/ra.asp?m=66203&p=&url=https://onlinecasino.us.org  http://my.otvetim.com.ua/go/url=https://onlinecasino.us.org   http://smith.suparegistration.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://advanceamericavisa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mooseheadlakecabins.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://longviewfibre.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://irwinsaviersballard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cafgroup.napkinnipper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ultimate-dream.co/index.php?thememode=full;redirect=https://onlinecasino.us.org   http://zxm.telcosystems.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://japanesestaffingconnection.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nesudba.net/go/url=onlinecasino.us.org  http://us.zilok.com/item/redirect/?url=https://onlinecasino.us.org  http://www.masonlight.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://prcy.ru/seo/onlinecasino.us.org \nhttp://sobermagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.wildmaineadventures.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://planerwelt.tip-f1.net/index.php?a<>=<a+href=https://onlinecasino.us.org   http://zitem.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gmredtagpricing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://apmcomm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://digitallandrun.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://interpol-s.ru/go/url=https://onlinecasino.us.org   http://bretten.schachvereine.de/gbook133e/go.php?url=https://onlinecasino.us.org \nhttp://havajob.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://websiteanalise.studiodigital.ws/redirect.php?url=https://onlinecasino.us.org   http://austinfurniturerental.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://firstbaptistloeb.org/System/ForgotPassword.asp?id=42182&referer=https://onlinecasino.us.org  http://vahomeloans101.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://montereycannabiscompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.wifisukien.com.vn/v2/url?u=https://onlinecasino.us.org  http://jctcuonline.org/redirect.php?link=https://onlinecasino.us.org   http://dentegrainsurance.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://forum.asdrlabels.com/index.php?topic=401731.new#new\nhttp://forum.venture.com.bd/index.php?topic=2936.new#new\nhttps://primeaque.com/forum/index.php?topic=90095.new#new\nhttp://greenegreene.com/GGwp/2015/11/14/hello-world/?unapproved=80764&moderation-hash=a1d4e49bf5c2c01203a792190a2673c8#comment-80764\nhttps://forumgalaxy.net/viewtopic.php?f=5&t=9436\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8167, "cpu_time_ms": 102, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s695281893", "group_id": "codeNet:p03941", "input_text": "http://centre-group.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://learn2speak.difelene.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://manadhe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mypanerapickup.ca/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://valeuraenergy.ca/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://humangrowthcapital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://grchapman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://m.ww.filmzitate.info/index-link.php?link=https://onlinecasino.us.org   http://realms-of-fiction.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://onewcs.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.beethoven-gymnasium.de/index.php?id=73&refresh=1&url=https://onlinecasino.us.org   http://bennyemakeup.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.livetsordsbforlag.gq/tgpx/click.php?id=85083&s=100&u=https://onlinecasino.us.org  http://crazy-3d-world.com/crtr/cgi/out.cgi?id=173&l=top_top&u=https://onlinecasino.us.org   http://ptours.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://a-prostine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://phventures.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://theprandmarketingagency.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://carolchrista.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.asiawater.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://bilingualschooljobs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://thecalendarsystem.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.frankfinn.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.deic.uab.es/recerca/reportar.php3?url=https://onlinecasino.us.org  http://ihatedavidweekly.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://qgk.cityoliveoil.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vwk.skybail.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://planetverification.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.backbonebanners.com/click.php?z=1&a=13000&c=&d=0&url=https://onlinecasino.us.org   http://wptz.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ty.17imo.com/index.php?g=Appoint&c=Changecity&a=go&city=jq&referer=https://onlinecasino.us.org  http://wavebroadbandsux.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.corpfarm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ok1dub.cz/proxy/index.php?url=https://onlinecasino.us.org  http://kettlewhistle.co/website-review/redirect.php?url=https://onlinecasino.us.org   http://midnightrp.smfnew2.com/index.php?thememode=full;redirect=https://onlinecasino.us.org \nhttp://inpoweryourkids.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.weblint.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://logc204.xiti.com/go.url?xts=453041&xtor=AD-8-<dsl>check-glasfaser-0713]-<basis>-<>40x30]-<t>online.de]-<>-<Startseite>&url=https://onlinecasino.us.org   http://www.hitarm.ru/links.php?go=https://onlinecasino.us.org  http://takebackthenight.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ccppa.ca/LinkClick.aspx?link=https://onlinecasino.us.org  http://qwj.outdoorrewards.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mantomars.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elmhurstparkdistrict.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://nucarautocenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://adviceaboutvisioncorrection.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bbs.cnmybbs.com/redirect.php?tid=11810&goto=onlinecasino.us.org   http://www.pabili.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cartouche.nonore.com/go.php?url=https://onlinecasino.us.org   http://www.mdscore.com/__media__/js/trademark.php?d=onlinecasino.us.org  https://www.depigest.ch/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://wetpantiesmovies.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://imperialbakery.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.compacttractorreview.com/redirect.aspx?url=onlinecasino.us.org  http://aggressionmanagement.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nalmls.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://whews.westaircomm.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gd-zz.edutt.com/bbs/index.asp?url=https://onlinecasino.us.org   http://www.mcusw.com/redirect.php?tid=1283&bbsid=5&goto=onlinecasino.us.org  http://cuttingedgephysicaltherapy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://smartycamhd.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://orentepper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://appmarketermagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bokuantena.com/out.php?out=https://onlinecasino.us.org   http://marketingforlawyers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://osfspiritofhopeconcert.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.leading.ee/module/bannerExt/redirect.php?id=65&url=https://onlinecasino.us.org   http://digitalpowerlines.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.wipo.uni-jena.de/index.php?id=155&use_get_query=1&suffix=print&?s=https://onlinecasino.us.org  http://mackinacchocolatecompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ldslflicks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.lawdailyrecord.com/Redirect.asp?UID=16146345&SubSectionID=-1&AdArrayID=20&AdPosition=0&Linkurl=https://onlinecasino.us.org  http://www.childrencoffee.com/search/redirect.php?f=https://onlinecasino.us.org   http://cruisehoneymoon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://farport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://spin-communications.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ladderworld.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.crazyfamous.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://flyin3d.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.wordxml.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://flooring-stlouis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sirensconference.org/go.php?redir=https://onlinecasino.us.org   http://l.rhsoccer.org/Goto.asp?url=https://onlinecasino.us.org   http://wealthoptimization.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://laser.nonore.com/go.php?url=https://onlinecasino.us.org   http://dnslookup.fr/onlinecasino.us.org  http://qualityrestdowncomforters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sfcyclones.com/tracker/index.html?t=sponsor&sponsor_id=1&url=https://onlinecasino.us.org/   http://unclesamautoinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://kowrai.net.md-92.webhostbox.net/punbb/viewtopic.php?pid=608719#p608719\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=437004\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttps://www.knownothing.net/community2/index.php/topic,325655.new.html#new\nhttp://300house.com/forum/viewtopic.php?f=14&t=230993\n", "language": "Lisp", "metadata": {"date": 1551894654, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s695281893.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s695281893", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://centre-group.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://learn2speak.difelene.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://manadhe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mypanerapickup.ca/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://valeuraenergy.ca/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://humangrowthcapital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://grchapman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://m.ww.filmzitate.info/index-link.php?link=https://onlinecasino.us.org   http://realms-of-fiction.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://onewcs.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.beethoven-gymnasium.de/index.php?id=73&refresh=1&url=https://onlinecasino.us.org   http://bennyemakeup.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.livetsordsbforlag.gq/tgpx/click.php?id=85083&s=100&u=https://onlinecasino.us.org  http://crazy-3d-world.com/crtr/cgi/out.cgi?id=173&l=top_top&u=https://onlinecasino.us.org   http://ptours.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://a-prostine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://phventures.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://theprandmarketingagency.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://carolchrista.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.asiawater.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://bilingualschooljobs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://thecalendarsystem.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.frankfinn.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.deic.uab.es/recerca/reportar.php3?url=https://onlinecasino.us.org  http://ihatedavidweekly.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://qgk.cityoliveoil.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vwk.skybail.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://planetverification.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.backbonebanners.com/click.php?z=1&a=13000&c=&d=0&url=https://onlinecasino.us.org   http://wptz.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ty.17imo.com/index.php?g=Appoint&c=Changecity&a=go&city=jq&referer=https://onlinecasino.us.org  http://wavebroadbandsux.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.corpfarm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ok1dub.cz/proxy/index.php?url=https://onlinecasino.us.org  http://kettlewhistle.co/website-review/redirect.php?url=https://onlinecasino.us.org   http://midnightrp.smfnew2.com/index.php?thememode=full;redirect=https://onlinecasino.us.org \nhttp://inpoweryourkids.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.weblint.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://logc204.xiti.com/go.url?xts=453041&xtor=AD-8-<dsl>check-glasfaser-0713]-<basis>-<>40x30]-<t>online.de]-<>-<Startseite>&url=https://onlinecasino.us.org   http://www.hitarm.ru/links.php?go=https://onlinecasino.us.org  http://takebackthenight.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ccppa.ca/LinkClick.aspx?link=https://onlinecasino.us.org  http://qwj.outdoorrewards.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mantomars.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elmhurstparkdistrict.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://nucarautocenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://adviceaboutvisioncorrection.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bbs.cnmybbs.com/redirect.php?tid=11810&goto=onlinecasino.us.org   http://www.pabili.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cartouche.nonore.com/go.php?url=https://onlinecasino.us.org   http://www.mdscore.com/__media__/js/trademark.php?d=onlinecasino.us.org  https://www.depigest.ch/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://wetpantiesmovies.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://imperialbakery.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.compacttractorreview.com/redirect.aspx?url=onlinecasino.us.org  http://aggressionmanagement.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nalmls.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://whews.westaircomm.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gd-zz.edutt.com/bbs/index.asp?url=https://onlinecasino.us.org   http://www.mcusw.com/redirect.php?tid=1283&bbsid=5&goto=onlinecasino.us.org  http://cuttingedgephysicaltherapy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://smartycamhd.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://orentepper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://appmarketermagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bokuantena.com/out.php?out=https://onlinecasino.us.org   http://marketingforlawyers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://osfspiritofhopeconcert.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.leading.ee/module/bannerExt/redirect.php?id=65&url=https://onlinecasino.us.org   http://digitalpowerlines.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.wipo.uni-jena.de/index.php?id=155&use_get_query=1&suffix=print&?s=https://onlinecasino.us.org  http://mackinacchocolatecompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ldslflicks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.lawdailyrecord.com/Redirect.asp?UID=16146345&SubSectionID=-1&AdArrayID=20&AdPosition=0&Linkurl=https://onlinecasino.us.org  http://www.childrencoffee.com/search/redirect.php?f=https://onlinecasino.us.org   http://cruisehoneymoon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://farport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://spin-communications.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ladderworld.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.crazyfamous.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://flyin3d.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.wordxml.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://flooring-stlouis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sirensconference.org/go.php?redir=https://onlinecasino.us.org   http://l.rhsoccer.org/Goto.asp?url=https://onlinecasino.us.org   http://wealthoptimization.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://laser.nonore.com/go.php?url=https://onlinecasino.us.org   http://dnslookup.fr/onlinecasino.us.org  http://qualityrestdowncomforters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sfcyclones.com/tracker/index.html?t=sponsor&sponsor_id=1&url=https://onlinecasino.us.org/   http://unclesamautoinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://kowrai.net.md-92.webhostbox.net/punbb/viewtopic.php?pid=608719#p608719\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=437004\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttps://www.knownothing.net/community2/index.php/topic,325655.new.html#new\nhttp://300house.com/forum/viewtopic.php?f=14&t=230993\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7849, "cpu_time_ms": 92, "memory_kb": 9448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s016891110", "group_id": "codeNet:p03941", "input_text": "http://usapatientadvocates.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.tourism-punjab.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://manifoldbar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://creativity.goldenarticles.net/go.php?url=https://onlinecasino.us.org  http://www.sparklinggreentea.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mycargo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://redlifeins.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vbriceland.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://revisions.linkedbyair.net/works-cited/?referer=https://onlinecasino.us.org \nhttp://obrabotki.nsksoft.ru/redirect.php?url=onlinecasino.us.org  http://alliancelinx.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://internete.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://funtrafficschoolonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trunellfelder.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://necmobileinternet.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fabclothinginc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.starlightenterprises.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://alldublinhomesforsale.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://myvendorview.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.cracking.com.ar/redir/redir.php?url=https://onlinecasino.us.org   http://www.discountslimited.com/internal.php?q=newark+element14+canada&n=949620&rk=1&u=&ts=2018-02-05%2001:34:10&clicked=1&rurl=https://onlinecasino.us.org   http://downtownresources.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.vxzone.com/redirect.php?url=onlinecasino.us.org   http://thegreencpa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kiddiedisco.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.revinveist.tk/cgi-bin/a2/out.cgi?s=10&l=random&u=https://onlinecasino.us.org   https://fixthecourt-dot-yamm-track.appspot.com/Redirect?ukey=1VZ4D2jXh-BRPW7SvpYPuqxYkgHCMAgMR0W3A1rBkIQQ-0&key=YAMMID-50312342&link=https://onlinecasino.us.org \nhttp://www.stevehenn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://garykain.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://socialstudionetwork.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://savingswithandre.info/click.php?id=161&url=onlinecasino.us.org  http://www.westguardinsurancecompany.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bronquite-infecciosa.com/redir.asp?from=PT&to=onlinecasino.us.org  http://raleighmusic.com/tracker.asp?id=7391&url=https://onlinecasino.us.org  http://www.bogpris.nu/buy_frame.php?store=Plusbog&url=https://onlinecasino.us.org   http://www.mobilnyt.dk/go/?url=https://onlinecasino.us.org \nhttp://www.scoopoo.com/redir.php?id=https://onlinecasino.us.org  http://connertonflorida.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dropsinthebucket.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://synergyservice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ydk.austinpubcrawl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://theelpasoprocessserver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.forevertube.ru/go/url=https://onlinecasino.us.org  http://452678.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cycloops.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://click2sue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.redshamen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nundinaeinc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tracgrad.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.xy1960.com/classblog/go.asp?url=https://onlinecasino.us.org   http://chilternestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sns.maimaicha.com/default/go?url=https://onlinecasino.us.org  http://bikedeco.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bloodpressureanswered.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://doit-yourself.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org  http://www.lqksyj.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://caexpertwitnesses.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://michaelverdu.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://musclemilkdiet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pesure.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://melrc.net/go?https://onlinecasino.us.org  http://www.sinelliconcepts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://polarusa.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://gnpn.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sandsofthecaribbean.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.contact-worldwide.com/redirect.php?url=https://onlinecasino.us.org   http://omcupper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://legentclearing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://iflypaws.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://139132855.r.bat.bing.com/?ld=d35zgw9o9bw3_1vUxtIGnzHTVUCUwfTcwu5zbNkpOnke_aXN2MLJLhUW_CEZ3O4P7r3UGdnF60uhrx7ReLnKldepJiFwUPXEerT92QBGs7Fa43WSXx7Wz2aF9RnuXhlEN8R4vOL2eabbX29Ge762gHw1erRyQ&u=https://onlinecasino.us.org  http://www.autosite.ua/redirect.html?url=https://onlinecasino.us.org   http://ihateaarcorp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.dreamboxsaudi.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://delaygifts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://9wivesclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://trck.epeldano.com/redirect.php?trgt_usr=@@@EMAIL@@@&target_url=onlinecasino.us.org  http://salsa-productions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://premium-scripts.info/?go=2320&url=https://onlinecasino.us.org  http://col.11510.net/out.cgi?id=00489&url=https://onlinecasino.us.org  http://iwantahat.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.justdownforme.com/www/onlinecasino.us.org \nhttp://nationwidetaxinc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.evansville.in.gov/redirect.aspx?url=https://onlinecasino.us.org   http://www.sjacps.edu.hk/cyberranger/home/link.php?url=https://onlinecasino.us.org   http://m.mts.by/bonus/bitrix/rk.php?goto=https://onlinecasino.us.org  https://roscomsport.com/golink/onlinecasino.us.org   http://zven.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.imporcar.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.resecon.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://algae-biodiesel.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://lavoroabergamo.it/index.php?topic=638191.new#new\nhttp://www.d-fakti.lv/forum/viewtopic.php?f=2&t=696643\nhttp://www.online-einsaetze.de/forum/showthread.php?tid=1385524\nhttp://www.piterenka.ru/forum/viewtopic.php?f=4&t=54738\nhttp://forum.cvma152.org/showthread.php?tid=143843&pid=164338#pid164338\n", "language": "Lisp", "metadata": {"date": 1551842382, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s016891110.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s016891110", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://usapatientadvocates.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.tourism-punjab.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://manifoldbar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://creativity.goldenarticles.net/go.php?url=https://onlinecasino.us.org  http://www.sparklinggreentea.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mycargo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://redlifeins.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vbriceland.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://revisions.linkedbyair.net/works-cited/?referer=https://onlinecasino.us.org \nhttp://obrabotki.nsksoft.ru/redirect.php?url=onlinecasino.us.org  http://alliancelinx.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://internete.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://funtrafficschoolonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trunellfelder.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://necmobileinternet.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fabclothinginc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.starlightenterprises.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://alldublinhomesforsale.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://myvendorview.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.cracking.com.ar/redir/redir.php?url=https://onlinecasino.us.org   http://www.discountslimited.com/internal.php?q=newark+element14+canada&n=949620&rk=1&u=&ts=2018-02-05%2001:34:10&clicked=1&rurl=https://onlinecasino.us.org   http://downtownresources.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.vxzone.com/redirect.php?url=onlinecasino.us.org   http://thegreencpa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kiddiedisco.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.revinveist.tk/cgi-bin/a2/out.cgi?s=10&l=random&u=https://onlinecasino.us.org   https://fixthecourt-dot-yamm-track.appspot.com/Redirect?ukey=1VZ4D2jXh-BRPW7SvpYPuqxYkgHCMAgMR0W3A1rBkIQQ-0&key=YAMMID-50312342&link=https://onlinecasino.us.org \nhttp://www.stevehenn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://garykain.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://socialstudionetwork.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://savingswithandre.info/click.php?id=161&url=onlinecasino.us.org  http://www.westguardinsurancecompany.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bronquite-infecciosa.com/redir.asp?from=PT&to=onlinecasino.us.org  http://raleighmusic.com/tracker.asp?id=7391&url=https://onlinecasino.us.org  http://www.bogpris.nu/buy_frame.php?store=Plusbog&url=https://onlinecasino.us.org   http://www.mobilnyt.dk/go/?url=https://onlinecasino.us.org \nhttp://www.scoopoo.com/redir.php?id=https://onlinecasino.us.org  http://connertonflorida.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dropsinthebucket.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://synergyservice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ydk.austinpubcrawl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://theelpasoprocessserver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.forevertube.ru/go/url=https://onlinecasino.us.org  http://452678.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cycloops.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://click2sue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.redshamen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nundinaeinc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tracgrad.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.xy1960.com/classblog/go.asp?url=https://onlinecasino.us.org   http://chilternestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sns.maimaicha.com/default/go?url=https://onlinecasino.us.org  http://bikedeco.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bloodpressureanswered.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://doit-yourself.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org  http://www.lqksyj.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://caexpertwitnesses.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://michaelverdu.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://musclemilkdiet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pesure.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://melrc.net/go?https://onlinecasino.us.org  http://www.sinelliconcepts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://polarusa.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://gnpn.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sandsofthecaribbean.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.contact-worldwide.com/redirect.php?url=https://onlinecasino.us.org   http://omcupper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://legentclearing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://iflypaws.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://139132855.r.bat.bing.com/?ld=d35zgw9o9bw3_1vUxtIGnzHTVUCUwfTcwu5zbNkpOnke_aXN2MLJLhUW_CEZ3O4P7r3UGdnF60uhrx7ReLnKldepJiFwUPXEerT92QBGs7Fa43WSXx7Wz2aF9RnuXhlEN8R4vOL2eabbX29Ge762gHw1erRyQ&u=https://onlinecasino.us.org  http://www.autosite.ua/redirect.html?url=https://onlinecasino.us.org   http://ihateaarcorp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.dreamboxsaudi.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://delaygifts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://9wivesclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://trck.epeldano.com/redirect.php?trgt_usr=@@@EMAIL@@@&target_url=onlinecasino.us.org  http://salsa-productions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://premium-scripts.info/?go=2320&url=https://onlinecasino.us.org  http://col.11510.net/out.cgi?id=00489&url=https://onlinecasino.us.org  http://iwantahat.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.justdownforme.com/www/onlinecasino.us.org \nhttp://nationwidetaxinc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.evansville.in.gov/redirect.aspx?url=https://onlinecasino.us.org   http://www.sjacps.edu.hk/cyberranger/home/link.php?url=https://onlinecasino.us.org   http://m.mts.by/bonus/bitrix/rk.php?goto=https://onlinecasino.us.org  https://roscomsport.com/golink/onlinecasino.us.org   http://zven.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.imporcar.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.resecon.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://algae-biodiesel.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://lavoroabergamo.it/index.php?topic=638191.new#new\nhttp://www.d-fakti.lv/forum/viewtopic.php?f=2&t=696643\nhttp://www.online-einsaetze.de/forum/showthread.php?tid=1385524\nhttp://www.piterenka.ru/forum/viewtopic.php?f=4&t=54738\nhttp://forum.cvma152.org/showthread.php?tid=143843&pid=164338#pid164338\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7754, "cpu_time_ms": 98, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s173894150", "group_id": "codeNet:p03941", "input_text": "http://www.madmature.us/cgi-bin/out.cgi?ses=2qEfYRjrus&id=927&url=https://onlinecasino.us.org  http://treasuredobjects.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://petsexfree.com/go.php?xy=17&ug=24&le=249&url=https://onlinecasino.us.org   http://rnbee.com.ua/goto/https://onlinecasino.us.org  https://www.kok8.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://webcreatornote.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://skiwyoming.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bormioli.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://coffeeberryantioxidant.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://battlecreek.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ante-up.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ncsaltwaterflyfishing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.foto.aneta.foto.foto.dev.senzaparty.net/redir.php?link=https://onlinecasino.us.org  http://fruitofthywomb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.wsnt.at/ap/hollabrunn/link.asp?url=https://onlinecasino.us.org  http://www.curved.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.giantscreencinema.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://linkpage.biz/?onlinecasino.us.org \nhttp://rail.phototrans.eu/redirect.php?url=https://onlinecasino.us.org  http://home-of-economy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.vidaextra.com.mx/redirect?url=https://onlinecasino.us.org   http://www.maincell.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://forums.na.square-enix.com/showthread.php?t=29351&goto=onlinecasino.us.org   http://boulangeriewholesomeharvest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.toptoonsites.com/cgi-bin/sites/out.cgi?id=amber&url=https://onlinecasino.us.org  http://www.notariat-hoefe.ch/DesktopModules/SaveAsPDF/DownloadPdf.aspx?url=https://onlinecasino.us.org   http://fulserv.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://comicsalliance.com/login/?referer=https://onlinecasino.us.org  http://myhealthhubb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.man-ga.it/newsletter/redir.asp?url=https://onlinecasino.us.org   http://catalogwikis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tycarlson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lovemymovies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://smtp.citycell.com/horde/index.php?url=https://onlinecasino.us.org  http://worldofmovies.net/wbb2/thread.php?goto=onlinecasino.us.org   http://tasteandtalk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.tourister.ru/go?item=hotelObjectAll&url=https://onlinecasino.us.org  http://imgcollegeproducts.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.saga-inc.ru/bitrix/redirect.php?event1=&event2=&event3=wifi&goto=https://onlinecasino.us.org   http://whitneywright.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://аєАаЄБаЄ?аЄ?аЄҐаЄ?аЄІ.com/re?url=https://onlinecasino.us.org   http://newbrightonclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://alquilatucasa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.niuc.net/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://glampingmart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://menacompliance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jvs-outdoor.seeno.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://giansante.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hairprint.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://agilitylogisticssucks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://futureproofingsolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://richborodentalexcellence.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://telecommutingadvantage.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://throttlecrm.com/resources/webcomponents/link.php?realm=aftermarket&dealergroup=A5002T&link=https://onlinecasino.us.org \nhttp://coolspringsliving.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://reignaccessories.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bridalassociationofamerica.com/weddingnews/go.php?url=https://onlinecasino.us.org   http://datacomp.sk/redir.asp?WenId=1175&WenUrllink=https://onlinecasino.us.org  http://weekleyhomes.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.wisconsinfreshsausagecompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.familinktravel.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pushmsg.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.panpagan.com/forum/threads/4070-Baby-mit-an-den-Kraftort-mitnehmen?goto=onlinecasino.us.org \nhttp://mydatastory.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.x17online.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://blog.zzkid.com/go.asp?url=https://onlinecasino.us.org   http://coachkfilms.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://historyofchicagomusic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nametoknow.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://skaz-pushkina.ru/go.php?url=https://onlinecasino.us.org  http://w.fastfoodfinancials.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.markhoy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.implantdirectory.com/jump.asp?url=https://onlinecasino.us.org  http://sequimcommercial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ethicsoft.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.royalmanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://esongtracks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wondervision.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.xxxdino.com/out.php?v=https://onlinecasino.us.org  http://www.lifeflourgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://1d345.systems/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.lipperhey.com/en/onlinecasino.us.org/  http://manpowerfrance.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yourholidayconcierge.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.jusunlee.com/topsite/out.php??s=https://onlinecasino.us.org  http://sleepwellmattress.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.machinistmusic.net/guestbook/go.php?url=https://onlinecasino.us.org  http://ishikawaya.biz/blog/m/index.cgi?id=1&cat=17&mode=redirect&no=1&ref_eid=1044&url=https://onlinecasino.us.org  http://www.haggenmueller.de/content/links.php?go=https://onlinecasino.us.org   http://www.cidertube.com/?go=click&c=284&n=-13&e=0&g=3&r=-92043427&u=https://onlinecasino.us.org \n \n \n \n \n \nhttp://7olool.tk/index.php/topic,19424.new.html#new\nhttps://ict-npo.com/lecheniye-stvolovymi-kletkami-otzivi/?unapproved=88162&moderation-hash=d7f4425b59a6fedd8d479605b4d49878#comment-88162\nhttp://hanvico.com.vn/bac/dao-tao-nhan-vien-ban-hang-cac-showroom-hanvico-2018-de-su-tan-tam-ngay-cang-them-chuyen-nghiep/#comment-25951\nhttp://www.akofturkiye.com/showthread.php?tid=149428&pid=358575#pid358575\nhttp://freebitcoin.co/forum/showthread.php?tid=235974\n", "language": "Lisp", "metadata": {"date": 1551836437, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s173894150.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s173894150", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.madmature.us/cgi-bin/out.cgi?ses=2qEfYRjrus&id=927&url=https://onlinecasino.us.org  http://treasuredobjects.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://petsexfree.com/go.php?xy=17&ug=24&le=249&url=https://onlinecasino.us.org   http://rnbee.com.ua/goto/https://onlinecasino.us.org  https://www.kok8.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://webcreatornote.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://skiwyoming.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bormioli.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://coffeeberryantioxidant.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://battlecreek.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ante-up.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ncsaltwaterflyfishing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.foto.aneta.foto.foto.dev.senzaparty.net/redir.php?link=https://onlinecasino.us.org  http://fruitofthywomb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.wsnt.at/ap/hollabrunn/link.asp?url=https://onlinecasino.us.org  http://www.curved.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.giantscreencinema.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://linkpage.biz/?onlinecasino.us.org \nhttp://rail.phototrans.eu/redirect.php?url=https://onlinecasino.us.org  http://home-of-economy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.vidaextra.com.mx/redirect?url=https://onlinecasino.us.org   http://www.maincell.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://forums.na.square-enix.com/showthread.php?t=29351&goto=onlinecasino.us.org   http://boulangeriewholesomeharvest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.toptoonsites.com/cgi-bin/sites/out.cgi?id=amber&url=https://onlinecasino.us.org  http://www.notariat-hoefe.ch/DesktopModules/SaveAsPDF/DownloadPdf.aspx?url=https://onlinecasino.us.org   http://fulserv.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://comicsalliance.com/login/?referer=https://onlinecasino.us.org  http://myhealthhubb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.man-ga.it/newsletter/redir.asp?url=https://onlinecasino.us.org   http://catalogwikis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tycarlson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lovemymovies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://smtp.citycell.com/horde/index.php?url=https://onlinecasino.us.org  http://worldofmovies.net/wbb2/thread.php?goto=onlinecasino.us.org   http://tasteandtalk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.tourister.ru/go?item=hotelObjectAll&url=https://onlinecasino.us.org  http://imgcollegeproducts.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.saga-inc.ru/bitrix/redirect.php?event1=&event2=&event3=wifi&goto=https://onlinecasino.us.org   http://whitneywright.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://аєАаЄБаЄ?аЄ?аЄҐаЄ?аЄІ.com/re?url=https://onlinecasino.us.org   http://newbrightonclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://alquilatucasa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.niuc.net/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://glampingmart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://menacompliance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jvs-outdoor.seeno.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://giansante.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hairprint.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://agilitylogisticssucks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://futureproofingsolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://richborodentalexcellence.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://telecommutingadvantage.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://throttlecrm.com/resources/webcomponents/link.php?realm=aftermarket&dealergroup=A5002T&link=https://onlinecasino.us.org \nhttp://coolspringsliving.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://reignaccessories.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bridalassociationofamerica.com/weddingnews/go.php?url=https://onlinecasino.us.org   http://datacomp.sk/redir.asp?WenId=1175&WenUrllink=https://onlinecasino.us.org  http://weekleyhomes.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.wisconsinfreshsausagecompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.familinktravel.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pushmsg.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.panpagan.com/forum/threads/4070-Baby-mit-an-den-Kraftort-mitnehmen?goto=onlinecasino.us.org \nhttp://mydatastory.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.x17online.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://blog.zzkid.com/go.asp?url=https://onlinecasino.us.org   http://coachkfilms.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://historyofchicagomusic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nametoknow.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://skaz-pushkina.ru/go.php?url=https://onlinecasino.us.org  http://w.fastfoodfinancials.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.markhoy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.implantdirectory.com/jump.asp?url=https://onlinecasino.us.org  http://sequimcommercial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ethicsoft.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.royalmanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://esongtracks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wondervision.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.xxxdino.com/out.php?v=https://onlinecasino.us.org  http://www.lifeflourgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://1d345.systems/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.lipperhey.com/en/onlinecasino.us.org/  http://manpowerfrance.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yourholidayconcierge.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.jusunlee.com/topsite/out.php??s=https://onlinecasino.us.org  http://sleepwellmattress.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.machinistmusic.net/guestbook/go.php?url=https://onlinecasino.us.org  http://ishikawaya.biz/blog/m/index.cgi?id=1&cat=17&mode=redirect&no=1&ref_eid=1044&url=https://onlinecasino.us.org  http://www.haggenmueller.de/content/links.php?go=https://onlinecasino.us.org   http://www.cidertube.com/?go=click&c=284&n=-13&e=0&g=3&r=-92043427&u=https://onlinecasino.us.org \n \n \n \n \n \nhttp://7olool.tk/index.php/topic,19424.new.html#new\nhttps://ict-npo.com/lecheniye-stvolovymi-kletkami-otzivi/?unapproved=88162&moderation-hash=d7f4425b59a6fedd8d479605b4d49878#comment-88162\nhttp://hanvico.com.vn/bac/dao-tao-nhan-vien-ban-hang-cac-showroom-hanvico-2018-de-su-tan-tam-ngay-cang-them-chuyen-nghiep/#comment-25951\nhttp://www.akofturkiye.com/showthread.php?tid=149428&pid=358575#pid358575\nhttp://freebitcoin.co/forum/showthread.php?tid=235974\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7903, "cpu_time_ms": 109, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s836061685", "group_id": "codeNet:p03941", "input_text": "http://nvpastors.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://balme.ug.edu.gh/chat/index.php/chat?locale=en&url=https://onlinecasino.us.org   http://pru-bank.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://suddenlink-lab.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.carsoncitymi.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://combee.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.moviemo.com/cgi-bin/a2/out.cgi?r=1&l=subcat&u=https://onlinecasino.us.org  http://khro1650.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ricoshairypussy.com/ttt-out.php?pct=60&url=https://onlinecasino.us.org \nhttp://560500.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.mtbproject.com/redir?url=https://onlinecasino.us.org   http://cgi.debian.org/cgi-bin/redirect.pl?page=%2FNews%2F2008%2F20080217&?s=https://onlinecasino.us.org   http://usgbbc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cdts.hkgnu.org/uchome/link.php?url=https://onlinecasino.us.org   http://allencountygop.com/Events/SingleEvent/14-03-18/2014_ACGOP_Lincoln_Dinner.aspx?Returnurl=https://onlinecasino.us.org/  https://mediakuzbass.ru/away.php?url=https://onlinecasino.us.org  http://www.telewizja-polska.co.uk/v2/url?u=https://onlinecasino.us.org   http://xbq.extremeflying.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.hufu.club/index.php?c=login&&referer=https://onlinecasino.us.org  http://www.ygim31.ru/bitrix/rk.php?id=23&event1=banner&event2=click&event3=1+%2F+%5B23%5D+%5B186x60_LEFT%5D+%D0%9C%D0%BE%D0%BB%D0%BE%D0%B4%D0%B5%D0%B6%D1%8C+%D0%A1%D0%B5%D0%B2%D0%B5%D1%80%D0%BE%D0%B4%D0%B2%D0%B8%D0%BD%D1%81%D0%BA%D0%B0&goto=https://onlinecasino.us.org   http://parks.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://largus-shop.ru/go/url=https://onlinecasino.us.org  http://virginiaseclawyers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.loredz.com/vb/go.php?url=https://onlinecasino.us.org/  http://gakku.kz.xx3.kz/go.php?url=https://onlinecasino.us.org  http://arparent.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.google.com.pa/url?q=https://onlinecasino.us.org \nhttp://www.3mms88v.com/?go=https://onlinecasino.us.org  http://americanratterrierrescue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ktcom.jp/redirect.php?u=https://onlinecasino.us.org   http://torrent.janemusic.org/redir.php?url=https://onlinecasino.us.org  http://web.bondclub.cn/home/link.php?url=https://onlinecasino.us.org   http://www.bigasspictures.net/cgi-bin/atx/out.cgi?s=65&u=https://onlinecasino.us.org  http://dmcaauditing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bq--3cpm7ana.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://oheck.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://lzw.nonprofitneighbourhood.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://surgicalimaging.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jeankasem.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.thefamiliesweb.com/memorial/VW/Lists/Posts/ViewPost.aspx?ID=8&Source=https://onlinecasino.us.org  http://rebeccasguide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gtadvisorsonline.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://truesmokingpleasure.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pd2.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fireballred.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.itariarya-site.info/rank.php?mode=link&id=1776&url=https://onlinecasino.us.org/  http://andre-romberg.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mercuryprinciple.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://trq.showerfilters4less.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mcnasonrisa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://societybrasscollection.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tudoraovat.com/showthread.php/8630-Xe-tai-nhe-Th%C3%A1i-Lan-Gi%C3%A1-R%E1%BA%BB-Nh%E1%BA%A5t-Vi%E1%BB%87t-Nam?goto=onlinecasino.us.org  http://financialwellnessgroup.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.smoothcharacter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.damageprevention.biz/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.tuifly.allgaeu.info/index.shtml?seite=ami_badeseetemp&url=onlinecasino.us.org   http://54hotel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.northwestcraneservice.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.warrensvillebaptistchurch.com/System/UserProfile.asp?id=46468&func=signup&referer=https://onlinecasino.us.org   http://iaid.pro/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://229doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://acadahu.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://branchenverzeichnis.cci-dialog.com/go/go.php?url=onlinecasino.us.org \nhttp://clc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ihatehillary.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.usbusinesslist.org/goto.php?url=https://onlinecasino.us.org   http://commercialhousing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mrd-institute.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://divemeetinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://echinasourcesweb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.myhornygrandma.com/cgi-bin/crtr/out.cgi?l=thumb&s=55g&c=1&u=https://onlinecasino.us.org   http://silentseel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://senolkarahasan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://smartcenterabq.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://banespasantander.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://f1rstsupport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://decodaddy.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.gvardeyskiy.ru/v2/url?u=https://onlinecasino.us.org  http://actsystems.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jeffmorse.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.inven.co.kr/webzine/news/??s=https://onlinecasino.us.org \nhttp://slotlandvip.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bridebytes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.pub-explorer.com/includes/goto.php?r=https://onlinecasino.us.org   http://comrads.ru/bitrix/rk.php?id=2&site_id=s1&event1=banner&event2=click&goto=onlinecasino.us.org  http://www.prombez.kz/away.php?url=https://onlinecasino.us.org   http://weststart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.grandepornogratis.com/cgi-bin/atc/out.cgi?id=26&u=https://onlinecasino.us.org  https://admmegion.ru/rk.php?id=12&site_id=am&event1=banner&event2=click&event3=1+%2F+%5B12%5D+%5BKDN%5D+%D0%94%D0%B5%D1%82%D1%8F%D0%BC&goto=https://onlinecasino.us.org   http://www.absolutekim.maioid.com/cgi-bin/autorank/out.cgi?id=mk0522&url=https://onlinecasino.us.org \n \n \n \n \n \nhttps://jazzycats.org/?contact-form-id=27229&contact-form-sent=134074&contact-form-hash=184e4d9da75354ec1a6db97761bfb1e84d9e5f46&_wpnonce=ca27c70da4\nhttp://filmantra.org/forum/viewtopic.php?pid=401202#p401202\nhttp://www.kingsaccord.com/viewtopic.php?f=11&t=9350&p=19295#p19295\nhttps://uosymphony.com/resources/intonation-solutions-for-orchestral-players/\nhttps://www.kadmium.nl/forum/viewtopic.php?f=3&t=205137\n", "language": "Lisp", "metadata": {"date": 1551807270, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s836061685.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s836061685", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://nvpastors.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://balme.ug.edu.gh/chat/index.php/chat?locale=en&url=https://onlinecasino.us.org   http://pru-bank.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://suddenlink-lab.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.carsoncitymi.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://combee.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.moviemo.com/cgi-bin/a2/out.cgi?r=1&l=subcat&u=https://onlinecasino.us.org  http://khro1650.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ricoshairypussy.com/ttt-out.php?pct=60&url=https://onlinecasino.us.org \nhttp://560500.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.mtbproject.com/redir?url=https://onlinecasino.us.org   http://cgi.debian.org/cgi-bin/redirect.pl?page=%2FNews%2F2008%2F20080217&?s=https://onlinecasino.us.org   http://usgbbc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cdts.hkgnu.org/uchome/link.php?url=https://onlinecasino.us.org   http://allencountygop.com/Events/SingleEvent/14-03-18/2014_ACGOP_Lincoln_Dinner.aspx?Returnurl=https://onlinecasino.us.org/  https://mediakuzbass.ru/away.php?url=https://onlinecasino.us.org  http://www.telewizja-polska.co.uk/v2/url?u=https://onlinecasino.us.org   http://xbq.extremeflying.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.hufu.club/index.php?c=login&&referer=https://onlinecasino.us.org  http://www.ygim31.ru/bitrix/rk.php?id=23&event1=banner&event2=click&event3=1+%2F+%5B23%5D+%5B186x60_LEFT%5D+%D0%9C%D0%BE%D0%BB%D0%BE%D0%B4%D0%B5%D0%B6%D1%8C+%D0%A1%D0%B5%D0%B2%D0%B5%D1%80%D0%BE%D0%B4%D0%B2%D0%B8%D0%BD%D1%81%D0%BA%D0%B0&goto=https://onlinecasino.us.org   http://parks.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://largus-shop.ru/go/url=https://onlinecasino.us.org  http://virginiaseclawyers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.loredz.com/vb/go.php?url=https://onlinecasino.us.org/  http://gakku.kz.xx3.kz/go.php?url=https://onlinecasino.us.org  http://arparent.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.google.com.pa/url?q=https://onlinecasino.us.org \nhttp://www.3mms88v.com/?go=https://onlinecasino.us.org  http://americanratterrierrescue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ktcom.jp/redirect.php?u=https://onlinecasino.us.org   http://torrent.janemusic.org/redir.php?url=https://onlinecasino.us.org  http://web.bondclub.cn/home/link.php?url=https://onlinecasino.us.org   http://www.bigasspictures.net/cgi-bin/atx/out.cgi?s=65&u=https://onlinecasino.us.org  http://dmcaauditing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bq--3cpm7ana.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://oheck.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://lzw.nonprofitneighbourhood.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://surgicalimaging.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jeankasem.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.thefamiliesweb.com/memorial/VW/Lists/Posts/ViewPost.aspx?ID=8&Source=https://onlinecasino.us.org  http://rebeccasguide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gtadvisorsonline.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://truesmokingpleasure.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pd2.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fireballred.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.itariarya-site.info/rank.php?mode=link&id=1776&url=https://onlinecasino.us.org/  http://andre-romberg.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mercuryprinciple.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://trq.showerfilters4less.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mcnasonrisa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://societybrasscollection.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tudoraovat.com/showthread.php/8630-Xe-tai-nhe-Th%C3%A1i-Lan-Gi%C3%A1-R%E1%BA%BB-Nh%E1%BA%A5t-Vi%E1%BB%87t-Nam?goto=onlinecasino.us.org  http://financialwellnessgroup.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.smoothcharacter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.damageprevention.biz/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.tuifly.allgaeu.info/index.shtml?seite=ami_badeseetemp&url=onlinecasino.us.org   http://54hotel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.northwestcraneservice.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.warrensvillebaptistchurch.com/System/UserProfile.asp?id=46468&func=signup&referer=https://onlinecasino.us.org   http://iaid.pro/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://229doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://acadahu.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://branchenverzeichnis.cci-dialog.com/go/go.php?url=onlinecasino.us.org \nhttp://clc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ihatehillary.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.usbusinesslist.org/goto.php?url=https://onlinecasino.us.org   http://commercialhousing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mrd-institute.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://divemeetinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://echinasourcesweb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.myhornygrandma.com/cgi-bin/crtr/out.cgi?l=thumb&s=55g&c=1&u=https://onlinecasino.us.org   http://silentseel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://senolkarahasan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://smartcenterabq.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://banespasantander.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://f1rstsupport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://decodaddy.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.gvardeyskiy.ru/v2/url?u=https://onlinecasino.us.org  http://actsystems.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jeffmorse.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.inven.co.kr/webzine/news/??s=https://onlinecasino.us.org \nhttp://slotlandvip.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bridebytes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.pub-explorer.com/includes/goto.php?r=https://onlinecasino.us.org   http://comrads.ru/bitrix/rk.php?id=2&site_id=s1&event1=banner&event2=click&goto=onlinecasino.us.org  http://www.prombez.kz/away.php?url=https://onlinecasino.us.org   http://weststart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.grandepornogratis.com/cgi-bin/atc/out.cgi?id=26&u=https://onlinecasino.us.org  https://admmegion.ru/rk.php?id=12&site_id=am&event1=banner&event2=click&event3=1+%2F+%5B12%5D+%5BKDN%5D+%D0%94%D0%B5%D1%82%D1%8F%D0%BC&goto=https://onlinecasino.us.org   http://www.absolutekim.maioid.com/cgi-bin/autorank/out.cgi?id=mk0522&url=https://onlinecasino.us.org \n \n \n \n \n \nhttps://jazzycats.org/?contact-form-id=27229&contact-form-sent=134074&contact-form-hash=184e4d9da75354ec1a6db97761bfb1e84d9e5f46&_wpnonce=ca27c70da4\nhttp://filmantra.org/forum/viewtopic.php?pid=401202#p401202\nhttp://www.kingsaccord.com/viewtopic.php?f=11&t=9350&p=19295#p19295\nhttps://uosymphony.com/resources/intonation-solutions-for-orchestral-players/\nhttps://www.kadmium.nl/forum/viewtopic.php?f=3&t=205137\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8030, "cpu_time_ms": 98, "memory_kb": 9312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s310421223", "group_id": "codeNet:p03941", "input_text": "http://divorce-solutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://w.profishintl.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://creditunionprotectionplans.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.thehungerartists.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.petbirdreport.com/resources/addYourLink.asp?site=onlinecasino.us.org   http://edinayasemya.ru/away.php?url=https://onlinecasino.us.org  http://nationalgeographickidsturkiye.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thepecasogroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://instituteforgood.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ap360solutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yqi.gpls-survey.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://8merrill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elamanecerdelmilenio.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ass4all.com/out.php?l=https://onlinecasino.us.org   http://www.praveorechove.com/redirect.php?https://onlinecasino.us.org  http://www.jaeahn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://departamento.metroscubicos.com/noindex/quotation/MLM613701805?go=https://onlinecasino.us.org   http://mail.sealmag.com/cgi-bin/go?https://onlinecasino.us.org \nhttp://rodonews.com/out.php?url=https://onlinecasino.us.org/  http://www.elcampellochristiancommunity.org/goto-link.php?link_id=18&url=https://onlinecasino.us.org   http://pagomisviajes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://essentialtruths.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.isfun.nl/cgi-bin/isfun/gratis/out.cgi?id=promotie&url=https://onlinecasino.us.org   http://explorethenorthshore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://printsymphony.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ficofortress.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://realprayingwives.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.detiseti.ru/redirect.php?u=https://onlinecasino.us.org  https://www.elliottwave.com/r.asp?acn=4CT&rcn=aa431&url=https://onlinecasino.us.org   http://azamira.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://authentisign.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xn--l3cf5dg3btj9i.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zogwatch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fogcitymagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thelimestonegrill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kirov.xzaa.ru/go.php?id=33780&url=https://onlinecasino.us.org \nhttp://gvp.ragemotorsports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aafpusa.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://orbanbiotech.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kessingerentertainment.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://5stepanimalwelfarerating.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sajamedia.com/v2/url?u=https://onlinecasino.us.org  http://flyingkingranch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hawaiihostels.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://batteryclinic.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://iko.misterhide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://erikanddanielle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lighthouseharbour.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://adekb.ru/upload/rk/029/029de0f574b5e7c1465960b62326fc91.swf?flash_link=onlinecasino.us.org  http://www.sexhairytgp.com/cgi-bin/at3/out.cgi?id=82&tag=toplist&trade=https://onlinecasino.us.org   http://analtorture.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gloryholeswallowing.com/cgi-bin/autorank/out.cgi?id=mk0199&url=https://onlinecasino.us.org  http://naresav.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nightforceproshop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://b4u.lawandordercriminalintent.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://texasshooting.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.nbaersplayground.com/cgi-bin/redirect.cgi?url=https://onlinecasino.us.org   http://www.imaoshan.com/home/link.php?url=https://onlinecasino.us.org  http://www.cheapdealuk.lesgh.com/go.php?url=onlinecasino.us.org   http://briefnovel.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://freerobux.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://collegeradionews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://adult.misty.ne.jp/rank/old/out.cgi?id=heart&url=https://onlinecasino.us.org \nhttp://burca.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://courtneydesena.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dexter-vom-jordanbach.de/gallery/main.php?g2_view=core.UserAdmin&g2_subView=core.UserRecoverPassword&g2_return=https://onlinecasino.us.org   https://www.skfintech.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://www.tzjulang.com/goto.asp?url=https://onlinecasino.us.org   http://alanjaylerner.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://inflateaflix.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://beerplace.com.ua/r.php?url=https://onlinecasino.us.org   http://hrlawgroup.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.cuntsarea.com/crtr/cgi/out.cgi?id=84&tag=v&trade=https://onlinecasino.us.org  http://s.anicausa.de/htref.php?u=https://onlinecasino.us.org   http://discsupersite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://capturelivehd.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fuegova.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://webbraces.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://prepareware.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://microexchangeoutlet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gruponear.com.mx/index.php/noticias2/item/32-neuromarketing?fromurl=onlinecasino.us.org \nhttp://etraffel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.sbafla.com/method/LinkClick.aspx?link=https://onlinecasino.us.org   http://tellmyhandyman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://membershipmanagementlinx.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.prvi.hr/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org   http://smallhostel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rmschulz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://diceclearancejobs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://carolinaconsultationcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://fearl-gaming.com/index.php?topic=509254.new#new\nhttp://vseplotniki.ru/forum/?PAGE_NAME=message&FID=43&TID=733&TITLE_SEO=733-i-think_-that-you-are-not-right.-write-to-me-in-pm_-we-will-discuss.&MID=4735&result=reply#message4735\nhttp://forum.fibroteam.info/showthread.php?p=668187#post668187\nhttps://lindaghill.com/2018/08/15/one-liner-wednesday-snail-mail/\nhttp://sr.leet.cz/viewtopic.php?f=16&t=457\n", "language": "Lisp", "metadata": {"date": 1551795739, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s310421223.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s310421223", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://divorce-solutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://w.profishintl.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://creditunionprotectionplans.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.thehungerartists.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.petbirdreport.com/resources/addYourLink.asp?site=onlinecasino.us.org   http://edinayasemya.ru/away.php?url=https://onlinecasino.us.org  http://nationalgeographickidsturkiye.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thepecasogroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://instituteforgood.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ap360solutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yqi.gpls-survey.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://8merrill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elamanecerdelmilenio.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ass4all.com/out.php?l=https://onlinecasino.us.org   http://www.praveorechove.com/redirect.php?https://onlinecasino.us.org  http://www.jaeahn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://departamento.metroscubicos.com/noindex/quotation/MLM613701805?go=https://onlinecasino.us.org   http://mail.sealmag.com/cgi-bin/go?https://onlinecasino.us.org \nhttp://rodonews.com/out.php?url=https://onlinecasino.us.org/  http://www.elcampellochristiancommunity.org/goto-link.php?link_id=18&url=https://onlinecasino.us.org   http://pagomisviajes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://essentialtruths.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.isfun.nl/cgi-bin/isfun/gratis/out.cgi?id=promotie&url=https://onlinecasino.us.org   http://explorethenorthshore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://printsymphony.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ficofortress.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://realprayingwives.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.detiseti.ru/redirect.php?u=https://onlinecasino.us.org  https://www.elliottwave.com/r.asp?acn=4CT&rcn=aa431&url=https://onlinecasino.us.org   http://azamira.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://authentisign.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xn--l3cf5dg3btj9i.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zogwatch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fogcitymagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thelimestonegrill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kirov.xzaa.ru/go.php?id=33780&url=https://onlinecasino.us.org \nhttp://gvp.ragemotorsports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aafpusa.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://orbanbiotech.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kessingerentertainment.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://5stepanimalwelfarerating.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sajamedia.com/v2/url?u=https://onlinecasino.us.org  http://flyingkingranch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hawaiihostels.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://batteryclinic.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://iko.misterhide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://erikanddanielle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lighthouseharbour.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://adekb.ru/upload/rk/029/029de0f574b5e7c1465960b62326fc91.swf?flash_link=onlinecasino.us.org  http://www.sexhairytgp.com/cgi-bin/at3/out.cgi?id=82&tag=toplist&trade=https://onlinecasino.us.org   http://analtorture.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gloryholeswallowing.com/cgi-bin/autorank/out.cgi?id=mk0199&url=https://onlinecasino.us.org  http://naresav.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nightforceproshop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://b4u.lawandordercriminalintent.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://texasshooting.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.nbaersplayground.com/cgi-bin/redirect.cgi?url=https://onlinecasino.us.org   http://www.imaoshan.com/home/link.php?url=https://onlinecasino.us.org  http://www.cheapdealuk.lesgh.com/go.php?url=onlinecasino.us.org   http://briefnovel.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://freerobux.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://collegeradionews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://adult.misty.ne.jp/rank/old/out.cgi?id=heart&url=https://onlinecasino.us.org \nhttp://burca.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://courtneydesena.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dexter-vom-jordanbach.de/gallery/main.php?g2_view=core.UserAdmin&g2_subView=core.UserRecoverPassword&g2_return=https://onlinecasino.us.org   https://www.skfintech.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://www.tzjulang.com/goto.asp?url=https://onlinecasino.us.org   http://alanjaylerner.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://inflateaflix.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://beerplace.com.ua/r.php?url=https://onlinecasino.us.org   http://hrlawgroup.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.cuntsarea.com/crtr/cgi/out.cgi?id=84&tag=v&trade=https://onlinecasino.us.org  http://s.anicausa.de/htref.php?u=https://onlinecasino.us.org   http://discsupersite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://capturelivehd.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fuegova.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://webbraces.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://prepareware.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://microexchangeoutlet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gruponear.com.mx/index.php/noticias2/item/32-neuromarketing?fromurl=onlinecasino.us.org \nhttp://etraffel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.sbafla.com/method/LinkClick.aspx?link=https://onlinecasino.us.org   http://tellmyhandyman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://membershipmanagementlinx.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.prvi.hr/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org   http://smallhostel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rmschulz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://diceclearancejobs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://carolinaconsultationcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://fearl-gaming.com/index.php?topic=509254.new#new\nhttp://vseplotniki.ru/forum/?PAGE_NAME=message&FID=43&TID=733&TITLE_SEO=733-i-think_-that-you-are-not-right.-write-to-me-in-pm_-we-will-discuss.&MID=4735&result=reply#message4735\nhttp://forum.fibroteam.info/showthread.php?p=668187#post668187\nhttps://lindaghill.com/2018/08/15/one-liner-wednesday-snail-mail/\nhttp://sr.leet.cz/viewtopic.php?f=16&t=457\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7865, "cpu_time_ms": 87, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s997930931", "group_id": "codeNet:p03941", "input_text": "http://screw-networksolutions.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://upnorthinvestments.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://q-debit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://primgorod.ru/redirect?url=https://onlinecasino.us.org  http://www.englishviaskype.ru/goto.php?url=https://onlinecasino.us.org   http://a1limousineofchicago.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.minstroy74.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org  http://hottopicfoundation.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.americanmanga.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://smartbabycare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nova-pub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://susanashton.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dispatchmediagroup.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gpspetfence.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wlb-baseball.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wonheart.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://granaryvodka.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wildarts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://libertytreenewspaper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mpym.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://seminarcity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nationalparktour.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mcelveenfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://knitstudio.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cboestockexchange.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://unibancodda.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://natala.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://oblog.hlzhjy.net/go.asp?url=https://onlinecasino.us.org  http://thelisteninghour.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://creativesonfire.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://100percentlgbt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://amhindustries.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://davincirobotcerrahi.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://royron.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://book-marketing.goldenarticles.net/go.php?url=https://onlinecasino.us.org   http://images.google.com.ag/url?q=https://onlinecasino.us.org \nhttp://catterline.org/node/link.php?url=https://onlinecasino.us.org  http://johnsoncityfordlincoln.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.austinhouse.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.voucharoo.co.uk/discount-codes.php?url=https://onlinecasino.us.org/  http://semanticseats.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.newbikinipics.com/cgi-bin/atc/out.cgi?id=17&u=https://onlinecasino.us.org  http://tangotaxes.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jrd.nazarethboard.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.ckvb.cz/go/https://onlinecasino.us.org \nhttp://athleticmindbody.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sport-kids.ru/go.php?url=onlinecasino.us.org   http://yourultimatelifenow.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sewforamerica.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xn--d1abbanb7ab.com/go/url=https://onlinecasino.us.org   http://manuscripta.mediaevum.de/cgi-bin/click.php?id=handschriften3_1&url=https://onlinecasino.us.org  http://www.sbg-auto.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://davidangie.com/passport/register.aspx?url=https://onlinecasino.us.org   http://www.machodocrenaissance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://reaganlegacy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lawrencesinclairgold.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kredit-200000.mosgorkredit.ru/go?https://onlinecasino.us.org   http://mylanidentityguide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nrasporting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rcivoucher.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://philonet.wantacondo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://torpedopromocao.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chwomack.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://eexceljapan.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://travelerknow.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ogloszeniaostrow.pl/link.php?url=https://onlinecasino.us.org   http://vkz.prgateway.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mywhitelabel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.drugaya-fizika.ru/go?https://onlinecasino.us.org  http://www.chooseaamateur.http13.com/cgi-bin/out.cgi?id=devil&url=https://onlinecasino.us.org  http://newsoftman.com/go?https://onlinecasino.us.org   http://seeyourbiopsy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sinjinlee.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://plugin.lt/out.php?url=onlinecasino.us.org   http://dandougherty.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.trinquetdarcangues.com/links/redir.asp?link=onlinecasino.us.org  http://www.uspour.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://easyeapis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://soloincontri.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://portfoliorevolution.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://home.hkesp.com/link.php?url=https://onlinecasino.us.org \nhttp://lendersolutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://photofactor.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://initialcloudflare.linhuake.com/redirect.php?tid=18874&goto=onlinecasino.us.org   http://masters-martialarts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://blog.basnit.com/wp-content/themes/Beginlts/inc/go.php?url=https://onlinecasino.us.org   http://www.callmecrazy.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://newcarquote.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stt.pagespot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dogussk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.luxuriousgaming.com/fourms/showthread.php?tid=37953\nhttp://www.ni28320-2.web12.nitrado.hosting/phpBB3/viewtopic.php?f=7&t=741599&p=1400122#p1400122\nhttps://bazingacoin.com/forum/viewtopic.php?f=5&t=1973080\nhttp://forum.10muhasebe.com/index.php?topic=974967.new#new\nhttp://barhoppersnepa.com/forum/index.php?topic=325057.new#new\n", "language": "Lisp", "metadata": {"date": 1551790096, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s997930931.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s997930931", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://screw-networksolutions.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://upnorthinvestments.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://q-debit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://primgorod.ru/redirect?url=https://onlinecasino.us.org  http://www.englishviaskype.ru/goto.php?url=https://onlinecasino.us.org   http://a1limousineofchicago.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.minstroy74.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org  http://hottopicfoundation.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.americanmanga.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://smartbabycare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nova-pub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://susanashton.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dispatchmediagroup.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gpspetfence.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wlb-baseball.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wonheart.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://granaryvodka.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wildarts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://libertytreenewspaper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mpym.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://seminarcity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nationalparktour.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mcelveenfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://knitstudio.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cboestockexchange.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://unibancodda.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://natala.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://oblog.hlzhjy.net/go.asp?url=https://onlinecasino.us.org  http://thelisteninghour.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://creativesonfire.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://100percentlgbt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://amhindustries.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://davincirobotcerrahi.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://royron.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://book-marketing.goldenarticles.net/go.php?url=https://onlinecasino.us.org   http://images.google.com.ag/url?q=https://onlinecasino.us.org \nhttp://catterline.org/node/link.php?url=https://onlinecasino.us.org  http://johnsoncityfordlincoln.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.austinhouse.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.voucharoo.co.uk/discount-codes.php?url=https://onlinecasino.us.org/  http://semanticseats.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.newbikinipics.com/cgi-bin/atc/out.cgi?id=17&u=https://onlinecasino.us.org  http://tangotaxes.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jrd.nazarethboard.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.ckvb.cz/go/https://onlinecasino.us.org \nhttp://athleticmindbody.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sport-kids.ru/go.php?url=onlinecasino.us.org   http://yourultimatelifenow.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sewforamerica.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xn--d1abbanb7ab.com/go/url=https://onlinecasino.us.org   http://manuscripta.mediaevum.de/cgi-bin/click.php?id=handschriften3_1&url=https://onlinecasino.us.org  http://www.sbg-auto.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://davidangie.com/passport/register.aspx?url=https://onlinecasino.us.org   http://www.machodocrenaissance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://reaganlegacy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lawrencesinclairgold.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kredit-200000.mosgorkredit.ru/go?https://onlinecasino.us.org   http://mylanidentityguide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nrasporting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rcivoucher.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://philonet.wantacondo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://torpedopromocao.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chwomack.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://eexceljapan.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://travelerknow.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ogloszeniaostrow.pl/link.php?url=https://onlinecasino.us.org   http://vkz.prgateway.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mywhitelabel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.drugaya-fizika.ru/go?https://onlinecasino.us.org  http://www.chooseaamateur.http13.com/cgi-bin/out.cgi?id=devil&url=https://onlinecasino.us.org  http://newsoftman.com/go?https://onlinecasino.us.org   http://seeyourbiopsy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sinjinlee.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://plugin.lt/out.php?url=onlinecasino.us.org   http://dandougherty.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.trinquetdarcangues.com/links/redir.asp?link=onlinecasino.us.org  http://www.uspour.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://easyeapis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://soloincontri.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://portfoliorevolution.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://home.hkesp.com/link.php?url=https://onlinecasino.us.org \nhttp://lendersolutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://photofactor.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://initialcloudflare.linhuake.com/redirect.php?tid=18874&goto=onlinecasino.us.org   http://masters-martialarts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://blog.basnit.com/wp-content/themes/Beginlts/inc/go.php?url=https://onlinecasino.us.org   http://www.callmecrazy.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://newcarquote.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stt.pagespot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dogussk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.luxuriousgaming.com/fourms/showthread.php?tid=37953\nhttp://www.ni28320-2.web12.nitrado.hosting/phpBB3/viewtopic.php?f=7&t=741599&p=1400122#p1400122\nhttps://bazingacoin.com/forum/viewtopic.php?f=5&t=1973080\nhttp://forum.10muhasebe.com/index.php?topic=974967.new#new\nhttp://barhoppersnepa.com/forum/index.php?topic=325057.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7514, "cpu_time_ms": 32, "memory_kb": 4580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s121485622", "group_id": "codeNet:p03941", "input_text": "http://www.black-board.net/thread.php?goto=onlinecasino.us.org  http://aetnaabsenceadvocate.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.zeograd.com/goto.php?https://onlinecasino.us.org   http://assuredpartnersnl.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mayfairforum.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://enbmobile.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wheatland-tube.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://engelandvolkersoakville.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://purelightingllc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://dom.webika.com.ua/ru/redirect?url=https://onlinecasino.us.org  http://daleyps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clubfabia.ru/forum/go.php?https://onlinecasino.us.org   http://www.ldshj.com/bbs/redirect.php?tid=1753&goto=onlinecasino.us.org  https://www.zakkamania.com/dir/shopsearch/ps_search.cgi?act=jump&access=1&url=https://onlinecasino.us.org   http://www.comune.orbetello.gr.it/vivere-orbetello/redirect.asp?url=https://onlinecasino.us.org  http://fuckaau.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://worldwideconsumervoices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://designerbathkitchen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ieuro.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://allcoupon.jp/rd2?url=https://onlinecasino.us.org   http://troika.ifmo.ru/go.php?url=https://onlinecasino.us.org   http://nowbeyond.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://theofficialsites.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.austreale.com/membre.php?referer=https://onlinecasino.us.org  http://china-scooters.ru/go.php?https://onlinecasino.us.org  http://ryha.org/Goto.asp?url=https://onlinecasino.us.org   http://www.comro.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://fishrovex.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gvz.vaskan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://intext.billboard.cz/core/ad_transaction?att=4&atd=1470;8402228890041056734;7275776205120215938;1083;1115;77701;1590;3473861635477096772;200;2;6;3959256398&curl=https://onlinecasino.us.org   http://paco-mama.com/m/redirect.php?url=https://onlinecasino.us.org  http://nysdepartmentofhealth.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.askalot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mascarenhas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pawl.needloan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://texthandler.cceg.ca/www.google.com/dp/ads?max_radlink_len=32&r=m&domain_name=fabulous.com&client=dp-voodoo21_3ph&hl=en&adtest=off&optimize_terms=on&swp=as-drid-2464369813134582&afdt=CiAKEwj0hNrfscnZAhXXJB8KHWwfBoAYBHExJ2hC3-OWKxIZAG06ipDH024CdhpNTkqRE9ocSrcpsPoc9g&uiopt=true&oe=UTF-8&ie=UTF-8&fexp=21404%2C17300002&format=s%7Cr5%7Cr5%7Cr3&adrep=0&num=0&output=afd_ads&v=3&adext=as1%2Csr1&bsl=8&u_his=6&u_tz=-300&dt=1519847661687&u_w=1440&u_h=900&biw=-12245933&bih=-12245933&isw=1440&ish=358&psw=-1&psh=-1&frm=2&uio=sl1sr1--st22sv16sa16lt35-st22sv16sa16lt35-st12sa12&jsv=13016&rurl=https://onlinecasino.us.org \nhttp://jiguparmar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.raymondused.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://xmp.42line.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://205doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hotelsforlife.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://albatros-usa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://l1idbd.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ruen.info/redirect.php?tid=8637&goto=onlinecasino.us.org   http://hurrikini.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://kris.prgateway.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://377tyc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://sc.jet.su/bitrix/rk.php?id=15&site_id=sc&event1=banner&event2=click&event3=2+%2F+%5B15%5D+%5Bsidebar%5D+%D0%9E%D1%84%D0%BE%D1%80%D0%BC%D0%B8%D1%82%D1%8C+%D0%B7%D0%B0%D1%8F%D0%B2%D0%BA%D1%83+%D0%BD%D0%B0+%D1%83%D1%81%D0%BB%D1%83%D0%B3%D0%B8&goto=onlinecasino.us.org   http://abcfulfillment.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://meredithdavis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://business28.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://centurycombat.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eastland-shoe.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://macmillanaudiopublishing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.paulscheffert.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://app.mailingcube.nl/redirect.php?m=4d5451354e546b7a&n=4d5463344e413d3d&url=https://onlinecasino.us.org   http://www.bestmilfclips.com/cgi-bin/atx/out.cgi?link=tmx1x106x448507&u=https://onlinecasino.us.org   http://fuseanylitics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.nlacrc.com/redirect.aspx?url=https://onlinecasino.us.org   http://mojohummer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ethermail.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mallwayfinder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mcgascbillingservices.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://hyiplist.ru/goto.php?url=https://onlinecasino.us.org  http://onlinetvsguide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://windyweb.com/cgibin/top100/out.cgi?id=spatula&url=https://onlinecasino.us.org   http://broadbandmetrophone.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ucr.backrack.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://columnists.qbling.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.retirementworkshop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sportspartystore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://snuggledouble.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://electrolux.ru.xx3.kz/go.php?url=https://onlinecasino.us.org  http://masslawtemps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.fortrucker-env.com/leaving.aspx?ext=https://onlinecasino.us.org   http://lrf.woodconnection.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bigbarbecue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.askasb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://functionaltrainingfitnesscenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ccia.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bonnieandhopkins.com/__media__/js/trademark.php?d=onlinecasino.us.org \nhttp://lightpointcapital.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.psychevisual.com/common/redirect.html?type=lecture_advertisement&ID=23&link=https://onlinecasino.us.org   http://strosalieschool.org/__media__/js/trademark.php?d=onlinecasino.us.org   http://bayermarine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.89zsw.com/go.asp?url=https://onlinecasino.us.org   http://ups-nextdayairsaver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.yanbiaochina.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.traficopr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://accfin.teiep.gr/eclass/modules/link/go.php?course=TMA217&id=108&url=https://onlinecasino.us.org \n \n \n \n \n \nhttps://forums.lfstats.com/viewtopic.php?f=6&t=35952\nhttp://forum.erotyczny24.pl/showthread.php?tid=3234&pid=10474#pid10474\nhttps://weechookeong.com/2018/05/30/masa-sekarang-menungggu-mu-part-5-tourism-msias-rm99-694-mil-speedy-gonzales-contract/\nhttp://7olool.tk/index.php/topic,18993.new.html#new\nhttp://sr.leet.cz/viewtopic.php?f=16&t=454\n", "language": "Lisp", "metadata": {"date": 1551778739, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s121485622.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s121485622", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.black-board.net/thread.php?goto=onlinecasino.us.org  http://aetnaabsenceadvocate.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.zeograd.com/goto.php?https://onlinecasino.us.org   http://assuredpartnersnl.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mayfairforum.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://enbmobile.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wheatland-tube.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://engelandvolkersoakville.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://purelightingllc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://dom.webika.com.ua/ru/redirect?url=https://onlinecasino.us.org  http://daleyps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clubfabia.ru/forum/go.php?https://onlinecasino.us.org   http://www.ldshj.com/bbs/redirect.php?tid=1753&goto=onlinecasino.us.org  https://www.zakkamania.com/dir/shopsearch/ps_search.cgi?act=jump&access=1&url=https://onlinecasino.us.org   http://www.comune.orbetello.gr.it/vivere-orbetello/redirect.asp?url=https://onlinecasino.us.org  http://fuckaau.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://worldwideconsumervoices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://designerbathkitchen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ieuro.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://allcoupon.jp/rd2?url=https://onlinecasino.us.org   http://troika.ifmo.ru/go.php?url=https://onlinecasino.us.org   http://nowbeyond.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://theofficialsites.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.austreale.com/membre.php?referer=https://onlinecasino.us.org  http://china-scooters.ru/go.php?https://onlinecasino.us.org  http://ryha.org/Goto.asp?url=https://onlinecasino.us.org   http://www.comro.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://fishrovex.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gvz.vaskan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://intext.billboard.cz/core/ad_transaction?att=4&atd=1470;8402228890041056734;7275776205120215938;1083;1115;77701;1590;3473861635477096772;200;2;6;3959256398&curl=https://onlinecasino.us.org   http://paco-mama.com/m/redirect.php?url=https://onlinecasino.us.org  http://nysdepartmentofhealth.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.askalot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mascarenhas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pawl.needloan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://texthandler.cceg.ca/www.google.com/dp/ads?max_radlink_len=32&r=m&domain_name=fabulous.com&client=dp-voodoo21_3ph&hl=en&adtest=off&optimize_terms=on&swp=as-drid-2464369813134582&afdt=CiAKEwj0hNrfscnZAhXXJB8KHWwfBoAYBHExJ2hC3-OWKxIZAG06ipDH024CdhpNTkqRE9ocSrcpsPoc9g&uiopt=true&oe=UTF-8&ie=UTF-8&fexp=21404%2C17300002&format=s%7Cr5%7Cr5%7Cr3&adrep=0&num=0&output=afd_ads&v=3&adext=as1%2Csr1&bsl=8&u_his=6&u_tz=-300&dt=1519847661687&u_w=1440&u_h=900&biw=-12245933&bih=-12245933&isw=1440&ish=358&psw=-1&psh=-1&frm=2&uio=sl1sr1--st22sv16sa16lt35-st22sv16sa16lt35-st12sa12&jsv=13016&rurl=https://onlinecasino.us.org \nhttp://jiguparmar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.raymondused.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://xmp.42line.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://205doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hotelsforlife.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://albatros-usa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://l1idbd.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ruen.info/redirect.php?tid=8637&goto=onlinecasino.us.org   http://hurrikini.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://kris.prgateway.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://377tyc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://sc.jet.su/bitrix/rk.php?id=15&site_id=sc&event1=banner&event2=click&event3=2+%2F+%5B15%5D+%5Bsidebar%5D+%D0%9E%D1%84%D0%BE%D1%80%D0%BC%D0%B8%D1%82%D1%8C+%D0%B7%D0%B0%D1%8F%D0%B2%D0%BA%D1%83+%D0%BD%D0%B0+%D1%83%D1%81%D0%BB%D1%83%D0%B3%D0%B8&goto=onlinecasino.us.org   http://abcfulfillment.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://meredithdavis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://business28.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://centurycombat.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eastland-shoe.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://macmillanaudiopublishing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.paulscheffert.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://app.mailingcube.nl/redirect.php?m=4d5451354e546b7a&n=4d5463344e413d3d&url=https://onlinecasino.us.org   http://www.bestmilfclips.com/cgi-bin/atx/out.cgi?link=tmx1x106x448507&u=https://onlinecasino.us.org   http://fuseanylitics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.nlacrc.com/redirect.aspx?url=https://onlinecasino.us.org   http://mojohummer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ethermail.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mallwayfinder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mcgascbillingservices.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://hyiplist.ru/goto.php?url=https://onlinecasino.us.org  http://onlinetvsguide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://windyweb.com/cgibin/top100/out.cgi?id=spatula&url=https://onlinecasino.us.org   http://broadbandmetrophone.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ucr.backrack.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://columnists.qbling.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.retirementworkshop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sportspartystore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://snuggledouble.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://electrolux.ru.xx3.kz/go.php?url=https://onlinecasino.us.org  http://masslawtemps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.fortrucker-env.com/leaving.aspx?ext=https://onlinecasino.us.org   http://lrf.woodconnection.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bigbarbecue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.askasb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://functionaltrainingfitnesscenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ccia.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bonnieandhopkins.com/__media__/js/trademark.php?d=onlinecasino.us.org \nhttp://lightpointcapital.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.psychevisual.com/common/redirect.html?type=lecture_advertisement&ID=23&link=https://onlinecasino.us.org   http://strosalieschool.org/__media__/js/trademark.php?d=onlinecasino.us.org   http://bayermarine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.89zsw.com/go.asp?url=https://onlinecasino.us.org   http://ups-nextdayairsaver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.yanbiaochina.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.traficopr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://accfin.teiep.gr/eclass/modules/link/go.php?course=TMA217&id=108&url=https://onlinecasino.us.org \n \n \n \n \n \nhttps://forums.lfstats.com/viewtopic.php?f=6&t=35952\nhttp://forum.erotyczny24.pl/showthread.php?tid=3234&pid=10474#pid10474\nhttps://weechookeong.com/2018/05/30/masa-sekarang-menungggu-mu-part-5-tourism-msias-rm99-694-mil-speedy-gonzales-contract/\nhttp://7olool.tk/index.php/topic,18993.new.html#new\nhttp://sr.leet.cz/viewtopic.php?f=16&t=454\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8445, "cpu_time_ms": 107, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s362882261", "group_id": "codeNet:p03941", "input_text": "http://outsourcetomalta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.stowint.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fluentnews.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://comoxvalleycalendar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sosburn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://a.scmor.site/url?q=https://onlinecasino.us.org  http://522woman.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://martinandjan.com/admin/Portal/LinkClick.aspx?tabid=138&table=Links&field=ItemID&id=9&link=https://onlinecasino.us.org   http://www.ddksqt.com/index.php?g=Index&c=Recognition&a=see_login_qrcode&referer=https://onlinecasino.us.org \nhttp://metadios.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bottleopener.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://astroconfess.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://flexibler-rentenplan.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bellsafetystore.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://anytruckrepair.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.newbalkan.com/redirect.php?url=https://onlinecasino.us.org  http://www.lifeonaline.com/link.php?go=onlinecasino.us.org   http://bizberi.ru/redirect?url=https://onlinecasino.us.org \nhttp://murana.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dsignsales.mfmed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brinksbroadviewsecurity.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://callanmulvey.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tekcycles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chargeanything.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://buybilliardstables.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://discountgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yourculinarycreations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mualuon.info/go/3/168563?url=https://onlinecasino.us.org  http://renepierreusa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.jesseclingan.org/r?u=https://onlinecasino.us.org   http://xtremesnowsleds.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://remlouisiana.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.onepang.com/url/link.php?url=https://onlinecasino.us.org  http://mobilitydesigns.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://praguepower.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://panerabreadonline.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.imacon-usa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://intlpokerleague.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://itutilityservices.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://usedraymondtrucks.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://productionforsale.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://smartwomenaboutrealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://markkistler.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tailorpages.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://artistrights.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ekw.tastingnotes.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://refer.ccbill.com/cgi-bin/clicks.cgi?CA=928532-0000&PA=2298149&HTML=https://onlinecasino.us.org   http://thegiftiwasgiven.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://go.raidrush.ws/?url=https://onlinecasino.us.org/  http://chicagolandrising.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nationalroboticshonorsociety.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://smartidlock.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lexingtonlawfirms.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.warrensvillebaptistchurch.com/System/UserProfile.asp?id=46468&func=signup&referer=https://onlinecasino.us.org \nhttps://www.storemat.com/redir.asp?action=mailing_special&link=https://onlinecasino.us.org  http://rockandrollstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://tubebd24.com/goto.php?url=https://onlinecasino.us.org   http://globaldiversityroundtable.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.quenovias.com/cgi-bin/at3/out.cgi?s=75u0026amp;l=FOTOSu0026amp;u=/onlinecasino.us.org   http://pieperobrienherr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://powernationmotorsports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://johnkontopuls.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mikefranklin.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://gummybearimplants.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.meezeilen.nl/index.php?redirect&type=shipsite&id=76&url=https://onlinecasino.us.org   http://garo.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jasonapfel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kashbah.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sexplayhot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mysecretnites.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tjtech.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://minlaton.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://thisismission-dot-yamm-track.appspot.com/Redirect?ukey=1N0UCtQwxy7RUewLEGZNdZ8fbzOfAQ4EORU2VLdw6iLU-0&key=YAMMID-59465643&link=https://onlinecasino.us.org  http://www.natiscrea.ch/index.php?option=com_k2&view=item&id=113:astuccio-trihatlon2&itemid=115&v=60&fromurl=onlinecasino.us.org   http://www.sergioleone.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://khalil-khoshrou.blogsky.com/dailylink/?go=https://onlinecasino.us.org  http://www.mujkonicek.cz/redir.php?url=https://onlinecasino.us.org   http://ingreetients.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://longsdrugs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nuq.nursesconnect.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vcmultimedia.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://infocycle.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://contactmonkey.com/api/v1/tracker?cm_session=51e09177-bc16-4e72-a176-5c3dc3e78f6f&cm_type=link&cm_link=aecfb592-1c5b-4f41-88f7-da82d040fbee&cm_destination=https://onlinecasino.us.org   http://highachieversscorecard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://david-weekley-homes-stink.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.tinhdoanquangninh.vn/webcu/index.php?option=com_ngrabnews&view=link&task=go&url=onlinecasino.us.org   http://eoi.sylvanresort.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.beatthebomb.com.au/?url=https://onlinecasino.us.org  http://www.bct5123.com/e/public/jump/?classid=30&id=353&url=https://onlinecasino.us.org   http://www.3dtoonsexx.com/crtr/cgi/out.cgi?id=749&l=top_top&u=https://onlinecasino.us.org \n \n \n \n \n \nhttps://ict-npo.com/lecheniye-stvolovymi-kletkami-otzivi/?unapproved=88117&moderation-hash=02ebfeb10edf8c57336dcdb7db8e8af5#comment-88117\nhttp://zohra.ch/forum/viewtopic.php?p=571798#571798\nhttp://seosocial.nl/2014/06/apple-voegt-duckduckgo-toe-als-zoekmachine/#comment-655005\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttps://runeatrelaxrepeat.com/2015/04/04/start-to-run-met-evy-gruyaert-podcast-download/comment-page-1/\n", "language": "Lisp", "metadata": {"date": 1551755016, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s362882261.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s362882261", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://outsourcetomalta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.stowint.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fluentnews.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://comoxvalleycalendar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sosburn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://a.scmor.site/url?q=https://onlinecasino.us.org  http://522woman.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://martinandjan.com/admin/Portal/LinkClick.aspx?tabid=138&table=Links&field=ItemID&id=9&link=https://onlinecasino.us.org   http://www.ddksqt.com/index.php?g=Index&c=Recognition&a=see_login_qrcode&referer=https://onlinecasino.us.org \nhttp://metadios.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bottleopener.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://astroconfess.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://flexibler-rentenplan.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bellsafetystore.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://anytruckrepair.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.newbalkan.com/redirect.php?url=https://onlinecasino.us.org  http://www.lifeonaline.com/link.php?go=onlinecasino.us.org   http://bizberi.ru/redirect?url=https://onlinecasino.us.org \nhttp://murana.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dsignsales.mfmed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brinksbroadviewsecurity.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://callanmulvey.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tekcycles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chargeanything.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://buybilliardstables.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://discountgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yourculinarycreations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mualuon.info/go/3/168563?url=https://onlinecasino.us.org  http://renepierreusa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.jesseclingan.org/r?u=https://onlinecasino.us.org   http://xtremesnowsleds.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://remlouisiana.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.onepang.com/url/link.php?url=https://onlinecasino.us.org  http://mobilitydesigns.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://praguepower.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://panerabreadonline.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.imacon-usa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://intlpokerleague.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://itutilityservices.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://usedraymondtrucks.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://productionforsale.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://smartwomenaboutrealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://markkistler.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tailorpages.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://artistrights.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ekw.tastingnotes.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://refer.ccbill.com/cgi-bin/clicks.cgi?CA=928532-0000&PA=2298149&HTML=https://onlinecasino.us.org   http://thegiftiwasgiven.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://go.raidrush.ws/?url=https://onlinecasino.us.org/  http://chicagolandrising.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nationalroboticshonorsociety.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://smartidlock.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lexingtonlawfirms.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.warrensvillebaptistchurch.com/System/UserProfile.asp?id=46468&func=signup&referer=https://onlinecasino.us.org \nhttps://www.storemat.com/redir.asp?action=mailing_special&link=https://onlinecasino.us.org  http://rockandrollstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://tubebd24.com/goto.php?url=https://onlinecasino.us.org   http://globaldiversityroundtable.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.quenovias.com/cgi-bin/at3/out.cgi?s=75u0026amp;l=FOTOSu0026amp;u=/onlinecasino.us.org   http://pieperobrienherr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://powernationmotorsports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://johnkontopuls.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mikefranklin.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://gummybearimplants.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.meezeilen.nl/index.php?redirect&type=shipsite&id=76&url=https://onlinecasino.us.org   http://garo.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jasonapfel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kashbah.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sexplayhot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mysecretnites.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tjtech.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://minlaton.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://thisismission-dot-yamm-track.appspot.com/Redirect?ukey=1N0UCtQwxy7RUewLEGZNdZ8fbzOfAQ4EORU2VLdw6iLU-0&key=YAMMID-59465643&link=https://onlinecasino.us.org  http://www.natiscrea.ch/index.php?option=com_k2&view=item&id=113:astuccio-trihatlon2&itemid=115&v=60&fromurl=onlinecasino.us.org   http://www.sergioleone.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://khalil-khoshrou.blogsky.com/dailylink/?go=https://onlinecasino.us.org  http://www.mujkonicek.cz/redir.php?url=https://onlinecasino.us.org   http://ingreetients.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://longsdrugs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nuq.nursesconnect.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vcmultimedia.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://infocycle.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://contactmonkey.com/api/v1/tracker?cm_session=51e09177-bc16-4e72-a176-5c3dc3e78f6f&cm_type=link&cm_link=aecfb592-1c5b-4f41-88f7-da82d040fbee&cm_destination=https://onlinecasino.us.org   http://highachieversscorecard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://david-weekley-homes-stink.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.tinhdoanquangninh.vn/webcu/index.php?option=com_ngrabnews&view=link&task=go&url=onlinecasino.us.org   http://eoi.sylvanresort.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.beatthebomb.com.au/?url=https://onlinecasino.us.org  http://www.bct5123.com/e/public/jump/?classid=30&id=353&url=https://onlinecasino.us.org   http://www.3dtoonsexx.com/crtr/cgi/out.cgi?id=749&l=top_top&u=https://onlinecasino.us.org \n \n \n \n \n \nhttps://ict-npo.com/lecheniye-stvolovymi-kletkami-otzivi/?unapproved=88117&moderation-hash=02ebfeb10edf8c57336dcdb7db8e8af5#comment-88117\nhttp://zohra.ch/forum/viewtopic.php?p=571798#571798\nhttp://seosocial.nl/2014/06/apple-voegt-duckduckgo-toe-als-zoekmachine/#comment-655005\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttps://runeatrelaxrepeat.com/2015/04/04/start-to-run-met-evy-gruyaert-podcast-download/comment-page-1/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8148, "cpu_time_ms": 182, "memory_kb": 14052}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s268409908", "group_id": "codeNet:p03941", "input_text": "http://aveakantin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stpetersburgemergency.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://creditmentor.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://shop.awel54.ru/bitrix/rk.php?id=8359&goto=onlinecasino.us.org  http://usfoodlogistics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.mom1.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  https://farming-mods.ru/engine/go.php?url=onlinecasino.us.org  http://iloveschoolbuses.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://freeschooltutoring.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.chicagoboardoftrade.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.dance.nyc/articles/redirect/Tamar-Rogoff-Performance-Projects?r=https://onlinecasino.us.org   http://sfxb9g.sexinsex.pro/forum/redirect.php?fid=122&tid=828033&goto=onlinecasino.us.org   http://infodynamics.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.scrappylife.ru/go/url=https://onlinecasino.us.org   http://puro-mexico.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gpls-survey.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://violet.katabrozova.cz/youraccount/login?ln=cs&referer=https://onlinecasino.us.org   http://xzz.kelleyfuneralhome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://myfirstwebapplication.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://livefounders.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nfpannuity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sintoment.caltec.cl/bitrix/rk.php?id=5&event1=banner&event2=click&event3=1+%2F+%5B5%5D+%5Bservices2%5D+%D3%F1%EB%F3%E3%E8+2&goto=onlinecasino.us.org  http://olzatjoamt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://maps.google.al/url?q=https://onlinecasino.us.org  http://zaxblz.blog.jspi.cn/go.asp?url=https://onlinecasino.us.org  http://9.xg4ken.com/media/redir.php?prof=585&camp=14222&affcode=kw643898&cid=21462414847&networkType=search&kid=_kenshoo_clickid_&url%5B%5D=https://onlinecasino.us.org   http://subrogationbenchmarking.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mydelissh.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ronedmonds.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pfchangsrocknroll.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.ojjdp.gov/exit.asp?url=https://onlinecasino.us.org  http://etui.valeroportarthur.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://smartfreescores.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.arteporexcelencias.com/adplus/redirect?ad_id=23927&url=https://onlinecasino.us.org  http://kwamekilpatrick.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ilsitoufficiale.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://doguskoruma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gammagefh.com/cfi/addthis_email.cfm?url=https://onlinecasino.us.org   http://danielledriggs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://masterkeuze.qompas.nl/redirect/information?url=https://onlinecasino.us.org  http://aehsveqexz.cevy.1.gsr.anonimizing.com/home287/createSession?referer=https://onlinecasino.us.org   http://johnstownnewschannel.com/index.php?do=external&channel=289&url=https://onlinecasino.us.org  http://axiomproperties.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rainydayfunds.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.birds.cz/avif/redirect.php?from=avif.obs.php&url=https://onlinecasino.us.org \nhttp://danlaytham.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://veryfly.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://taximaximum.lviv.ua/redirect.php?url=https://onlinecasino.us.org/   http://www.bet3732.com/230/c?z=ifeng&la=0&si=2&cg=1&c=1&ci=2&or=11189&l=43284&bg=43284&b=66647&u=https://onlinecasino.us.org  http://nataliejohn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://krat.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://m.shopinstlouis.com/redirect.aspx?url=onlinecasino.us.org  http://iranmodern.com/seo/redirect.php?url=https://onlinecasino.us.org/   http://www.seethelightshine.com/affiliate/scripts/click.php?a_aid=50984b5eb7b19&desturl=https://onlinecasino.us.org \nhttp://www.stanthonys.edu.hk/redirect.php?id=9&url=https://onlinecasino.us.org  http://lppreservation.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stuartschool.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://langlangweb.mycomb.cn/adredir.asp?url=https://onlinecasino.us.org  http://itspublicknowledge.info/nmsruntime/logLink.aspx?linkURL=https://onlinecasino.us.org   http://www.google.ru/url?q=https://onlinecasino.us.org  http://www.cock-n-dick.com/cgi-bin/a2/out.cgi?id=21&l=mid3&u=https://onlinecasino.us.org  http://www.futurefocusfinancial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://bbs.vpser.net/redirect.php?tid=5689&goto=onlinecasino.us.org \nhttp://damnyankee.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://difiores.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wrinklemakeover.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.topmoms.org/cgi-bin/out.cgi?perm=mature-post.com&link=onlinecasino.us.org  http://kozymoss.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tundra.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://atriumdoor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://forum.hi-net.com.tw/redirect.php?tid=4298&goto=onlinecasino.us.org   http://vzletim.aero/upload/rk/77f/q.swf?flash_link=onlinecasino.us.org \nhttp://e-mortgageclosings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://es.sapr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tju.spillmasters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://capitalify.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mainstreetalliance.org/r?u=https://onlinecasino.us.org   http://jawpro.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://twincitytc-legacy.org/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.peoplesbc.ca/__media__/js/trademark.php?d=onlinecasino.us.org   http://cravosteelproducts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://alumninetwork.rhsmith.umd.edu/dpplead/PortalHub.nsf/External?ReadForm&url=onlinecasino.us.org  http://hyperionservicesllc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://winlottocash.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mountainbrookapts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://online.activecommunities.com/cityoforlando/Start/StartSelectLanguage.asp?Referrer=https://onlinecasino.us.org   http://thecenterformaking.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bigkidcollectables.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fracmax.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://saversladder.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://barhoppersnepa.com/forum/index.php?topic=323106.new#new\nhttps://friendsofdenverparks.org/contact-us/?contact-form-id=30&contact-form-sent=6172&contact-form-hash=d9052198692ffea62c40cfcca204ebeb2682dad1&_wpnonce=63a28a3337\nhttps://vegetation-daheim.info/2012/11/26/vegetative-vermehrung-der-blauen-passionsblume-passiflora-caerulea/\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=422449\nhttps://uosymphony.com/resources/intonation-solutions-for-orchestral-players/\n", "language": "Lisp", "metadata": {"date": 1551749223, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s268409908.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s268409908", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://aveakantin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stpetersburgemergency.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://creditmentor.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://shop.awel54.ru/bitrix/rk.php?id=8359&goto=onlinecasino.us.org  http://usfoodlogistics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.mom1.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  https://farming-mods.ru/engine/go.php?url=onlinecasino.us.org  http://iloveschoolbuses.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://freeschooltutoring.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.chicagoboardoftrade.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.dance.nyc/articles/redirect/Tamar-Rogoff-Performance-Projects?r=https://onlinecasino.us.org   http://sfxb9g.sexinsex.pro/forum/redirect.php?fid=122&tid=828033&goto=onlinecasino.us.org   http://infodynamics.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.scrappylife.ru/go/url=https://onlinecasino.us.org   http://puro-mexico.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gpls-survey.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://violet.katabrozova.cz/youraccount/login?ln=cs&referer=https://onlinecasino.us.org   http://xzz.kelleyfuneralhome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://myfirstwebapplication.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://livefounders.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nfpannuity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sintoment.caltec.cl/bitrix/rk.php?id=5&event1=banner&event2=click&event3=1+%2F+%5B5%5D+%5Bservices2%5D+%D3%F1%EB%F3%E3%E8+2&goto=onlinecasino.us.org  http://olzatjoamt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://maps.google.al/url?q=https://onlinecasino.us.org  http://zaxblz.blog.jspi.cn/go.asp?url=https://onlinecasino.us.org  http://9.xg4ken.com/media/redir.php?prof=585&camp=14222&affcode=kw643898&cid=21462414847&networkType=search&kid=_kenshoo_clickid_&url%5B%5D=https://onlinecasino.us.org   http://subrogationbenchmarking.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mydelissh.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ronedmonds.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pfchangsrocknroll.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.ojjdp.gov/exit.asp?url=https://onlinecasino.us.org  http://etui.valeroportarthur.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://smartfreescores.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.arteporexcelencias.com/adplus/redirect?ad_id=23927&url=https://onlinecasino.us.org  http://kwamekilpatrick.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ilsitoufficiale.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://doguskoruma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gammagefh.com/cfi/addthis_email.cfm?url=https://onlinecasino.us.org   http://danielledriggs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://masterkeuze.qompas.nl/redirect/information?url=https://onlinecasino.us.org  http://aehsveqexz.cevy.1.gsr.anonimizing.com/home287/createSession?referer=https://onlinecasino.us.org   http://johnstownnewschannel.com/index.php?do=external&channel=289&url=https://onlinecasino.us.org  http://axiomproperties.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rainydayfunds.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.birds.cz/avif/redirect.php?from=avif.obs.php&url=https://onlinecasino.us.org \nhttp://danlaytham.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://veryfly.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://taximaximum.lviv.ua/redirect.php?url=https://onlinecasino.us.org/   http://www.bet3732.com/230/c?z=ifeng&la=0&si=2&cg=1&c=1&ci=2&or=11189&l=43284&bg=43284&b=66647&u=https://onlinecasino.us.org  http://nataliejohn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://krat.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://m.shopinstlouis.com/redirect.aspx?url=onlinecasino.us.org  http://iranmodern.com/seo/redirect.php?url=https://onlinecasino.us.org/   http://www.seethelightshine.com/affiliate/scripts/click.php?a_aid=50984b5eb7b19&desturl=https://onlinecasino.us.org \nhttp://www.stanthonys.edu.hk/redirect.php?id=9&url=https://onlinecasino.us.org  http://lppreservation.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stuartschool.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://langlangweb.mycomb.cn/adredir.asp?url=https://onlinecasino.us.org  http://itspublicknowledge.info/nmsruntime/logLink.aspx?linkURL=https://onlinecasino.us.org   http://www.google.ru/url?q=https://onlinecasino.us.org  http://www.cock-n-dick.com/cgi-bin/a2/out.cgi?id=21&l=mid3&u=https://onlinecasino.us.org  http://www.futurefocusfinancial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://bbs.vpser.net/redirect.php?tid=5689&goto=onlinecasino.us.org \nhttp://damnyankee.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://difiores.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wrinklemakeover.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.topmoms.org/cgi-bin/out.cgi?perm=mature-post.com&link=onlinecasino.us.org  http://kozymoss.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tundra.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://atriumdoor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://forum.hi-net.com.tw/redirect.php?tid=4298&goto=onlinecasino.us.org   http://vzletim.aero/upload/rk/77f/q.swf?flash_link=onlinecasino.us.org \nhttp://e-mortgageclosings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://es.sapr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tju.spillmasters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://capitalify.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mainstreetalliance.org/r?u=https://onlinecasino.us.org   http://jawpro.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://twincitytc-legacy.org/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.peoplesbc.ca/__media__/js/trademark.php?d=onlinecasino.us.org   http://cravosteelproducts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://alumninetwork.rhsmith.umd.edu/dpplead/PortalHub.nsf/External?ReadForm&url=onlinecasino.us.org  http://hyperionservicesllc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://winlottocash.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mountainbrookapts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://online.activecommunities.com/cityoforlando/Start/StartSelectLanguage.asp?Referrer=https://onlinecasino.us.org   http://thecenterformaking.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bigkidcollectables.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fracmax.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://saversladder.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://barhoppersnepa.com/forum/index.php?topic=323106.new#new\nhttps://friendsofdenverparks.org/contact-us/?contact-form-id=30&contact-form-sent=6172&contact-form-hash=d9052198692ffea62c40cfcca204ebeb2682dad1&_wpnonce=63a28a3337\nhttps://vegetation-daheim.info/2012/11/26/vegetative-vermehrung-der-blauen-passionsblume-passiflora-caerulea/\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=422449\nhttps://uosymphony.com/resources/intonation-solutions-for-orchestral-players/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8085, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s384836547", "group_id": "codeNet:p03941", "input_text": "http://pitstops.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://whalepants.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chrismuller.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eyewitnessnews8.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gemorigins.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://monkeyhugsfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mcafhna.org.au/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.fucknetworksolutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.instantwinner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.ralstonfamilylegacy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://traffic-building.awardspace.com/go.php?url=https://onlinecasino.us.org   http://misecureconnect.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dragonesandroid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://creditunionbonus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://blackboardtransactionsystem.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://palingseru.com/rdir/go.php?to=https://onlinecasino.us.org  http://discoversalmo.ca/LinkClick.aspx?link=https://onlinecasino.us.org   http://prlinktampabay.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://michaelfuljenz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cyberwayswaterways.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://directimpressionsinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.kampfkunst-board.info/forum/blog.php?b=118&goto=onlinecasino.us.org  http://www.msiusa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bytomogloszenia.pl/link.php?url=https://onlinecasino.us.org  http://completesavings-ripoff.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://webformsite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://autoconfig.ru/redirect.php?url=onlinecasino.us.org \nhttp://uslugiwroclaw.one.pl/baneriada/url.php?url=https://onlinecasino.us.org  http://geraldschoenfeld.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://westravenmanga.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://34rt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tradeop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lnvc.cn/home/link.php?url=https://onlinecasino.us.org/  http://www.universalelectric.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.alvieducationwelfaresociety.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eash.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://gay-porn-art.com/crtr/cgi/out.cgi?id=365&l=top_top&u=https://onlinecasino.us.org  http://bbs.dashunde.com/redirect.php?goto=onlinecasino.us.org   http://www.vuxentoppen.com/ept/out.php?f=1&pct=60&url=https://onlinecasino.us.org   http://californiastudenthousing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://scrantonalumnicommunity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.oysterbaylocal881.org/__media__/js/trademark.php?d=onlinecasino.us.org  http://baylakebank.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cssn.cn/comment/comment?newsid=3295965&encoding=UTF-8&data=ADJK3QAAABUAAC_8AAAAAQAz56ys5LqM5bGK5pWw5a2X5pe25Luj5Ye654mI5Zu96ZmF5YyW56CU6K6o5Lya5Li-6KGMAAAAAAAAAAAAAAAuMCwCFBNDL4m4r2tU9Hk7UZ8H441gP0T6AhQ8BnWSzlobXC2QOUom2eJu6vuqMw..&referer=https://onlinecasino.us.org   http://truckmart.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://netsticky.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kmw.abadiepaper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://usa-interpreters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.twinkspicsorgasm.com/cgi-bin/crtr/out.cgi?p=60&url=https://onlinecasino.us.org  http://www.acupunctuur-winterswijk.nl/LinkClick.aspx?link=https://onlinecasino.us.org   http://yueyuebaby.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://8000msc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://polloftheday.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mikelangley.com/LinkClick.aspx?link=https://onlinecasino.us.org \nhttp://campfarwell.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://banking2go.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://econforum.ru/links.php?go=https://onlinecasino.us.org   http://hiexlittletondenver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://daysinnscottsdale.com/redirect.php?l=https://onlinecasino.us.org   http://dittingswiss.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lzz.bustbuilder.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marefatschool.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.hesleygroup.co.uk/content/rjp-adult-services?return=https://onlinecasino.us.org \nhttp://www.fastvalue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.southshoreskincenter.com/tt/reports.php?domain=&conversionsonly=1&start=1/1/2004&end=05/15/14&action=keywords&referrer=&refdomain=onlinecasino.us.org   http://hackedgear.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://makethehealthychoice.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.christmasny.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tennis.isport.com/Default.aspx?link=https://onlinecasino.us.org  http://foreverresortsllc.com/adredir.asp?url=https://onlinecasino.us.org  http://cinellifamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chinaswine.com.cn/bbs/redirect.php?goto=onlinecasino.us.org \nhttp://eliseterlato.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ridewear.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.forecresults.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ridemate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lowestgasprice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mochifanta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://healthypeople.gov/2010/redirect.aspx?url=https://onlinecasino.us.org  http://t-grandis.net/wp-content/themes/Beginlts-11/inc/go.php?url=https://onlinecasino.us.org   http://www.spababy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://globaldoctorsforchoice.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.hikingproject.com/redir?key=manager&url=https://onlinecasino.us.org   http://broadwaymobile.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.patanegrarental.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tekmachinery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://1fx.ru/upload/rk/989/989f3b62d10da654dd3489ad91b6b070.swf?flash_link=onlinecasino.us.org  http://3317760.vkrugudruzei.ru/x/outlink?url=https://onlinecasino.us.org  http://sathyabamacbt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clausingind.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://dgrreklam.com/staff/index.php?topic=105434.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://forum.caothumu.com/showthread.php?13251-practice-commercial-scripts&p=19252#post19252\nhttp://forum.lib42.ru/viewtopic.php?pid=179246#p179246\nhttp://ultimatemuskyguide.com/forum/index.php?topic=297575.new#new\n", "language": "Lisp", "metadata": {"date": 1551701924, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s384836547.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s384836547", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://pitstops.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://whalepants.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chrismuller.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eyewitnessnews8.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gemorigins.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://monkeyhugsfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mcafhna.org.au/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.fucknetworksolutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.instantwinner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.ralstonfamilylegacy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://traffic-building.awardspace.com/go.php?url=https://onlinecasino.us.org   http://misecureconnect.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dragonesandroid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://creditunionbonus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://blackboardtransactionsystem.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://palingseru.com/rdir/go.php?to=https://onlinecasino.us.org  http://discoversalmo.ca/LinkClick.aspx?link=https://onlinecasino.us.org   http://prlinktampabay.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://michaelfuljenz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cyberwayswaterways.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://directimpressionsinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.kampfkunst-board.info/forum/blog.php?b=118&goto=onlinecasino.us.org  http://www.msiusa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bytomogloszenia.pl/link.php?url=https://onlinecasino.us.org  http://completesavings-ripoff.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://webformsite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://autoconfig.ru/redirect.php?url=onlinecasino.us.org \nhttp://uslugiwroclaw.one.pl/baneriada/url.php?url=https://onlinecasino.us.org  http://geraldschoenfeld.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://westravenmanga.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://34rt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tradeop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lnvc.cn/home/link.php?url=https://onlinecasino.us.org/  http://www.universalelectric.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.alvieducationwelfaresociety.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eash.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://gay-porn-art.com/crtr/cgi/out.cgi?id=365&l=top_top&u=https://onlinecasino.us.org  http://bbs.dashunde.com/redirect.php?goto=onlinecasino.us.org   http://www.vuxentoppen.com/ept/out.php?f=1&pct=60&url=https://onlinecasino.us.org   http://californiastudenthousing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://scrantonalumnicommunity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.oysterbaylocal881.org/__media__/js/trademark.php?d=onlinecasino.us.org  http://baylakebank.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cssn.cn/comment/comment?newsid=3295965&encoding=UTF-8&data=ADJK3QAAABUAAC_8AAAAAQAz56ys5LqM5bGK5pWw5a2X5pe25Luj5Ye654mI5Zu96ZmF5YyW56CU6K6o5Lya5Li-6KGMAAAAAAAAAAAAAAAuMCwCFBNDL4m4r2tU9Hk7UZ8H441gP0T6AhQ8BnWSzlobXC2QOUom2eJu6vuqMw..&referer=https://onlinecasino.us.org   http://truckmart.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://netsticky.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kmw.abadiepaper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://usa-interpreters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.twinkspicsorgasm.com/cgi-bin/crtr/out.cgi?p=60&url=https://onlinecasino.us.org  http://www.acupunctuur-winterswijk.nl/LinkClick.aspx?link=https://onlinecasino.us.org   http://yueyuebaby.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://8000msc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://polloftheday.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mikelangley.com/LinkClick.aspx?link=https://onlinecasino.us.org \nhttp://campfarwell.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://banking2go.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://econforum.ru/links.php?go=https://onlinecasino.us.org   http://hiexlittletondenver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://daysinnscottsdale.com/redirect.php?l=https://onlinecasino.us.org   http://dittingswiss.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lzz.bustbuilder.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marefatschool.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.hesleygroup.co.uk/content/rjp-adult-services?return=https://onlinecasino.us.org \nhttp://www.fastvalue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.southshoreskincenter.com/tt/reports.php?domain=&conversionsonly=1&start=1/1/2004&end=05/15/14&action=keywords&referrer=&refdomain=onlinecasino.us.org   http://hackedgear.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://makethehealthychoice.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.christmasny.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tennis.isport.com/Default.aspx?link=https://onlinecasino.us.org  http://foreverresortsllc.com/adredir.asp?url=https://onlinecasino.us.org  http://cinellifamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chinaswine.com.cn/bbs/redirect.php?goto=onlinecasino.us.org \nhttp://eliseterlato.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ridewear.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.forecresults.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ridemate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lowestgasprice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mochifanta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://healthypeople.gov/2010/redirect.aspx?url=https://onlinecasino.us.org  http://t-grandis.net/wp-content/themes/Beginlts-11/inc/go.php?url=https://onlinecasino.us.org   http://www.spababy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://globaldoctorsforchoice.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.hikingproject.com/redir?key=manager&url=https://onlinecasino.us.org   http://broadwaymobile.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.patanegrarental.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tekmachinery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://1fx.ru/upload/rk/989/989f3b62d10da654dd3489ad91b6b070.swf?flash_link=onlinecasino.us.org  http://3317760.vkrugudruzei.ru/x/outlink?url=https://onlinecasino.us.org  http://sathyabamacbt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clausingind.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://dgrreklam.com/staff/index.php?topic=105434.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://forum.caothumu.com/showthread.php?13251-practice-commercial-scripts&p=19252#post19252\nhttp://forum.lib42.ru/viewtopic.php?pid=179246#p179246\nhttp://ultimatemuskyguide.com/forum/index.php?topic=297575.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8469, "cpu_time_ms": 78, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s375423299", "group_id": "codeNet:p03941", "input_text": "http://orange-beach-rentals.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://55natoma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zuckertest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ktm.floridafirstinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.vreau-muzica.http15.com/cgi-bin/atc/out.cgi?id=93&u=/onlinecasino.us.org   http://gallbladder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fisheraccounts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bq--3bhdw65b.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://salespersonreviewer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://nyctownhouseinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://talkceleb.com/out.php?url=https://onlinecasino.us.org   http://infobodensee.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.realestate.incoffs.com/click.php?https://onlinecasino.us.org  http://scisconnect.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cpass.nationallawinstitute.com/redirect.php?ad=35&uid=&url=https://onlinecasino.us.org  https://nb.jewishpolicycenter.org/r?u=https://onlinecasino.us.org  http://envisionconsultingllc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://i-gloryon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://9538.r.msn.com/?ld=d3lfa745z4qmVUlD1VwDCHtTVUCUxFy7gdmOQxJ9ny3r6DFYT_aSnbo80u6xLyCxp7cd2ijg0YRZ8IGGATbXT-BTe25CkR-37tBoJlAZs92QEHLyLMfq_dULE5MI8aocUSKspGOc05oaWFXlsGVH7sNxu78J_kG6I_7E6PBxlWzSl1ENuf&u=https://onlinecasino.us.org  http://islandofsongs.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.greenmodeconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://invenio.nusl.cz/youraccount/login?referer=https://onlinecasino.us.org  http://wawawa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cellexams.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sweetcollegegirls.com/cgi-bin/atx/out.cgi?id=429&tag=tbot&trade=https://onlinecasino.us.org  http://liveunitedbayarea.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jobmatchhuntsville.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://chicagoeyesurgeons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://analogunite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://analiz-sajta.megabusin.ru/redirect.php?url=https://onlinecasino.us.org   http://winebeerimports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://telusmobilityblows.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mooseback.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aesirmediaholdings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cubaforma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.edgarsclub.co.za/wp-json/oembed/1.0/embed?url=https://onlinecasino.us.org \nhttp://wealthmanagementsystems.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nunui.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://utahhomegrantsmoney.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vcl.xspurt.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://makemeanoffer.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.formykids.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://groupofsingles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dramafestivals.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dieselgeneratorstexas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://glickmaintenancetees.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.djdeep.com/redirect.php?link=https://onlinecasino.us.org   http://дє’иЃЇз¶Ій›»еЅ±ж•ёж“љеє«.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.axon-electronics.gr/redirect.php?action=url&goto=https://onlinecasino.us.org  http://payeverybill.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rheinchat.de/x/redirect.php?go=https://onlinecasino.us.org  http://harringtonconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://millsfordwillmar.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.askalot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://isignon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fractionaljetinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://livedocs.safeandsecureschools.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aboutvisionloss.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://apneadentist.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.citybreakscheap.co.uk/go.php?url=https://onlinecasino.us.org  http://longislandcontractors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://template-demo.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://saitebi.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bbs.xyweb.cc/index.php?c=login&&referer=https://onlinecasino.us.org  http://postgrad.studymalaysia.com/out.php?url=onlinecasino.us.org   https://epoque.fi/horde/services/go.php?url=https://onlinecasino.us.org   http://www.cnqcb.com/web/static/swf/Magazine.swf?url=https://onlinecasino.us.org  https://poll.minvostokrazvitia.ru/bitrix/rk.php?id=12&site_id=s2&event1=banner&event2=click&event3=1+%2F+%5B12%5D+%5B220_75%5D+%CF%E5%F0%E5%E5%F5%E0%F2%FC&goto=https://onlinecasino.us.org   http://unforgotten.life/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://brookeshunter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://11.xn--d1acvi.xn--80aswg/go/url=onlinecasino.us.org   http://montereybaycannabiscompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.goodhouse.com.tw/pro/redirect.php?url=https://onlinecasino.us.org  http://www.nikki4oakland.com/r?u=https://onlinecasino.us.org   http://gelen.pro/away.php?url=https://onlinecasino.us.org   http://www.vog8.com/go/go.php?url=https://onlinecasino.us.org  http://zag.itffinancial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qimok.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://tri-par.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://planned-parenthood-nyc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://petsacrossamerica.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://employmentpda.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hobby-moto.com/yamaha-reader.php?url=https://onlinecasino.us.org   http://www.editor.bg/redirect.php?url=https://onlinecasino.us.org   http://www.theadoptionkey.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.greenlakehalfmarathon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.peterscorp.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://innovatingbeauty.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jesuswasasocialist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.adamhinds.org/r?u=https://onlinecasino.us.org \n \n \n \n \n \nhttp://ishq-m.com/s/saeed/showthread.php?p=42177#post42177\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=78857&p=142921#p142921\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php%20\nhttp://www.piterenka.ru/forum/viewtopic.php?f=4&t=53051\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=417002\n", "language": "Lisp", "metadata": {"date": 1551695964, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s375423299.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s375423299", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://orange-beach-rentals.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://55natoma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zuckertest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ktm.floridafirstinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.vreau-muzica.http15.com/cgi-bin/atc/out.cgi?id=93&u=/onlinecasino.us.org   http://gallbladder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fisheraccounts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bq--3bhdw65b.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://salespersonreviewer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://nyctownhouseinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://talkceleb.com/out.php?url=https://onlinecasino.us.org   http://infobodensee.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.realestate.incoffs.com/click.php?https://onlinecasino.us.org  http://scisconnect.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cpass.nationallawinstitute.com/redirect.php?ad=35&uid=&url=https://onlinecasino.us.org  https://nb.jewishpolicycenter.org/r?u=https://onlinecasino.us.org  http://envisionconsultingllc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://i-gloryon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://9538.r.msn.com/?ld=d3lfa745z4qmVUlD1VwDCHtTVUCUxFy7gdmOQxJ9ny3r6DFYT_aSnbo80u6xLyCxp7cd2ijg0YRZ8IGGATbXT-BTe25CkR-37tBoJlAZs92QEHLyLMfq_dULE5MI8aocUSKspGOc05oaWFXlsGVH7sNxu78J_kG6I_7E6PBxlWzSl1ENuf&u=https://onlinecasino.us.org  http://islandofsongs.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.greenmodeconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://invenio.nusl.cz/youraccount/login?referer=https://onlinecasino.us.org  http://wawawa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cellexams.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sweetcollegegirls.com/cgi-bin/atx/out.cgi?id=429&tag=tbot&trade=https://onlinecasino.us.org  http://liveunitedbayarea.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jobmatchhuntsville.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://chicagoeyesurgeons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://analogunite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://analiz-sajta.megabusin.ru/redirect.php?url=https://onlinecasino.us.org   http://winebeerimports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://telusmobilityblows.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mooseback.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aesirmediaholdings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cubaforma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.edgarsclub.co.za/wp-json/oembed/1.0/embed?url=https://onlinecasino.us.org \nhttp://wealthmanagementsystems.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nunui.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://utahhomegrantsmoney.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vcl.xspurt.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://makemeanoffer.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.formykids.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://groupofsingles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dramafestivals.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dieselgeneratorstexas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://glickmaintenancetees.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.djdeep.com/redirect.php?link=https://onlinecasino.us.org   http://дє’иЃЇз¶Ій›»еЅ±ж•ёж“љеє«.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.axon-electronics.gr/redirect.php?action=url&goto=https://onlinecasino.us.org  http://payeverybill.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rheinchat.de/x/redirect.php?go=https://onlinecasino.us.org  http://harringtonconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://millsfordwillmar.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.askalot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://isignon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fractionaljetinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://livedocs.safeandsecureschools.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aboutvisionloss.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://apneadentist.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.citybreakscheap.co.uk/go.php?url=https://onlinecasino.us.org  http://longislandcontractors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://template-demo.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://saitebi.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bbs.xyweb.cc/index.php?c=login&&referer=https://onlinecasino.us.org  http://postgrad.studymalaysia.com/out.php?url=onlinecasino.us.org   https://epoque.fi/horde/services/go.php?url=https://onlinecasino.us.org   http://www.cnqcb.com/web/static/swf/Magazine.swf?url=https://onlinecasino.us.org  https://poll.minvostokrazvitia.ru/bitrix/rk.php?id=12&site_id=s2&event1=banner&event2=click&event3=1+%2F+%5B12%5D+%5B220_75%5D+%CF%E5%F0%E5%E5%F5%E0%F2%FC&goto=https://onlinecasino.us.org   http://unforgotten.life/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://brookeshunter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://11.xn--d1acvi.xn--80aswg/go/url=onlinecasino.us.org   http://montereybaycannabiscompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.goodhouse.com.tw/pro/redirect.php?url=https://onlinecasino.us.org  http://www.nikki4oakland.com/r?u=https://onlinecasino.us.org   http://gelen.pro/away.php?url=https://onlinecasino.us.org   http://www.vog8.com/go/go.php?url=https://onlinecasino.us.org  http://zag.itffinancial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qimok.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://tri-par.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://planned-parenthood-nyc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://petsacrossamerica.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://employmentpda.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hobby-moto.com/yamaha-reader.php?url=https://onlinecasino.us.org   http://www.editor.bg/redirect.php?url=https://onlinecasino.us.org   http://www.theadoptionkey.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.greenlakehalfmarathon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.peterscorp.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://innovatingbeauty.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jesuswasasocialist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.adamhinds.org/r?u=https://onlinecasino.us.org \n \n \n \n \n \nhttp://ishq-m.com/s/saeed/showthread.php?p=42177#post42177\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=78857&p=142921#p142921\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php%20\nhttp://www.piterenka.ru/forum/viewtopic.php?f=4&t=53051\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=417002\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8424, "cpu_time_ms": 101, "memory_kb": 9312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s905972636", "group_id": "codeNet:p03941", "input_text": "http://www.terqp.com/bbs_cnool_net/login.aspx?referer=https://onlinecasino.us.org  http://www.telesiscde.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://1550254.r.bat.bing.com/?ld=d3asSzdhyqnFdB3Fqg1YCjtzVUCUyuilIY8vGm2DyglfedHFzI72mOIFxjA5fw50n1LORltxIZug2ymxP2EKl3-9IkmM_lITv-Wcmb9KX_wS3X7DsPBvlG2Mi-I-tW6BLBsFOZopyzioSlk4VBsy-w1MWF8fWltvtiW5HA69qy8tiw2_0r&u=https://onlinecasino.us.org   http://telusmobilityblows.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.adventuresoutdoors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stagefoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://antmancostumes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://unionbancaireprivee.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://grounding-lightning.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://nextregistrationrights.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://shoppermarketingsummit.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stephennosal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mearsashbygroup.org.uk/goto-link.php?link_id=36&url=https://onlinecasino.us.org  http://www.hizliizlefilm.net/r/728.html?reklam=1457827200&referer=https://onlinecasino.us.org   http://wefixbikes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mopon.ru/out.php?link=https://onlinecasino.us.org  http://powerboatgear.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bondgo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://0nm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ghobashinvestments.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tarbellrealtorsonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.selectivemutismfoundation.org/guestbook/go.php?url=https://onlinecasino.us.org  http://www.realcanadiansuperstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://forplaymarket.com/go.php??s=https://onlinecasino.us.org  http://myykkbrz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://greatestits.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yourfinaldirective.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://pynnfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fujiki-naohito.com/redirect.php?goto=onlinecasino.us.org   http://oleis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.creativepastimes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://da.urbanrail.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://digitizationarchitects.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jackdraymond.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fattysexvids.com/cgi-bin/atx/out.cgi?id=28&trade=https://onlinecasino.us.org   http://www.cotedor-tourisme.com/objets/redirect.php?url=https://onlinecasino.us.org \nhttp://fiestamaids.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mrbanner.3dn.ru/go?https://onlinecasino.us.org   http://www.fatretirement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://voicecommerce.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://depuoz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://workoutforhope.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://se.tom.ru/engine/redirect.php?url=https://onlinecasino.us.org  http://mollybrownsummerhouse.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dujiao.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://panerapantry.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.apple-gallery.net/gallery/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasino.us.org   https://webmail.math.unifi.it/horde-webmail-1.0/services/go.php?url=https://onlinecasino.us.org   http://www.mustseetoday.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://northwestchicagorealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://youramazingpictures.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bustydaily.com/cgi-bin/atx/out.cgi?id=66&trade=https://onlinecasino.us.org  http://www.erodocdb.dk/doks/filedownload.aspx?fileid=3740&fileurl=https://onlinecasino.us.org   http://thespringshealthcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.bg-auto.com/go.php??s=https://onlinecasino.us.org  http://slchospital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://musikon.se/exit.php?url=https://onlinecasino.us.org   https://www.undergroundnews.com/link.php?system=redirect&url=https://onlinecasino.us.org  http://eastmarkawesomefest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://olginfo.info/redirect.php?tid=2261&goto=onlinecasino.us.org  http://ndhockey.com/Goto.asp?url=https://onlinecasino.us.org  http://www.fresherswalkins.in/Home/Redirect?url=https://onlinecasino.us.org   https://www.diagraph.com/LinkClick.aspx?link=https://onlinecasino.us.org \nhttp://ilovemills.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://quiznosux.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.antiquar.pro/go.php?go=https://onlinecasino.us.org   http://jdmcapitaldesigns.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://soccertryouts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://itstaxservice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://breakingideas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aybsa.com/Goto.asp?url=https://onlinecasino.us.org   http://ladyboy8.com/cgi-bin/a2/out.cgi?id=24&u=https://onlinecasino.us.org \nhttp://www.champtruck.us.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://namastetv.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.australiatodaymag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://glhecsux.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://unspunsports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.cui.edu/LinkClick.aspx?link=https://onlinecasino.us.org  http://autopartescalifornia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://carysma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wildenpartskit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://idsunsystem.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ostrichplace.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sencor.us.xx3.kz/go.php?url=https://onlinecasino.us.org   http://www.weiberecke.de/wbb2/thread.php?goto=onlinecasino.us.org  http://contemporaryclothes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://choosehim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.taodaxiang.cn/p.php?go=https://onlinecasino.us.org  https://www.fnol.cz/redirect.asp?link=https://onlinecasino.us.org   http://quepasacuba.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://jerry-coleby-williams.net/2018/04/26/market-gardening-vietnam/\nhttp://gwforum.com.br/viewtopic.php?f=18&t=271694\nhttps://truthinreality.com/2015/09/15/prayer-for-breaking-the-powers-of-witchcraft/\nhttp://niklever.com/spritoon/forum/viewtopic.php?f=5&t=317936\nhttps://www.dangeroussports.com/forum/viewtopic.php?pid=473945#p473945\n", "language": "Lisp", "metadata": {"date": 1551678243, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s905972636.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s905972636", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.terqp.com/bbs_cnool_net/login.aspx?referer=https://onlinecasino.us.org  http://www.telesiscde.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://1550254.r.bat.bing.com/?ld=d3asSzdhyqnFdB3Fqg1YCjtzVUCUyuilIY8vGm2DyglfedHFzI72mOIFxjA5fw50n1LORltxIZug2ymxP2EKl3-9IkmM_lITv-Wcmb9KX_wS3X7DsPBvlG2Mi-I-tW6BLBsFOZopyzioSlk4VBsy-w1MWF8fWltvtiW5HA69qy8tiw2_0r&u=https://onlinecasino.us.org   http://telusmobilityblows.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.adventuresoutdoors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stagefoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://antmancostumes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://unionbancaireprivee.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://grounding-lightning.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://nextregistrationrights.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://shoppermarketingsummit.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stephennosal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mearsashbygroup.org.uk/goto-link.php?link_id=36&url=https://onlinecasino.us.org  http://www.hizliizlefilm.net/r/728.html?reklam=1457827200&referer=https://onlinecasino.us.org   http://wefixbikes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mopon.ru/out.php?link=https://onlinecasino.us.org  http://powerboatgear.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bondgo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://0nm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ghobashinvestments.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tarbellrealtorsonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.selectivemutismfoundation.org/guestbook/go.php?url=https://onlinecasino.us.org  http://www.realcanadiansuperstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://forplaymarket.com/go.php??s=https://onlinecasino.us.org  http://myykkbrz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://greatestits.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yourfinaldirective.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://pynnfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fujiki-naohito.com/redirect.php?goto=onlinecasino.us.org   http://oleis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.creativepastimes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://da.urbanrail.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://digitizationarchitects.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jackdraymond.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fattysexvids.com/cgi-bin/atx/out.cgi?id=28&trade=https://onlinecasino.us.org   http://www.cotedor-tourisme.com/objets/redirect.php?url=https://onlinecasino.us.org \nhttp://fiestamaids.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mrbanner.3dn.ru/go?https://onlinecasino.us.org   http://www.fatretirement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://voicecommerce.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://depuoz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://workoutforhope.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://se.tom.ru/engine/redirect.php?url=https://onlinecasino.us.org  http://mollybrownsummerhouse.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dujiao.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://panerapantry.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.apple-gallery.net/gallery/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasino.us.org   https://webmail.math.unifi.it/horde-webmail-1.0/services/go.php?url=https://onlinecasino.us.org   http://www.mustseetoday.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://northwestchicagorealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://youramazingpictures.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bustydaily.com/cgi-bin/atx/out.cgi?id=66&trade=https://onlinecasino.us.org  http://www.erodocdb.dk/doks/filedownload.aspx?fileid=3740&fileurl=https://onlinecasino.us.org   http://thespringshealthcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.bg-auto.com/go.php??s=https://onlinecasino.us.org  http://slchospital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://musikon.se/exit.php?url=https://onlinecasino.us.org   https://www.undergroundnews.com/link.php?system=redirect&url=https://onlinecasino.us.org  http://eastmarkawesomefest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://olginfo.info/redirect.php?tid=2261&goto=onlinecasino.us.org  http://ndhockey.com/Goto.asp?url=https://onlinecasino.us.org  http://www.fresherswalkins.in/Home/Redirect?url=https://onlinecasino.us.org   https://www.diagraph.com/LinkClick.aspx?link=https://onlinecasino.us.org \nhttp://ilovemills.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://quiznosux.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.antiquar.pro/go.php?go=https://onlinecasino.us.org   http://jdmcapitaldesigns.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://soccertryouts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://itstaxservice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://breakingideas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aybsa.com/Goto.asp?url=https://onlinecasino.us.org   http://ladyboy8.com/cgi-bin/a2/out.cgi?id=24&u=https://onlinecasino.us.org \nhttp://www.champtruck.us.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://namastetv.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.australiatodaymag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://glhecsux.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://unspunsports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.cui.edu/LinkClick.aspx?link=https://onlinecasino.us.org  http://autopartescalifornia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://carysma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wildenpartskit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://idsunsystem.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ostrichplace.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sencor.us.xx3.kz/go.php?url=https://onlinecasino.us.org   http://www.weiberecke.de/wbb2/thread.php?goto=onlinecasino.us.org  http://contemporaryclothes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://choosehim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.taodaxiang.cn/p.php?go=https://onlinecasino.us.org  https://www.fnol.cz/redirect.asp?link=https://onlinecasino.us.org   http://quepasacuba.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://jerry-coleby-williams.net/2018/04/26/market-gardening-vietnam/\nhttp://gwforum.com.br/viewtopic.php?f=18&t=271694\nhttps://truthinreality.com/2015/09/15/prayer-for-breaking-the-powers-of-witchcraft/\nhttp://niklever.com/spritoon/forum/viewtopic.php?f=5&t=317936\nhttps://www.dangeroussports.com/forum/viewtopic.php?pid=473945#p473945\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7780, "cpu_time_ms": 91, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s438369008", "group_id": "codeNet:p03941", "input_text": "http://www.12345678910.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ecoclothingcare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://oldtrailschool.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.fishersci.co.uk/webfiles/uk/web-docs/redirect.php?url=https://onlinecasino.us.org  http://www.davenportsharbour.nz/LinkClick.aspx?link=https://onlinecasino.us.org   http://forum.guns.ua/go.php?https://onlinecasino.us.org/  http://stv-boutique.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.stchadladybarn.org.uk/goto-link.php?link_id=7&url=https://onlinecasino.us.org   http://toawiki.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.my511wv.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://estrelladelmar.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gvh.ikeaegypt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://exlien.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://findafilipina.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gxo.stopcomputerizedvoting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://budapest-hu.ru/goto/https://onlinecasino.us.org  http://fonbettoto.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://format.cn.ua/go?https://onlinecasino.us.org \nhttp://islandhunde-vinkona.de/index.php?option=com_easybookreloaded&lang=en&goto=onlinecasino.us.org  http://charlesnelsonsdistillery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crossroadscommunityministries.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://agbina.agbina-grass.ru/bitrix/rk.php?id=19&event1=banner&event2=click&event3=1+%2F+%5B19%5D+%5Bspec%5D+%D0%91%D0%B5%D0%B3%D0%BE%D0%BD%D0%B8%D1%8F+%D0%BA%D0%BB%D1%83%D0%B1%D0%BD%D0%B5%D0%B2%D0%B0%D1%8F&goto=onlinecasino.us.org  http://wholesale-shop.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://palladiumsilver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://premiertitleinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eke.consbrasmontreal.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.maritimeattorneyseattle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://yoursurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.turnkeysports.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nuevacare.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ticket.www.wp.pl/smgreticket?backUrl=https://onlinecasino.us.org/&test=1&cookie=5680205832473409Jb6THxwwhU5HGiDtNB7myFLNqSOJ3WUPoZDVcFNhulIxCEqoDjauX/By00VSN3+fOaZs+YBs9IR3EjFIEVMoWbw7SMbXxRfjey9i2J9e8RA=  http://gatorztactical.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bq--3cdy2zqmknyfeny.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://coloradorealtors.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.autopartsobsolete.com/cart.php?m=modify&sidebarDetailed=Y&prevCmd=search_results&go=https://onlinecasino.us.org   http://benjaminchambers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://floridachain.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.buzzairlines.net/__media__/js/netsoltrademark.php?d=&onlinecasino.us.org   http://tructiep.vn/Redirect.aspx?UrlTo=https://onlinecasino.us.org   http://ciuchcia.adultdvdempire.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.eliseparts.com/settings/vat/?euVat=0&url=https://onlinecasino.us.org   http://www.milanwoods.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://carmats.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zuanji360.com/redirect.php?url=https://onlinecasino.us.org   http://chuseng.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ai-khandi.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thinkposters.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://saveonyourtaxes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://doggeetalkee.ch/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ggzvs.nl/LinkClick.aspx?link=https://onlinecasino.us.org   http://visionenviroprogressive.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jp.kahsa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.islandlaserskincare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://homeinternetproducts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://afftonaa.com/Goto.asp?url=https://onlinecasino.us.org  http://theultimatefighterjapan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://thegotomum.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://americandreamerstudio.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bambergerpolymers.be/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cyanotech.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.huntermountain.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cafe1919.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.gainesvillesun.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://soultravel.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://neacenet.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://web.bambooin.gr.jp/rank/rank.cgi?mode=link&id=3975&url=https://onlinecasino.us.org/   https://www.electrobuzz.net/goto/https://onlinecasino.us.org  http://apryze.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crainsboro.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://out.ucoz.org/go?https://onlinecasino.us.org  http://www.usemybenefits.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://teengeneration.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://nautilusfitnesscanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://womanstux.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://desigreenville.oafdom.com/cgi-bin/at3/out.cgi?id=194&tag=toplist&trade=/onlinecasino.us.org   http://threedollarbill.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thejudgmentbank.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://onlinepiperepair.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://brknwprop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fineartteens.com/cgi-bin/atx/out.cgi?id=110&tag=toplist&trade=https://onlinecasino.us.org   http://www.eventbox.de/redirect.php?link_main=6&data=308&url=https://onlinecasino.us.org \nhttp://annaangenend.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://esri-japan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dom-press.com/go.php?url=https://onlinecasino.us.org   http://www.iator.gr/redirect.php?url=https://onlinecasino.us.org  http://www.allnewriga.ru/go/url=https://onlinecasino.us.org   http://www.ppsdmkebtke.esdm.go.id/component/vitabook/?goto=onlinecasino.us.org  http://eptactv.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://checkwind.com/html/Redirect.aspx?id=27&tipo=L&idRegion=0&idAnemometro=12&url=https://onlinecasino.us.org   http://a.bookdepository.com/scripts/click.php?a_aid=WaitingForWentworth&desturl=https://onlinecasino.us.org \n \n \n \n \n \nhttp://www.popolsku.fr.pl/forum/index.php?topic=140628.new#new\nhttp://smulti.org/forum/showthread.php?tid=316610\nhttp://rupkotha.tk/viewtopic.php?f=2&t=18801\nhttp://certare.pl/forum/viewtopic.php?f=36&t=243118&p=820261#p820261\nhttp://ultimatemuskyguide.com/forum/index.php?topic=294777.new#new\n", "language": "Lisp", "metadata": {"date": 1551666103, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s438369008.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s438369008", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.12345678910.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ecoclothingcare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://oldtrailschool.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.fishersci.co.uk/webfiles/uk/web-docs/redirect.php?url=https://onlinecasino.us.org  http://www.davenportsharbour.nz/LinkClick.aspx?link=https://onlinecasino.us.org   http://forum.guns.ua/go.php?https://onlinecasino.us.org/  http://stv-boutique.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.stchadladybarn.org.uk/goto-link.php?link_id=7&url=https://onlinecasino.us.org   http://toawiki.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.my511wv.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://estrelladelmar.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gvh.ikeaegypt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://exlien.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://findafilipina.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gxo.stopcomputerizedvoting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://budapest-hu.ru/goto/https://onlinecasino.us.org  http://fonbettoto.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://format.cn.ua/go?https://onlinecasino.us.org \nhttp://islandhunde-vinkona.de/index.php?option=com_easybookreloaded&lang=en&goto=onlinecasino.us.org  http://charlesnelsonsdistillery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crossroadscommunityministries.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://agbina.agbina-grass.ru/bitrix/rk.php?id=19&event1=banner&event2=click&event3=1+%2F+%5B19%5D+%5Bspec%5D+%D0%91%D0%B5%D0%B3%D0%BE%D0%BD%D0%B8%D1%8F+%D0%BA%D0%BB%D1%83%D0%B1%D0%BD%D0%B5%D0%B2%D0%B0%D1%8F&goto=onlinecasino.us.org  http://wholesale-shop.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://palladiumsilver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://premiertitleinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eke.consbrasmontreal.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.maritimeattorneyseattle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://yoursurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.turnkeysports.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nuevacare.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ticket.www.wp.pl/smgreticket?backUrl=https://onlinecasino.us.org/&test=1&cookie=5680205832473409Jb6THxwwhU5HGiDtNB7myFLNqSOJ3WUPoZDVcFNhulIxCEqoDjauX/By00VSN3+fOaZs+YBs9IR3EjFIEVMoWbw7SMbXxRfjey9i2J9e8RA=  http://gatorztactical.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bq--3cdy2zqmknyfeny.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://coloradorealtors.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.autopartsobsolete.com/cart.php?m=modify&sidebarDetailed=Y&prevCmd=search_results&go=https://onlinecasino.us.org   http://benjaminchambers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://floridachain.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.buzzairlines.net/__media__/js/netsoltrademark.php?d=&onlinecasino.us.org   http://tructiep.vn/Redirect.aspx?UrlTo=https://onlinecasino.us.org   http://ciuchcia.adultdvdempire.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.eliseparts.com/settings/vat/?euVat=0&url=https://onlinecasino.us.org   http://www.milanwoods.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://carmats.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zuanji360.com/redirect.php?url=https://onlinecasino.us.org   http://chuseng.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ai-khandi.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thinkposters.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://saveonyourtaxes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://doggeetalkee.ch/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ggzvs.nl/LinkClick.aspx?link=https://onlinecasino.us.org   http://visionenviroprogressive.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jp.kahsa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.islandlaserskincare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://homeinternetproducts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://afftonaa.com/Goto.asp?url=https://onlinecasino.us.org  http://theultimatefighterjapan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://thegotomum.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://americandreamerstudio.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bambergerpolymers.be/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cyanotech.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.huntermountain.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cafe1919.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.gainesvillesun.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://soultravel.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://neacenet.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://web.bambooin.gr.jp/rank/rank.cgi?mode=link&id=3975&url=https://onlinecasino.us.org/   https://www.electrobuzz.net/goto/https://onlinecasino.us.org  http://apryze.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crainsboro.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://out.ucoz.org/go?https://onlinecasino.us.org  http://www.usemybenefits.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://teengeneration.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://nautilusfitnesscanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://womanstux.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://desigreenville.oafdom.com/cgi-bin/at3/out.cgi?id=194&tag=toplist&trade=/onlinecasino.us.org   http://threedollarbill.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thejudgmentbank.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://onlinepiperepair.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://brknwprop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fineartteens.com/cgi-bin/atx/out.cgi?id=110&tag=toplist&trade=https://onlinecasino.us.org   http://www.eventbox.de/redirect.php?link_main=6&data=308&url=https://onlinecasino.us.org \nhttp://annaangenend.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://esri-japan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dom-press.com/go.php?url=https://onlinecasino.us.org   http://www.iator.gr/redirect.php?url=https://onlinecasino.us.org  http://www.allnewriga.ru/go/url=https://onlinecasino.us.org   http://www.ppsdmkebtke.esdm.go.id/component/vitabook/?goto=onlinecasino.us.org  http://eptactv.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://checkwind.com/html/Redirect.aspx?id=27&tipo=L&idRegion=0&idAnemometro=12&url=https://onlinecasino.us.org   http://a.bookdepository.com/scripts/click.php?a_aid=WaitingForWentworth&desturl=https://onlinecasino.us.org \n \n \n \n \n \nhttp://www.popolsku.fr.pl/forum/index.php?topic=140628.new#new\nhttp://smulti.org/forum/showthread.php?tid=316610\nhttp://rupkotha.tk/viewtopic.php?f=2&t=18801\nhttp://certare.pl/forum/viewtopic.php?f=36&t=243118&p=820261#p820261\nhttp://ultimatemuskyguide.com/forum/index.php?topic=294777.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7986, "cpu_time_ms": 89, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s987519517", "group_id": "codeNet:p03941", "input_text": "http://www.sgdaohang.com/url.php?url=https://onlinecasino.us.org  http://singularbackup.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://youcantmakethissh-tup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://motomochila.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://voicevalues.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pakforum.mobi/go.php?ext_url=https://onlinecasino.us.org  http://www.dokshicy.info/redir.php?https://onlinecasino.us.org  http://pogrzeby-bielsko.firmeo.biz/redir.php?target=onlinecasino.us.org   http://pegasusseyahat.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://electronicserviceofprocess.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://56.rjob.ru/bitrix/rk.php?id=1899&site_id=s1&event1=banner&event2=click&event3=3+/+<>899]+<vac>search]+Лавка-Лавка&goto=https://onlinecasino.us.org   https://www.rockstar98.com/out/onlinecasino.us.org   http://bbs.lritat.com/redirect.php?fid=56&tid=11710&goto=onlinecasino.us.org  http://www.greenworker.coop/r?u=https://onlinecasino.us.org   http://bosspedals.com.ua/goto.php?onlinecasino.us.org  http://2913490.r.msn.com/?ld=DvsziGTvAGrbF2rjh0PogFuzVUCUxAJrqy4o5ekqC5ahE3aPd-e_eFsHlEGEzkehvEL1aqdhrE1Jg_dEUHYSM65kFUrrqxDiYEgHzJlpFZwhlHBn7LedanxWeRPGe_B9KVVTAtRj0bIw6hcz3fuQ8uTKiGxEM&u=https://onlinecasino.us.org  http://tomjonesenterprises.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tonkinsuperstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://pnaz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bitcoin-faucet.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jeanbarrylifecoach.maioid.com/cgi-bin/atc/out.cgi?s=60&u=/onlinecasino.us.org   https://www.shifenyangguang.top/odflv/index.php?url=https://onlinecasino.us.org  http://tardukai.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.pbem.fr/feed2js/feed2js.php?src=https://onlinecasino.us.org  http://pcie104.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.gccfcats.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://top.062.ru/out.php?www=https://onlinecasino.us.org \nhttp://38.103.161.168/bbs/redirect.php?fid=231&tid=3101370&goto=onlinecasino.us.org  http://glutenfree-foodies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://oktaholdings.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lhempire.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://www.ixianzong.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://freevirtualrealityporn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.live-like-a-german.com/redirect.php?redirect=https://onlinecasino.us.org  http://photographyconnects.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.kwaliteitsimpulsgroenalliantie.nl/shortcuts/sendlinkmessage.aspx?url=https://onlinecasino.us.org \nhttps://login.questrade.com/Signin.aspx?Returnurl=https://onlinecasino.us.org  http://triggerjewels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.atlantagladiators.com/tracker/index.html?t=sponsor&sponsor_id=48&url=https://onlinecasino.us.org   http://giftplant.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fiplanpartners.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://o2o.qjwykj.cn/index.php?c=Login&a=index&referer=https://onlinecasino.us.org  http://sorn.eagle-engineering.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rate-raznoe.dirx.ru/click.php?url=https://onlinecasino.us.org   http://comprarentuciudad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://realmexfoods.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.algalfuel.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://protective.pcb-manufacturing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://mbs.mbssecurities.com/Footer/OrderRouting.aspx?goto=https://onlinecasino.us.org  https://www.atterburymuscatatuck.in.ng.mil/LinkClick.aspx?link=https://onlinecasino.us.org   https://www.bertrand-sport-avocat.com/es/droitdusport/index.php?url=https://onlinecasino.us.org  http://51jifenbao.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trucksellers.com/inventory/specsheet/emailfriend.aspx?subject=2008%20Mitsubishi%20FG&url=https://onlinecasino.us.org   http://u-network.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://robertwelchsociety.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.dialanddudleyfuneralhome.com/cfi/addthis_email.cfm?url=https://onlinecasino.us.org   http://romaguesthouses.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://investc360.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://geo.navigator.az/redirect.php?url=https://onlinecasino.us.org   http://anykidcancook.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://choosethespirit.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dremel-online.ru.xx3.kz/go.php?url=https://onlinecasino.us.org   http://harcourthighschool.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://willowlanecondos.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vankidok.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://leafguardindianapolis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://leecanalitoboxing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://missuniversegermany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qualityenglish.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tomaswhitacre.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://copsforyouth.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://navoigaz.uz/engine/go.php?url=onlinecasino.us.org \nhttp://www.staging.spaweek.com/redirect.php?spa_id=32132&programid=0&url=https://onlinecasino.us.org  http://hypnosis.tc/__media__/js/trademark.php?d=onlinecasino.us.org   http://dcdcnetwork.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://client.vandaily.com/server/adclick.php?bannerid=210&zoneid=43&source=&dest=https://onlinecasino.us.org  http://centraltransportllc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://w.ochziffcapital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dejdis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://veteranstradingcompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://op.ci/go/?url=https://onlinecasino.us.org \nhttps://ceriwis.net/forum/out.php?link=https://onlinecasino.us.org  http://teenemployment.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dishupgrade.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://breezeszanzibar.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://justspain.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.stallionsplus.com/external-link.php?link=https://onlinecasino.us.org  http://bhhct.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://localsearch.stargazette.com/sp?cId=0&wId=82505&rNum=1&url=https://onlinecasino.us.org/   http://companionsandhomehelpers.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.leopoldsdorf-wien.info/phpbb/viewtopic.php?f=2&t=487855\nhttps://traitimbenho.com/threads/2780216-occ-blackboard.html?p=38667630#post38667630\nhttp://mamnontrithuc.edu.vn/forum/showthread.php?43750-add-comment-sale-erectalis&p=191976&posted=1#post191976\nhttp://forum.sonturkrpg.org/showthread.php?tid=88584&pid=141157#pid141157\nhttp://cmamdp.fr/forumM/index.php?topic=11967.new#new\n", "language": "Lisp", "metadata": {"date": 1551660161, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s987519517.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s987519517", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.sgdaohang.com/url.php?url=https://onlinecasino.us.org  http://singularbackup.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://youcantmakethissh-tup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://motomochila.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://voicevalues.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pakforum.mobi/go.php?ext_url=https://onlinecasino.us.org  http://www.dokshicy.info/redir.php?https://onlinecasino.us.org  http://pogrzeby-bielsko.firmeo.biz/redir.php?target=onlinecasino.us.org   http://pegasusseyahat.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://electronicserviceofprocess.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://56.rjob.ru/bitrix/rk.php?id=1899&site_id=s1&event1=banner&event2=click&event3=3+/+<>899]+<vac>search]+Лавка-Лавка&goto=https://onlinecasino.us.org   https://www.rockstar98.com/out/onlinecasino.us.org   http://bbs.lritat.com/redirect.php?fid=56&tid=11710&goto=onlinecasino.us.org  http://www.greenworker.coop/r?u=https://onlinecasino.us.org   http://bosspedals.com.ua/goto.php?onlinecasino.us.org  http://2913490.r.msn.com/?ld=DvsziGTvAGrbF2rjh0PogFuzVUCUxAJrqy4o5ekqC5ahE3aPd-e_eFsHlEGEzkehvEL1aqdhrE1Jg_dEUHYSM65kFUrrqxDiYEgHzJlpFZwhlHBn7LedanxWeRPGe_B9KVVTAtRj0bIw6hcz3fuQ8uTKiGxEM&u=https://onlinecasino.us.org  http://tomjonesenterprises.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tonkinsuperstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://pnaz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bitcoin-faucet.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jeanbarrylifecoach.maioid.com/cgi-bin/atc/out.cgi?s=60&u=/onlinecasino.us.org   https://www.shifenyangguang.top/odflv/index.php?url=https://onlinecasino.us.org  http://tardukai.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.pbem.fr/feed2js/feed2js.php?src=https://onlinecasino.us.org  http://pcie104.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.gccfcats.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://top.062.ru/out.php?www=https://onlinecasino.us.org \nhttp://38.103.161.168/bbs/redirect.php?fid=231&tid=3101370&goto=onlinecasino.us.org  http://glutenfree-foodies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://oktaholdings.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lhempire.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://www.ixianzong.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://freevirtualrealityporn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.live-like-a-german.com/redirect.php?redirect=https://onlinecasino.us.org  http://photographyconnects.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.kwaliteitsimpulsgroenalliantie.nl/shortcuts/sendlinkmessage.aspx?url=https://onlinecasino.us.org \nhttps://login.questrade.com/Signin.aspx?Returnurl=https://onlinecasino.us.org  http://triggerjewels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.atlantagladiators.com/tracker/index.html?t=sponsor&sponsor_id=48&url=https://onlinecasino.us.org   http://giftplant.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fiplanpartners.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://o2o.qjwykj.cn/index.php?c=Login&a=index&referer=https://onlinecasino.us.org  http://sorn.eagle-engineering.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rate-raznoe.dirx.ru/click.php?url=https://onlinecasino.us.org   http://comprarentuciudad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://realmexfoods.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.algalfuel.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://protective.pcb-manufacturing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://mbs.mbssecurities.com/Footer/OrderRouting.aspx?goto=https://onlinecasino.us.org  https://www.atterburymuscatatuck.in.ng.mil/LinkClick.aspx?link=https://onlinecasino.us.org   https://www.bertrand-sport-avocat.com/es/droitdusport/index.php?url=https://onlinecasino.us.org  http://51jifenbao.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trucksellers.com/inventory/specsheet/emailfriend.aspx?subject=2008%20Mitsubishi%20FG&url=https://onlinecasino.us.org   http://u-network.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://robertwelchsociety.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.dialanddudleyfuneralhome.com/cfi/addthis_email.cfm?url=https://onlinecasino.us.org   http://romaguesthouses.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://investc360.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://geo.navigator.az/redirect.php?url=https://onlinecasino.us.org   http://anykidcancook.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://choosethespirit.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dremel-online.ru.xx3.kz/go.php?url=https://onlinecasino.us.org   http://harcourthighschool.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://willowlanecondos.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vankidok.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://leafguardindianapolis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://leecanalitoboxing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://missuniversegermany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qualityenglish.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tomaswhitacre.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://copsforyouth.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://navoigaz.uz/engine/go.php?url=onlinecasino.us.org \nhttp://www.staging.spaweek.com/redirect.php?spa_id=32132&programid=0&url=https://onlinecasino.us.org  http://hypnosis.tc/__media__/js/trademark.php?d=onlinecasino.us.org   http://dcdcnetwork.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://client.vandaily.com/server/adclick.php?bannerid=210&zoneid=43&source=&dest=https://onlinecasino.us.org  http://centraltransportllc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://w.ochziffcapital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dejdis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://veteranstradingcompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://op.ci/go/?url=https://onlinecasino.us.org \nhttps://ceriwis.net/forum/out.php?link=https://onlinecasino.us.org  http://teenemployment.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dishupgrade.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://breezeszanzibar.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://justspain.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.stallionsplus.com/external-link.php?link=https://onlinecasino.us.org  http://bhhct.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://localsearch.stargazette.com/sp?cId=0&wId=82505&rNum=1&url=https://onlinecasino.us.org/   http://companionsandhomehelpers.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.leopoldsdorf-wien.info/phpbb/viewtopic.php?f=2&t=487855\nhttps://traitimbenho.com/threads/2780216-occ-blackboard.html?p=38667630#post38667630\nhttp://mamnontrithuc.edu.vn/forum/showthread.php?43750-add-comment-sale-erectalis&p=191976&posted=1#post191976\nhttp://forum.sonturkrpg.org/showthread.php?tid=88584&pid=141157#pid141157\nhttp://cmamdp.fr/forumM/index.php?topic=11967.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8000, "cpu_time_ms": 103, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s224670049", "group_id": "codeNet:p03941", "input_text": "http://uushenghuo.com/member/login/?referer=https://onlinecasino.us.org  http://www.mechanictakestan.blogsky.com/dailylink/?go=https://onlinecasino.us.org   http://dir.dir.bg/url.php?url=https://onlinecasino.us.org   http://chinausa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hberger.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tubebigcock.com/movies/go.php?id=717799_1&url=https://onlinecasino.us.org  http://jeffreywald.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thefashioncourt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://weberstl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://listserv.vbschools.com:81/default.aspx??s=https://onlinecasino.us.org  http://tasiast.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kennygames.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.avian-pneumovirus.com/redir.asp?from=EN&to=onlinecasino.us.org  http://www.i64trucks.com/forms/specsheet/emailfriend.aspx?subject=2003%20Freightliner%20Classic%20XL&url=https://onlinecasino.us.org   http://companyfloatations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yasinchn.info/wp-content/themes/begin5.2/inc/go.php?url=https://onlinecasino.us.org  http://wjohnmartin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://socialmediahotspot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://thevirtualshaman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://theovations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nin.greywolflabs.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://paramount-designs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://justinhughes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://toughbreed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://laser-esthetique-medical.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://advocatefornmo.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://confessionsofafuckup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://smokersdating.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://debtshed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://icraveboats.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mgmkitchenandbath.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rotana-europe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://anywgo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trumerusa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lexingtoncreditspecialists.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://healthextrasmail.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mycrain.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://peraceticacidsuppliers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://continuityengineer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.cfabatiment-saintes.fr/sitebar/go.php?id=86&url=https://onlinecasino.us.org  http://back2better.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://freewaterreports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thebraunds.com/photos/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasino.us.org  http://theyorkville-enquirer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gode-sexemachine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bq--3bmwotu6.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trustedplatform.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://spherousmarketing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://usattends.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yaroslavl.po-aptekam.ru/rk.php?url=https://onlinecasino.us.org   http://xnxx.com.coo123.net/goto.php?c=&n=standard&url=https://onlinecasino.us.org  http://www.dqt.com.cn/go.php?url=https://onlinecasino.us.org  http://thecurseisgone.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hdbincorporated.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://phero.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://the-3rd.net/s//redirect.php?eid=731243&url=https://onlinecasino.us.org   http://spindleelectronics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nyexaminer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://poderesnaturales.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bboybattles.org/Redirect.aspx?url=https://onlinecasino.us.org  http://zeroordie.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wissehrrecycling.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.nealcrosbie.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://asoboo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://symetrixgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.alytausnaujienos.lt/ads/adclick.php?bannerid=17&zoneid=0&source=&dest=https://onlinecasino.us.org   http://www.beautysampler.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://familieswithamission.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.almax-kia.ru/bitrix/rk.php?id=691&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B691%5D+%5BNEW_INDEX_BANNERS%5D+Trade-in+football&goto=onlinecasino.us.org  http://avaccineforviolence.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.weddinglodge.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://k2global.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://theflipsideoflife.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yxx.cz/?redirect=onlinecasino.us.org   http://images.google.com.sg/url?q=https://onlinecasino.us.org   http://custompamphlets.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://offthestreetresearch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mandjpaquette.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://imgapi.huaihai.tv/adv/click.php?a=doclick&url=https://onlinecasino.us.org  http://xn----7sbmrhakusml6j.xn--p1ai/engine/go.php?url=onlinecasino.us.org   http://beargrassyoga.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://gjj.mathtexts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://missiondental.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.indianapca.org/link.asp?e=@@email@@&job=1922831&ymlink=3730642&finalurl=https://onlinecasino.us.org/   http://bartolus.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://infraweb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tollfreeatm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://compbiol.ru/go/?https://onlinecasino.us.org  http://www.ksc-suppurbia.de/content/viewlinks/index.php?url=https://onlinecasino.us.org   http://paintstandards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.rmlalliance.com/forum/index.php?topic=167573.new#new\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttp://forum.onlinefootballmanager.ru/threads/9003-Hot-new-pictures-each-day?p=234653&posted=1#post234653\nhttp://yallalive.live/vb/showthread.php?p=376459#post376459\nhttp://ishq-m.com/s/saeed/showthread.php?p=39935#post39935\n", "language": "Lisp", "metadata": {"date": 1551648627, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s224670049.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s224670049", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://uushenghuo.com/member/login/?referer=https://onlinecasino.us.org  http://www.mechanictakestan.blogsky.com/dailylink/?go=https://onlinecasino.us.org   http://dir.dir.bg/url.php?url=https://onlinecasino.us.org   http://chinausa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hberger.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tubebigcock.com/movies/go.php?id=717799_1&url=https://onlinecasino.us.org  http://jeffreywald.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thefashioncourt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://weberstl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://listserv.vbschools.com:81/default.aspx??s=https://onlinecasino.us.org  http://tasiast.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kennygames.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.avian-pneumovirus.com/redir.asp?from=EN&to=onlinecasino.us.org  http://www.i64trucks.com/forms/specsheet/emailfriend.aspx?subject=2003%20Freightliner%20Classic%20XL&url=https://onlinecasino.us.org   http://companyfloatations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yasinchn.info/wp-content/themes/begin5.2/inc/go.php?url=https://onlinecasino.us.org  http://wjohnmartin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://socialmediahotspot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://thevirtualshaman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://theovations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nin.greywolflabs.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://paramount-designs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://justinhughes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://toughbreed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://laser-esthetique-medical.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://advocatefornmo.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://confessionsofafuckup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://smokersdating.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://debtshed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://icraveboats.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mgmkitchenandbath.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rotana-europe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://anywgo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trumerusa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lexingtoncreditspecialists.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://healthextrasmail.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mycrain.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://peraceticacidsuppliers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://continuityengineer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.cfabatiment-saintes.fr/sitebar/go.php?id=86&url=https://onlinecasino.us.org  http://back2better.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://freewaterreports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thebraunds.com/photos/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasino.us.org  http://theyorkville-enquirer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gode-sexemachine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bq--3bmwotu6.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trustedplatform.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://spherousmarketing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://usattends.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yaroslavl.po-aptekam.ru/rk.php?url=https://onlinecasino.us.org   http://xnxx.com.coo123.net/goto.php?c=&n=standard&url=https://onlinecasino.us.org  http://www.dqt.com.cn/go.php?url=https://onlinecasino.us.org  http://thecurseisgone.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hdbincorporated.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://phero.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://the-3rd.net/s//redirect.php?eid=731243&url=https://onlinecasino.us.org   http://spindleelectronics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nyexaminer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://poderesnaturales.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bboybattles.org/Redirect.aspx?url=https://onlinecasino.us.org  http://zeroordie.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wissehrrecycling.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.nealcrosbie.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://asoboo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://symetrixgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.alytausnaujienos.lt/ads/adclick.php?bannerid=17&zoneid=0&source=&dest=https://onlinecasino.us.org   http://www.beautysampler.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://familieswithamission.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.almax-kia.ru/bitrix/rk.php?id=691&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B691%5D+%5BNEW_INDEX_BANNERS%5D+Trade-in+football&goto=onlinecasino.us.org  http://avaccineforviolence.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.weddinglodge.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://k2global.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://theflipsideoflife.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yxx.cz/?redirect=onlinecasino.us.org   http://images.google.com.sg/url?q=https://onlinecasino.us.org   http://custompamphlets.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://offthestreetresearch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mandjpaquette.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://imgapi.huaihai.tv/adv/click.php?a=doclick&url=https://onlinecasino.us.org  http://xn----7sbmrhakusml6j.xn--p1ai/engine/go.php?url=onlinecasino.us.org   http://beargrassyoga.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://gjj.mathtexts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://missiondental.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.indianapca.org/link.asp?e=@@email@@&job=1922831&ymlink=3730642&finalurl=https://onlinecasino.us.org/   http://bartolus.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://infraweb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tollfreeatm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://compbiol.ru/go/?https://onlinecasino.us.org  http://www.ksc-suppurbia.de/content/viewlinks/index.php?url=https://onlinecasino.us.org   http://paintstandards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.rmlalliance.com/forum/index.php?topic=167573.new#new\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttp://forum.onlinefootballmanager.ru/threads/9003-Hot-new-pictures-each-day?p=234653&posted=1#post234653\nhttp://yallalive.live/vb/showthread.php?p=376459#post376459\nhttp://ishq-m.com/s/saeed/showthread.php?p=39935#post39935\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7869, "cpu_time_ms": 92, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s950732907", "group_id": "codeNet:p03941", "input_text": "http://ubasainthelena.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hollyandpasquale.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aestheticshop.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eventpromos.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://widespread.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.figure-skating-corner.de/php/goto.php?link=onlinecasino.us.org  http://www.gter.net/index.html?referer=https://onlinecasino.us.org  http://easyduvet.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://app.gaogulou.com/module/adsview/content/?action=click&area=A2&id=1867&url=https://onlinecasino.us.org \nhttp://class04.top/index.php?c=reg&&referer=https://onlinecasino.us.org  http://www.domaingames.com.br/Redirect.asp?ID_Banners=348&url=https://onlinecasino.us.org   http://lonevalkyrie.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ontario-fishing-lodges.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stem-cellbio-technologies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://drpaul.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://encampments.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://artsoflaos.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lvnorm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.job-ete.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wholeheartpottery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.undercovercamera.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eatreal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tempstent.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zqx.resurrectionmary.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://adslotgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://truesmokingpleasure.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lcbjapan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://peugeot301-club.com.ua/goto.php?https://onlinecasino.us.org  http://gotconsultants.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mypetworld.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chicago.pass.org/LinkClick.aspx?link=https://onlinecasino.us.org  http://maximum-kia.ru/bitrix/rk.php?id=666&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B666%5D+%5BNEW_INDEX_BANNERS%5D+%D1%CF+Kia+Finance&goto=onlinecasino.us.org   http://grammypammysweetery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://octavia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.adminv.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://sleepwellbeds.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://copperalliance.medml.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lookingforhome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dearestfutureself.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.igfederal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fives.com.tw/w3/webs/imglink_hits.php?id=6&url=https://onlinecasino.us.org   http://www.travianbabysitter.com/php/redirect.php?url=https://onlinecasino.us.org  http://nsuada.ru/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fnsuada.ru%2Fkafedry%2F1418%2F&event3=%D0%9A%D0%B0%D1%84%D0%B5%D0%B4%D1%80%D0%B0+%D0%BF%D1%80%D0%BE%D0%BC%D1%8B%D1%88%D0%BB%D0%B5%D0%BD%D0%BD%D0%BE%D0%B3%D0%BE+%D0%B4%D0%B8%D0%B7%D0%B0%D0%B9%D0%BD%D0%B0+%D0%B8+%D0%B8%D0%BD%D0%B4%D1%83%D1%81%D1%82%D1%80%D0%B8%D0%B8+%D0%BC%D0%BE%D0%B4%D1%8B+%28%D0%BA%D0%B0%D1%84%D0%B5%D0%B4%D1%80%D0%B0+%D0%9F%D0%94%D0%98%D0%9C%29+%26lt%3Bbr%26gt%3B-+%D0%BB%D0%B0%D0%B1%D0%BE%D1%80%D0%B0%D1%82%D0%BE%D1%80%D0%B8%D1%8F+%D0%BF%D1%80%D0%BE%D0%BC%D1%8B%D1%88%D0%BB%D0%B5%D0%BD%D0%BD%D0%BE%D0%B3%D0%BE+%D0%B4%D0%B8%D0%B7%D0%B0%D0%B9%D0%BD%D0%B0+%26lt%3Bbr%26gt%3B-+%D0%BB%D0%B0%D0%B1%D0%BE%D1%80%D0%B0%D1%82%D0%BE%D1%80%D0%B8%D1%8F+%D0%B4%D0%B8%D0%B7%D0%B0%D0%B9%D0%BD%D0%B0+%26lt%3Bbr%26gt%3B-+%D0%BC%D0%B0%D0%BA%D0%B5%D1%82%D0%BD%D0%B0%D1%8F+%D0%BC%D0%B0%D1%81%D1%82%D0%B5%D1%80%D1%81%D0%BA%D0%B0%D1%8F%26lt%3Bbr%26gt%3B-+%D1%88%D0%B2%D0%B5%D0%B9%D0%BD%D0%B0%D1%8F+%D0%BC%D0%B0%D1%81%D1%82%D0%B5%D1%80%D1%81%D0%BA%D0%B0%D1%8F&goto=https://onlinecasino.us.org  http://flwine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.enuri.com/mobilefirst/move.jsp?freetoken=outlink&vcode=536&plno=2866248544&url=https://onlinecasino.us.org \nhttp://penskeproducts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sereparan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.kip-k.ru/best/sql.php?=onlinecasino.us.org   http://simteq.pl/do/login?referer=https://onlinecasino.us.org  http://bike717.info/redirect.php?tid=2115&goto=onlinecasino.us.org   http://accountablecarevalue.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.find-best-mature.com/movies/go.php?id=185538_1&url=https://onlinecasino.us.org  http://healthready.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cosgraveranch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://urathletics.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thebronfmanfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://electrumstrat.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://o2o.nxnet.cn/index.php?g=Appoint&c=Changecity&a=index&referer=https://onlinecasino.us.org  http://www.netsolmail.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rciholidaysrewards.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sevensun.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ntta.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://amendero.5dayradiationtreatment.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://thetwilightman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://alisure.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fresnoexaminer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://siliconvalleyinternationalschool.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ph3.oldestcompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://4seasonspatiocovers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.frannetfranchise.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://keirakfans.createaforum.com/index.php?thememode=full;redirect=https://onlinecasino.us.org   http://www.e-anim.com/test/drag001/wonderlandtoyschnauzers.com/cgi-bin/fpg.cgi?a<>=<a href=https://onlinecasino.us.org \nhttp://weightlosspartner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://labdate.in/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tuscancapitalpartners.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bbwtwat.com/cgi-bin/atx/out.cgi?id=195&tag=toplist&trade=https://onlinecasino.us.org  http://www.aimexpo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sacbee.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jeppesendirect.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mybironas.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://insurancebpm.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://6000indiancreekmiamibeach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cmillc.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://henriquecisneros.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://davidjhaines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://officeserviceshub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://alliantagency.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://outcalt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://novobzor.ru/go?https://onlinecasino.us.org   http://www.fileavenue.net/download.php?url=https://onlinecasino.us.org \n \n \n \n \n \nhttp://graphfolio.com/forum/index.php?topic=128103.new#new\nhttp://watchmyswing.net/node/11#comment-476317\nhttps://entmuttert.com/2016/01/24/einfache-rechnung-kein-umgangdann-kein-unterhalt/\nhttp://forum.lakshmi-food.ru/viewtopic.php?f=3&t=398724\nhttp://sanavy.club/showthread.php?tid=38225&pid=223910#pid223910\n", "language": "Lisp", "metadata": {"date": 1551625266, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s950732907.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s950732907", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://ubasainthelena.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hollyandpasquale.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aestheticshop.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eventpromos.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://widespread.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.figure-skating-corner.de/php/goto.php?link=onlinecasino.us.org  http://www.gter.net/index.html?referer=https://onlinecasino.us.org  http://easyduvet.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://app.gaogulou.com/module/adsview/content/?action=click&area=A2&id=1867&url=https://onlinecasino.us.org \nhttp://class04.top/index.php?c=reg&&referer=https://onlinecasino.us.org  http://www.domaingames.com.br/Redirect.asp?ID_Banners=348&url=https://onlinecasino.us.org   http://lonevalkyrie.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ontario-fishing-lodges.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stem-cellbio-technologies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://drpaul.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://encampments.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://artsoflaos.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lvnorm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.job-ete.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wholeheartpottery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.undercovercamera.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eatreal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tempstent.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zqx.resurrectionmary.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://adslotgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://truesmokingpleasure.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lcbjapan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://peugeot301-club.com.ua/goto.php?https://onlinecasino.us.org  http://gotconsultants.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mypetworld.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chicago.pass.org/LinkClick.aspx?link=https://onlinecasino.us.org  http://maximum-kia.ru/bitrix/rk.php?id=666&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B666%5D+%5BNEW_INDEX_BANNERS%5D+%D1%CF+Kia+Finance&goto=onlinecasino.us.org   http://grammypammysweetery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://octavia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.adminv.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://sleepwellbeds.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://copperalliance.medml.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lookingforhome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dearestfutureself.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.igfederal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fives.com.tw/w3/webs/imglink_hits.php?id=6&url=https://onlinecasino.us.org   http://www.travianbabysitter.com/php/redirect.php?url=https://onlinecasino.us.org  http://nsuada.ru/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fnsuada.ru%2Fkafedry%2F1418%2F&event3=%D0%9A%D0%B0%D1%84%D0%B5%D0%B4%D1%80%D0%B0+%D0%BF%D1%80%D0%BE%D0%BC%D1%8B%D1%88%D0%BB%D0%B5%D0%BD%D0%BD%D0%BE%D0%B3%D0%BE+%D0%B4%D0%B8%D0%B7%D0%B0%D0%B9%D0%BD%D0%B0+%D0%B8+%D0%B8%D0%BD%D0%B4%D1%83%D1%81%D1%82%D1%80%D0%B8%D0%B8+%D0%BC%D0%BE%D0%B4%D1%8B+%28%D0%BA%D0%B0%D1%84%D0%B5%D0%B4%D1%80%D0%B0+%D0%9F%D0%94%D0%98%D0%9C%29+%26lt%3Bbr%26gt%3B-+%D0%BB%D0%B0%D0%B1%D0%BE%D1%80%D0%B0%D1%82%D0%BE%D1%80%D0%B8%D1%8F+%D0%BF%D1%80%D0%BE%D0%BC%D1%8B%D1%88%D0%BB%D0%B5%D0%BD%D0%BD%D0%BE%D0%B3%D0%BE+%D0%B4%D0%B8%D0%B7%D0%B0%D0%B9%D0%BD%D0%B0+%26lt%3Bbr%26gt%3B-+%D0%BB%D0%B0%D0%B1%D0%BE%D1%80%D0%B0%D1%82%D0%BE%D1%80%D0%B8%D1%8F+%D0%B4%D0%B8%D0%B7%D0%B0%D0%B9%D0%BD%D0%B0+%26lt%3Bbr%26gt%3B-+%D0%BC%D0%B0%D0%BA%D0%B5%D1%82%D0%BD%D0%B0%D1%8F+%D0%BC%D0%B0%D1%81%D1%82%D0%B5%D1%80%D1%81%D0%BA%D0%B0%D1%8F%26lt%3Bbr%26gt%3B-+%D1%88%D0%B2%D0%B5%D0%B9%D0%BD%D0%B0%D1%8F+%D0%BC%D0%B0%D1%81%D1%82%D0%B5%D1%80%D1%81%D0%BA%D0%B0%D1%8F&goto=https://onlinecasino.us.org  http://flwine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.enuri.com/mobilefirst/move.jsp?freetoken=outlink&vcode=536&plno=2866248544&url=https://onlinecasino.us.org \nhttp://penskeproducts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sereparan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.kip-k.ru/best/sql.php?=onlinecasino.us.org   http://simteq.pl/do/login?referer=https://onlinecasino.us.org  http://bike717.info/redirect.php?tid=2115&goto=onlinecasino.us.org   http://accountablecarevalue.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.find-best-mature.com/movies/go.php?id=185538_1&url=https://onlinecasino.us.org  http://healthready.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cosgraveranch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://urathletics.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thebronfmanfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://electrumstrat.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://o2o.nxnet.cn/index.php?g=Appoint&c=Changecity&a=index&referer=https://onlinecasino.us.org  http://www.netsolmail.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rciholidaysrewards.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sevensun.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ntta.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://amendero.5dayradiationtreatment.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://thetwilightman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://alisure.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fresnoexaminer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://siliconvalleyinternationalschool.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ph3.oldestcompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://4seasonspatiocovers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.frannetfranchise.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://keirakfans.createaforum.com/index.php?thememode=full;redirect=https://onlinecasino.us.org   http://www.e-anim.com/test/drag001/wonderlandtoyschnauzers.com/cgi-bin/fpg.cgi?a<>=<a href=https://onlinecasino.us.org \nhttp://weightlosspartner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://labdate.in/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tuscancapitalpartners.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bbwtwat.com/cgi-bin/atx/out.cgi?id=195&tag=toplist&trade=https://onlinecasino.us.org  http://www.aimexpo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sacbee.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jeppesendirect.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mybironas.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://insurancebpm.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://6000indiancreekmiamibeach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cmillc.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://henriquecisneros.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://davidjhaines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://officeserviceshub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://alliantagency.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://outcalt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://novobzor.ru/go?https://onlinecasino.us.org   http://www.fileavenue.net/download.php?url=https://onlinecasino.us.org \n \n \n \n \n \nhttp://graphfolio.com/forum/index.php?topic=128103.new#new\nhttp://watchmyswing.net/node/11#comment-476317\nhttps://entmuttert.com/2016/01/24/einfache-rechnung-kein-umgangdann-kein-unterhalt/\nhttp://forum.lakshmi-food.ru/viewtopic.php?f=3&t=398724\nhttp://sanavy.club/showthread.php?tid=38225&pid=223910#pid223910\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8838, "cpu_time_ms": 27, "memory_kb": 4324}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s102529533", "group_id": "codeNet:p03941", "input_text": "http://ccante1.free.fr/annuaire-aquariophilie/jump.php?sid=315&url=https://onlinecasino.us.org  http://ditchyourspace.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://egono.com/link.php/deny/rank.php?h=949&url=https://onlinecasino.us.org   http://www.2dm.cn/tools/goto.aspx?url=https://onlinecasino.us.org  http://teenbook.site/rotator/video.php?gr=1&id=1bc378&url=/video/out.cgi?url=https://onlinecasino.us.org   http://theultimatefighterjapan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://berkshirehathawayyostlittle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://spacewithabba.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qis.needyinnewyork.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.bled-apartments.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://forum.key8.com/redirect.php?fid=133&tid=1591315&goto=onlinecasino.us.org   http://qcd.powengineeringinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.efeu.clipe.pt/cgi-bin/atc/out.cgi?id=86&u=/onlinecasino.us.org  https://lakemedelsverket.se/Tpl/HitCounter.aspx?resid=2025904672&q=test&ilang=en&hitnr=7&url=https://onlinecasino.us.org   http://sns.zaoche168.com/link.php?url=https://onlinecasino.us.org  http://www.very-sexy.com/movies/go.php?id=1095841_1&url=https://onlinecasino.us.org  http://625.highergroundco.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://batteryrestore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://airtkt.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.atlantic-software.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kd-24.ru/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fbigwall.ru%2F&event3=%D0%98%D0%BD%D1%82%D0%B5%D1%80%D0%BD%D0%B5%D1%82-%D0%BC%D0%B0%D0%B3%D0%B0%D0%B7%D0%B8%D0%BD+BigWall&goto=https://onlinecasino.us.org   http://xgk.moonlitexotics.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://inflamax.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://homesweetjungle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thegoodyearprocessserver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.domainclub.cn/tools/baidu.php?domain=onlinecasino.us.org   http://www.pauldbarton.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://adviceaboutprk.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://heatherbonomo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.infoconsumo.gov.br/redir.asp?url=https://onlinecasino.us.org   http://tennesseecatholic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.soosh.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.accessorypitusa.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.bailsoft.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://amicaconcierge.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://warnerjazzworks.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://permeotechnologies.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bofweb.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://uglyshirt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://onecanhappen.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://43070073.r.bat.bing.com/?ld=d37_WOgepXMp3n6wHbgNqs2TVUCUys7SIQtA6-uPudD9TpjyQ0mzfLLxLMAZWb9lBZ0DcXdcgaBcrqXJ_Ebvw-7j8mMib2CZhDTFL4d2UJp7kg7mZwOY_giG7COJHddN9eAnVwCDEGR6rQeJdP3Tym59TXaro&u=https://onlinecasino.us.org   http://spapartsltd.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cauoco.gq/e/o/?/movies/go.php?id=659780_1&url=https://onlinecasino.us.org  http://cervical-stim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dasweb.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://seasonofpursuit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://adguardteam.github.io/AnonymousRedirect/redirect.html?url=https://onlinecasino.us.org   http://tuxedomagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://770bamtree.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ws.skoda-auto.com/movieplayerweb/02.00.00/Default.aspx?url=https://onlinecasino.us.org   http://equitableseniorsolutions.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://panerapantry.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ehometownbank.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://idgcsc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.kisscatalog.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dezignsmith.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mario.bg/shop/redirect.php?action=url&goto=onlinecasino.us.org   http://fertilitysolutions.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://smoxy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://novostitehniki.ru/redirect/?url=https://onlinecasino.us.org  http://www.conceptcaronline.com/ccdirectory/jump.php?url=https://onlinecasino.us.org  http://roboproxy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.seashellhomes.com/SearchPoint/redir.asp?reg_id=pTypes&sname=/searchpoint/search.asp&lid=0&sponsor=RES&url=onlinecasino.us.org \nhttp://pnpds.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.hartfordcplco-op.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://remingtoncollegenursing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.huntohio.net/forums/index.php?t=msg&goto=onlinecasino.us.org  http://maps.google.co.cr/url?q=https://onlinecasino.us.org   http://codovations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.autohjaelpindeks.dk/goto.php??s=https://onlinecasino.us.org  http://ehtiros.ru/go.php?url=https://onlinecasino.us.org   http://daten.ws-mack.de/core.asp?a=aktuelles&n=heckerjahr2011&sd=heckerjahr2011/index.asp&d=onlinecasino.us.org \nhttp://kvartal-cafe.com.ua/wp-content/themes/eatery/nav.php?-Menu-=https://onlinecasino.us.org  http://baylaurelpark.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://scfw12365.cn/other/link.php?id=272&url=https://onlinecasino.us.org   http://lucartisan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://amrdiab.net/forum/blog.php?b=168&goto=onlinecasino.us.org   http://hajjaj.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.lossuenosspa.com/referrer.php?link=https://onlinecasino.us.org  http://www.blackpantera.ru/bitrix/redirect.php?event1=womnet&event2=&event3=&goto=https://onlinecasino.us.org   http://megajets.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://delcocodered.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://studentaccesssoftware.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://carnivalkid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bwg24.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.scsenhan.com/502/connect.php?mod=login&op=init&referer=https://onlinecasino.us.org   http://www.babiesonline.co.za/scripts/AdClick.php?ID=26&URL=https://onlinecasino.us.org/  http://texasgirls.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://onlinecarrepair.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vignoblecotemontrigaud.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.emtiletisim.com/forum/viewtopic.php?pid=128435#p128435\nhttp://pvmdeklaracija.lt/forum/viewtopic.php?f=2&t=620817&sid=8d42edf018b5c9d729f609e5ea2f55eb\nhttp://rundata.ro/forum/viewtopic.php?f=10&t=394937\nhttp://lezzetinur.com/corba-terbiye-cesitleri/#comment-43395\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\n", "language": "Lisp", "metadata": {"date": 1551595735, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s102529533.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s102529533", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://ccante1.free.fr/annuaire-aquariophilie/jump.php?sid=315&url=https://onlinecasino.us.org  http://ditchyourspace.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://egono.com/link.php/deny/rank.php?h=949&url=https://onlinecasino.us.org   http://www.2dm.cn/tools/goto.aspx?url=https://onlinecasino.us.org  http://teenbook.site/rotator/video.php?gr=1&id=1bc378&url=/video/out.cgi?url=https://onlinecasino.us.org   http://theultimatefighterjapan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://berkshirehathawayyostlittle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://spacewithabba.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qis.needyinnewyork.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.bled-apartments.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://forum.key8.com/redirect.php?fid=133&tid=1591315&goto=onlinecasino.us.org   http://qcd.powengineeringinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.efeu.clipe.pt/cgi-bin/atc/out.cgi?id=86&u=/onlinecasino.us.org  https://lakemedelsverket.se/Tpl/HitCounter.aspx?resid=2025904672&q=test&ilang=en&hitnr=7&url=https://onlinecasino.us.org   http://sns.zaoche168.com/link.php?url=https://onlinecasino.us.org  http://www.very-sexy.com/movies/go.php?id=1095841_1&url=https://onlinecasino.us.org  http://625.highergroundco.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://batteryrestore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://airtkt.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.atlantic-software.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kd-24.ru/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fbigwall.ru%2F&event3=%D0%98%D0%BD%D1%82%D0%B5%D1%80%D0%BD%D0%B5%D1%82-%D0%BC%D0%B0%D0%B3%D0%B0%D0%B7%D0%B8%D0%BD+BigWall&goto=https://onlinecasino.us.org   http://xgk.moonlitexotics.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://inflamax.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://homesweetjungle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thegoodyearprocessserver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.domainclub.cn/tools/baidu.php?domain=onlinecasino.us.org   http://www.pauldbarton.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://adviceaboutprk.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://heatherbonomo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.infoconsumo.gov.br/redir.asp?url=https://onlinecasino.us.org   http://tennesseecatholic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.soosh.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.accessorypitusa.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.bailsoft.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://amicaconcierge.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://warnerjazzworks.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://permeotechnologies.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bofweb.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://uglyshirt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://onecanhappen.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://43070073.r.bat.bing.com/?ld=d37_WOgepXMp3n6wHbgNqs2TVUCUys7SIQtA6-uPudD9TpjyQ0mzfLLxLMAZWb9lBZ0DcXdcgaBcrqXJ_Ebvw-7j8mMib2CZhDTFL4d2UJp7kg7mZwOY_giG7COJHddN9eAnVwCDEGR6rQeJdP3Tym59TXaro&u=https://onlinecasino.us.org   http://spapartsltd.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cauoco.gq/e/o/?/movies/go.php?id=659780_1&url=https://onlinecasino.us.org  http://cervical-stim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dasweb.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://seasonofpursuit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://adguardteam.github.io/AnonymousRedirect/redirect.html?url=https://onlinecasino.us.org   http://tuxedomagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://770bamtree.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ws.skoda-auto.com/movieplayerweb/02.00.00/Default.aspx?url=https://onlinecasino.us.org   http://equitableseniorsolutions.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://panerapantry.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ehometownbank.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://idgcsc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.kisscatalog.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dezignsmith.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mario.bg/shop/redirect.php?action=url&goto=onlinecasino.us.org   http://fertilitysolutions.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://smoxy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://novostitehniki.ru/redirect/?url=https://onlinecasino.us.org  http://www.conceptcaronline.com/ccdirectory/jump.php?url=https://onlinecasino.us.org  http://roboproxy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.seashellhomes.com/SearchPoint/redir.asp?reg_id=pTypes&sname=/searchpoint/search.asp&lid=0&sponsor=RES&url=onlinecasino.us.org \nhttp://pnpds.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.hartfordcplco-op.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://remingtoncollegenursing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.huntohio.net/forums/index.php?t=msg&goto=onlinecasino.us.org  http://maps.google.co.cr/url?q=https://onlinecasino.us.org   http://codovations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.autohjaelpindeks.dk/goto.php??s=https://onlinecasino.us.org  http://ehtiros.ru/go.php?url=https://onlinecasino.us.org   http://daten.ws-mack.de/core.asp?a=aktuelles&n=heckerjahr2011&sd=heckerjahr2011/index.asp&d=onlinecasino.us.org \nhttp://kvartal-cafe.com.ua/wp-content/themes/eatery/nav.php?-Menu-=https://onlinecasino.us.org  http://baylaurelpark.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://scfw12365.cn/other/link.php?id=272&url=https://onlinecasino.us.org   http://lucartisan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://amrdiab.net/forum/blog.php?b=168&goto=onlinecasino.us.org   http://hajjaj.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.lossuenosspa.com/referrer.php?link=https://onlinecasino.us.org  http://www.blackpantera.ru/bitrix/redirect.php?event1=womnet&event2=&event3=&goto=https://onlinecasino.us.org   http://megajets.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://delcocodered.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://studentaccesssoftware.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://carnivalkid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bwg24.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.scsenhan.com/502/connect.php?mod=login&op=init&referer=https://onlinecasino.us.org   http://www.babiesonline.co.za/scripts/AdClick.php?ID=26&URL=https://onlinecasino.us.org/  http://texasgirls.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://onlinecarrepair.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vignoblecotemontrigaud.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.emtiletisim.com/forum/viewtopic.php?pid=128435#p128435\nhttp://pvmdeklaracija.lt/forum/viewtopic.php?f=2&t=620817&sid=8d42edf018b5c9d729f609e5ea2f55eb\nhttp://rundata.ro/forum/viewtopic.php?f=10&t=394937\nhttp://lezzetinur.com/corba-terbiye-cesitleri/#comment-43395\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8132, "cpu_time_ms": 108, "memory_kb": 9312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s237752415", "group_id": "codeNet:p03941", "input_text": "http://jesuswasasocialist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gyvunugloba.lt/url.php?url=https://onlinecasino.us.org   http://jwhomelink.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://alljizz.com/out.php?v=https://onlinecasino.us.org  http://jbrandfashion.es/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://atlasshardware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://flyingfox.hsbpartners.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.infoholix.com/redirect.php?mWeb=https://onlinecasino.us.org   http://bethshalomaustin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://understandinganda.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://colorrblind.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://scad-sucks.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://abacusprivateequity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://north-american-watergardens.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bunkerhillbaptist.org/System/UserProfile.asp?id=20238&func=signup&referer=https://onlinecasino.us.org  http://utoucan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://godrejbrighterlife.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sc25.com/log_viewing.php?id=374&type=source&url=https://onlinecasino.us.org \nhttp://www.barclaycardring.com/t5/Barclaycard-Ring-Public-Blog/bg-p/public-blog/label-name/card%20features/page/3?liaLangParamName=hl&liaNodeLang=en&redirectreason=notregistered&referer=https://onlinecasino.us.org  http://foreverygirl.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dudleymoorecd.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://slickdealsindia.com/go.php?go=https://onlinecasino.us.org  http://estateplansandtrusts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://patricioatkinson.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.neodiscuss.zisal.com/redirect.php?tid=13653&goto=onlinecasino.us.org  http://awesomeapps.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rare-hospitality.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://grocerssupply.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ameritexfabric.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://worldcivilizations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dolese.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://classroombeautiful.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lecovecity-wx.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xlw.worldjewelry.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.lkagan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bauer.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.rain-filter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hanoimuare.com/redirect/?url=https://onlinecasino.us.org   http://www.kutjeporno.com/cgi-bin/atc/out.cgi?id=31&l=secondthumbs&u=https://onlinecasino.us.org   http://www.sweetmemories.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.electricman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://abcportland.org/System/UserProfile.asp?id=59956&func=signup&referer=https://onlinecasino.us.org  https://baywoodelementary.ejoinme.org/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.fso-lawprac.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sage-imc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://westernguy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aetnaworkforceavailability.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://xtdump.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.simferopol.info/upload/rk/0fb/0fbdbd3c8bbd2b3ae9b985674fefc057.swf?flash_link=onlinecasino.us.org  https://shop.ammann-it-services.de/index.php?q=https://onlinecasino.us.org   http://json-to-xml.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.topide.com/engine/go.php?url=onlinecasino.us.org  http://daagators.org/Goto.asp?url=https://onlinecasino.us.org   http://ezcharity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://lewisnotary.signingbiz.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://ironcart.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://xafeer.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://grommetman.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://integritypublications.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://academysportsandoutdoorssuck.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gavel.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://shop4diamonds.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tlu.performancechip.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.belorechensk.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org  https://www.cheapassgamer.com/redirect.php?url=https://onlinecasino.us.org   http://apply4phd.blogsky.com/dailylink/?go=https://onlinecasino.us.org   http://flrtree.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://greengardengirl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://orangeexperience.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://multihop-net.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://docguidenb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myhubmoms.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://towelsystems.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jewishbookmarketing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://iwirelesscameras.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rewardsfocus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://directooriente.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fotoarts.smwec.ca/go.php??s=https://onlinecasino.us.org  http://bq--3cc43atskfwi33y.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://besteuropeanporcelain.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://2wp.ca/process/RedirectN?url=https://onlinecasino.us.org \nhttp://vfg.medicaldoctor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fccdca.com/index.php?c=login&&referer=https://onlinecasino.us.org   http://www.lessentiel-newsletter.lu/redirect.php?nwsltr=2cbca44843a864533ec05b321ae1f9d1&email=&link=https://onlinecasino.us.org   http://www.colegioenfermeriasevilla.es/Recursos/Boletin/URL.php?Cod=%F1q%F1qCodcol&ID=95&url=https://onlinecasino.us.org  http://www.vniigis.ru/bitrix/rk.php?id=8&site_id=s2&event1=banner&event2=click&event3=1+%2F+%5B8%5D+%5BTOP%5D+The+new+site+Research+Institute+of+Parasitology+im.Skryabina&goto=https://onlinecasino.us.org   https://gtss.ssf.gov.co/SedeElectronica/redirect.do?destino=https://onlinecasino.us.org  http://www.zzlianjie.com/Home/Index/go.html?url=onlinecasino.us.org  http://www.mybigfatgreekwedding.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.240ip.com/redirect.php?fid=19&tid=17490&goto=onlinecasino.us.org \n \n \n \n \n \nhttps://pmcforlando.com/members/index.php?topic=11378.new#new\nhttp://xn--iexed-ngaa6qrbbh.mannlist.com/viewtopic.php?f=10&t=46143480\nhttp://school9m.org.ru/node/1#comment-100155\nhttps://primeaque.com/forum/index.php?topic=85013.new#new\nhttps://wanderingjouster.com/2017/11/12/the-hunting/\n", "language": "Lisp", "metadata": {"date": 1551565996, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s237752415.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s237752415", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://jesuswasasocialist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gyvunugloba.lt/url.php?url=https://onlinecasino.us.org   http://jwhomelink.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://alljizz.com/out.php?v=https://onlinecasino.us.org  http://jbrandfashion.es/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://atlasshardware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://flyingfox.hsbpartners.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.infoholix.com/redirect.php?mWeb=https://onlinecasino.us.org   http://bethshalomaustin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://understandinganda.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://colorrblind.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://scad-sucks.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://abacusprivateequity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://north-american-watergardens.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bunkerhillbaptist.org/System/UserProfile.asp?id=20238&func=signup&referer=https://onlinecasino.us.org  http://utoucan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://godrejbrighterlife.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sc25.com/log_viewing.php?id=374&type=source&url=https://onlinecasino.us.org \nhttp://www.barclaycardring.com/t5/Barclaycard-Ring-Public-Blog/bg-p/public-blog/label-name/card%20features/page/3?liaLangParamName=hl&liaNodeLang=en&redirectreason=notregistered&referer=https://onlinecasino.us.org  http://foreverygirl.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dudleymoorecd.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://slickdealsindia.com/go.php?go=https://onlinecasino.us.org  http://estateplansandtrusts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://patricioatkinson.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.neodiscuss.zisal.com/redirect.php?tid=13653&goto=onlinecasino.us.org  http://awesomeapps.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rare-hospitality.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://grocerssupply.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ameritexfabric.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://worldcivilizations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dolese.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://classroombeautiful.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lecovecity-wx.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xlw.worldjewelry.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.lkagan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bauer.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.rain-filter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hanoimuare.com/redirect/?url=https://onlinecasino.us.org   http://www.kutjeporno.com/cgi-bin/atc/out.cgi?id=31&l=secondthumbs&u=https://onlinecasino.us.org   http://www.sweetmemories.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.electricman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://abcportland.org/System/UserProfile.asp?id=59956&func=signup&referer=https://onlinecasino.us.org  https://baywoodelementary.ejoinme.org/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.fso-lawprac.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sage-imc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://westernguy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aetnaworkforceavailability.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://xtdump.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.simferopol.info/upload/rk/0fb/0fbdbd3c8bbd2b3ae9b985674fefc057.swf?flash_link=onlinecasino.us.org  https://shop.ammann-it-services.de/index.php?q=https://onlinecasino.us.org   http://json-to-xml.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.topide.com/engine/go.php?url=onlinecasino.us.org  http://daagators.org/Goto.asp?url=https://onlinecasino.us.org   http://ezcharity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://lewisnotary.signingbiz.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://ironcart.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://xafeer.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://grommetman.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://integritypublications.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://academysportsandoutdoorssuck.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gavel.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://shop4diamonds.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tlu.performancechip.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.belorechensk.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org  https://www.cheapassgamer.com/redirect.php?url=https://onlinecasino.us.org   http://apply4phd.blogsky.com/dailylink/?go=https://onlinecasino.us.org   http://flrtree.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://greengardengirl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://orangeexperience.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://multihop-net.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://docguidenb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myhubmoms.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://towelsystems.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jewishbookmarketing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://iwirelesscameras.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rewardsfocus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://directooriente.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fotoarts.smwec.ca/go.php??s=https://onlinecasino.us.org  http://bq--3cc43atskfwi33y.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://besteuropeanporcelain.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://2wp.ca/process/RedirectN?url=https://onlinecasino.us.org \nhttp://vfg.medicaldoctor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fccdca.com/index.php?c=login&&referer=https://onlinecasino.us.org   http://www.lessentiel-newsletter.lu/redirect.php?nwsltr=2cbca44843a864533ec05b321ae1f9d1&email=&link=https://onlinecasino.us.org   http://www.colegioenfermeriasevilla.es/Recursos/Boletin/URL.php?Cod=%F1q%F1qCodcol&ID=95&url=https://onlinecasino.us.org  http://www.vniigis.ru/bitrix/rk.php?id=8&site_id=s2&event1=banner&event2=click&event3=1+%2F+%5B8%5D+%5BTOP%5D+The+new+site+Research+Institute+of+Parasitology+im.Skryabina&goto=https://onlinecasino.us.org   https://gtss.ssf.gov.co/SedeElectronica/redirect.do?destino=https://onlinecasino.us.org  http://www.zzlianjie.com/Home/Index/go.html?url=onlinecasino.us.org  http://www.mybigfatgreekwedding.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.240ip.com/redirect.php?fid=19&tid=17490&goto=onlinecasino.us.org \n \n \n \n \n \nhttps://pmcforlando.com/members/index.php?topic=11378.new#new\nhttp://xn--iexed-ngaa6qrbbh.mannlist.com/viewtopic.php?f=10&t=46143480\nhttp://school9m.org.ru/node/1#comment-100155\nhttps://primeaque.com/forum/index.php?topic=85013.new#new\nhttps://wanderingjouster.com/2017/11/12/the-hunting/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8005, "cpu_time_ms": 99, "memory_kb": 9440}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s005803443", "group_id": "codeNet:p03941", "input_text": "http://www.maduras-calientes.com.ar/out.php?url=https://onlinecasino.us.org  http://cukierniaambrozja.com.pl/do/login?referer=https://onlinecasino.us.org   http://nundinaeinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rubymayer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fabianpal.com/ujvend/go.php?url=https://onlinecasino.us.org   http://15845.r.msn.com/?ld=d3D9vpoC6BQzZ7NhbsZff0RTVUCUwOGSyVEc7hmgi0uNA9vQferOTt0mjJ7h_cEEf4-rMaz6gXke6I2Quh-jl5aUIKkMwnMjO-lSezdqeuUT5XiNq6SJoE-yJC1Z_dvvx4pc6I-hbDrrnMjm0TzUaV0Y8eOn4gJwsejzBf52XRNbD1h2DC&u=https://onlinecasino.us.org  http://jfe.momnt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.draguscapital.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.omageilblog.com/cgi-bin/crtr/out.cgi?id=53&l=top_top&u=https://onlinecasino.us.org \nhttp://jerkyfarm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mirage3d.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gcpusa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.brooklynrun.nyc/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.berkeleyvsbigsoda.com/r?u=https://onlinecasino.us.org   http://ynj.bailsoft.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.wochacha.com/record/index?t=wgg&c=7240023_2&go=https://onlinecasino.us.org  http://food2go.com/__media__/js/netsoltrademark.php?d=&onlinecasino.us.org   http://www.delijn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://tracycwinter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://killercheese.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dadi365.com/odflv/index.php?url=https://onlinecasino.us.org   http://elmir.ua.xx3.kz/go.php?url=https://onlinecasino.us.org  http://fivebridges.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://senseus.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://freedogfartmovies.com/cgi-bin/atc/out.cgi?id=32&u=https://onlinecasino.us.org  http://www.aryachandra.com/cgi-bin/clickcount.pl?url=https://onlinecasino.us.org   http://www.bakergovt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.kimpen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://9gag-greece.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://zootovary.ru/?id=150&site_id=s1&event1=banner&event2=click&event3=1+%252F+%255B150%255D+%255BMAINPAGE_SMALL1%255D+VISA+%25D0%25B8+MASTERCARD&goto=https://onlinecasino.us.org   http://jayandrewssalonspa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zoologica.ru/go.php?url=https://onlinecasino.us.org   http://sherwoodforestfestival.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lipsea.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.crystalrice.com/COUNTRY-STORE.html?template=&userId=8676428&hsId=1759186879&numPerPage=5&paypalEmail=crpmona@cs.com&paymentType=paypal&imageSize=Small&siteUrl=https://onlinecasino.us.org/   https://www.mapsandhotels.com/goto.php?url=https://onlinecasino.us.org \nhttp://remote-blimp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pxb.capspa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.easthope.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://getaskylightcard.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eduaction2020.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://buapartment.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://artsmart.bz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://3dcentaurporn.com/crtr/cgi/out.cgi?id=71&l=top_top&u=https://onlinecasino.us.org   https://fanski.info/out.php?https://onlinecasino.us.org \nhttp://donnertruffles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://healthnewshelp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.markaleaf.com/shop/display_cart?return_url=https://onlinecasino.us.org   http://jwstevenson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://enlightera.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wildcatweekly.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://livingsoles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.etnews.com/tools/redirect_log.html?url=https://onlinecasino.us.org   http://virchi.pp.net.ua/go?https://onlinecasino.us.org \nhttp://ds-moscow.ru/forum/go.php?https://onlinecasino.us.org  http://oferta-satumare.ro/redirect.php?link=https://onlinecasino.us.org   http://scout.fund/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lollipopclothingstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tykessports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://auctionfrogs.org/outbound.php?url=&type_id=112&type=donoronlinecasino.us.org  http://fjvauctions.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ixidigital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gyx.lindengrun.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://m.bitrix24.ru/bitrix/rk.php?id=150&site_id=ru&event1=banner&event2=click&event3=1+/+<>50]+<PRIMARY>DAILY_BANNER_WIDGET]+Баннер+на+главной+странице+(блочный+баннер)+от+(31.01.2018)&goto=https://onlinecasino.us.org  http://whiskeyplank.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cdnindex.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sunartists.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fishingarea.awardspace.com/go.php?url=https://onlinecasino.us.org   http://belaga.ru/go/url=https://onlinecasino.us.org  http://e-blocs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://interactconnect.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://erikbronfman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://fetishtubez.com/go.php?https://onlinecasino.us.org  https://fmtrust.asureforce.net/redirect.aspx?redirecturl=https://onlinecasino.us.org   http://secretsexlifeofangels.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://caffeinequit.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yun34567.com/index.php?c=login&&referer=https://onlinecasino.us.org   http://iclassroom.pro/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dashlove.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://atkritka.com/bitrix/rk.php?goto=https://onlinecasino.us.org   http://primorsky.ru/bitrix/rk.php?id=111&event1=banner&event2=click&event3=1+%2F+%5B111%5D+%5BRSB_BLOCK_2%5D+%D0%A1%D0%BF%D0%B8%D1%81%D0%BE%D0%BA+%D1%82%D0%B5%D0%BB%D0%B5%D1%84%D0%BE%D0%BD%D0%BE%D0%B2+%D0%B3%D0%BE%D1%80%D1%8F%D1%87%D0%B8%D1%85+%D0%BB%D0%B8%D0%BD%D0%B8%D0%B9&goto=https://onlinecasino.us.org \nhttp://flyingyears.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://web3dstop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://web.fullsearch.com.ar/?url=https://onlinecasino.us.org/   http://oneautodr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wiessner.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://randolphpiercefoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.deli-s.net/click/click.cgi?cnt=kt72&url=https://onlinecasino.us.org  http://www.waitwaitpodcasts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://corelpainter.kz/goto/https://onlinecasino.us.org \n \n \n \n \n \nhttp://kalapati.atasteofasia.com.au/index.php?topic=259754.new#new\nhttps://truthinreality.com/2015/09/15/prayer-for-breaking-the-powers-of-witchcraft/\nhttps://weechookeong.com/2018/05/30/masa-sekarang-menungggu-mu-part-5-tourism-msias-rm99-694-mil-speedy-gonzales-contract/\nhttp://www.vok-forum.ru/viewtopic.php?f=2&t=330396\nhttp://omen.im/forum/index.php?topic=82041.new#new\n", "language": "Lisp", "metadata": {"date": 1551560153, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s005803443.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s005803443", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.maduras-calientes.com.ar/out.php?url=https://onlinecasino.us.org  http://cukierniaambrozja.com.pl/do/login?referer=https://onlinecasino.us.org   http://nundinaeinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rubymayer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fabianpal.com/ujvend/go.php?url=https://onlinecasino.us.org   http://15845.r.msn.com/?ld=d3D9vpoC6BQzZ7NhbsZff0RTVUCUwOGSyVEc7hmgi0uNA9vQferOTt0mjJ7h_cEEf4-rMaz6gXke6I2Quh-jl5aUIKkMwnMjO-lSezdqeuUT5XiNq6SJoE-yJC1Z_dvvx4pc6I-hbDrrnMjm0TzUaV0Y8eOn4gJwsejzBf52XRNbD1h2DC&u=https://onlinecasino.us.org  http://jfe.momnt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.draguscapital.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.omageilblog.com/cgi-bin/crtr/out.cgi?id=53&l=top_top&u=https://onlinecasino.us.org \nhttp://jerkyfarm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mirage3d.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gcpusa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.brooklynrun.nyc/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.berkeleyvsbigsoda.com/r?u=https://onlinecasino.us.org   http://ynj.bailsoft.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.wochacha.com/record/index?t=wgg&c=7240023_2&go=https://onlinecasino.us.org  http://food2go.com/__media__/js/netsoltrademark.php?d=&onlinecasino.us.org   http://www.delijn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://tracycwinter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://killercheese.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dadi365.com/odflv/index.php?url=https://onlinecasino.us.org   http://elmir.ua.xx3.kz/go.php?url=https://onlinecasino.us.org  http://fivebridges.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://senseus.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://freedogfartmovies.com/cgi-bin/atc/out.cgi?id=32&u=https://onlinecasino.us.org  http://www.aryachandra.com/cgi-bin/clickcount.pl?url=https://onlinecasino.us.org   http://www.bakergovt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.kimpen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://9gag-greece.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://zootovary.ru/?id=150&site_id=s1&event1=banner&event2=click&event3=1+%252F+%255B150%255D+%255BMAINPAGE_SMALL1%255D+VISA+%25D0%25B8+MASTERCARD&goto=https://onlinecasino.us.org   http://jayandrewssalonspa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zoologica.ru/go.php?url=https://onlinecasino.us.org   http://sherwoodforestfestival.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lipsea.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.crystalrice.com/COUNTRY-STORE.html?template=&userId=8676428&hsId=1759186879&numPerPage=5&paypalEmail=crpmona@cs.com&paymentType=paypal&imageSize=Small&siteUrl=https://onlinecasino.us.org/   https://www.mapsandhotels.com/goto.php?url=https://onlinecasino.us.org \nhttp://remote-blimp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pxb.capspa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.easthope.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://getaskylightcard.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eduaction2020.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://buapartment.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://artsmart.bz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://3dcentaurporn.com/crtr/cgi/out.cgi?id=71&l=top_top&u=https://onlinecasino.us.org   https://fanski.info/out.php?https://onlinecasino.us.org \nhttp://donnertruffles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://healthnewshelp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.markaleaf.com/shop/display_cart?return_url=https://onlinecasino.us.org   http://jwstevenson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://enlightera.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wildcatweekly.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://livingsoles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.etnews.com/tools/redirect_log.html?url=https://onlinecasino.us.org   http://virchi.pp.net.ua/go?https://onlinecasino.us.org \nhttp://ds-moscow.ru/forum/go.php?https://onlinecasino.us.org  http://oferta-satumare.ro/redirect.php?link=https://onlinecasino.us.org   http://scout.fund/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lollipopclothingstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tykessports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://auctionfrogs.org/outbound.php?url=&type_id=112&type=donoronlinecasino.us.org  http://fjvauctions.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ixidigital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gyx.lindengrun.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://m.bitrix24.ru/bitrix/rk.php?id=150&site_id=ru&event1=banner&event2=click&event3=1+/+<>50]+<PRIMARY>DAILY_BANNER_WIDGET]+Баннер+на+главной+странице+(блочный+баннер)+от+(31.01.2018)&goto=https://onlinecasino.us.org  http://whiskeyplank.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cdnindex.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sunartists.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fishingarea.awardspace.com/go.php?url=https://onlinecasino.us.org   http://belaga.ru/go/url=https://onlinecasino.us.org  http://e-blocs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://interactconnect.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://erikbronfman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://fetishtubez.com/go.php?https://onlinecasino.us.org  https://fmtrust.asureforce.net/redirect.aspx?redirecturl=https://onlinecasino.us.org   http://secretsexlifeofangels.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://caffeinequit.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yun34567.com/index.php?c=login&&referer=https://onlinecasino.us.org   http://iclassroom.pro/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dashlove.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://atkritka.com/bitrix/rk.php?goto=https://onlinecasino.us.org   http://primorsky.ru/bitrix/rk.php?id=111&event1=banner&event2=click&event3=1+%2F+%5B111%5D+%5BRSB_BLOCK_2%5D+%D0%A1%D0%BF%D0%B8%D1%81%D0%BE%D0%BA+%D1%82%D0%B5%D0%BB%D0%B5%D1%84%D0%BE%D0%BD%D0%BE%D0%B2+%D0%B3%D0%BE%D1%80%D1%8F%D1%87%D0%B8%D1%85+%D0%BB%D0%B8%D0%BD%D0%B8%D0%B9&goto=https://onlinecasino.us.org \nhttp://flyingyears.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://web3dstop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://web.fullsearch.com.ar/?url=https://onlinecasino.us.org/   http://oneautodr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wiessner.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://randolphpiercefoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.deli-s.net/click/click.cgi?cnt=kt72&url=https://onlinecasino.us.org  http://www.waitwaitpodcasts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://corelpainter.kz/goto/https://onlinecasino.us.org \n \n \n \n \n \nhttp://kalapati.atasteofasia.com.au/index.php?topic=259754.new#new\nhttps://truthinreality.com/2015/09/15/prayer-for-breaking-the-powers-of-witchcraft/\nhttps://weechookeong.com/2018/05/30/masa-sekarang-menungggu-mu-part-5-tourism-msias-rm99-694-mil-speedy-gonzales-contract/\nhttp://www.vok-forum.ru/viewtopic.php?f=2&t=330396\nhttp://omen.im/forum/index.php?topic=82041.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8194, "cpu_time_ms": 81, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s511805929", "group_id": "codeNet:p03941", "input_text": "http://www.99shlf.net/redirect.php?goto=onlinecasino.us.org  http://www.my511wv.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.99wys.cn/home/link.php?url=https://onlinecasino.us.org   http://www.federcomated.it/redirect.asp?link=https://onlinecasino.us.org  http://skinny-trunk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://link.sendbee.com/redirect.php?fid=6&tid=5792&goto=onlinecasino.us.org  http://xlogics.mybaylorhealth.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://radiojose.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://roomerpms.mx/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://experienceanacortes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://payabillfromanybank.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bormutato.hu/link.php?link=https://onlinecasino.us.org   http://www.antirecession.com/ct.ashx?id=80fb7bfa-0bcd-41e4-8a70-74a42e7c4bba&url=https://onlinecasino.us.org  http://reddeer.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.rockclimbing.com/cgi-bin/forum/gforum.cgi?url=http://www.onlinecasino.us.org/  http://graniteglobalventures.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hshsmedicalgroup.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.vr345.com/link.php?url=https://onlinecasino.us.org \nhttp://www.comune.agazzano.pc.it/servizi/certificati/redirect.aspx?url=https://onlinecasino.us.org  http://dogussportactivities.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.find-best-babes.com/movies/go.php?id=1244320_1&url=https://onlinecasino.us.org   http://europeanrivertravel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.chicagodnn.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://www.extreme-thumbz.com/cgi-bin/atc/out.cgi?id=33&u=https://onlinecasino.us.org  http://oekakichat.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jri.qvsd2.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://danielmager.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://massivescaleconsulting.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://live-ins.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ldshj.com/bbs/redirect.php?tid=1753&goto=onlinecasino.us.org   http://riverlandresort.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sscctv.com/rb/?r=eng&system=popup.login&iframe=Y&referer=https://onlinecasino.us.org   http://km13020.keymachine.de/php.php?a<>=<a+href=https://onlinecasino.us.org  http://www.ultraleggeri.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://songsurfing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://supplepowder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.keepthatcontact.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rescapinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://udx.cleartest.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sunmoods.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.propertyappraisals.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://oldtrailschool.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.trueprivate.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://montanadra.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://suissesport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.allied-publishing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://procovery.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gymtech.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rxadmix.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gethelppayingbills.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fabricfishes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dalniestrany.ru/go.php?redirect=https://onlinecasino.us.org  http://rowleywines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fluidgrow.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://smd-west.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://ms683.nitrado.net/webinterface/vendors/phpmyadmin/url.php?url=https://onlinecasino.us.org   http://panda-cafe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://operationshirt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stoneagepartners.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tuning-italia.it/forum/g.php?url=https://onlinecasino.us.org  http://livejones.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dairyprotect.net/__media__/js/netsoltrademark.php?d=&g2_returnName=Albumonlinecasino.us.org   http://chanri.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://idbupay.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://americolatino.tw/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kazus.ru/url.php?url=https://onlinecasino.us.org   http://heynicepictures.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://oaknoll.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://closeoutworld.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bt2.ccdome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://insurance.goldenarticles.net/go.php?url=https://onlinecasino.us.org   http://stemcell-ed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://stemcellcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wje.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dvdpro.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.travity.de/redirect/?url=https://onlinecasino.us.org  http://www.quizpatente.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bromwellfireplaces.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fbcsurfside.org/System/UserProfile.asp?id=45009&func=signup&referer=https://onlinecasino.us.org  http://coldspringspic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.flttracking.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bransonairlines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jdmnissanparts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://9et.cn/kaixin/link.php?url=https://onlinecasino.us.org   http://classicgarageshoptalk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://liveintune.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fantasyworldwriter.com/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://www.cvtips.com/career_advice_forum/blog.php?b=382&goto=onlinecasino.us.org  http://rollerchains.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tierhotels.org/uzext/redirect.php?tab=gastkarten&location=https://onlinecasino.us.org \n \n \n \n \n \nhttp://www.borsaekrani.net/index.php?topic=250161.new#new\nhttp://pvmdeklaracija.lt/forum/viewtopic.php?f=2&t=613935&sid=49e5e3e6ec470394647f5f556dd9392b\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttps://meresparaxenes.com/2016/04/19/max-spiers-%cf%8c%ce%bb%ce%b7-%ce%b7-%ce%bc%ce%bf%cf%85%cf%83%ce%b9%ce%ba%ce%ae-%ce%b2%ce%b9%ce%bf%ce%bc%ce%b7%cf%87%ce%b1%ce%bd%ce%af%ce%b1-%cf%83%cf%84%ce%b7%cf%81%ce%af%ce%b6%ce%b5%cf%84%ce%b1/\nhttp://poliklinika5.ru/forum/viewtopic.php?f=2&t=1034518\n", "language": "Lisp", "metadata": {"date": 1551536883, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s511805929.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s511805929", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.99shlf.net/redirect.php?goto=onlinecasino.us.org  http://www.my511wv.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.99wys.cn/home/link.php?url=https://onlinecasino.us.org   http://www.federcomated.it/redirect.asp?link=https://onlinecasino.us.org  http://skinny-trunk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://link.sendbee.com/redirect.php?fid=6&tid=5792&goto=onlinecasino.us.org  http://xlogics.mybaylorhealth.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://radiojose.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://roomerpms.mx/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://experienceanacortes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://payabillfromanybank.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bormutato.hu/link.php?link=https://onlinecasino.us.org   http://www.antirecession.com/ct.ashx?id=80fb7bfa-0bcd-41e4-8a70-74a42e7c4bba&url=https://onlinecasino.us.org  http://reddeer.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.rockclimbing.com/cgi-bin/forum/gforum.cgi?url=http://www.onlinecasino.us.org/  http://graniteglobalventures.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hshsmedicalgroup.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.vr345.com/link.php?url=https://onlinecasino.us.org \nhttp://www.comune.agazzano.pc.it/servizi/certificati/redirect.aspx?url=https://onlinecasino.us.org  http://dogussportactivities.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.find-best-babes.com/movies/go.php?id=1244320_1&url=https://onlinecasino.us.org   http://europeanrivertravel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.chicagodnn.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://www.extreme-thumbz.com/cgi-bin/atc/out.cgi?id=33&u=https://onlinecasino.us.org  http://oekakichat.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jri.qvsd2.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://danielmager.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://massivescaleconsulting.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://live-ins.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ldshj.com/bbs/redirect.php?tid=1753&goto=onlinecasino.us.org   http://riverlandresort.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sscctv.com/rb/?r=eng&system=popup.login&iframe=Y&referer=https://onlinecasino.us.org   http://km13020.keymachine.de/php.php?a<>=<a+href=https://onlinecasino.us.org  http://www.ultraleggeri.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://songsurfing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://supplepowder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.keepthatcontact.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rescapinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://udx.cleartest.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sunmoods.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.propertyappraisals.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://oldtrailschool.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.trueprivate.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://montanadra.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://suissesport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.allied-publishing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://procovery.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gymtech.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rxadmix.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gethelppayingbills.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fabricfishes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dalniestrany.ru/go.php?redirect=https://onlinecasino.us.org  http://rowleywines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fluidgrow.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://smd-west.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://ms683.nitrado.net/webinterface/vendors/phpmyadmin/url.php?url=https://onlinecasino.us.org   http://panda-cafe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://operationshirt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stoneagepartners.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tuning-italia.it/forum/g.php?url=https://onlinecasino.us.org  http://livejones.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dairyprotect.net/__media__/js/netsoltrademark.php?d=&g2_returnName=Albumonlinecasino.us.org   http://chanri.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://idbupay.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://americolatino.tw/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kazus.ru/url.php?url=https://onlinecasino.us.org   http://heynicepictures.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://oaknoll.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://closeoutworld.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bt2.ccdome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://insurance.goldenarticles.net/go.php?url=https://onlinecasino.us.org   http://stemcell-ed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://stemcellcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wje.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dvdpro.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.travity.de/redirect/?url=https://onlinecasino.us.org  http://www.quizpatente.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bromwellfireplaces.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fbcsurfside.org/System/UserProfile.asp?id=45009&func=signup&referer=https://onlinecasino.us.org  http://coldspringspic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.flttracking.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bransonairlines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jdmnissanparts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://9et.cn/kaixin/link.php?url=https://onlinecasino.us.org   http://classicgarageshoptalk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://liveintune.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fantasyworldwriter.com/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://www.cvtips.com/career_advice_forum/blog.php?b=382&goto=onlinecasino.us.org  http://rollerchains.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tierhotels.org/uzext/redirect.php?tab=gastkarten&location=https://onlinecasino.us.org \n \n \n \n \n \nhttp://www.borsaekrani.net/index.php?topic=250161.new#new\nhttp://pvmdeklaracija.lt/forum/viewtopic.php?f=2&t=613935&sid=49e5e3e6ec470394647f5f556dd9392b\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttps://meresparaxenes.com/2016/04/19/max-spiers-%cf%8c%ce%bb%ce%b7-%ce%b7-%ce%bc%ce%bf%cf%85%cf%83%ce%b9%ce%ba%ce%ae-%ce%b2%ce%b9%ce%bf%ce%bc%ce%b7%cf%87%ce%b1%ce%bd%ce%af%ce%b1-%cf%83%cf%84%ce%b7%cf%81%ce%af%ce%b6%ce%b5%cf%84%ce%b1/\nhttp://poliklinika5.ru/forum/viewtopic.php?f=2&t=1034518\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7839, "cpu_time_ms": 99, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s196658150", "group_id": "codeNet:p03941", "input_text": "http://op-vlieland.nl/out.php?id=vh-poolster&appl=2&link=https://onlinecasino.us.org  http://cisnerosmanagementgroup.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://9ab.ihatemercuryinsurance.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://businessantivirus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://paytoc4gtpn5czl2.torpaysolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pushmsg.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://guardyourmemories.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://feedsort.com/articleView.php?id=324626&goto=https://onlinecasino.us.org   http://www.feedshuttle.com/go.aspx?url=https://onlinecasino.us.org \nhttp://jasmine-shasta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://31001677.r.msn.com/?ld=d3UbpU_nfVh1gQeoPg1KjBXTVUCUycCa8y7DGPG50vdoGYu6w5TwFtrE6FxdwdD2l_2B0WWH7xhaL0NJENnCza8th9Z1VfVqJdfP_ZGqfBlstXx7eU6bk90nkxcVbFHf5zBHifCkZmUqwUL8VEeEGuAyZZ5J0&u=https://onlinecasino.us.org   http://www.chapar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.globetrottingdesign.com/card.php?ID=29&type=eventi&urlPrec=onlinecasino.us.org  https://174101133.r.bat.bing.com/?ld=d3E8bZW5lPLrb8ke0hRFJkWTVUCUxsf0s95W460-avfBpeKs7-udkbz_CUKWhMtSVjxdMtaZ0Tuk_KxSWoz9TwgxOOTWX_ZfcdEmr6AauCNA_m80Bu4L0iMGW8EAMH7l6w1ZVWfK1CefHBG7CIOm9n21VqKZ9NCylIA-4iDu14Gx0erB8O&u=https://onlinecasino.us.org   http://organic-provisions.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bovolone.gov.it/servizi/certificati/redirect.aspx?url=https://onlinecasino.us.org  http://uvouch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.arauz.com.mx/salima/redir.asp?link=onlinecasino.us.org \nhttp://bankofirelandinternationalfinance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bocayoga.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vnu.wire-vac.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.qingbaoju.net/wp-content/themes/beginlts/inc/go.php?url=https://onlinecasino.us.org  http://urltorrents.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.news.shammil.com/redirect.php?link=https://onlinecasino.us.org  http://www.merkinvestments.com/enter/?url=https://onlinecasino.us.org  http://lince.ru/?goto=https://onlinecasino.us.org   http://jacobheglundrealty.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://tanglewire.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://caymanobservationtower.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://imgworldwide.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://evergladesfcu.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://isaacbrownnyc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://internationalhouston.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://qicdatatransport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ed-ca.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://whswrestling.leag1.com/Goto.asp?url=https://onlinecasino.us.org \nhttp://credsmart.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.pilzzeitung.ch/links/?links_id=2&goto=https://onlinecasino.us.org   http://nn-files.nnov.org/go?https://onlinecasino.us.org   http://www.tracewap.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://iyg.safestearpiercing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://greatattitude.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.forestshipping.cn/dialog_1.htm?arg=10160424&style=1&kflist=off&kf=dsl004,dsl003,dsl002&zdkf_type=1&lnk_overflow=1&language=zh-cn&charset=gbk&referer=https://onlinecasino.us.org  http://cn15.wang/tool/redirect.asp?id=424&url=https://onlinecasino.us.org   http://taquillaonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wsbs.yantian.gov.cn/yantian/uc/login?goto=https://onlinecasino.us.org  https://www.ovidinsights.com/url.php?docid=https://onlinecasino.us.org   https://www.name.com/leaving?redirect_url=https://onlinecasino.us.org/   http://bagelmuseum.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://safetynational.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kif-od.com/go?https://onlinecasino.us.org  http://ongameaffiliates.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ossama.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://germantownoncology.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://compucor.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nastygranny.ws/cgi-bin/atc/out.cgi?id=14&u=https://onlinecasino.us.org   http://votetobanmenthol.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.acro3d.com/public/joomla/index.php?option=com_content&view=article&id=123:breitling10&catid=44:eventosimac&itemid=62&fromurl=onlinecasino.us.org  http://classroombeautiful.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.renshooyenga.nl/test/phpinfo.php?a<>=<a href=https://onlinecasino.us.org  http://modernshipbuilding.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://elitetoronto.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://desu.moy.su/go?https://onlinecasino.us.org \nhttp://www.rushcommerce.com/click.php?bannerid=449&partner=5668&promo=&url=http://www.onlinecasino.us.org  http://xoroshiy.ru/engine/go.php?url=onlinecasino.us.org   http://www.arabianvehicles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://usatodaypix.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nathandevore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.gaycoupletube.com/sr/out.php?l=0s.2.30.3366.2505&u=/onlinecasino.us.org  https://www.hualalaiclub.com/default.aspx?p=TrackHyperlink&url=https://onlinecasino.us.org  http://thebestofthebest.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mammaklær.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bitobi.org/redirect?url=https://onlinecasino.us.org  http://weheartmovies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mydcast.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.european-cruise-guide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://saffroncollectibles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://riskstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fedmechanical.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cleanmailserver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://prussing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.noeuthanasia.org.au/r?u=https://onlinecasino.us.org  https://llm-guide.com/link/http:/www.fachzeitungen.de/pressemeldungen/en/goto/https://onlinecasino.us.org   http://www.kea.org/redirect.asp?q_url=https://onlinecasino.us.org   http://dqe.railsale.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.trumpinwhitehouse.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ufcfightnight.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://calculustutor.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://168geek.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.whmyys.com/go.asp?url=https://onlinecasino.us.org \n \n \n \n \n \nhttp://shinobinomorto.xaa.pl/viewtopic.php?f=35&t=11227\nhttp://gwforum.com.br/viewtopic.php?f=18&t=257403\nhttps://dgrreklam.com/staff/index.php?topic=97320.new#new\nhttp://school9m.org.ru/node/1#comment-100131\nhttps://kokifilmaziureti.lt/2016/07/24/we-need-to-talk-about-kevin-2011/\n", "language": "Lisp", "metadata": {"date": 1551501518, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s196658150.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s196658150", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://op-vlieland.nl/out.php?id=vh-poolster&appl=2&link=https://onlinecasino.us.org  http://cisnerosmanagementgroup.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://9ab.ihatemercuryinsurance.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://businessantivirus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://paytoc4gtpn5czl2.torpaysolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pushmsg.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://guardyourmemories.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://feedsort.com/articleView.php?id=324626&goto=https://onlinecasino.us.org   http://www.feedshuttle.com/go.aspx?url=https://onlinecasino.us.org \nhttp://jasmine-shasta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://31001677.r.msn.com/?ld=d3UbpU_nfVh1gQeoPg1KjBXTVUCUycCa8y7DGPG50vdoGYu6w5TwFtrE6FxdwdD2l_2B0WWH7xhaL0NJENnCza8th9Z1VfVqJdfP_ZGqfBlstXx7eU6bk90nkxcVbFHf5zBHifCkZmUqwUL8VEeEGuAyZZ5J0&u=https://onlinecasino.us.org   http://www.chapar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.globetrottingdesign.com/card.php?ID=29&type=eventi&urlPrec=onlinecasino.us.org  https://174101133.r.bat.bing.com/?ld=d3E8bZW5lPLrb8ke0hRFJkWTVUCUxsf0s95W460-avfBpeKs7-udkbz_CUKWhMtSVjxdMtaZ0Tuk_KxSWoz9TwgxOOTWX_ZfcdEmr6AauCNA_m80Bu4L0iMGW8EAMH7l6w1ZVWfK1CefHBG7CIOm9n21VqKZ9NCylIA-4iDu14Gx0erB8O&u=https://onlinecasino.us.org   http://organic-provisions.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bovolone.gov.it/servizi/certificati/redirect.aspx?url=https://onlinecasino.us.org  http://uvouch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.arauz.com.mx/salima/redir.asp?link=onlinecasino.us.org \nhttp://bankofirelandinternationalfinance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bocayoga.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vnu.wire-vac.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.qingbaoju.net/wp-content/themes/beginlts/inc/go.php?url=https://onlinecasino.us.org  http://urltorrents.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.news.shammil.com/redirect.php?link=https://onlinecasino.us.org  http://www.merkinvestments.com/enter/?url=https://onlinecasino.us.org  http://lince.ru/?goto=https://onlinecasino.us.org   http://jacobheglundrealty.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://tanglewire.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://caymanobservationtower.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://imgworldwide.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://evergladesfcu.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://isaacbrownnyc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://internationalhouston.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://qicdatatransport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ed-ca.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://whswrestling.leag1.com/Goto.asp?url=https://onlinecasino.us.org \nhttp://credsmart.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.pilzzeitung.ch/links/?links_id=2&goto=https://onlinecasino.us.org   http://nn-files.nnov.org/go?https://onlinecasino.us.org   http://www.tracewap.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://iyg.safestearpiercing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://greatattitude.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.forestshipping.cn/dialog_1.htm?arg=10160424&style=1&kflist=off&kf=dsl004,dsl003,dsl002&zdkf_type=1&lnk_overflow=1&language=zh-cn&charset=gbk&referer=https://onlinecasino.us.org  http://cn15.wang/tool/redirect.asp?id=424&url=https://onlinecasino.us.org   http://taquillaonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wsbs.yantian.gov.cn/yantian/uc/login?goto=https://onlinecasino.us.org  https://www.ovidinsights.com/url.php?docid=https://onlinecasino.us.org   https://www.name.com/leaving?redirect_url=https://onlinecasino.us.org/   http://bagelmuseum.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://safetynational.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kif-od.com/go?https://onlinecasino.us.org  http://ongameaffiliates.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ossama.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://germantownoncology.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://compucor.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nastygranny.ws/cgi-bin/atc/out.cgi?id=14&u=https://onlinecasino.us.org   http://votetobanmenthol.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.acro3d.com/public/joomla/index.php?option=com_content&view=article&id=123:breitling10&catid=44:eventosimac&itemid=62&fromurl=onlinecasino.us.org  http://classroombeautiful.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.renshooyenga.nl/test/phpinfo.php?a<>=<a href=https://onlinecasino.us.org  http://modernshipbuilding.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://elitetoronto.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://desu.moy.su/go?https://onlinecasino.us.org \nhttp://www.rushcommerce.com/click.php?bannerid=449&partner=5668&promo=&url=http://www.onlinecasino.us.org  http://xoroshiy.ru/engine/go.php?url=onlinecasino.us.org   http://www.arabianvehicles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://usatodaypix.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nathandevore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.gaycoupletube.com/sr/out.php?l=0s.2.30.3366.2505&u=/onlinecasino.us.org  https://www.hualalaiclub.com/default.aspx?p=TrackHyperlink&url=https://onlinecasino.us.org  http://thebestofthebest.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mammaklær.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bitobi.org/redirect?url=https://onlinecasino.us.org  http://weheartmovies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mydcast.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.european-cruise-guide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://saffroncollectibles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://riskstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fedmechanical.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cleanmailserver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://prussing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.noeuthanasia.org.au/r?u=https://onlinecasino.us.org  https://llm-guide.com/link/http:/www.fachzeitungen.de/pressemeldungen/en/goto/https://onlinecasino.us.org   http://www.kea.org/redirect.asp?q_url=https://onlinecasino.us.org   http://dqe.railsale.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.trumpinwhitehouse.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ufcfightnight.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://calculustutor.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://168geek.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.whmyys.com/go.asp?url=https://onlinecasino.us.org \n \n \n \n \n \nhttp://shinobinomorto.xaa.pl/viewtopic.php?f=35&t=11227\nhttp://gwforum.com.br/viewtopic.php?f=18&t=257403\nhttps://dgrreklam.com/staff/index.php?topic=97320.new#new\nhttp://school9m.org.ru/node/1#comment-100131\nhttps://kokifilmaziureti.lt/2016/07/24/we-need-to-talk-about-kevin-2011/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8021, "cpu_time_ms": 113, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s829266941", "group_id": "codeNet:p03941", "input_text": "http://expo.stroit.ru/button.redirect?url=https://onlinecasino.us.org  http://www.majorkey1920ksscv.org/gbook/go.php?url=https://onlinecasino.us.org   http://analyticalbotanicallabs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://ggso.ml/url?q=https://onlinecasino.us.org  http://obrc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gilmercountryclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://drycleanerforsale.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://visualworks-training.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.nisailing.co.uk/newsfeed/feed2js/feed2js.php?src=https://onlinecasino.us.org \nhttps://www.192ly.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://www.shorthairstylesblog.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.culverco.com/phpScripts/redirect.php??s=https://onlinecasino.us.org   http://previewtunes.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thefortworthprocessserver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ultra-4k-netflix.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.chwq.net/goto.aspx?link=https://onlinecasino.us.org  http://mediatory.ru/redirect.phtml?https://onlinecasino.us.org   http://xmg.davidkwinter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://fiatpandaracer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tchawillson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://liddellsteelelaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://socialsecurityfacts.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://therightamountof.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://fujitsu-online-shop.ru/bitrix/rk.php?id=24&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B24%5D+%5Btop_right%5D+Windows+7&goto=https://onlinecasino.us.org  http://starfish-seminars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.weightlossbanter.net/showthread.php?goto=onlinecasino.us.org   http://ganznancy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://jyi.lycaphone.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://20x.whatisso.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mymoneydata.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://michaelcaughill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.xxxyfilms.com/cgi-bin/out.cgi?t=105&tag=toplist&link=https://onlinecasino.us.org   http://current-kid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://angelislandrecords.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://newenglandbeerfest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myhealthbooster.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://esdpackaging.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mrkaraoke.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kapahuluhawaii.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ibuenacasa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://documentsjaunes.free.fr/portail/1-formatik/upload/goto.php?ID=3d57ff66d6e94a7f667d6a9abdd7485b1366551093&url=https://onlinecasino.us.org   http://dachsdev.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mypayrecords.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://michaelsingh.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://newwavevacation.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://forum.porres.org/DLIS/frankel/go.php?url=https://onlinecasino.us.org  http://ms.sbrfeeds.com/redirect-proxy/redirect/?url=https://onlinecasino.us.org   http://www.hoerspass.net/blog/blog.php?b=13&goto=onlinecasino.us.org   http://weather.j-walker.jp/index.php?url=https://onlinecasino.us.org  http://westerlypawcatuckpress.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://service.meltwaternews.com/mnews/redirect.html?docId=3601414654&userId=1594102&cId=444827&agentId=729011&type=2&s=370&url=https://onlinecasino.us.org  http://vericord.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cmdiet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ms4clicks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sensations4women.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.accunet.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://www.jayhawkrealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://skillbuildingmastery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.uniquesexygirls.net/cgi-bin/atc/out.cgi?id=43&u=https://onlinecasino.us.org   http://hdiwiki.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rincap.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.torontofootballclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://nylon.link/link.php?i=5538c637983a1&m=551128718e55c&guid=ON&url=https://onlinecasino.us.org \nhttp://ulambaligroups.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marylanddirectvaloans.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://areyoubisexual.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sunlandlogistics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dkporno.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://labo.anything-navi.net/s/redirect.php?u=https://onlinecasino.us.org  http://flyingfishyachts.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ilhousegop.org/r?u=https://onlinecasino.us.org   http://ashcraftgolf.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://zipcity-usa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://velocetraining.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://businessarticle.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://urathletics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://neorainc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://jungschar.ch/links/goto/?url=https://onlinecasino.us.org  http://firemagicgasgrill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trinityplano.org/__media__/js/trademark.php?d=onlinecasino.us.org   http://instantcms2.ru/redirect?url=https://onlinecasino.us.org/ \nhttp://tools.ppn-ultimate.fr/redirect.php?url=https://onlinecasino.us.org  http://dailypromocoupons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.alistaircarmichael.co.uk/r?u=https://onlinecasino.us.org   http://nycdiscountrx.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lorta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.movementdisorder.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://letstalkjobs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hillring.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.willesborough.org.uk/goto-link.php?link_id=19&url=https://onlinecasino.us.org \n \n \n \n \n \nhttp://walbrofuelpumps.com/forum/viewtopic.php?pid=513494#p513494\nhttps://jazzycats.org/?contact-form-id=27229&contact-form-sent=132043&contact-form-hash=184e4d9da75354ec1a6db97761bfb1e84d9e5f46&_wpnonce=3e17b2fd35\nhttps://www.prakob.com/index.php?topic=80845.new#new\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=78857&p=127078#p127078\nhttp://www.leopoldsdorf-wien.info/phpbb/viewtopic.php?f=2&t=464996\n", "language": "Lisp", "metadata": {"date": 1551495470, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s829266941.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s829266941", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://expo.stroit.ru/button.redirect?url=https://onlinecasino.us.org  http://www.majorkey1920ksscv.org/gbook/go.php?url=https://onlinecasino.us.org   http://analyticalbotanicallabs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://ggso.ml/url?q=https://onlinecasino.us.org  http://obrc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gilmercountryclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://drycleanerforsale.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://visualworks-training.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.nisailing.co.uk/newsfeed/feed2js/feed2js.php?src=https://onlinecasino.us.org \nhttps://www.192ly.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://www.shorthairstylesblog.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.culverco.com/phpScripts/redirect.php??s=https://onlinecasino.us.org   http://previewtunes.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thefortworthprocessserver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ultra-4k-netflix.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.chwq.net/goto.aspx?link=https://onlinecasino.us.org  http://mediatory.ru/redirect.phtml?https://onlinecasino.us.org   http://xmg.davidkwinter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://fiatpandaracer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tchawillson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://liddellsteelelaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://socialsecurityfacts.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://therightamountof.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://fujitsu-online-shop.ru/bitrix/rk.php?id=24&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B24%5D+%5Btop_right%5D+Windows+7&goto=https://onlinecasino.us.org  http://starfish-seminars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.weightlossbanter.net/showthread.php?goto=onlinecasino.us.org   http://ganznancy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://jyi.lycaphone.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://20x.whatisso.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mymoneydata.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://michaelcaughill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.xxxyfilms.com/cgi-bin/out.cgi?t=105&tag=toplist&link=https://onlinecasino.us.org   http://current-kid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://angelislandrecords.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://newenglandbeerfest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myhealthbooster.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://esdpackaging.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mrkaraoke.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kapahuluhawaii.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ibuenacasa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://documentsjaunes.free.fr/portail/1-formatik/upload/goto.php?ID=3d57ff66d6e94a7f667d6a9abdd7485b1366551093&url=https://onlinecasino.us.org   http://dachsdev.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mypayrecords.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://michaelsingh.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://newwavevacation.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://forum.porres.org/DLIS/frankel/go.php?url=https://onlinecasino.us.org  http://ms.sbrfeeds.com/redirect-proxy/redirect/?url=https://onlinecasino.us.org   http://www.hoerspass.net/blog/blog.php?b=13&goto=onlinecasino.us.org   http://weather.j-walker.jp/index.php?url=https://onlinecasino.us.org  http://westerlypawcatuckpress.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://service.meltwaternews.com/mnews/redirect.html?docId=3601414654&userId=1594102&cId=444827&agentId=729011&type=2&s=370&url=https://onlinecasino.us.org  http://vericord.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cmdiet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ms4clicks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sensations4women.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.accunet.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://www.jayhawkrealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://skillbuildingmastery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.uniquesexygirls.net/cgi-bin/atc/out.cgi?id=43&u=https://onlinecasino.us.org   http://hdiwiki.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rincap.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.torontofootballclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://nylon.link/link.php?i=5538c637983a1&m=551128718e55c&guid=ON&url=https://onlinecasino.us.org \nhttp://ulambaligroups.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marylanddirectvaloans.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://areyoubisexual.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sunlandlogistics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dkporno.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://labo.anything-navi.net/s/redirect.php?u=https://onlinecasino.us.org  http://flyingfishyachts.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ilhousegop.org/r?u=https://onlinecasino.us.org   http://ashcraftgolf.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://zipcity-usa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://velocetraining.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://businessarticle.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://urathletics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://neorainc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://jungschar.ch/links/goto/?url=https://onlinecasino.us.org  http://firemagicgasgrill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trinityplano.org/__media__/js/trademark.php?d=onlinecasino.us.org   http://instantcms2.ru/redirect?url=https://onlinecasino.us.org/ \nhttp://tools.ppn-ultimate.fr/redirect.php?url=https://onlinecasino.us.org  http://dailypromocoupons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.alistaircarmichael.co.uk/r?u=https://onlinecasino.us.org   http://nycdiscountrx.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lorta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.movementdisorder.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://letstalkjobs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hillring.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.willesborough.org.uk/goto-link.php?link_id=19&url=https://onlinecasino.us.org \n \n \n \n \n \nhttp://walbrofuelpumps.com/forum/viewtopic.php?pid=513494#p513494\nhttps://jazzycats.org/?contact-form-id=27229&contact-form-sent=132043&contact-form-hash=184e4d9da75354ec1a6db97761bfb1e84d9e5f46&_wpnonce=3e17b2fd35\nhttps://www.prakob.com/index.php?topic=80845.new#new\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=78857&p=127078#p127078\nhttp://www.leopoldsdorf-wien.info/phpbb/viewtopic.php?f=2&t=464996\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7913, "cpu_time_ms": 41, "memory_kb": 5344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s350994076", "group_id": "codeNet:p03941", "input_text": "http://joseviejo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://ultimatetvstudio.com/seo/cy-pr-speed-website-analyzer/redirect.php?url=https://onlinecasino.us.org   http://silinvestments.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hassy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bhaffiliate.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brkhsarealty.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://autodirectinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mkmp.su/ext_link?url=https://onlinecasino.us.org   https://daysinnscottsdale.com/redirect.php?l=https://onlinecasino.us.org \nhttp://www.frontrunnerzmotorcycleclub.com/frmc/modules.php?name=NukeWrap&page=https://onlinecasino.us.org/  http://stjohnbasics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vcfarms.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://bbs.powerapple.com/redirect.php?goto=onlinecasino.us.org  http://chezschnitz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://naturalhomegoods.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.acicorkusa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://buckeyestatesports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.alexsgrillandicecream.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://tnmqewyjrkehgfa.parkcitysoccer.org/Goto.asp?url=https://onlinecasino.us.org  http://egao21.com/search/rank.cgi?mode=link&id=1622&url=https://onlinecasino.us.org   https://www.cuinsight.com/ad/index.php?redirect_to=http%3A%2F%2Fwww.rochdalegroup.com+&url=https://onlinecasino.us.org   http://yagodovod.com/redirect?url=https://onlinecasino.us.org  http://jordan720.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crmchallenge.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://28899.r.bat.bing.com/?ld=d3LRe81_Qp6GC_BZIno_12WzVUCUwf6TBYa9d8JGJv9xtYDB_DEjFS4EsOUnEN9jS07O4zxYfdW-ikSTpEkp9KvVrMqrhJKoioT3ttOMH4W3733Sc43h6YWbvULG6mfzkq6dJGVQ-I48RO9HCpWW__C_6H3cBY9o1wXe6cnrI1QnLs04sQ&u=https://onlinecasino.us.org  http://manhoodreclaimed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://centroscheel.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.imperial-info.net/link?apps=16&idl=3&idp=271&idt=16&url=https://onlinecasino.us.org  http://governanceleaders.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.peoplestrustcreditunion.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://std-dating-websites.no1reviews.com/goto.php?url=https://onlinecasino.us.org  http://openedprojects.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://referralsuperstar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://humorpig.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bczxa.co/2048/goto.php?url=onlinecasino.us.org   http://takeanorphandogtoworkday.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.oldsweet.com/crtr/cgi/out.cgi?id=59&tag=top&trade=https://onlinecasino.us.org  http://qclasers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fonbetgames.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://davidjargiello.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.nuevoexplorando.edicionessm.cl/redirect.php?url=onlinecasino.us.org   http://teambeach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vkontaktemp3.ru/away.php?https://onlinecasino.us.org  http://khunjoeudonthani.com/goto/https://onlinecasino.us.org   http://bendpakparts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mclaughlinsculpturestudio.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.edu11.net/link.php?url=https://onlinecasino.us.org   http://tabachok.net/redirect.php?url=https://onlinecasino.us.org   http://alpineautobody.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cottagegrovecityguide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tommychrist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://muanimal.ga/?go=click&c=97&n=-2&e=1&g=3&r=1265023&u=https://onlinecasino.us.org  http://taxi107000.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nxtique.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://blueskytower.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://runningman.66rt.com/redirect.php?goto=onlinecasino.us.org   http://newspm.com.br/r.php?r=https://onlinecasino.us.org   http://idiff.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.z2zv.com/cgcms/member/register?SiteID=122&referer=https://onlinecasino.us.org   http://www.j-college.ru/go.php?url=https://onlinecasino.us.org  http://www.talentus.be/linkedin/authenticate/?referer=https://onlinecasino.us.org  http://anthonyglenn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://olympicposter.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ypb.greatfurniturebuys.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://toystorepizza.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yanbal-international.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.blackshemalevideo.com/?go=click&c=3&n=70&e=0&g=3&r=536522&u=https://onlinecasino.us.org  http://ali-institute.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://maximusminimus.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.danielromualdezarchitecture.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sidewinderstudios.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ajmpbegsff.ejnpcj.1.gsr.anonimizing.com/home287/createSession?referer=https://onlinecasino.us.org \nhttp://www.lib.superforum.org.ru/redirect.php?url=onlinecasino.us.org  http://avosmotoneiges.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lairdstewart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://northhillssurgerycenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://go-nsg.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://avto-mk.kia.ru/bitrix/rk.php?id=674&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B674%5D+%5BNEW_INDEX_BANNERS%5D+%C3%EE%E4+%C1%C5%C7+%EF%EB%E0%F2%E5%E6%E5%E9_%E4%E5%EA%E0%E1%F0%FC+2017&goto=onlinecasino.us.org  http://morescape.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.learnalberta.ca/Redirector/Redirect.aspx?url=https://onlinecasino.us.org   http://austinexaminer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://toywc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gh.videodw.com/url?q=https://onlinecasino.us.org   http://www.eastmorelandhospital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://berlin-r.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jupiteralarms.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://magagne.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lyceum-theater.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://miretirementaccounts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.multiple-list.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://compareaquatics.com/forum/viewtopic.php?f=12&t=133540\nhttp://www.robaloboatowners.com/RBO/viewtopic.php?f=24&t=1699390\nhttp://www.rmlalliance.com/forum/index.php?topic=62090.new#new\nhttp://2tarke.com/forum/showthread.php?tid=18360\nhttp://xn--80aihgzecn.xn--p1ai/index.php?/topic/199982-emoticon-gerak-blackberry-messenger/\n", "language": "Lisp", "metadata": {"date": 1549563279, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s350994076.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s350994076", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://joseviejo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://ultimatetvstudio.com/seo/cy-pr-speed-website-analyzer/redirect.php?url=https://onlinecasino.us.org   http://silinvestments.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hassy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bhaffiliate.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brkhsarealty.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://autodirectinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mkmp.su/ext_link?url=https://onlinecasino.us.org   https://daysinnscottsdale.com/redirect.php?l=https://onlinecasino.us.org \nhttp://www.frontrunnerzmotorcycleclub.com/frmc/modules.php?name=NukeWrap&page=https://onlinecasino.us.org/  http://stjohnbasics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vcfarms.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://bbs.powerapple.com/redirect.php?goto=onlinecasino.us.org  http://chezschnitz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://naturalhomegoods.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.acicorkusa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://buckeyestatesports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.alexsgrillandicecream.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://tnmqewyjrkehgfa.parkcitysoccer.org/Goto.asp?url=https://onlinecasino.us.org  http://egao21.com/search/rank.cgi?mode=link&id=1622&url=https://onlinecasino.us.org   https://www.cuinsight.com/ad/index.php?redirect_to=http%3A%2F%2Fwww.rochdalegroup.com+&url=https://onlinecasino.us.org   http://yagodovod.com/redirect?url=https://onlinecasino.us.org  http://jordan720.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crmchallenge.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://28899.r.bat.bing.com/?ld=d3LRe81_Qp6GC_BZIno_12WzVUCUwf6TBYa9d8JGJv9xtYDB_DEjFS4EsOUnEN9jS07O4zxYfdW-ikSTpEkp9KvVrMqrhJKoioT3ttOMH4W3733Sc43h6YWbvULG6mfzkq6dJGVQ-I48RO9HCpWW__C_6H3cBY9o1wXe6cnrI1QnLs04sQ&u=https://onlinecasino.us.org  http://manhoodreclaimed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://centroscheel.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.imperial-info.net/link?apps=16&idl=3&idp=271&idt=16&url=https://onlinecasino.us.org  http://governanceleaders.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.peoplestrustcreditunion.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://std-dating-websites.no1reviews.com/goto.php?url=https://onlinecasino.us.org  http://openedprojects.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://referralsuperstar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://humorpig.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bczxa.co/2048/goto.php?url=onlinecasino.us.org   http://takeanorphandogtoworkday.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.oldsweet.com/crtr/cgi/out.cgi?id=59&tag=top&trade=https://onlinecasino.us.org  http://qclasers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fonbetgames.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://davidjargiello.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.nuevoexplorando.edicionessm.cl/redirect.php?url=onlinecasino.us.org   http://teambeach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vkontaktemp3.ru/away.php?https://onlinecasino.us.org  http://khunjoeudonthani.com/goto/https://onlinecasino.us.org   http://bendpakparts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mclaughlinsculpturestudio.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.edu11.net/link.php?url=https://onlinecasino.us.org   http://tabachok.net/redirect.php?url=https://onlinecasino.us.org   http://alpineautobody.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cottagegrovecityguide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tommychrist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://muanimal.ga/?go=click&c=97&n=-2&e=1&g=3&r=1265023&u=https://onlinecasino.us.org  http://taxi107000.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nxtique.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://blueskytower.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://runningman.66rt.com/redirect.php?goto=onlinecasino.us.org   http://newspm.com.br/r.php?r=https://onlinecasino.us.org   http://idiff.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.z2zv.com/cgcms/member/register?SiteID=122&referer=https://onlinecasino.us.org   http://www.j-college.ru/go.php?url=https://onlinecasino.us.org  http://www.talentus.be/linkedin/authenticate/?referer=https://onlinecasino.us.org  http://anthonyglenn.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://olympicposter.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ypb.greatfurniturebuys.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://toystorepizza.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yanbal-international.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.blackshemalevideo.com/?go=click&c=3&n=70&e=0&g=3&r=536522&u=https://onlinecasino.us.org  http://ali-institute.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://maximusminimus.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.danielromualdezarchitecture.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sidewinderstudios.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ajmpbegsff.ejnpcj.1.gsr.anonimizing.com/home287/createSession?referer=https://onlinecasino.us.org \nhttp://www.lib.superforum.org.ru/redirect.php?url=onlinecasino.us.org  http://avosmotoneiges.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lairdstewart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://northhillssurgerycenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://go-nsg.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://avto-mk.kia.ru/bitrix/rk.php?id=674&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B674%5D+%5BNEW_INDEX_BANNERS%5D+%C3%EE%E4+%C1%C5%C7+%EF%EB%E0%F2%E5%E6%E5%E9_%E4%E5%EA%E0%E1%F0%FC+2017&goto=onlinecasino.us.org  http://morescape.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.learnalberta.ca/Redirector/Redirect.aspx?url=https://onlinecasino.us.org   http://austinexaminer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://toywc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gh.videodw.com/url?q=https://onlinecasino.us.org   http://www.eastmorelandhospital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://berlin-r.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jupiteralarms.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://magagne.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lyceum-theater.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://miretirementaccounts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.multiple-list.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://compareaquatics.com/forum/viewtopic.php?f=12&t=133540\nhttp://www.robaloboatowners.com/RBO/viewtopic.php?f=24&t=1699390\nhttp://www.rmlalliance.com/forum/index.php?topic=62090.new#new\nhttp://2tarke.com/forum/showthread.php?tid=18360\nhttp://xn--80aihgzecn.xn--p1ai/index.php?/topic/199982-emoticon-gerak-blackberry-messenger/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7984, "cpu_time_ms": 86, "memory_kb": 8672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s087789420", "group_id": "codeNet:p03941", "input_text": "http://justmybag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.boule-dauborn.de/redir.php?url=https://onlinecasino.us.org   http://bayareawellnesscoach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://choosethespirit.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fqd.yogatreks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://iran-ajor.ir/redirect/redirect.php?url=https://onlinecasino.us.org  http://iran180.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://alibabacapital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kosairchildrenhospitalfoundation.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://pubparty.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://indianhillsaustin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.valuedentures.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myowndorm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wristids.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ingridgrudke.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hollywoodglobeawards.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://d-guvenlik.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ourholidaycenter.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://kiefer-tech.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://offender-monitoring.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.rapidproxylist.org/out.php??s=https://onlinecasino.us.org   http://www.devrekaniziraat.com/index.php?option=com_easybookreloaded&view=easybookreloaded&Itemid=110&fromurl=onlinecasino.us.org  http://712doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.horeca-expo.ru/bitrix/redirect.php?event1=banner_out&event2=horeca16&event3=sdexpert.ru&goto=https://onlinecasino.us.org  http://periophome.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://employeecheckup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.smbrussels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.pistoiafutura.it/Dati/visitexe.asp?IDDato=40138&IDUS=undefined&goto=https://onlinecasino.us.org  http://mylingnan.com/bbs/redirect.php?goto=onlinecasino.us.org   http://www.bsansw.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://www.agropijaca.com/goto.php?link=https://onlinecasino.us.org  http://www.tribalddb.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.getemgone.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://checktube.com/?go=click&c=121&n=106&e=0&g=3&r=91900933&u=https://onlinecasino.us.org  http://willkids.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://acnee.awardspace.com/go.php?url=https://onlinecasino.us.org \nhttp://bioforward.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aldata.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elisailanadesigns.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://penhallgroundpenetratingradar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://forumed.org/doc/sitomed.php?url=https://onlinecasino.us.org   http://ikazu.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cdc.thehcn.net/redir.php?url=https://onlinecasino.us.org  http://keepmyinfosafe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://survivaltacticalkits.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://magellanggps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://temporarymail.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://casinoazresortandspa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://ffurnass.tk/forum/hacking-connaissances-avanc%C3%A9es/local/crack-wifi/963-python-crack-livebox-sagem-router-fast-3304-3464-3504?goto=onlinecasino.us.org  http://discoveredatedc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cloud.clefgroup.com/help_mail/_m/index.php?a=free_page/goto_mobile&referer=https://onlinecasino.us.org  http://libertydevo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://uniquelivesandexperiences.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://askoch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wbidbroker.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://ww.scancorp.dk/nyheder/redirect.php?artid=12791185&link=https://onlinecasino.us.org   http://e-powerinvesting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.skipass.com/cgi-local/clickcount.pl?url=https://onlinecasino.us.org  http://www.hairytaco.com/cgi-bin/atx/out.cgi?id=28&trade=https://onlinecasino.us.org   http://rawbaptist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jetreacares.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://riseupantibiotic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bartlesvillepeople.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://canada-trademark-law.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.frankievalli4seasons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dingli.gov.mt/ExternalLink.aspx?url=https://onlinecasino.us.org/   http://imlivecash.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sanantoniocreditunion.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://maenergyloan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://spacepoints.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nordwandx.gq/go.php?track=dhNMfHoMY29EfEYE&url=https://onlinecasino.us.org   http://tasertimes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.escortguide.co.uk/go?https://onlinecasino.us.org  https://www.radionomy.com/en/radio/wsje-db-smoothjazzexpressions/export/?version=1.1&url=wsje-db-smoothjazzexpressions&type=medium&autoplay=0&color1=%23000000&color2=%23ffffff&language=en&referer=https://onlinecasino.us.org   https://amerigo.net/?fullSiteView=Y&go=https://onlinecasino.us.org   http://careerlogics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://liaudiology.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://suugaan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://zeroclosingcosthome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kennethbdartfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://prolaborthotics.com.gravitatehosting.com/Default.aspx?tabid=406&ctl=EmailPage&mid=649&tp=spam&ttl=Vacuum-Formed+vs.+Direct-Milled+Workshop&u=https://onlinecasino.us.org \nhttp://asergisoutsourcing.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://etw.biomarin-europe.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://calaproducts.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cpanel.surfcareer.com/careerforum/redirect.php?tid=2445&goto=onlinecasino.us.org  http://25centmovies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pinecroftwines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://localfocusllc.media/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://addictionsucks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cakemonster.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://community.alahlyegypt.com/forum/main-forum/141100-french-twist-hairstyle-pictures\nhttp://theposhmedia.com/forum/showthread.php?tid=121241\nhttp://forum.gsm-rom.com/showthread.php?1197656-captain-marvel-comicvine&p=1417297#post1417297\nhttp://mamnontrithuc.edu.vn/forum/showthread.php?19595-Actual-double-entry-journal-kite-runner&p=70777#post70777\nhttps://entmuttert.com/2016/01/24/einfache-rechnung-kein-umgangdann-kein-unterhalt/\n", "language": "Lisp", "metadata": {"date": 1549557619, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s087789420.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s087789420", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://justmybag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.boule-dauborn.de/redir.php?url=https://onlinecasino.us.org   http://bayareawellnesscoach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://choosethespirit.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fqd.yogatreks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://iran-ajor.ir/redirect/redirect.php?url=https://onlinecasino.us.org  http://iran180.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://alibabacapital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kosairchildrenhospitalfoundation.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://pubparty.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://indianhillsaustin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.valuedentures.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myowndorm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wristids.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ingridgrudke.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hollywoodglobeawards.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://d-guvenlik.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ourholidaycenter.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://kiefer-tech.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://offender-monitoring.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.rapidproxylist.org/out.php??s=https://onlinecasino.us.org   http://www.devrekaniziraat.com/index.php?option=com_easybookreloaded&view=easybookreloaded&Itemid=110&fromurl=onlinecasino.us.org  http://712doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.horeca-expo.ru/bitrix/redirect.php?event1=banner_out&event2=horeca16&event3=sdexpert.ru&goto=https://onlinecasino.us.org  http://periophome.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://employeecheckup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.smbrussels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.pistoiafutura.it/Dati/visitexe.asp?IDDato=40138&IDUS=undefined&goto=https://onlinecasino.us.org  http://mylingnan.com/bbs/redirect.php?goto=onlinecasino.us.org   http://www.bsansw.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://www.agropijaca.com/goto.php?link=https://onlinecasino.us.org  http://www.tribalddb.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.getemgone.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://checktube.com/?go=click&c=121&n=106&e=0&g=3&r=91900933&u=https://onlinecasino.us.org  http://willkids.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://acnee.awardspace.com/go.php?url=https://onlinecasino.us.org \nhttp://bioforward.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aldata.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elisailanadesigns.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://penhallgroundpenetratingradar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://forumed.org/doc/sitomed.php?url=https://onlinecasino.us.org   http://ikazu.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cdc.thehcn.net/redir.php?url=https://onlinecasino.us.org  http://keepmyinfosafe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://survivaltacticalkits.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://magellanggps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://temporarymail.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://casinoazresortandspa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://ffurnass.tk/forum/hacking-connaissances-avanc%C3%A9es/local/crack-wifi/963-python-crack-livebox-sagem-router-fast-3304-3464-3504?goto=onlinecasino.us.org  http://discoveredatedc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cloud.clefgroup.com/help_mail/_m/index.php?a=free_page/goto_mobile&referer=https://onlinecasino.us.org  http://libertydevo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://uniquelivesandexperiences.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://askoch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wbidbroker.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://ww.scancorp.dk/nyheder/redirect.php?artid=12791185&link=https://onlinecasino.us.org   http://e-powerinvesting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.skipass.com/cgi-local/clickcount.pl?url=https://onlinecasino.us.org  http://www.hairytaco.com/cgi-bin/atx/out.cgi?id=28&trade=https://onlinecasino.us.org   http://rawbaptist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jetreacares.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://riseupantibiotic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bartlesvillepeople.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://canada-trademark-law.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.frankievalli4seasons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dingli.gov.mt/ExternalLink.aspx?url=https://onlinecasino.us.org/   http://imlivecash.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sanantoniocreditunion.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://maenergyloan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://spacepoints.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nordwandx.gq/go.php?track=dhNMfHoMY29EfEYE&url=https://onlinecasino.us.org   http://tasertimes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.escortguide.co.uk/go?https://onlinecasino.us.org  https://www.radionomy.com/en/radio/wsje-db-smoothjazzexpressions/export/?version=1.1&url=wsje-db-smoothjazzexpressions&type=medium&autoplay=0&color1=%23000000&color2=%23ffffff&language=en&referer=https://onlinecasino.us.org   https://amerigo.net/?fullSiteView=Y&go=https://onlinecasino.us.org   http://careerlogics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://liaudiology.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://suugaan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://zeroclosingcosthome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kennethbdartfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://prolaborthotics.com.gravitatehosting.com/Default.aspx?tabid=406&ctl=EmailPage&mid=649&tp=spam&ttl=Vacuum-Formed+vs.+Direct-Milled+Workshop&u=https://onlinecasino.us.org \nhttp://asergisoutsourcing.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://etw.biomarin-europe.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://calaproducts.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cpanel.surfcareer.com/careerforum/redirect.php?tid=2445&goto=onlinecasino.us.org  http://25centmovies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pinecroftwines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://localfocusllc.media/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://addictionsucks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cakemonster.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://community.alahlyegypt.com/forum/main-forum/141100-french-twist-hairstyle-pictures\nhttp://theposhmedia.com/forum/showthread.php?tid=121241\nhttp://forum.gsm-rom.com/showthread.php?1197656-captain-marvel-comicvine&p=1417297#post1417297\nhttp://mamnontrithuc.edu.vn/forum/showthread.php?19595-Actual-double-entry-journal-kite-runner&p=70777#post70777\nhttps://entmuttert.com/2016/01/24/einfache-rechnung-kein-umgangdann-kein-unterhalt/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8228, "cpu_time_ms": 11, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s259902401", "group_id": "codeNet:p03941", "input_text": "http://savefromx.online/index.php?url=https://onlinecasino.us.org  http://umtbsec.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.amateurwifefuck.com/cgi-bin/atc/out.cgi?id=1&u=https://onlinecasino.us.org   http://terminixtermiteswarmalert.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://11.1go.kr/link.php?url=https://onlinecasino.us.org   http://gamusa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.primainc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://saversfree.co.uk/jump.php?id2=739&url=https://onlinecasino.us.org   http://smteatr.ru/engine/api/go.php?go=https://onlinecasino.us.org \nhttp://www.licnioglasi.org/index.php?thememode=full;redirect=https://onlinecasino.us.org  http://boomerangdns.com/LinkClick.aspx?link=https://onlinecasino.us.org   https://xn----jtbhicnj8j.xn--p1ai/bitrix/rk.php?id=8249&goto=onlinecasino.us.org   http://helpforveryangrypeople.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zjblog.com/go.asp?url=https://onlinecasino.us.org   http://jd05.ru/go/url=onlinecasino.us.org  http://minialmacenespr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thebirthdiamond.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://espoofaloo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.uralmotor.ru/redirect.php?url=https://onlinecasino.us.org  https://pwnsome.net/forum/main-forum/6067-barney-good-clean-fun?goto=onlinecasino.us.org   http://promoville.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://slaymaker.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ansuex.com/wp-content/themes/begin5.2/inc/go.php?url=https://onlinecasino.us.org   http://giveahoneymoon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bodyclues.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://impossiblesolutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://spinecenters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://energypricingsolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://csttires.pro/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://isteameducation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bandagbridgestone.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://omfh.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bouncingben.mobile.goldenpages.ie/?task=get&ihash=c81f9d3194&url=https://onlinecasino.us.org  https://www.nishitetsutravel.jp/redirect/?https://onlinecasino.us.org  http://n3o.khmerartsacademy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nenani.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.aaa-outdoor.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org  http://cookiesrmom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lsoft.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lovetoys.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pyinmanathar.createaforum.com/index.php?thememode=full;redirect=https://onlinecasino.us.org   http://pyinmanathar.createaforum.com/index.php?thememode=full;redirect=https://onlinecasino.us.org  http://www.auhoney.net/link.php?url=https://onlinecasino.us.org  http://portal.sbct.ru/go/url=onlinecasino.us.org   http://hertzrentalcoupons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://jameslimm.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tcwshopfunds.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://escalera.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://eshop.100mega.cz/redir.asp?wenid=869&wenurllink=https://onlinecasino.us.org  http://installzamma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://solidsouthamerica.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kpireportcard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.lcgp.net/LinkClick.aspx?link=https://onlinecasino.us.org   http://3dpublishingservice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bickersinsurance.co.uk/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://www.borlaperformance.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://modid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://famouscreations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://northstarribs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://arh-adm.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org  http://lukassebastian.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ls-centre.ru/go.php?url=https://onlinecasino.us.org   http://dentalflosscard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://theequitable.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.lowest-price-web-hosting.com/big5/bbs/redirect.php?fid=4&tid=1408&goto=onlinecasino.us.org   http://lynnskitchen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.autoscaners.ru/bitrix/rk.php?id=22&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B22%5D+%5BMAIN%5D+%D0%9D%D0%BE%D0%B2%D0%B0%D1%8F+%D0%B6%D0%B8%D0%B4%D0%BA%D0%BE%D1%81%D1%82%D1%8C+Injtest+%D0%B8+Injcleaner+%D1%80%D0%B0%D0%B7%D0%B4%D0%B5%D0%BB+%D0%A3%D1%81%D1%82%D0%B0%D0%BD%D0%BE%D0%B2%D0%BA%D0%B8+%D0%B4%D0%BB%D1%8F+%D0%A3%D0%97+%D0%BE%D1%87%D0%B8%D1%81%D1%82%D0%BA%D0%B8+%D0%B8+%D1%82%D0%BE%D0%BF%D0%BB%D0%B8%D0%B2%D0%BD%D0%BE%D0%B9+%D1%81%D0%B8%D1%81%D1%82%D0%B5%D0%BC%D1%8B&goto=https://onlinecasino.us.org  http://19sex.ru/comments.php?module=news&item_id=2&return=https://onlinecasino.us.org   http://custommedia.mcmahonmed.com/Redirect?url=https://onlinecasino.us.org  http://southbaybuildersllc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://primediaconsumerguides.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zilientnrg.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://saintpetersnews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kenrichinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://newhomebuyerguide.com/redirect.php?u=onlinecasino.us.org   http://m.shenmeche.cn/tool/redirect.asp?id=112&url=https://onlinecasino.us.org  http://www.dianzichan.com/uc/bb2//redirect.php?fid=22&tid=2004&goto=onlinecasino.us.org   http://hirlevel.lapcom.hu/link.php?url=onlinecasino.us.org  http://peace-loveandlight.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://probiht.tk/ext_link?url=https://onlinecasino.us.org   http://www.aatravel.co.nz/main/url-redirect.php?&listingId=15453&clientId=4465&url=https://onlinecasino.us.org \nhttp://humanities.goldenarticles.net/go.php?url=https://onlinecasino.us.org  http://koralblue.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://essobmr.ru/redirect?url=https://onlinecasino.us.org   http://www.uz.all.biz/goto.php?url=https://onlinecasino.us.org  http://pussycelebs.com/dtr/link.php?gr=4&id=3d66de&url=https://onlinecasino.us.org   http://zebratomatoes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gp-hd.es/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.3dwoo.com/bbs/redirect.php?goto=onlinecasino.us.org   http://imved.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://xn--iexed-ngaa6qrbbh.mannlist.com/viewtopic.php?f=10&t=45974253\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=195856\nhttp://taiyi.one/viewtopic.php?pid=372330#p372330\nhttps://nutribulletme.com/product/nutribullet-rx/#comment-6714\nhttp://www.serebryakov.org/index.php?option=com_fireboard&Itemid=69&func=view&catid=3&id=34364#34364\n", "language": "Lisp", "metadata": {"date": 1549529233, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s259902401.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s259902401", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://savefromx.online/index.php?url=https://onlinecasino.us.org  http://umtbsec.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.amateurwifefuck.com/cgi-bin/atc/out.cgi?id=1&u=https://onlinecasino.us.org   http://terminixtermiteswarmalert.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://11.1go.kr/link.php?url=https://onlinecasino.us.org   http://gamusa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.primainc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://saversfree.co.uk/jump.php?id2=739&url=https://onlinecasino.us.org   http://smteatr.ru/engine/api/go.php?go=https://onlinecasino.us.org \nhttp://www.licnioglasi.org/index.php?thememode=full;redirect=https://onlinecasino.us.org  http://boomerangdns.com/LinkClick.aspx?link=https://onlinecasino.us.org   https://xn----jtbhicnj8j.xn--p1ai/bitrix/rk.php?id=8249&goto=onlinecasino.us.org   http://helpforveryangrypeople.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zjblog.com/go.asp?url=https://onlinecasino.us.org   http://jd05.ru/go/url=onlinecasino.us.org  http://minialmacenespr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thebirthdiamond.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://espoofaloo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.uralmotor.ru/redirect.php?url=https://onlinecasino.us.org  https://pwnsome.net/forum/main-forum/6067-barney-good-clean-fun?goto=onlinecasino.us.org   http://promoville.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://slaymaker.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ansuex.com/wp-content/themes/begin5.2/inc/go.php?url=https://onlinecasino.us.org   http://giveahoneymoon.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bodyclues.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://impossiblesolutions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://spinecenters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://energypricingsolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://csttires.pro/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://isteameducation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bandagbridgestone.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://omfh.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bouncingben.mobile.goldenpages.ie/?task=get&ihash=c81f9d3194&url=https://onlinecasino.us.org  https://www.nishitetsutravel.jp/redirect/?https://onlinecasino.us.org  http://n3o.khmerartsacademy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nenani.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.aaa-outdoor.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org  http://cookiesrmom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lsoft.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lovetoys.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pyinmanathar.createaforum.com/index.php?thememode=full;redirect=https://onlinecasino.us.org   http://pyinmanathar.createaforum.com/index.php?thememode=full;redirect=https://onlinecasino.us.org  http://www.auhoney.net/link.php?url=https://onlinecasino.us.org  http://portal.sbct.ru/go/url=onlinecasino.us.org   http://hertzrentalcoupons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://jameslimm.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tcwshopfunds.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://escalera.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://eshop.100mega.cz/redir.asp?wenid=869&wenurllink=https://onlinecasino.us.org  http://installzamma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://solidsouthamerica.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kpireportcard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.lcgp.net/LinkClick.aspx?link=https://onlinecasino.us.org   http://3dpublishingservice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bickersinsurance.co.uk/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://www.borlaperformance.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://modid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://famouscreations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://northstarribs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://arh-adm.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org  http://lukassebastian.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ls-centre.ru/go.php?url=https://onlinecasino.us.org   http://dentalflosscard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://theequitable.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.lowest-price-web-hosting.com/big5/bbs/redirect.php?fid=4&tid=1408&goto=onlinecasino.us.org   http://lynnskitchen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.autoscaners.ru/bitrix/rk.php?id=22&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B22%5D+%5BMAIN%5D+%D0%9D%D0%BE%D0%B2%D0%B0%D1%8F+%D0%B6%D0%B8%D0%B4%D0%BA%D0%BE%D1%81%D1%82%D1%8C+Injtest+%D0%B8+Injcleaner+%D1%80%D0%B0%D0%B7%D0%B4%D0%B5%D0%BB+%D0%A3%D1%81%D1%82%D0%B0%D0%BD%D0%BE%D0%B2%D0%BA%D0%B8+%D0%B4%D0%BB%D1%8F+%D0%A3%D0%97+%D0%BE%D1%87%D0%B8%D1%81%D1%82%D0%BA%D0%B8+%D0%B8+%D1%82%D0%BE%D0%BF%D0%BB%D0%B8%D0%B2%D0%BD%D0%BE%D0%B9+%D1%81%D0%B8%D1%81%D1%82%D0%B5%D0%BC%D1%8B&goto=https://onlinecasino.us.org  http://19sex.ru/comments.php?module=news&item_id=2&return=https://onlinecasino.us.org   http://custommedia.mcmahonmed.com/Redirect?url=https://onlinecasino.us.org  http://southbaybuildersllc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://primediaconsumerguides.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zilientnrg.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://saintpetersnews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kenrichinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://newhomebuyerguide.com/redirect.php?u=onlinecasino.us.org   http://m.shenmeche.cn/tool/redirect.asp?id=112&url=https://onlinecasino.us.org  http://www.dianzichan.com/uc/bb2//redirect.php?fid=22&tid=2004&goto=onlinecasino.us.org   http://hirlevel.lapcom.hu/link.php?url=onlinecasino.us.org  http://peace-loveandlight.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://probiht.tk/ext_link?url=https://onlinecasino.us.org   http://www.aatravel.co.nz/main/url-redirect.php?&listingId=15453&clientId=4465&url=https://onlinecasino.us.org \nhttp://humanities.goldenarticles.net/go.php?url=https://onlinecasino.us.org  http://koralblue.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://essobmr.ru/redirect?url=https://onlinecasino.us.org   http://www.uz.all.biz/goto.php?url=https://onlinecasino.us.org  http://pussycelebs.com/dtr/link.php?gr=4&id=3d66de&url=https://onlinecasino.us.org   http://zebratomatoes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gp-hd.es/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.3dwoo.com/bbs/redirect.php?goto=onlinecasino.us.org   http://imved.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://xn--iexed-ngaa6qrbbh.mannlist.com/viewtopic.php?f=10&t=45974253\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=195856\nhttp://taiyi.one/viewtopic.php?pid=372330#p372330\nhttps://nutribulletme.com/product/nutribullet-rx/#comment-6714\nhttp://www.serebryakov.org/index.php?option=com_fireboard&Itemid=69&func=view&catid=3&id=34364#34364\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8000, "cpu_time_ms": 92, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s553241641", "group_id": "codeNet:p03941", "input_text": "http://www.everyoneguide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.prostoreltd.com/bitrix/rk.php?id=8359&goto=onlinecasino.us.org   http://togs.de/url?q=https://onlinecasino.us.org   http://holyclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xt.huanyingke.com/index.php?g=Appoint&c=Changecity&a=go&city=jh&referer=https://onlinecasino.us.org   http://www.kanekosystem.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://myindianahome.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bellabrito.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ghanaelections.peacefmonline.com/tgghanaelections/social/email_page.php?title=&url=https://onlinecasino.us.org \nhttp://kalyaniyeast.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://apartmentops.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://win-a-day.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aphexxciter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://shu.wecanbuyhomes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://quiznossubrestaurants.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://treeconserveswater.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://davisbrodybond.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mortgageretreat.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.jahbnet.jp/index.php?url=https://onlinecasino.us.org  http://www.cellsea.com/deal/redirect?url=https://onlinecasino.us.org   http://1c.ruboard.ru/bitrix/rk.php?id=1549&goto=https://onlinecasino.us.org   http://aircraftprofileprint.mysharebar.com/view?iframe=https://onlinecasino.us.org  http://www.gscsjl.com/home/link.php?url=https://onlinecasino.us.org   http://shakergame.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://desertcitiesusa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://greenmountaincapitalpartner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.anotherday.me.uk/forum/redirect.php?url=https://onlinecasino.us.org \nhttp://losangalex.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cobracarclubnsw.org.au/forum/viewthread.php?goto=onlinecasino.us.org   http://bathroomrenovationsydney.net.assetline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crisisdiverted.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.congenitalcardiologytoday.com/Clicks/forward.php?fname=https://onlinecasino.us.org   http://www.cynthiawhitemurray.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://beezen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dogussportiffaaliyetleri.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://understandreits.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://shermanoaksbraces.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://campusroslagen.xletter.se/newsletter/index.php/newsletter/public/Link?id=letter180524ec88da9a54&name=&url=https://onlinecasino.us.org   http://chaisenelson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sellashare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nimbinmusic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ups-notice.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trunellfelderministries.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zecurity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.go2fiber.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.pediatric.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://barnetconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://visworld.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.vwglosser.nl/gbook/go.php?url=https://onlinecasino.us.org  http://lasgardeniasmexico.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.agencyonaging.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://18778367366.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://permimumtutor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ebisgardmd.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://rmsproducts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://139013098.r.bat.bing.com/?ld=d3R7nn_wHXihRt3dvkx1-GyTVUCUwzuSnRtPRHyeaNkDp0sWRhREZFDW8REwqko25yAlljoW3D-vKe-XTl34KGY9V6AfZURJmiR8qHafYUF4MoMyMO1N6zCqes6MiiL8nmMe_CVjGxen_EgUvWEjLZum56DSU&u=https://onlinecasino.us.org   http://nysdot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://orgmakeover.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.brainpopbaby.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bakingsoda.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://carrentalsvista.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://889yy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://m.ardi.ru/bitrix/rk.php?id=36&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B36%5D+%5BMOBILE_HOMAPAGE_MOSAIC%5D+%D0%A1%D0%BB%D0%B0%D0%B9%D0%B4%D0%B5%D1%80+1+%D0%9D%D0%BE%D0%B2%D0%B0%D1%8F+%D0%BA%D0%BE%D0%BB%D0%BB%D0%B5%D0%BA%D1%86%D0%B8%D1%8F&goto=https://onlinecasino.us.org \nhttps://archive.is/o/bgz2H/www.bravoerotica.com/crtr/cgi/out.cgi?id=311&l=bottom_thumb_top&trade=onlinecasino.us.org  http://americanhotelfurnishings.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mjtunes.com/myradioplayer.php?title=mayo&logo=uploads/savt472c67c939bd9.gif&url=https://onlinecasino.us.org/   http://www.stopnetworksolutions.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aredhot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bwcos.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stemcell-antibodies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://palladiumequityhispanic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stratesphereinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.worldvision.org.hk/en/hit/track-redirect.asp?url=https://onlinecasino.us.org  http://www.grandcanyonskybridge.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cmpp.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://theflavorsoffrance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://inp-act.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crainnewsservice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://healthysuperstar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://derms.celestialstar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://amerisbancorp.world/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.teacherscoop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nueveunouno.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hgr.artbainterstate50.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://blog.it5.cn/go.asp?url=https://onlinecasino.us.org  http://adsrv.itweb.co.za/adclick.php?bannerid=32657&zoneid=0&source=&dest=https://onlinecasino.us.org   http://workbots.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bizmarketplace.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.afvbw.de/goto.php?url=https://onlinecasino.us.org   http://3rooms-5ruedemoussy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://timzimmermann.com/2017/10/02/is-this-restaurant-woke-vegan/\nhttps://spanishintheusa.com/2014/11/19/embutido-en-la-maleta/\nhttps://unlikelyexplanations.com/\nhttp://www.yorubaunity.org/showthread.php?tid=34631&pid=94411#pid94411\nhttps://liberalsbackwardsthink.com/2018/05/18/liberal-democrat-media-makes-ms-13-terrorist-animals-their-dreamers/\n", "language": "Lisp", "metadata": {"date": 1549523295, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s553241641.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s553241641", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.everyoneguide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.prostoreltd.com/bitrix/rk.php?id=8359&goto=onlinecasino.us.org   http://togs.de/url?q=https://onlinecasino.us.org   http://holyclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xt.huanyingke.com/index.php?g=Appoint&c=Changecity&a=go&city=jh&referer=https://onlinecasino.us.org   http://www.kanekosystem.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://myindianahome.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bellabrito.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ghanaelections.peacefmonline.com/tgghanaelections/social/email_page.php?title=&url=https://onlinecasino.us.org \nhttp://kalyaniyeast.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://apartmentops.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://win-a-day.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aphexxciter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://shu.wecanbuyhomes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://quiznossubrestaurants.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://treeconserveswater.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://davisbrodybond.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mortgageretreat.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.jahbnet.jp/index.php?url=https://onlinecasino.us.org  http://www.cellsea.com/deal/redirect?url=https://onlinecasino.us.org   http://1c.ruboard.ru/bitrix/rk.php?id=1549&goto=https://onlinecasino.us.org   http://aircraftprofileprint.mysharebar.com/view?iframe=https://onlinecasino.us.org  http://www.gscsjl.com/home/link.php?url=https://onlinecasino.us.org   http://shakergame.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://desertcitiesusa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://greenmountaincapitalpartner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.anotherday.me.uk/forum/redirect.php?url=https://onlinecasino.us.org \nhttp://losangalex.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cobracarclubnsw.org.au/forum/viewthread.php?goto=onlinecasino.us.org   http://bathroomrenovationsydney.net.assetline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crisisdiverted.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.congenitalcardiologytoday.com/Clicks/forward.php?fname=https://onlinecasino.us.org   http://www.cynthiawhitemurray.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://beezen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dogussportiffaaliyetleri.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://understandreits.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://shermanoaksbraces.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://campusroslagen.xletter.se/newsletter/index.php/newsletter/public/Link?id=letter180524ec88da9a54&name=&url=https://onlinecasino.us.org   http://chaisenelson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sellashare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nimbinmusic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ups-notice.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://trunellfelderministries.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zecurity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.go2fiber.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.pediatric.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://barnetconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://visworld.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.vwglosser.nl/gbook/go.php?url=https://onlinecasino.us.org  http://lasgardeniasmexico.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.agencyonaging.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://18778367366.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://permimumtutor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ebisgardmd.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://rmsproducts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://139013098.r.bat.bing.com/?ld=d3R7nn_wHXihRt3dvkx1-GyTVUCUwzuSnRtPRHyeaNkDp0sWRhREZFDW8REwqko25yAlljoW3D-vKe-XTl34KGY9V6AfZURJmiR8qHafYUF4MoMyMO1N6zCqes6MiiL8nmMe_CVjGxen_EgUvWEjLZum56DSU&u=https://onlinecasino.us.org   http://nysdot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://orgmakeover.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.brainpopbaby.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bakingsoda.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://carrentalsvista.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://889yy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://m.ardi.ru/bitrix/rk.php?id=36&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B36%5D+%5BMOBILE_HOMAPAGE_MOSAIC%5D+%D0%A1%D0%BB%D0%B0%D0%B9%D0%B4%D0%B5%D1%80+1+%D0%9D%D0%BE%D0%B2%D0%B0%D1%8F+%D0%BA%D0%BE%D0%BB%D0%BB%D0%B5%D0%BA%D1%86%D0%B8%D1%8F&goto=https://onlinecasino.us.org \nhttps://archive.is/o/bgz2H/www.bravoerotica.com/crtr/cgi/out.cgi?id=311&l=bottom_thumb_top&trade=onlinecasino.us.org  http://americanhotelfurnishings.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mjtunes.com/myradioplayer.php?title=mayo&logo=uploads/savt472c67c939bd9.gif&url=https://onlinecasino.us.org/   http://www.stopnetworksolutions.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aredhot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bwcos.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stemcell-antibodies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://palladiumequityhispanic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stratesphereinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.worldvision.org.hk/en/hit/track-redirect.asp?url=https://onlinecasino.us.org  http://www.grandcanyonskybridge.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cmpp.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://theflavorsoffrance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://inp-act.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crainnewsservice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://healthysuperstar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://derms.celestialstar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://amerisbancorp.world/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.teacherscoop.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nueveunouno.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hgr.artbainterstate50.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://blog.it5.cn/go.asp?url=https://onlinecasino.us.org  http://adsrv.itweb.co.za/adclick.php?bannerid=32657&zoneid=0&source=&dest=https://onlinecasino.us.org   http://workbots.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bizmarketplace.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.afvbw.de/goto.php?url=https://onlinecasino.us.org   http://3rooms-5ruedemoussy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://timzimmermann.com/2017/10/02/is-this-restaurant-woke-vegan/\nhttps://spanishintheusa.com/2014/11/19/embutido-en-la-maleta/\nhttps://unlikelyexplanations.com/\nhttp://www.yorubaunity.org/showthread.php?tid=34631&pid=94411#pid94411\nhttps://liberalsbackwardsthink.com/2018/05/18/liberal-democrat-media-makes-ms-13-terrorist-animals-their-dreamers/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8280, "cpu_time_ms": 104, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s866800088", "group_id": "codeNet:p03941", "input_text": "http://informationoperatingsystem.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cher.xzaa.ru/go.php?id=33735&url=https://onlinecasino.us.org   http://aty.se/index.php?format=simple&action=shorturl&url=https://onlinecasino.us.org   http://diamondtubes.com/cgi-bin/a2/out.cgi?id=822&u=https://onlinecasino.us.org  http://www.rinehartinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://careereverafter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kidteacher.info/redirect.php?tid=1845&goto=onlinecasino.us.org  http://reinec.m-g-m-sucks.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://berkshirehathawayhomeservicesofthetriad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://urbanfighterscommunity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://teens.bajarun.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qgi.diyphotocards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tguslaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.colonialbaptistmemphis.org/System/UserProfile.asp?id=27466&func=signup&referer=https://onlinecasino.us.org   http://www.dnnturkiye.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://gvp.ragemotorsports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bart-stewart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://manosalaobra.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://accentuatewriters.com/viewthread.php?goto=onlinecasino.us.org  http://bloedgeil.com/cgi-bin/dpmtrade/out.cgi?url=https://onlinecasino.us.org   https://www.aqualeisure.com/aquafitness/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://centroamerica-adelante.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://web.vivicorp.com/bitrix/rk.php?id=1&event1=banner&event2=click&event3=1+%2F+%5B1%5D+%5BDNS_WEB%5D+&goto=https://onlinecasino.us.org   http://sportcentrumkubus.cz/index.php?a=5&replyto=onlinecasino.us.org  http://www.dermatologypalmharborfl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.gp32spain.com/foros/entry.php?1844-quot-Hombre-quot-se-enfrenta-a-4-060-a%25F1os-en-prisi%25F3n&goto=onlinecasino.us.org   http://factoryheating.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://statusnyc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://allofearth.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rgissmartspace.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tapeinfo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.vossemece.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://1236.xg4ken.com/media/redir.php?prof=607&affcode=uc%7CSpredfast_GooglePlus%7CRetailMeNot%7C10/17/14%20Blog%20G%2B%20Worst%20Halloween%20Costumes%20Ever%7C32512479%7Cbroad&url=https://onlinecasino.us.org  http://syc.lookinghealthy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://images.google.co.il/url?q=https://onlinecasino.us.org   http://kia-lipetsk.ru/bitrix/rk.php?id=691&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B691%5D+%5BNEW_INDEX_BANNERS%5D+Trade-in+football&goto=onlinecasino.us.org \nhttp://www.home-chef.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://evolvegame.ru/go?https://onlinecasino.us.org   http://biankang.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://picturesandstories.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.howard.edu/asp/linkcounter/resourcesondemand.asp?url=https://onlinecasino.us.org   http://davidcoyle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.factorfunds.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://triggerjewels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://uswired.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://friendsofwestbury.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jonesconsulting.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://berkeley.worldcat.org/wcpa/oclc/610842504?page=frame&url=https://onlinecasino.us.org   http://ryanlandau.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bkq.joynexus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chetparkppty.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://3ntr0py.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://transdisciplinario.cinvestav.mx/LinkClick.aspx?link=https://onlinecasino.us.org   http://petiteteenager.com/cgi-bin/atx/out.cgi?id=182&amp;trade=https://onlinecasino.us.org \nhttp://transdisciplinario.cinvestav.mx/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.zevc.com.cn/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://littlerockeye.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fusion4energy.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wherecollections.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://abstractsonline.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thelimestonegrille.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cattleusa.com/clickthru.php?URL=https://onlinecasino.us.org/   http://tlcor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://homesytles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mueffling.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://flemingtonvans.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mypadala.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://seablacklist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://omf.letstalkaboutit.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://oromoctopostgazette.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jennifersultan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://leatherheadfood.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://joinmuse.ru/forum/go.php?https://onlinecasino.us.org/  http://www.yogafittrainings.tw/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.2008tb.com.tw/redirect.php?tid=13265&goto=onlinecasino.us.org   http://www.daisy-akademie.de/cgi-bin/redirect.pl?token=594b19f27b214c686e42bce6c819b1e1&id=https://onlinecasino.us.org  http://titchener.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://baystatesavingsbank.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://2a03.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ssg.sebastopol.ua/go/url=https://onlinecasino.us.org   http://www.bransoncoupons.net/go/bc.asp?g=https://onlinecasino.us.org \nhttps://shop.rshaarlem.com/redirect.php?action=url&goto=onlinecasino.us.org  http://go.fanli7.net/jump.html?url=onlinecasino.us.org   http://dealdogs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://winetourism.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://isitdownforjustme.appspot.com/?url=http://tubepatrol.netonlinecasino.us.org   https://vod.sinslife.com/outgoing.php?goto=https://onlinecasino.us.org  http://buchananspecialties.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://timic.net/wp-content/themes/cms/inc/go.php?url=https://onlinecasino.us.org   http://thenationalchamberfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://cpphc.ca/forum/showthread.php?tid=64419\nhttp://abapchallenge.com/forum/viewtopic.php?f=4&t=183916\nhttp://sr.leet.cz/viewtopic.php?f=16&t=391\nhttp://www.scrollsguide.com/forum/viewtopic.php?f=7&t=32602\nhttps://yancearizona.net/2010/04/17/pendaftaran-wilayah-adat-belum-jelas/\n", "language": "Lisp", "metadata": {"date": 1549348624, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s866800088.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s866800088", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://informationoperatingsystem.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cher.xzaa.ru/go.php?id=33735&url=https://onlinecasino.us.org   http://aty.se/index.php?format=simple&action=shorturl&url=https://onlinecasino.us.org   http://diamondtubes.com/cgi-bin/a2/out.cgi?id=822&u=https://onlinecasino.us.org  http://www.rinehartinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://careereverafter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kidteacher.info/redirect.php?tid=1845&goto=onlinecasino.us.org  http://reinec.m-g-m-sucks.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://berkshirehathawayhomeservicesofthetriad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://urbanfighterscommunity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://teens.bajarun.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qgi.diyphotocards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tguslaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.colonialbaptistmemphis.org/System/UserProfile.asp?id=27466&func=signup&referer=https://onlinecasino.us.org   http://www.dnnturkiye.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://gvp.ragemotorsports.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bart-stewart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://manosalaobra.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://accentuatewriters.com/viewthread.php?goto=onlinecasino.us.org  http://bloedgeil.com/cgi-bin/dpmtrade/out.cgi?url=https://onlinecasino.us.org   https://www.aqualeisure.com/aquafitness/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://centroamerica-adelante.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://web.vivicorp.com/bitrix/rk.php?id=1&event1=banner&event2=click&event3=1+%2F+%5B1%5D+%5BDNS_WEB%5D+&goto=https://onlinecasino.us.org   http://sportcentrumkubus.cz/index.php?a=5&replyto=onlinecasino.us.org  http://www.dermatologypalmharborfl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.gp32spain.com/foros/entry.php?1844-quot-Hombre-quot-se-enfrenta-a-4-060-a%25F1os-en-prisi%25F3n&goto=onlinecasino.us.org   http://factoryheating.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://statusnyc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://allofearth.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rgissmartspace.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tapeinfo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.vossemece.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://1236.xg4ken.com/media/redir.php?prof=607&affcode=uc%7CSpredfast_GooglePlus%7CRetailMeNot%7C10/17/14%20Blog%20G%2B%20Worst%20Halloween%20Costumes%20Ever%7C32512479%7Cbroad&url=https://onlinecasino.us.org  http://syc.lookinghealthy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://images.google.co.il/url?q=https://onlinecasino.us.org   http://kia-lipetsk.ru/bitrix/rk.php?id=691&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B691%5D+%5BNEW_INDEX_BANNERS%5D+Trade-in+football&goto=onlinecasino.us.org \nhttp://www.home-chef.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://evolvegame.ru/go?https://onlinecasino.us.org   http://biankang.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://picturesandstories.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.howard.edu/asp/linkcounter/resourcesondemand.asp?url=https://onlinecasino.us.org   http://davidcoyle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.factorfunds.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://triggerjewels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://uswired.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://friendsofwestbury.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jonesconsulting.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://berkeley.worldcat.org/wcpa/oclc/610842504?page=frame&url=https://onlinecasino.us.org   http://ryanlandau.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bkq.joynexus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chetparkppty.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://3ntr0py.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://transdisciplinario.cinvestav.mx/LinkClick.aspx?link=https://onlinecasino.us.org   http://petiteteenager.com/cgi-bin/atx/out.cgi?id=182&amp;trade=https://onlinecasino.us.org \nhttp://transdisciplinario.cinvestav.mx/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.zevc.com.cn/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://littlerockeye.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fusion4energy.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wherecollections.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://abstractsonline.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thelimestonegrille.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cattleusa.com/clickthru.php?URL=https://onlinecasino.us.org/   http://tlcor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://homesytles.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mueffling.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://flemingtonvans.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mypadala.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://seablacklist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://omf.letstalkaboutit.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://oromoctopostgazette.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jennifersultan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://leatherheadfood.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://joinmuse.ru/forum/go.php?https://onlinecasino.us.org/  http://www.yogafittrainings.tw/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.2008tb.com.tw/redirect.php?tid=13265&goto=onlinecasino.us.org   http://www.daisy-akademie.de/cgi-bin/redirect.pl?token=594b19f27b214c686e42bce6c819b1e1&id=https://onlinecasino.us.org  http://titchener.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://baystatesavingsbank.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://2a03.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ssg.sebastopol.ua/go/url=https://onlinecasino.us.org   http://www.bransoncoupons.net/go/bc.asp?g=https://onlinecasino.us.org \nhttps://shop.rshaarlem.com/redirect.php?action=url&goto=onlinecasino.us.org  http://go.fanli7.net/jump.html?url=onlinecasino.us.org   http://dealdogs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://winetourism.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://isitdownforjustme.appspot.com/?url=http://tubepatrol.netonlinecasino.us.org   https://vod.sinslife.com/outgoing.php?goto=https://onlinecasino.us.org  http://buchananspecialties.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://timic.net/wp-content/themes/cms/inc/go.php?url=https://onlinecasino.us.org   http://thenationalchamberfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://cpphc.ca/forum/showthread.php?tid=64419\nhttp://abapchallenge.com/forum/viewtopic.php?f=4&t=183916\nhttp://sr.leet.cz/viewtopic.php?f=16&t=391\nhttp://www.scrollsguide.com/forum/viewtopic.php?f=7&t=32602\nhttps://yancearizona.net/2010/04/17/pendaftaran-wilayah-adat-belum-jelas/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7992, "cpu_time_ms": 91, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s718343166", "group_id": "codeNet:p03941", "input_text": "http://pivotalprivateequity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://reggaetour.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mandrillapp.com/track/click.php?u=30172101&id=b9fd64993647405680f93494eea6bc8b&url=https://onlinecasino.us.org   http://cemexegypt.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://michigantravel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.wherecanifindjobsonline.xyloma.com/outlink.php?l=MzF4NzF4Mjk5NQ==&url=onlinecasino.us.org  http://licos-onlus.eu/cgi-bin/atc/out.cgi?id=28&u=https://onlinecasino.us.org  http://www.duotegame.com/phpMyDuoTe/url.php?url=https://onlinecasino.us.org   https://www.expertoautorecambios.es/science/?goto=https://onlinecasino.us.org \nhttp://www.bjqdjj.cn/Go.asp?URL=https://onlinecasino.us.org  http://comictoys.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jeffkoonsfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://avantgardcs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://provieda.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://guralturizm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://flexwrite.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.artistsrightssociety.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://westevents.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://solidworksmedia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.dkdfilm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lcj.detailcustomhomes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rr9.partitionsandaccessco.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wirto.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yzz.nafta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kernmetpit.nl/shortcuts/sendlinkmessage.aspx?url=https://onlinecasino.us.org  http://www.minbanc.org/__media__/js/trademark.php?d=onlinecasino.us.org   http://discoverylocker.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://artistengine.pro/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bartonandloguidice.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://ladydarhma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brookline-apartments.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://nieuwskop.nl/redirect.php?artid=9067937&link=https://onlinecasino.us.org   http://wyattgoreschiff.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://arantxasainzdemurieta.naturepure.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mdtvnews.com/Redirect.asp?SubSectionID=514&LinkID=173&Linkurl=https://onlinecasino.us.org   https://gg.levelup.com/index.php?seccion=login&accion=loginForm&type=windowRegister&referer=https://onlinecasino.us.org \nhttp://polloftheday.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://servantministriesinc.org/System/UserProfile.asp?id=44404&func=signup&referer=https://onlinecasino.us.org   http://throttle-booster.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://movingcoil.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://livejournals.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chinaski.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://editionsquebecormedia.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://westwindgroup.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://golden-theatre.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://e-m-financial.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://riverbelugacaviar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://principals-only.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wamco.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://premierdui.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://athenshop.gr/redirect.asp?https://onlinecasino.us.org  http://chakn.ru/redirect?url=https://onlinecasino.us.org  http://www.phillypa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mindriter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://romsat.ua/bitrix/rk.php?id=57&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B57%5D+%5Bmain_baner1%5D+%D0%9A%D0%BE%D0%BC%D1%83%D1%82%D0%B0%D1%82%D0%BE%D1%80%D0%B8+Ethernet&goto=onlinecasino.us.org  http://snaptrophies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dep.agro.tomsk.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org   http://bryanzumwalt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ip-216-194-89-80.tera-byte.com/o.php?u=out.php?url=onlinecasino.us.org   http://qwj.outdoorrewards.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cecilyober.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://epipenuse.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://belmont-trading.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mostblingforleastchaching.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hvaccincinnati.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://optiglyph.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://datascienceanalyticservices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://denti-gift.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ositeoficial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://shoredreamsevents.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://txiag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://davidhparker.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://saliemarise.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://spoistess.ga/redirect.php?url=https://onlinecasino.us.org   http://www.turkmedline.net/go.php?id=190&url=https://onlinecasino.us.org   http://scivest.com/cgi-bin/tools/printpage.cgi/sitemap.html?referer=https://onlinecasino.us.org  http://weddingstogo.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stillcomputes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://union-investment.ch/startseite-de/login.html?referer=https://onlinecasino.us.org  http://katheros.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://odokon.org/w3a/redirect.php?redirect=https://onlinecasino.us.org/ \nhttp://webcreate.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marylouiseparker.tv/out.php?url=https://onlinecasino.us.org/   https://facenama.com/redirect.php?url=https://onlinecasino.us.org   http://swemachines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://achievablehomes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yohobby.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://avocadouniversity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.malababetka.cz/malababetka/f-ce/insert-click-redir.php?nazev=Zahradn%ED%20kv%ECtin%E1%E8e,%20betonov%E9%20kv%ECtn%EDky%20&link=https://onlinecasino.us.org   http://www.150teengalleries.com/cgi-bin/a2/out.cgi?id=40&u=https://onlinecasino.us.org \n \n \n \n \n \nhttps://celsohl.com/?contact-form-id=50235&contact-form-sent=99381&contact-form-hash=61b7306e80c71013c4456a98c4fbb64f390ec1fb&_wpnonce=b44189235f\nhttps://www.deadlytarantulagirl.com/index.php?topic=21671.new#new\nhttp://tynedalegreenparty.org/forum/index.php?topic=61079.new#new\nhttp://futsal5cotland.com/viewtopic.php?pid=31195#p31195\nhttp://community.alahlyegypt.com/forum/main-forum/140604-free-online-games-miniclip\n", "language": "Lisp", "metadata": {"date": 1549336308, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s718343166.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s718343166", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://pivotalprivateequity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://reggaetour.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mandrillapp.com/track/click.php?u=30172101&id=b9fd64993647405680f93494eea6bc8b&url=https://onlinecasino.us.org   http://cemexegypt.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://michigantravel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.wherecanifindjobsonline.xyloma.com/outlink.php?l=MzF4NzF4Mjk5NQ==&url=onlinecasino.us.org  http://licos-onlus.eu/cgi-bin/atc/out.cgi?id=28&u=https://onlinecasino.us.org  http://www.duotegame.com/phpMyDuoTe/url.php?url=https://onlinecasino.us.org   https://www.expertoautorecambios.es/science/?goto=https://onlinecasino.us.org \nhttp://www.bjqdjj.cn/Go.asp?URL=https://onlinecasino.us.org  http://comictoys.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jeffkoonsfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://avantgardcs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://provieda.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://guralturizm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://flexwrite.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.artistsrightssociety.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://westevents.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://solidworksmedia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.dkdfilm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lcj.detailcustomhomes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rr9.partitionsandaccessco.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wirto.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yzz.nafta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kernmetpit.nl/shortcuts/sendlinkmessage.aspx?url=https://onlinecasino.us.org  http://www.minbanc.org/__media__/js/trademark.php?d=onlinecasino.us.org   http://discoverylocker.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://artistengine.pro/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bartonandloguidice.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://ladydarhma.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brookline-apartments.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://nieuwskop.nl/redirect.php?artid=9067937&link=https://onlinecasino.us.org   http://wyattgoreschiff.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://arantxasainzdemurieta.naturepure.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mdtvnews.com/Redirect.asp?SubSectionID=514&LinkID=173&Linkurl=https://onlinecasino.us.org   https://gg.levelup.com/index.php?seccion=login&accion=loginForm&type=windowRegister&referer=https://onlinecasino.us.org \nhttp://polloftheday.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://servantministriesinc.org/System/UserProfile.asp?id=44404&func=signup&referer=https://onlinecasino.us.org   http://throttle-booster.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://movingcoil.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://livejournals.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chinaski.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://editionsquebecormedia.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://westwindgroup.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://golden-theatre.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://e-m-financial.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://riverbelugacaviar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://principals-only.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wamco.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://premierdui.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://athenshop.gr/redirect.asp?https://onlinecasino.us.org  http://chakn.ru/redirect?url=https://onlinecasino.us.org  http://www.phillypa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mindriter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://romsat.ua/bitrix/rk.php?id=57&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B57%5D+%5Bmain_baner1%5D+%D0%9A%D0%BE%D0%BC%D1%83%D1%82%D0%B0%D1%82%D0%BE%D1%80%D0%B8+Ethernet&goto=onlinecasino.us.org  http://snaptrophies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dep.agro.tomsk.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org   http://bryanzumwalt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ip-216-194-89-80.tera-byte.com/o.php?u=out.php?url=onlinecasino.us.org   http://qwj.outdoorrewards.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cecilyober.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://epipenuse.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://belmont-trading.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mostblingforleastchaching.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hvaccincinnati.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://optiglyph.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://datascienceanalyticservices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://denti-gift.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ositeoficial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://shoredreamsevents.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://txiag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://davidhparker.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://saliemarise.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://spoistess.ga/redirect.php?url=https://onlinecasino.us.org   http://www.turkmedline.net/go.php?id=190&url=https://onlinecasino.us.org   http://scivest.com/cgi-bin/tools/printpage.cgi/sitemap.html?referer=https://onlinecasino.us.org  http://weddingstogo.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stillcomputes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://union-investment.ch/startseite-de/login.html?referer=https://onlinecasino.us.org  http://katheros.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://odokon.org/w3a/redirect.php?redirect=https://onlinecasino.us.org/ \nhttp://webcreate.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marylouiseparker.tv/out.php?url=https://onlinecasino.us.org/   https://facenama.com/redirect.php?url=https://onlinecasino.us.org   http://swemachines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://achievablehomes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yohobby.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://avocadouniversity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.malababetka.cz/malababetka/f-ce/insert-click-redir.php?nazev=Zahradn%ED%20kv%ECtin%E1%E8e,%20betonov%E9%20kv%ECtn%EDky%20&link=https://onlinecasino.us.org   http://www.150teengalleries.com/cgi-bin/a2/out.cgi?id=40&u=https://onlinecasino.us.org \n \n \n \n \n \nhttps://celsohl.com/?contact-form-id=50235&contact-form-sent=99381&contact-form-hash=61b7306e80c71013c4456a98c4fbb64f390ec1fb&_wpnonce=b44189235f\nhttps://www.deadlytarantulagirl.com/index.php?topic=21671.new#new\nhttp://tynedalegreenparty.org/forum/index.php?topic=61079.new#new\nhttp://futsal5cotland.com/viewtopic.php?pid=31195#p31195\nhttp://community.alahlyegypt.com/forum/main-forum/140604-free-online-games-miniclip\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8063, "cpu_time_ms": 26, "memory_kb": 4448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s561046823", "group_id": "codeNet:p03941", "input_text": "http://shoppermarketingexpo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://evl.sunfed.com.mx/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://imirzian.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://turnto10blogs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://alarifi.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ikonomist.bg/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://axapremiermutualfunds.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.12345678910.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://circlesandarrows.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://customizedmailings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.l9d.xoxohth.com/go.php?url=https://onlinecasino.us.org   http://cargigicars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://owdllp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://contramedia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://newhopeumc.us/System/UserProfile.asp?id=43489&func=signup&referer=https://onlinecasino.us.org  http://ero-story.com/forum/away.php?s=https://onlinecasino.us.org  http://happycareer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://panes.securehostingcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wondersocialexchange.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yixiumei.net/index.php?c=Login&a=reg&referer=https://onlinecasino.us.org   http://integrisconnect.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://baytowerresidences.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://expertapr.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.epubli.de/shop/buch/45209/go?link=https://onlinecasino.us.org  http://crinoplantes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.komandirovka.ru/bitrix/redirect.php?object_id=124948133&goto=https://onlinecasino.us.org   http://newhealing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.wesell4youtoo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://madasenmcgrath.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://after-love.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.teatech-inc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://specificationwriter.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://moladibari.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dermoviva.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.jjyad.cn/family/link.php?url=https://onlinecasino.us.org   http://kupocar.com/redirect?url=https://onlinecasino.us.org \nhttps://analyzer.gooo-gle.com/redirect.php?url=https://onlinecasino.us.org  http://gismanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://universityretirement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bichi.one/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://ofertas-esqui.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://flexprofen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.drmshk.com/link.php?url=https://onlinecasino.us.org  http://inzerujzdarma.jhs86alumni.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aminta.cdnvideo.ru/bitrix/rk.php?id=86&event1=banner&event2=click&event3=1+%2F+%5B86%5D+%5BMAIN_LEFT_REVIEW%5D+%CD%EE%E2%FB%E9+%C0%C8+-+%E1%E0%ED%ED%E5%F0+1+-+%CC%E8%ED%E8%EB%E0%E9%ED%E5%F0+(%EB%E5%E2%FB%E9+%E1%E0%ED%E5%F0+%E2+%EE%E1%E7%EE%F0%E0%F5+2.0)&goto=https://onlinecasino.us.org \nhttp://volkswagenalbuquerque.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://haberdiboni.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mycommunitynow.com/s?action=editReg&rurl=https://onlinecasino.us.org   http://brandonbariatrics.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.invatehnika.ru/redirect.php?url=https://onlinecasino.us.org   https://es.sourceforge.net/directory/?q=https://onlinecasino.us.org  http://scicominfo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.teamupfitness.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bjtz010.com/uhome/link.php?url=https://onlinecasino.us.org \nhttp://bestwesternaustralia.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://theworldsmostperfectlycutdiamond.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://katun24.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org   http://www.santetropicale.com/ext_link.asp?link=https://onlinecasino.us.org  http://taxsalebuyer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cannabis.ink/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://overheaddoormainnumber.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://karir.imslogistics.com/language/en?return=https://onlinecasino.us.org   http://comstockhomesinc.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://jobesgardner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sieforeazteca.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eddiebaueroutlets.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vks.ultrathinclient.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ladockchurch.org.uk/goto-link.php?link_id=24&url=https://onlinecasino.us.org   http://industrialfloormats.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kickbackproof.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.listasa.com.br/url.php?c=62341&s=onlinecasino.us.org   http://justhappymarriage.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://globalsausage.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.singingroom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.iistix.com/index.php?url=https://onlinecasino.us.org   http://certifiedcar.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.womanews.ru/goto/https://onlinecasino.us.org   http://thingssandysays.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://henricks.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://chernikovka24.ru/go/url=https://onlinecasino.us.org   http://dimalabs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://chemicalsaviour.viinyl.com/go?url_to=https://onlinecasino.us.org  http://www.carmax-blows.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://publichealthwell.ie/new_redirect/?&content=journal_article&member=16564&url=https://onlinecasino.us.org   http://110tyc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://akasha.solitarydesign.com/scoala/?a<>=<a href=https://onlinecasino.us.org ayam%2   http://www.xxxfuckporn.com/cgi-bin/atx/out.cgi?id=21&trade=https://onlinecasino.us.org  http://www.nikkos.kz/go.php?go=https://onlinecasino.us.org  http://beihaojia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://geo-news.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://coconut-water.in/index.php?topic=236470.new#new\nhttp://seafoxowners.com/viewtopic.php?f=8&t=1557513\nhttps://xossipp.com/showthread.php?tid=546\nhttps://www.educationdiet.com/blog/benefits-of-online-examinations/#comment-24692\nhttp://forumgeos.tk/viewtopic.php?f=4&t=294509\n", "language": "Lisp", "metadata": {"date": 1549330608, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s561046823.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s561046823", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://shoppermarketingexpo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://evl.sunfed.com.mx/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://imirzian.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://turnto10blogs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://alarifi.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ikonomist.bg/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://axapremiermutualfunds.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.12345678910.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://circlesandarrows.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://customizedmailings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.l9d.xoxohth.com/go.php?url=https://onlinecasino.us.org   http://cargigicars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://owdllp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://contramedia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://newhopeumc.us/System/UserProfile.asp?id=43489&func=signup&referer=https://onlinecasino.us.org  http://ero-story.com/forum/away.php?s=https://onlinecasino.us.org  http://happycareer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://panes.securehostingcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wondersocialexchange.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yixiumei.net/index.php?c=Login&a=reg&referer=https://onlinecasino.us.org   http://integrisconnect.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://baytowerresidences.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://expertapr.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.epubli.de/shop/buch/45209/go?link=https://onlinecasino.us.org  http://crinoplantes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.komandirovka.ru/bitrix/redirect.php?object_id=124948133&goto=https://onlinecasino.us.org   http://newhealing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.wesell4youtoo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://madasenmcgrath.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://after-love.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.teatech-inc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://specificationwriter.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://moladibari.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dermoviva.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.jjyad.cn/family/link.php?url=https://onlinecasino.us.org   http://kupocar.com/redirect?url=https://onlinecasino.us.org \nhttps://analyzer.gooo-gle.com/redirect.php?url=https://onlinecasino.us.org  http://gismanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://universityretirement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bichi.one/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://ofertas-esqui.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://flexprofen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.drmshk.com/link.php?url=https://onlinecasino.us.org  http://inzerujzdarma.jhs86alumni.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aminta.cdnvideo.ru/bitrix/rk.php?id=86&event1=banner&event2=click&event3=1+%2F+%5B86%5D+%5BMAIN_LEFT_REVIEW%5D+%CD%EE%E2%FB%E9+%C0%C8+-+%E1%E0%ED%ED%E5%F0+1+-+%CC%E8%ED%E8%EB%E0%E9%ED%E5%F0+(%EB%E5%E2%FB%E9+%E1%E0%ED%E5%F0+%E2+%EE%E1%E7%EE%F0%E0%F5+2.0)&goto=https://onlinecasino.us.org \nhttp://volkswagenalbuquerque.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://haberdiboni.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mycommunitynow.com/s?action=editReg&rurl=https://onlinecasino.us.org   http://brandonbariatrics.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.invatehnika.ru/redirect.php?url=https://onlinecasino.us.org   https://es.sourceforge.net/directory/?q=https://onlinecasino.us.org  http://scicominfo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.teamupfitness.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bjtz010.com/uhome/link.php?url=https://onlinecasino.us.org \nhttp://bestwesternaustralia.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://theworldsmostperfectlycutdiamond.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://katun24.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org   http://www.santetropicale.com/ext_link.asp?link=https://onlinecasino.us.org  http://taxsalebuyer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cannabis.ink/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://overheaddoormainnumber.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://karir.imslogistics.com/language/en?return=https://onlinecasino.us.org   http://comstockhomesinc.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://jobesgardner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sieforeazteca.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eddiebaueroutlets.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vks.ultrathinclient.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.ladockchurch.org.uk/goto-link.php?link_id=24&url=https://onlinecasino.us.org   http://industrialfloormats.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kickbackproof.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.listasa.com.br/url.php?c=62341&s=onlinecasino.us.org   http://justhappymarriage.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://globalsausage.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.singingroom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.iistix.com/index.php?url=https://onlinecasino.us.org   http://certifiedcar.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.womanews.ru/goto/https://onlinecasino.us.org   http://thingssandysays.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://henricks.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://chernikovka24.ru/go/url=https://onlinecasino.us.org   http://dimalabs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://chemicalsaviour.viinyl.com/go?url_to=https://onlinecasino.us.org  http://www.carmax-blows.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://publichealthwell.ie/new_redirect/?&content=journal_article&member=16564&url=https://onlinecasino.us.org   http://110tyc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://akasha.solitarydesign.com/scoala/?a<>=<a href=https://onlinecasino.us.org ayam%2   http://www.xxxfuckporn.com/cgi-bin/atx/out.cgi?id=21&trade=https://onlinecasino.us.org  http://www.nikkos.kz/go.php?go=https://onlinecasino.us.org  http://beihaojia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://geo-news.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://coconut-water.in/index.php?topic=236470.new#new\nhttp://seafoxowners.com/viewtopic.php?f=8&t=1557513\nhttps://xossipp.com/showthread.php?tid=546\nhttps://www.educationdiet.com/blog/benefits-of-online-examinations/#comment-24692\nhttp://forumgeos.tk/viewtopic.php?f=4&t=294509\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7801, "cpu_time_ms": 26, "memory_kb": 4452}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s160007513", "group_id": "codeNet:p03941", "input_text": "http://bible-maps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kupi-proday.by/redirect/?go=https://onlinecasino.us.org   http://carnetquicklist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fr.99quiz.com/link.php?link=https://onlinecasino.us.org  http://bizar-media.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cgitemps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://141027891.r.bat.bing.com/?ld=d3zb_jeb5TBYGwGSeSAOJVozVUCUyfMBVVCywWDYUXBqG8996YX3l0iJCy-NGmfGpckRA_AQL0g5saROGMIobpY5u4KD7Zso6JeUXjbRpjHNE_tD_dt5NJN8xRjNF5Lt1d8jnlA0mf1mQcxjkkhsoNfjd0eJ3lWko_nCXjFN_AZ9O832lf&u=https://onlinecasino.us.org  http://nuclear.expert/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gratui-tees.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.discoveruci.net/redirect?SessionGuid=135c4e89-a983-4f77-9143-daf046534533&url=https://onlinecasino.us.org  http://dwf.undercovercamera.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://448shill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://app.meltwater.com/mwTransition/?url=https://onlinecasino.us.org  http://contractassay.cn/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dreamflute.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tradeext.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://designingbanks.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://go.bodogame.com/index.php?url=https://onlinecasino.us.org \nhttp://iread4fun.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.awccc.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://tripodphoto.ru/go?https://onlinecasino.us.org   http://getagripdefense.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://umarket.be/go?https://onlinecasino.us.org   http://www.0934088843.tw/pro/redirect.php?url=https://onlinecasino.us.org  http://1877findout.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://brinkslights.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://networkrecovery.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.maturemoviesworld.com/cgi-bin/at3/out.cgi?id=58&tag=toplist&trade=https://onlinecasino.us.org  http://ceskapozice.lidovky.cz/redir.aspx?url=https://onlinecasino.us.org   http://happyhellowork.clipe.pt/go.php?url=onlinecasino.us.org   http://zechman.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://how2vacation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://garykain.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://oneperfectpilsner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rusticislands.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://equalafh.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://scriptsmafia.gemandjewelryguide.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lezlez.ranks1.apserver.http21.com/bestofadult/mkr/out.cgi?id=07385&go=/onlinecasino.us.org   http://www.tributetodeanmartin.com/elvis/go.php?url=https://onlinecasino.us.org   http://integratedwaterworks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thebestpageintheuniverse.net/outgoing.cgi?u=https://onlinecasino.us.org   http://mcindustrial.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dzhig.com/blog-o-rybalke/item/26-content-demo-135/26-content-demo-135?goto=onlinecasino.us.org  http://www.jig.jp/redirect/?url=https://onlinecasino.us.org   http://333.townegallery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://aapm.org/r/?s=AUTO&m=4573&u=https://onlinecasino.us.org  http://goneaskew.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://penn-exec.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fidelityflatheadcounty.com/customRedirect.aspx?url=https://onlinecasino.us.org  http://www.gaitclinical.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://blue11records.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.hermite.org/wp-content/plugins/go.php?https://onlinecasino.us.org/  http://coredaptx.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ausight.com.au/oscommerce/redirect.php?action=url&goto=onlinecasino.us.org \nhttp://daliprints.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nbc6weatherplus.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bathroomdetailing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.falconpro.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://usbkey4u.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cousinsproperties.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lauramatter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://zusds.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://reseau-anact.fr/emailer/newsletters/stats/link.jsp?sending=2123&id=475673&url=https://onlinecasino.us.org/ \nhttp://hockeymanawatu.org.nz/LinkClick.aspx?link=https://onlinecasino.us.org  http://mura.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cordlocks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://poleover.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.psirep.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.coverti.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.logisticsintegration.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.markclark.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.westportnow.com/index.php?url=https://onlinecasino.us.org \nhttp://mattbakey.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://memberservices.membee.com/feeds//login/redirect.aspx?cid=573&desturl=https://onlinecasino.us.org   http://kosaircrippledchildrenhospital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.blueprintforcash.com/go.php?url=https://onlinecasino.us.org  http://av-list.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.free521.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://www.4x4opony.pl/cgi-bin/redirect.pl?https://onlinecasino.us.org  http://vision-core.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pestguru.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://dreamsillustrated.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://parillogroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kobymanufacturingcompany.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.concours-emploi.com/r.php?u=https://onlinecasino.us.org  http://ftlauderdalesightseeingcruise.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sup-power.com/Chat.htm?arg=10004226&style=1&kf=&kflist=on&kf=jackyro%40led-card.com%2Csales033%40led-card.com%2Csales032%40led-card.com%2Csales031%40led-card.com%2Csales036%40led-card.com%2Csales035%40led-card.com%2Csales037%40led-card.com%2Csales038%40led-card.com%2Csales039%40led-card.com%2Ceng021%40led-card.com%2Ctoby%40led-card.com%2Csales021%40led-card.com&zdkf_type=1&language=en&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://onlinecasino.us.org  http://www.stocking-glamour.com/cgi-bin/at3/out.cgi?id=163&trade=https://onlinecasino.us.org  http://syfir.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.animalrank.com/cgi-bin/out.cgi?id=adraw&url=https://onlinecasino.us.org \n \n \n \n \n \nhttp://diamondrpg.tk/forum/viewtopic.php?f=68&t=945&p=33770#p33770\nhttp://www.gsusmusic.org/viewtopic.php?f=2&t=193791&p=253986#p253986\nhttp://seointelligenceagency.com/forum/viewtopic.php?f=103&t=4377&p=348597#p348597\nhttp://coconut-water.in/index.php?topic=236401.new#new\nhttp://forum.lib42.ru/viewtopic.php?pid=70901#p70901\n", "language": "Lisp", "metadata": {"date": 1549324808, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s160007513.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s160007513", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://bible-maps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kupi-proday.by/redirect/?go=https://onlinecasino.us.org   http://carnetquicklist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fr.99quiz.com/link.php?link=https://onlinecasino.us.org  http://bizar-media.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cgitemps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://141027891.r.bat.bing.com/?ld=d3zb_jeb5TBYGwGSeSAOJVozVUCUyfMBVVCywWDYUXBqG8996YX3l0iJCy-NGmfGpckRA_AQL0g5saROGMIobpY5u4KD7Zso6JeUXjbRpjHNE_tD_dt5NJN8xRjNF5Lt1d8jnlA0mf1mQcxjkkhsoNfjd0eJ3lWko_nCXjFN_AZ9O832lf&u=https://onlinecasino.us.org  http://nuclear.expert/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gratui-tees.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.discoveruci.net/redirect?SessionGuid=135c4e89-a983-4f77-9143-daf046534533&url=https://onlinecasino.us.org  http://dwf.undercovercamera.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://448shill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://app.meltwater.com/mwTransition/?url=https://onlinecasino.us.org  http://contractassay.cn/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dreamflute.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tradeext.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://designingbanks.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://go.bodogame.com/index.php?url=https://onlinecasino.us.org \nhttp://iread4fun.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.awccc.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org   http://tripodphoto.ru/go?https://onlinecasino.us.org   http://getagripdefense.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://umarket.be/go?https://onlinecasino.us.org   http://www.0934088843.tw/pro/redirect.php?url=https://onlinecasino.us.org  http://1877findout.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://brinkslights.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://networkrecovery.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.maturemoviesworld.com/cgi-bin/at3/out.cgi?id=58&tag=toplist&trade=https://onlinecasino.us.org  http://ceskapozice.lidovky.cz/redir.aspx?url=https://onlinecasino.us.org   http://happyhellowork.clipe.pt/go.php?url=onlinecasino.us.org   http://zechman.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://how2vacation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://garykain.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://oneperfectpilsner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rusticislands.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://equalafh.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://scriptsmafia.gemandjewelryguide.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lezlez.ranks1.apserver.http21.com/bestofadult/mkr/out.cgi?id=07385&go=/onlinecasino.us.org   http://www.tributetodeanmartin.com/elvis/go.php?url=https://onlinecasino.us.org   http://integratedwaterworks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thebestpageintheuniverse.net/outgoing.cgi?u=https://onlinecasino.us.org   http://mcindustrial.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dzhig.com/blog-o-rybalke/item/26-content-demo-135/26-content-demo-135?goto=onlinecasino.us.org  http://www.jig.jp/redirect/?url=https://onlinecasino.us.org   http://333.townegallery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://aapm.org/r/?s=AUTO&m=4573&u=https://onlinecasino.us.org  http://goneaskew.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://penn-exec.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fidelityflatheadcounty.com/customRedirect.aspx?url=https://onlinecasino.us.org  http://www.gaitclinical.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://blue11records.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.hermite.org/wp-content/plugins/go.php?https://onlinecasino.us.org/  http://coredaptx.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ausight.com.au/oscommerce/redirect.php?action=url&goto=onlinecasino.us.org \nhttp://daliprints.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nbc6weatherplus.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bathroomdetailing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.falconpro.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://usbkey4u.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cousinsproperties.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lauramatter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://zusds.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://reseau-anact.fr/emailer/newsletters/stats/link.jsp?sending=2123&id=475673&url=https://onlinecasino.us.org/ \nhttp://hockeymanawatu.org.nz/LinkClick.aspx?link=https://onlinecasino.us.org  http://mura.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cordlocks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://poleover.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.psirep.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.coverti.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.logisticsintegration.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.markclark.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.westportnow.com/index.php?url=https://onlinecasino.us.org \nhttp://mattbakey.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://memberservices.membee.com/feeds//login/redirect.aspx?cid=573&desturl=https://onlinecasino.us.org   http://kosaircrippledchildrenhospital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.blueprintforcash.com/go.php?url=https://onlinecasino.us.org  http://av-list.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.free521.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino.us.org  http://www.4x4opony.pl/cgi-bin/redirect.pl?https://onlinecasino.us.org  http://vision-core.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pestguru.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://dreamsillustrated.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://parillogroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kobymanufacturingcompany.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.concours-emploi.com/r.php?u=https://onlinecasino.us.org  http://ftlauderdalesightseeingcruise.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sup-power.com/Chat.htm?arg=10004226&style=1&kf=&kflist=on&kf=jackyro%40led-card.com%2Csales033%40led-card.com%2Csales032%40led-card.com%2Csales031%40led-card.com%2Csales036%40led-card.com%2Csales035%40led-card.com%2Csales037%40led-card.com%2Csales038%40led-card.com%2Csales039%40led-card.com%2Ceng021%40led-card.com%2Ctoby%40led-card.com%2Csales021%40led-card.com&zdkf_type=1&language=en&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://onlinecasino.us.org  http://www.stocking-glamour.com/cgi-bin/at3/out.cgi?id=163&trade=https://onlinecasino.us.org  http://syfir.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.animalrank.com/cgi-bin/out.cgi?id=adraw&url=https://onlinecasino.us.org \n \n \n \n \n \nhttp://diamondrpg.tk/forum/viewtopic.php?f=68&t=945&p=33770#p33770\nhttp://www.gsusmusic.org/viewtopic.php?f=2&t=193791&p=253986#p253986\nhttp://seointelligenceagency.com/forum/viewtopic.php?f=103&t=4377&p=348597#p348597\nhttp://coconut-water.in/index.php?topic=236401.new#new\nhttp://forum.lib42.ru/viewtopic.php?pid=70901#p70901\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8225, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s970877401", "group_id": "codeNet:p03941", "input_text": "https://poisk-podbor.ru/?&action=redirect&pkpk=1&owner_id=45746&global_id=30828721&url=https://onlinecasino.us.org  http://www.huisenzekerheidamersfoort.nl/index.php?url=https://onlinecasino.us.org   http://berkshireysu.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.invest74.ru/go.php?url=onlinecasino.us.org  http://lsjins.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nspi.expert/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.visionmatters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.magic-asians.com/cgi-bin/at3/out.cgi?s=50&l=t1&u=https://onlinecasino.us.org   http://seniordentalcenters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://visual-pagerank.eu/rapport-analyse-d3d3LnJhcGlkc2hhcmUuc3BhY2U=-onlinecasino.us.org  http://sportpromotion.eu/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org   http://sms-power.wirbay.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://koreaneora.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wagillc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.coponesapeso.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://alot.crumandforsterindemnity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://leigh-musicof.xoxohth.com/go.php?url=https://onlinecasino.us.org   http://www.ebusinessinsurance.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.tierwebcams.de/forwarder.php?url=https://onlinecasino.us.org  http://www.stockholmraceway.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bayareawellnesscoach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wjctoday.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bahiamar.events/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://puertasmmi.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://goldenwestmedicalclinic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pbmcfarlane.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lowertaxation.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://carobar.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.czslib.com/KCMS/logout.aspx?url=https://onlinecasino.us.org   http://fiddletalk.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://0u.cubedown.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lorilardinc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tmsk.zhuanbeikeji.com/index.php?g=Appoint&c=Changecity&a=go&city=yc&referer=https://onlinecasino.us.org  http://reousa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.orizontes.gr/redirect/redirect.aspx?url=https://onlinecasino.us.org   http://www.virchyfilmworks.net/click.php?id=60&url=https://onlinecasino.us.org \nhttp://noyeshealth.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://calculation-partner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://freeasiantube.org/cgi-bin/crtr/out.cgi?url=https://onlinecasino.us.org   http://oti.empiretrailer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thegalleriesxxx.com/cgi-bin/ucj/c.cgi?url=https://onlinecasino.us.org   http://alcoholspeaker.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://oralscoaching.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://irecyclesystem.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://americanpiepizza.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://companiondataservices.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eatingdisordersprogram.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://m.thisted-camping.dk/pages/link_stat.asp?url=https://onlinecasino.us.org   http://www.tastytom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.gaytorrent.ru/redir.php?url=https://onlinecasino.us.org   http://paycable.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dreamart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dmpna.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pinecroftwines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.myvacation.cn/space/link.php?url=https://onlinecasino.us.org  http://tritonclass.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vacationwonder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.kadouya-site.info/rank.php?mode=link&id=1418&url=https://onlinecasino.us.org  http://sociotonia.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pollutioncontrolnozzles.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.bashklip.ru/go?https://onlinecasino.us.org  http://it-webdesigns.nl/sitecheck/redirect.php?url=https://onlinecasino.us.org   http://www.52luckystar.com/link.php?action=previous&fid=100&tid=9856&fpage=0&goto=onlinecasino.us.org \nhttp://beforeithappens.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://familytree-maker.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.jlcontabilidade-rj.com.br/redir.php?ou=topo&url=https://onlinecasino.us.org   http://optimerareviews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tvshowaz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sovietjeans.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ip-216-194-89-80.tera-byte.com/o.php?u=out.php?url=onlinecasino.us.org  http://portabreezefan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://famouscitybistro.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://myitalianglasses.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://orcacapital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sgt.createaforum.com/index.php?thememode=full;redirect=https://onlinecasino.us.org   http://untransparency.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://supplements.goldenarticles.net/go.php?url=https://onlinecasino.us.org   http://deerfieldvalley.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cornguis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bluedigit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://somisusd.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://grandcaymanyachtclubmarina.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://neapolitantfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://makemoneyinrealestate.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://owy.blackbearfabrics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://baby-slings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mimismercantile.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.math.poly.edu/cgi-bin/axs/ax.pl?https://onlinecasino.us.org  http://www.gloriouscrusade.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://boothinvest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://forum.petmagaza.net/viewtopic.php?f=6&t=22169\nhttps://forum.sofort.support/index.php/topic,106465.new.html#new\nhttps://www.lecoindealex.fr/Forum/viewtopic.php?f=4&t=95233\nhttps://www.educationdiet.com/blog/benefits-of-online-examinations/#comment-24601\nhttps://www.com21.com/bbs/viewtopic.php?pid=113145#p113145\n", "language": "Lisp", "metadata": {"date": 1549313239, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s970877401.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s970877401", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://poisk-podbor.ru/?&action=redirect&pkpk=1&owner_id=45746&global_id=30828721&url=https://onlinecasino.us.org  http://www.huisenzekerheidamersfoort.nl/index.php?url=https://onlinecasino.us.org   http://berkshireysu.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.invest74.ru/go.php?url=onlinecasino.us.org  http://lsjins.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nspi.expert/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.visionmatters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.magic-asians.com/cgi-bin/at3/out.cgi?s=50&l=t1&u=https://onlinecasino.us.org   http://seniordentalcenters.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://visual-pagerank.eu/rapport-analyse-d3d3LnJhcGlkc2hhcmUuc3BhY2U=-onlinecasino.us.org  http://sportpromotion.eu/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org   http://sms-power.wirbay.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://koreaneora.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wagillc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.coponesapeso.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://alot.crumandforsterindemnity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://leigh-musicof.xoxohth.com/go.php?url=https://onlinecasino.us.org   http://www.ebusinessinsurance.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.tierwebcams.de/forwarder.php?url=https://onlinecasino.us.org  http://www.stockholmraceway.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bayareawellnesscoach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wjctoday.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bahiamar.events/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://puertasmmi.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://goldenwestmedicalclinic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pbmcfarlane.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lowertaxation.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://carobar.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.czslib.com/KCMS/logout.aspx?url=https://onlinecasino.us.org   http://fiddletalk.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://0u.cubedown.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lorilardinc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tmsk.zhuanbeikeji.com/index.php?g=Appoint&c=Changecity&a=go&city=yc&referer=https://onlinecasino.us.org  http://reousa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.orizontes.gr/redirect/redirect.aspx?url=https://onlinecasino.us.org   http://www.virchyfilmworks.net/click.php?id=60&url=https://onlinecasino.us.org \nhttp://noyeshealth.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://calculation-partner.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://freeasiantube.org/cgi-bin/crtr/out.cgi?url=https://onlinecasino.us.org   http://oti.empiretrailer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thegalleriesxxx.com/cgi-bin/ucj/c.cgi?url=https://onlinecasino.us.org   http://alcoholspeaker.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://oralscoaching.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://irecyclesystem.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://americanpiepizza.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://companiondataservices.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eatingdisordersprogram.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://m.thisted-camping.dk/pages/link_stat.asp?url=https://onlinecasino.us.org   http://www.tastytom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.gaytorrent.ru/redir.php?url=https://onlinecasino.us.org   http://paycable.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dreamart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dmpna.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pinecroftwines.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.myvacation.cn/space/link.php?url=https://onlinecasino.us.org  http://tritonclass.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vacationwonder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.kadouya-site.info/rank.php?mode=link&id=1418&url=https://onlinecasino.us.org  http://sociotonia.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://pollutioncontrolnozzles.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.bashklip.ru/go?https://onlinecasino.us.org  http://it-webdesigns.nl/sitecheck/redirect.php?url=https://onlinecasino.us.org   http://www.52luckystar.com/link.php?action=previous&fid=100&tid=9856&fpage=0&goto=onlinecasino.us.org \nhttp://beforeithappens.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://familytree-maker.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.jlcontabilidade-rj.com.br/redir.php?ou=topo&url=https://onlinecasino.us.org   http://optimerareviews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://tvshowaz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sovietjeans.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ip-216-194-89-80.tera-byte.com/o.php?u=out.php?url=onlinecasino.us.org  http://portabreezefan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://famouscitybistro.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://myitalianglasses.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://orcacapital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sgt.createaforum.com/index.php?thememode=full;redirect=https://onlinecasino.us.org   http://untransparency.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://supplements.goldenarticles.net/go.php?url=https://onlinecasino.us.org   http://deerfieldvalley.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cornguis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bluedigit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://somisusd.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://grandcaymanyachtclubmarina.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://neapolitantfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://makemoneyinrealestate.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://owy.blackbearfabrics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://baby-slings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mimismercantile.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.math.poly.edu/cgi-bin/axs/ax.pl?https://onlinecasino.us.org  http://www.gloriouscrusade.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://boothinvest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://forum.petmagaza.net/viewtopic.php?f=6&t=22169\nhttps://forum.sofort.support/index.php/topic,106465.new.html#new\nhttps://www.lecoindealex.fr/Forum/viewtopic.php?f=4&t=95233\nhttps://www.educationdiet.com/blog/benefits-of-online-examinations/#comment-24601\nhttps://www.com21.com/bbs/viewtopic.php?pid=113145#p113145\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7745, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s783208547", "group_id": "codeNet:p03941", "input_text": "http://agvine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://slugmen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://quickoutline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://presto-pre.com/modules/wordpress/wp-ktai.php?view=redir&url=https://onlinecasino.us.org/  http://homeinriverside.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://westonsolutions.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thenorthstarteam.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://2transport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tampabayivf.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://belgiumnewschannel.com/index.php?do=external&channel=26&url=https://onlinecasino.us.org  http://fxs.inproconsultinggroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.freeonlinetv.ru/go.php?url=https://onlinecasino.us.org   http://goodfoodplanet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.indookanagantimes.com/languages/?redirect=https://onlinecasino.us.org   http://kletterws.kaliop.net/KL_Redirect/redirect.aspx?id_newsletter=5026&intitule=ici&url=https://onlinecasino.us.org  http://drdelange.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://webscanner.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://enterprisefind.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://gx1.filmpix.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://publixcontactlenses.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mailersinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lifedebit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://polkspeakers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.yugzdrav.ru/upload/rk/eb5/eb506851bae8ee9a0a4195a8fa8914c8.swf?flash_link=onlinecasino.us.org  http://www.oboiland.ru/bitrix/rk.php?id=11&site_id=s1&goto=onlinecasino.us.org  http://walcost.com/go/?url=https://onlinecasino.us.org   http://thechibridge.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.bonitabayresidents.com/default.aspx?p=TrackHyperlink&url=https://onlinecasino.us.org  http://emergingtechlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://medicineinfo.awardspace.com/go.php?url=https://onlinecasino.us.org   http://lxe.hostingnames.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.alex-car.ru/links.php?go=https://onlinecasino.us.org   http://my-wmmail.ru/go?https://onlinecasino.us.org  http://ldsgeneralconference.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.medbroadcast.com/redirect.asp?action_id=103&url=https://onlinecasino.us.org   http://aubreymicky.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wap.118100.cn/i/e/redirect.do?turl=http://onlinecasino.us.org  http://www.vanadine.net/downloads_links/?links_id=18&goto=https://onlinecasino.us.org   http://turtlefly.4pets.es/php.php?a%5B%5D=%3Ca%20href%3Dhttp%3A%2F%2Fonlinecasino.us.org%2F%3E%C3%91%C5%8D%C3%90%C2%BB%C3%90%C2%B5%C3%90%C2%BA%C3%91%E2%80%9A%C3%91%E2%82%AC%C3%90%C2%BE%C3%90%C2%BC%C3%90%C2%BE%C3%90%C2%BD%C3%91%E2%80%9A%C3%90%C2%B0%C3%90%C2%B6%C3%90%C2%BD%C3%91%E2%80%B9%C3%90%C2%B5%20%C3%91%E2%82%AC%C3%90%C2%B0%C3%90%C2%B1%C3%90%C2%BE%C3%91%E2%80%9A%C3%91%E2%80%B9%20%C3%90%C2%B1%C3%90%C2%B0%C3%91%E2%82%AC%C3%90%C2%BD%C3%90%C2%B0%C3%91%83%C3%90%C2%BB%3C%2Fa%3E   http://mgmkitchenandbath.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://universityoffugu.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zaym-kruglosutochno-online.ru/go.php?url=onlinecasino.us.org  http://mdb.monsterball.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.donerrewards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://1888stopirs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://jbwgroup.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://questcable.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kallux.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.colamco.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.jechurch.org/goto-link.php?link_id=10&url=https://onlinecasino.us.org   http://pinespropane.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jobmatchhuntsville.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://2axxess.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.halawa.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.cosic.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.offshoreonly.com/forums/general-boating-discussion/323278-2015-fpc-miami-boat-show-poker-run-pix-shoot2thrill.html?amp;goto=onlinecasino.us.org   http://www.kladpoisk.ru/bitrix/redirect.php?event1=catalog_out&event2=http%3A%2F%2Fwww.kladpoisk.ru%2Finstr%2FWhites_TM808.pdf&event3=%D0%9C%D0%B5%D1%82%D0%B0%D0%BB%D0%BB%D0%BE%D0%B8%D1%81%D0%BA%D0%B0%D1%82%D0%B5%D0%BB%D1%8C+White%27s+TM+808+%28%D0%B3%D0%BB%D1%83%D0%B1%D0%B8%D0%BD%D0%BD%D1%8B%D0%B9%29&goto=https://onlinecasino.us.org   http://precisionmotorwerkes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://islamicunion.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://demo.klick2contact.com/v03/providers/GrahamDemo/window/windowEmail.html?t=GrahamDemo-37721434432450158a8fc0d443f250b5&p=GrahamDemo&pid=&d=20&n=&e=&c=GrahamDemo_iOSQApKu4FZcG&tel=&ch=EM&iid=IGH&psk=chat_a2&m=3&fcl=0&r=K2C&srbp=&iif=1&l=en&auto=&ud=&u=https://onlinecasino.us.org  http://www.freemaltomeal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://3.89089.site/url?q=https://onlinecasino.us.org   http://adultal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://behavioralwisdom.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.salesexpo.com.pk/redirect?id=KrossKulture&url=https://onlinecasino.us.org   http://cytotherapy.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://librahospitalitymanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://santandermoney.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rustichimalayas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hopyazz.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kigi-kultura.ru/go.php?to=https://onlinecasino.us.org   http://www.smolcar.ru/avto/redirect.php?click=onlinecasino.us.org \nhttp://www.blackxxxvids.com/cgi-bin/atx/out.cgi?id=75&trade=https://onlinecasino.us.org  http://icrcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://wstats.org/onlinecasino.us.org   http://cdwhighereducation.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fanlibsucks.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.daimali.com/Go/?url=https://onlinecasino.us.org  http://www.dmfy.gov.cn/h2p/index.php?url=https://onlinecasino.us.org  http://www.shortmeup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://murrietaautomall.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bbs.sufe.edu.cn/redirect.php?fid=118&tid=195316&goto=onlinecasino.us.org  http://spacecolorado.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://emx.samoasurf.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lasfuentes-alcaste.com/favoritos/go.php?id=270&url=https://onlinecasino.us.org  http://golfvideocritic.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lunenburgmoonshine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://saudipolymers.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://maytagblue.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://actuarialcareers.gs/__media__/js/trademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://entmuttert.com/2016/01/24/einfache-rechnung-kein-umgangdann-kein-unterhalt/\nhttp://www.thorinfamily.net/archives/72#comment-17143\nhttp://lady-swear.nichost.ru/index.php?topic=175197.new#new\nhttps://cyberpunkrp.xyz/f/showthread.php?tid=150240\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=174730\n", "language": "Lisp", "metadata": {"date": 1549301966, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s783208547.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s783208547", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://agvine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://slugmen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://quickoutline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://presto-pre.com/modules/wordpress/wp-ktai.php?view=redir&url=https://onlinecasino.us.org/  http://homeinriverside.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://westonsolutions.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thenorthstarteam.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://2transport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tampabayivf.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://belgiumnewschannel.com/index.php?do=external&channel=26&url=https://onlinecasino.us.org  http://fxs.inproconsultinggroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.freeonlinetv.ru/go.php?url=https://onlinecasino.us.org   http://goodfoodplanet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.indookanagantimes.com/languages/?redirect=https://onlinecasino.us.org   http://kletterws.kaliop.net/KL_Redirect/redirect.aspx?id_newsletter=5026&intitule=ici&url=https://onlinecasino.us.org  http://drdelange.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://webscanner.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://enterprisefind.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://gx1.filmpix.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://publixcontactlenses.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mailersinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lifedebit.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://polkspeakers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.yugzdrav.ru/upload/rk/eb5/eb506851bae8ee9a0a4195a8fa8914c8.swf?flash_link=onlinecasino.us.org  http://www.oboiland.ru/bitrix/rk.php?id=11&site_id=s1&goto=onlinecasino.us.org  http://walcost.com/go/?url=https://onlinecasino.us.org   http://thechibridge.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.bonitabayresidents.com/default.aspx?p=TrackHyperlink&url=https://onlinecasino.us.org  http://emergingtechlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://medicineinfo.awardspace.com/go.php?url=https://onlinecasino.us.org   http://lxe.hostingnames.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.alex-car.ru/links.php?go=https://onlinecasino.us.org   http://my-wmmail.ru/go?https://onlinecasino.us.org  http://ldsgeneralconference.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.medbroadcast.com/redirect.asp?action_id=103&url=https://onlinecasino.us.org   http://aubreymicky.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wap.118100.cn/i/e/redirect.do?turl=http://onlinecasino.us.org  http://www.vanadine.net/downloads_links/?links_id=18&goto=https://onlinecasino.us.org   http://turtlefly.4pets.es/php.php?a%5B%5D=%3Ca%20href%3Dhttp%3A%2F%2Fonlinecasino.us.org%2F%3E%C3%91%C5%8D%C3%90%C2%BB%C3%90%C2%B5%C3%90%C2%BA%C3%91%E2%80%9A%C3%91%E2%82%AC%C3%90%C2%BE%C3%90%C2%BC%C3%90%C2%BE%C3%90%C2%BD%C3%91%E2%80%9A%C3%90%C2%B0%C3%90%C2%B6%C3%90%C2%BD%C3%91%E2%80%B9%C3%90%C2%B5%20%C3%91%E2%82%AC%C3%90%C2%B0%C3%90%C2%B1%C3%90%C2%BE%C3%91%E2%80%9A%C3%91%E2%80%B9%20%C3%90%C2%B1%C3%90%C2%B0%C3%91%E2%82%AC%C3%90%C2%BD%C3%90%C2%B0%C3%91%83%C3%90%C2%BB%3C%2Fa%3E   http://mgmkitchenandbath.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://universityoffugu.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zaym-kruglosutochno-online.ru/go.php?url=onlinecasino.us.org  http://mdb.monsterball.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.donerrewards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://1888stopirs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://jbwgroup.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://questcable.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kallux.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.colamco.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.jechurch.org/goto-link.php?link_id=10&url=https://onlinecasino.us.org   http://pinespropane.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jobmatchhuntsville.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://2axxess.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.halawa.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.cosic.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.offshoreonly.com/forums/general-boating-discussion/323278-2015-fpc-miami-boat-show-poker-run-pix-shoot2thrill.html?amp;goto=onlinecasino.us.org   http://www.kladpoisk.ru/bitrix/redirect.php?event1=catalog_out&event2=http%3A%2F%2Fwww.kladpoisk.ru%2Finstr%2FWhites_TM808.pdf&event3=%D0%9C%D0%B5%D1%82%D0%B0%D0%BB%D0%BB%D0%BE%D0%B8%D1%81%D0%BA%D0%B0%D1%82%D0%B5%D0%BB%D1%8C+White%27s+TM+808+%28%D0%B3%D0%BB%D1%83%D0%B1%D0%B8%D0%BD%D0%BD%D1%8B%D0%B9%29&goto=https://onlinecasino.us.org   http://precisionmotorwerkes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://islamicunion.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://demo.klick2contact.com/v03/providers/GrahamDemo/window/windowEmail.html?t=GrahamDemo-37721434432450158a8fc0d443f250b5&p=GrahamDemo&pid=&d=20&n=&e=&c=GrahamDemo_iOSQApKu4FZcG&tel=&ch=EM&iid=IGH&psk=chat_a2&m=3&fcl=0&r=K2C&srbp=&iif=1&l=en&auto=&ud=&u=https://onlinecasino.us.org  http://www.freemaltomeal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://3.89089.site/url?q=https://onlinecasino.us.org   http://adultal.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://behavioralwisdom.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.salesexpo.com.pk/redirect?id=KrossKulture&url=https://onlinecasino.us.org   http://cytotherapy.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://librahospitalitymanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://santandermoney.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rustichimalayas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hopyazz.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kigi-kultura.ru/go.php?to=https://onlinecasino.us.org   http://www.smolcar.ru/avto/redirect.php?click=onlinecasino.us.org \nhttp://www.blackxxxvids.com/cgi-bin/atx/out.cgi?id=75&trade=https://onlinecasino.us.org  http://icrcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://wstats.org/onlinecasino.us.org   http://cdwhighereducation.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fanlibsucks.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.daimali.com/Go/?url=https://onlinecasino.us.org  http://www.dmfy.gov.cn/h2p/index.php?url=https://onlinecasino.us.org  http://www.shortmeup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://murrietaautomall.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://bbs.sufe.edu.cn/redirect.php?fid=118&tid=195316&goto=onlinecasino.us.org  http://spacecolorado.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://emx.samoasurf.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lasfuentes-alcaste.com/favoritos/go.php?id=270&url=https://onlinecasino.us.org  http://golfvideocritic.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lunenburgmoonshine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://saudipolymers.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://maytagblue.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://actuarialcareers.gs/__media__/js/trademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://entmuttert.com/2016/01/24/einfache-rechnung-kein-umgangdann-kein-unterhalt/\nhttp://www.thorinfamily.net/archives/72#comment-17143\nhttp://lady-swear.nichost.ru/index.php?topic=175197.new#new\nhttps://cyberpunkrp.xyz/f/showthread.php?tid=150240\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=174730\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8486, "cpu_time_ms": 99, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s426461193", "group_id": "codeNet:p03941", "input_text": "http://mooregardens.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://obrabotki.nsksoft.ru/redirect.php?url=onlinecasino.us.org   http://zzygbb.com/home/link.php?url=https://onlinecasino.us.org   http://peytonlist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cboestockexchange.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dicvlim.cms.carinet.de/search.ashx?g=c2231e8b-0d2b-443b-b5ba-725ad8b434b7&p=3&r=cde52007-4df1-42b7-ab48-5939c5008a8a&u=https://onlinecasino.us.org  http://diptibudhrani.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.hsfpp.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://www.autodesk.fr/adsk/servlet/oc/redir?siteID=458335&ch=ON&src=OMPSS&mktvar001=443305&mktvar002=443305&url=https://onlinecasino.us.org \nhttp://iatlas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://zdoro.ru/goto/https://onlinecasino.us.org   http://www.zumax.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://unodiario.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://1-800usedrim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mysteriousmadonna.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ipreptoefl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ivoronez.ru/go.php??s=https://onlinecasino.us.org   http://sunstreamvacationrentals.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sportab.ru/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://www.actionnc.org/r?u=https://onlinecasino.us.org   http://cancergeneticresearch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://avalanchesnowboards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mariaparham.fastcommand.com/goto.php?url=onlinecasino.us.org   http://mspfreaks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.artbrag.mordv.com/oizi/jump.php?url=https://onlinecasino.us.org  http://21enlineamexico.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://walktoendlupusnow.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://markwoodmusic.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eaeng.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cityofhomewood.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://xntdnn.azurewebsites.net/LinkClick.aspx?link=https://onlinecasino.us.org  http://chattt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://youngevityrewards.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://performancestat.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://purenudismpics.com/crtr/cgi/out.cgi?id=101&l=top_top&u=https://onlinecasino.us.org   https://mixsp.ru/go?to=https://onlinecasino.us.org \nhttp://logi163.xiti.com/go.url?xts=417925&s2=1&xtor=AD-9-<Grafikk>-<Blaa>-<>-<www>vg.no]&url=https://onlinecasino.us.org  http://artinbellevue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.minsk.alutech.by/bitrix/rk.php?id=6&event1=banner&event2=click&event3=1+%2F+%5B6%5D+%5Bafter_menu_bn%5D+%C2%FA%E5%E4%ED%FB%E5+%E2%EE%F0%EE%F2%E0&goto=https://onlinecasino.us.org   http://sexyblackmovies.com/cgi-bin/at3/out.cgi?id=70&amp;tag=topbottom&amp;trade=https://onlinecasino.us.org  http://win8soccer.info/redirect.php?tid=2192&goto=onlinecasino.us.org   http://khz.awardspace.com/bbs/redirect.php?fid=2&tid=13594&goto=onlinecasino.us.org  http://aircraftengineered.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://floridaflyfisherman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tracking.shopsmart.xyz/redirect.php?url=https://onlinecasino.us.org \nhttp://china-online.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cvinstallatie.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://whore-zoe-yang.xoxohth.com/go.php?url=https://onlinecasino.us.org   http://halcyon-capital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zakkalife.info/rank.cgi?mode=link&id=1106&url=onlinecasino.us.org   http://theexperiencecreator.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://webbworldwide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://9ty.diseasemanagement.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://digitalfatura.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://shenmoche.cn/tool/redirect.asp?id=1762&url=https://onlinecasino.us.org  http://syr-english.blogsky.com/dailylink/?go=https://onlinecasino.us.org   http://3dotsmedia.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://swimsuitcalendars.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://antique-dealer.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://euro-billions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ytjd.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ebookevangelist.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://djwolski.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://smentks.com/auth/?login=yes&backurl=onlinecasino.us.org  http://jholtmancpa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.rtsoft.ru/bitrix/redirect.php?event1=exit&event2=embeddedday&event3=&goto=https://onlinecasino.us.org   http://vermontweather.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pennsylvaniaassociationforjustice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://swdpstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ifuckinghatetheacademy.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pearlslife.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://funds.eatonvance.com/Result.php?denied=1&referer=https://onlinecasino.us.org \nhttp://ldmk.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://evh-guitars.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://rb7.ru/go?to=https://onlinecasino.us.org   http://lexingtoncreditcounselors.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gameoptimizer.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lindashields.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www12.ftb.pl/redirect.asp?typ=link&url=https://onlinecasino.us.org  http://ad.janbari.tv/w_clk/0000/MegaBanner32/?url=https://onlinecasino.us.org   http://chickasawcreativity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.kausthousing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mailsourceinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://grenadanewschannel.com/index.php?do=external&channel=73&url=https://onlinecasino.us.org   http://namnogo.ru/out.php?link=https://onlinecasino.us.org  http://calockemd.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://a.mirinfo.net/?onlinecasino.us.org  http://coatingsinspection.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.awolgamingcommunity.com/blog.php?b=26&goto=onlinecasino.us.org   http://go.p30script.com/index.php?url=https://onlinecasino.us.org \n \n \n \n \n \nhttp://forum.erotyczny24.pl/showthread.php?tid=2123\nhttps://trancerobot.com/forum/index.php?topic=711696.new#new\nhttps://www.wasdspace.ro/forum/showthread.php?tid=33321\nhttps://www.deadlytarantulagirl.com/index.php?topic=21671.new#new\nhttps://beta.i4g.tech/showthread.php?tid=58100&pid=181957#pid181957\n", "language": "Lisp", "metadata": {"date": 1549296326, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s426461193.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s426461193", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://mooregardens.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://obrabotki.nsksoft.ru/redirect.php?url=onlinecasino.us.org   http://zzygbb.com/home/link.php?url=https://onlinecasino.us.org   http://peytonlist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cboestockexchange.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dicvlim.cms.carinet.de/search.ashx?g=c2231e8b-0d2b-443b-b5ba-725ad8b434b7&p=3&r=cde52007-4df1-42b7-ab48-5939c5008a8a&u=https://onlinecasino.us.org  http://diptibudhrani.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.hsfpp.org/LinkClick.aspx?link=https://onlinecasino.us.org   http://www.autodesk.fr/adsk/servlet/oc/redir?siteID=458335&ch=ON&src=OMPSS&mktvar001=443305&mktvar002=443305&url=https://onlinecasino.us.org \nhttp://iatlas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://zdoro.ru/goto/https://onlinecasino.us.org   http://www.zumax.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://unodiario.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://1-800usedrim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mysteriousmadonna.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ipreptoefl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ivoronez.ru/go.php??s=https://onlinecasino.us.org   http://sunstreamvacationrentals.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sportab.ru/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://www.actionnc.org/r?u=https://onlinecasino.us.org   http://cancergeneticresearch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://avalanchesnowboards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mariaparham.fastcommand.com/goto.php?url=onlinecasino.us.org   http://mspfreaks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.artbrag.mordv.com/oizi/jump.php?url=https://onlinecasino.us.org  http://21enlineamexico.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://walktoendlupusnow.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://markwoodmusic.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eaeng.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cityofhomewood.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://xntdnn.azurewebsites.net/LinkClick.aspx?link=https://onlinecasino.us.org  http://chattt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://youngevityrewards.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://performancestat.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://purenudismpics.com/crtr/cgi/out.cgi?id=101&l=top_top&u=https://onlinecasino.us.org   https://mixsp.ru/go?to=https://onlinecasino.us.org \nhttp://logi163.xiti.com/go.url?xts=417925&s2=1&xtor=AD-9-<Grafikk>-<Blaa>-<>-<www>vg.no]&url=https://onlinecasino.us.org  http://artinbellevue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.minsk.alutech.by/bitrix/rk.php?id=6&event1=banner&event2=click&event3=1+%2F+%5B6%5D+%5Bafter_menu_bn%5D+%C2%FA%E5%E4%ED%FB%E5+%E2%EE%F0%EE%F2%E0&goto=https://onlinecasino.us.org   http://sexyblackmovies.com/cgi-bin/at3/out.cgi?id=70&amp;tag=topbottom&amp;trade=https://onlinecasino.us.org  http://win8soccer.info/redirect.php?tid=2192&goto=onlinecasino.us.org   http://khz.awardspace.com/bbs/redirect.php?fid=2&tid=13594&goto=onlinecasino.us.org  http://aircraftengineered.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://floridaflyfisherman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tracking.shopsmart.xyz/redirect.php?url=https://onlinecasino.us.org \nhttp://china-online.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cvinstallatie.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://whore-zoe-yang.xoxohth.com/go.php?url=https://onlinecasino.us.org   http://halcyon-capital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zakkalife.info/rank.cgi?mode=link&id=1106&url=onlinecasino.us.org   http://theexperiencecreator.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://webbworldwide.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://9ty.diseasemanagement.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://digitalfatura.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://shenmoche.cn/tool/redirect.asp?id=1762&url=https://onlinecasino.us.org  http://syr-english.blogsky.com/dailylink/?go=https://onlinecasino.us.org   http://3dotsmedia.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://swimsuitcalendars.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://antique-dealer.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://euro-billions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ytjd.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ebookevangelist.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://djwolski.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://smentks.com/auth/?login=yes&backurl=onlinecasino.us.org  http://jholtmancpa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.rtsoft.ru/bitrix/redirect.php?event1=exit&event2=embeddedday&event3=&goto=https://onlinecasino.us.org   http://vermontweather.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pennsylvaniaassociationforjustice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://swdpstore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ifuckinghatetheacademy.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pearlslife.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://funds.eatonvance.com/Result.php?denied=1&referer=https://onlinecasino.us.org \nhttp://ldmk.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://evh-guitars.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://rb7.ru/go?to=https://onlinecasino.us.org   http://lexingtoncreditcounselors.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gameoptimizer.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lindashields.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www12.ftb.pl/redirect.asp?typ=link&url=https://onlinecasino.us.org  http://ad.janbari.tv/w_clk/0000/MegaBanner32/?url=https://onlinecasino.us.org   http://chickasawcreativity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.kausthousing.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mailsourceinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://grenadanewschannel.com/index.php?do=external&channel=73&url=https://onlinecasino.us.org   http://namnogo.ru/out.php?link=https://onlinecasino.us.org  http://calockemd.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://a.mirinfo.net/?onlinecasino.us.org  http://coatingsinspection.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.awolgamingcommunity.com/blog.php?b=26&goto=onlinecasino.us.org   http://go.p30script.com/index.php?url=https://onlinecasino.us.org \n \n \n \n \n \nhttp://forum.erotyczny24.pl/showthread.php?tid=2123\nhttps://trancerobot.com/forum/index.php?topic=711696.new#new\nhttps://www.wasdspace.ro/forum/showthread.php?tid=33321\nhttps://www.deadlytarantulagirl.com/index.php?topic=21671.new#new\nhttps://beta.i4g.tech/showthread.php?tid=58100&pid=181957#pid181957\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7742, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s771912675", "group_id": "codeNet:p03941", "input_text": "http://elitemiami.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://votemywallet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://projectbee.com/redirect.php?url=https://onlinecasino.us.org   http://allmagicshows.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sewkidding.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://starwomanofgod.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wiesecommunications.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lbv.nickselectrical.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://schumacherwestpalmchevy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mathsedu.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.portaldehoteis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://weddingradio.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://timolehtinen.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.porrlejon.org/ept/out.php?f=1&pct=50&url=https://onlinecasino.us.org   http://bapman.nilu.no/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.rcshtac.clipe.pt/cgi-bin/a2/out.cgi?id=21&l=topref-11&u=/onlinecasino.us.org  http://www.megabtausch.de/cgi-bin/ms/search.pl?action=click&url=https://onlinecasino.us.org   http://www.oldlinestate.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://visionsourcelearning.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aboutmicr.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tejura.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mysweetfatty.com/cms2/out.php?id=132244&gid=175&c=1&s=85&url=https://onlinecasino.us.org/  http://geowaterservices.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://podarki-dlya-detei.ru/go/url=https://onlinecasino.us.org  http://dnr-board.com/redirect/?go=https://onlinecasino.us.org  http://oberoende.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://newsletter.smartson.se/t.aspx?S=1&ID=2741&NL=2&N=2824&SI=810198&URL=https://onlinecasino.us.org \nhttp://www.glasswareandmore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cbre.ae/emea_en/PrivacyPolicyEMEA?p_domain=onlinecasino.us.org   http://sektinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rnv.fsboauto.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sixbysoderbergh.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://znerealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wetsand.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dronemechanics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clubsharenation.com/sessions/new?goto=https://onlinecasino.us.org \nhttp://www.milfhdvideos.com/cgi-bin/atx/out.cgi?id=29&trade=https://onlinecasino.us.org  http://lexingtoncreditgroups.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.pensacola-divorce.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://woodsyndicate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thinkbigrecords.com/__media__/js/netsoltrademark.php?d=&onlinecasino.us.org   http://electronicsaaa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fursuit.co.uk/click.php?url=https://onlinecasino.us.org  http://travelabroadsecret.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vspresourcecenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://xxhtmlzg.com/index.php?c=ad&a=go&url=https://onlinecasino.us.org  http://www.liveryfinder.co.uk/includes/redirect.aspx?url=https://onlinecasino.us.org   http://learnyourmoneychallenge.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://osxtc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.selang.cawww.yinmm.netwww.selang.cawww.yinmm.netwww.selang.cawww.yinmm.netwww.selang.cawww.yinmm.net/forum/redirect.php?goto=onlinecasino.us.org   http://worldeditions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://myownbooks2go.com/login?referer=https://onlinecasino.us.org  http://www.pornmovies7.com/crtr/cgi/out.cgi?id=191&tag=ttop&u=https://onlinecasino.us.org   http://hclt.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://tribalselfinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://unitedgenetic-italy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://designated-heckler.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yogarising.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.chaneyharkinsfuneralhome.com/cfi/addthis_email.cfm?url=https://onlinecasino.us.org   http://blackhattersforum.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://surgeryhotline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ctjuniorrepublic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bbwmgpz.com/out.cgi?s=50&u=https://onlinecasino.us.org \nhttp://stockyourkiosk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://govtjobs.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zvx.digitalmediacctv.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bluewavenj.org/r?u=https://onlinecasino.us.org  http://s1.luqubao.com/link.php?url=https://onlinecasino.us.org   http://girlwars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://epmlive.in/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://militarytuxedos.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.stalemate.ru/redirect.php?url=https://onlinecasino.us.org \nhttp://www.mariemorgan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://invitationcalligraphy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://contramedia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rf.nxzgame.com/redirect.php?url=https://onlinecasino.us.org  http://likesforyou.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sixsixonebike.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dlmooc.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.feverlab.com/redirect.php?fid=70&tid=62254&goto=onlinecasino.us.org   http://karlboustany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://copyexpressonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.rhemuthcastle.com/index.php?thememode=full;redirect=https://onlinecasino.us.org   http://www.sitechno.com/Blog/ct.ashx?id=d1845361-f351-478a-8724-c5b5fffb8d06&url=https://onlinecasino.us.org   http://africaglobalbank.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://itravelchina.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rahn-trading.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ko-te.com/go.php?url=https://onlinecasino.us.org  http://www.kwiaty-alkohole.pl/do/countryAndCurrency?referer=https://onlinecasino.us.org   http://intrinsic-life.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=173351\nhttp://coconut-water.in/index.php?topic=236008.new#new\nhttp://www.borsaekrani.net/index.php?topic=32578.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttps://i2insights.org/2018/09/11/strengthening-environmental-humanities/\n", "language": "Lisp", "metadata": {"date": 1549290615, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s771912675.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s771912675", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://elitemiami.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://votemywallet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://projectbee.com/redirect.php?url=https://onlinecasino.us.org   http://allmagicshows.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sewkidding.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://starwomanofgod.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wiesecommunications.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lbv.nickselectrical.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://schumacherwestpalmchevy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mathsedu.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.portaldehoteis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://weddingradio.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://timolehtinen.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.porrlejon.org/ept/out.php?f=1&pct=50&url=https://onlinecasino.us.org   http://bapman.nilu.no/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.rcshtac.clipe.pt/cgi-bin/a2/out.cgi?id=21&l=topref-11&u=/onlinecasino.us.org  http://www.megabtausch.de/cgi-bin/ms/search.pl?action=click&url=https://onlinecasino.us.org   http://www.oldlinestate.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://visionsourcelearning.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aboutmicr.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tejura.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mysweetfatty.com/cms2/out.php?id=132244&gid=175&c=1&s=85&url=https://onlinecasino.us.org/  http://geowaterservices.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://podarki-dlya-detei.ru/go/url=https://onlinecasino.us.org  http://dnr-board.com/redirect/?go=https://onlinecasino.us.org  http://oberoende.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://newsletter.smartson.se/t.aspx?S=1&ID=2741&NL=2&N=2824&SI=810198&URL=https://onlinecasino.us.org \nhttp://www.glasswareandmore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cbre.ae/emea_en/PrivacyPolicyEMEA?p_domain=onlinecasino.us.org   http://sektinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rnv.fsboauto.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sixbysoderbergh.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://znerealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wetsand.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dronemechanics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clubsharenation.com/sessions/new?goto=https://onlinecasino.us.org \nhttp://www.milfhdvideos.com/cgi-bin/atx/out.cgi?id=29&trade=https://onlinecasino.us.org  http://lexingtoncreditgroups.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.pensacola-divorce.com/LinkClick.aspx?link=https://onlinecasino.us.org   http://woodsyndicate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thinkbigrecords.com/__media__/js/netsoltrademark.php?d=&onlinecasino.us.org   http://electronicsaaa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fursuit.co.uk/click.php?url=https://onlinecasino.us.org  http://travelabroadsecret.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vspresourcecenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://xxhtmlzg.com/index.php?c=ad&a=go&url=https://onlinecasino.us.org  http://www.liveryfinder.co.uk/includes/redirect.aspx?url=https://onlinecasino.us.org   http://learnyourmoneychallenge.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://osxtc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.selang.cawww.yinmm.netwww.selang.cawww.yinmm.netwww.selang.cawww.yinmm.netwww.selang.cawww.yinmm.net/forum/redirect.php?goto=onlinecasino.us.org   http://worldeditions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://myownbooks2go.com/login?referer=https://onlinecasino.us.org  http://www.pornmovies7.com/crtr/cgi/out.cgi?id=191&tag=ttop&u=https://onlinecasino.us.org   http://hclt.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://tribalselfinsurance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://unitedgenetic-italy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://designated-heckler.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yogarising.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.chaneyharkinsfuneralhome.com/cfi/addthis_email.cfm?url=https://onlinecasino.us.org   http://blackhattersforum.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://surgeryhotline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ctjuniorrepublic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bbwmgpz.com/out.cgi?s=50&u=https://onlinecasino.us.org \nhttp://stockyourkiosk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://govtjobs.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://zvx.digitalmediacctv.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bluewavenj.org/r?u=https://onlinecasino.us.org  http://s1.luqubao.com/link.php?url=https://onlinecasino.us.org   http://girlwars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://epmlive.in/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://militarytuxedos.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.stalemate.ru/redirect.php?url=https://onlinecasino.us.org \nhttp://www.mariemorgan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://invitationcalligraphy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://contramedia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rf.nxzgame.com/redirect.php?url=https://onlinecasino.us.org  http://likesforyou.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sixsixonebike.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dlmooc.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.feverlab.com/redirect.php?fid=70&tid=62254&goto=onlinecasino.us.org   http://karlboustany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://copyexpressonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.rhemuthcastle.com/index.php?thememode=full;redirect=https://onlinecasino.us.org   http://www.sitechno.com/Blog/ct.ashx?id=d1845361-f351-478a-8724-c5b5fffb8d06&url=https://onlinecasino.us.org   http://africaglobalbank.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://itravelchina.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rahn-trading.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ko-te.com/go.php?url=https://onlinecasino.us.org  http://www.kwiaty-alkohole.pl/do/countryAndCurrency?referer=https://onlinecasino.us.org   http://intrinsic-life.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=173351\nhttp://coconut-water.in/index.php?topic=236008.new#new\nhttp://www.borsaekrani.net/index.php?topic=32578.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttps://i2insights.org/2018/09/11/strengthening-environmental-humanities/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7760, "cpu_time_ms": 21, "memory_kb": 4068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s975045284", "group_id": "codeNet:p03941", "input_text": "http://youthbuildtexas.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://activatemomentum.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.nkj.ru/upload/bx/ad1/ad18a1aa9b9f1d1f929975b484aafe56.swf?flash_link=onlinecasino.us.org   http://sascables.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aveacekiyormu.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sisbe.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://akaka.al.ru/gourl.php?go=https://onlinecasino.us.org  http://kottayamairport.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.0750gg.com/jump.php?url=https://onlinecasino.us.org/ \nhttp://pierremendy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://travel-caixa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fonfrance.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sallylehrman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://doosandealers.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qgi.diyphotocards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.highlandfairviewcommunities.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wentworthpartners.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://forums.jlconline.com/forums/forum/jlc-online-expert-forums/exterior-details/1061242-whats-wrong-here?goto=onlinecasino.us.org \nhttps://ank-ugra.admhmao.ru/ie6/get.php?go=https://onlinecasino.us.org  http://143offroad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://exel-na.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://maxi.axeltechnology.com/xMAM_Demo/index.php?url=https://onlinecasino.us.org  http://www.google.ml/url?q=https://onlinecasino.us.org   http://zyq.hammerinternational.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://artisticdevices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://anesthesiarareartifacts.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://plainlanguagecontracts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.nationalfairhousing.org/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.jsmcc.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.hzlitai.com.cn/bbs/redirect.php?fid=28&tid=6419&goto=onlinecasino.us.org   http://pixiebears.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://insightimagingarrowhead.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tellmycharity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.flatironsucks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ultraphaco.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.inko-balt.com/redirect.php?url=https://onlinecasino.us.org \nhttp://doxanow.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.studying.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://distilledwater.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vyksa.org/go/url?to=https://onlinecasino.us.org  http://www.2ndgenerationvehicles.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://axaadvisors.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://quinielafutbol.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://161.ru/feedback/mailto.php?m=d7bh9z42e5L%2FxFm%2B48kSVsoXVpvS4B0%3D&u=DD%2BwKhVFqtDP%2FOoGJO8DeC6QbG%2FDu%2FvYyxUDOXmGt9rY9eMcNSZfYmeTjN7c86DTHe1JWSFZdL6r&referer=https://onlinecasino.us.org   http://vietnamantique.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://pol.org.au/LinkClick.aspx?link=https://onlinecasino.us.org  http://maps.google.com.kh/url?q=https://onlinecasino.us.org   http://hbm4.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ellensblitzrevue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nanj.an-matome.com/re.php?URL=https://onlinecasino.us.org   http://gemseries.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://collections.follettsoftware.com/navigate/?url=https://onlinecasino.us.org  http://erisa.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://maps.google.ga/url?q=https://onlinecasino.us.org \nhttp://militarygiftpack.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vip.sakuraweb.com/cgi-bin/link/tbpcount.cgi?url=https://onlinecasino.us.org   http://centralparkmortgageco.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://timsylvester.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://caribbeanbuys.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lovemyvalentine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.premium-traveller.com/booking/motor_reservas/motor/index.html?referer_skin=gis&referer_campaign=gis&hs=6515b7372a63a906d43c2b5a3414bfad6f0b6e1f&initial_booking_step=1&product_filter=8764&referer=https://onlinecasino.us.org  http://mvdemidov.com/bitrix/rk.php?goto=https://onlinecasino.us.org   http://www.domrebenok.ru/bitrix/rk.php?goto=onlinecasino.us.org \nhttp://enablementcloud.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://macmillanchildren.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.baberankings.com/cgi-bin/atx/out.cgi?id=21&trade=https://onlinecasino.us.org   http://sebastianbaker.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://drawger.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.goturkey.cn/home/link.php?url=https://onlinecasino.us.org  http://obaconferencecentre.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.onedaypaint.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dictionaryofamericanslang.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://degreeinmanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://batdiary.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mac.omeuidevice.pt/forum/index.php?thememode=full;redirect=https://onlinecasino.us.org   https://www.projectmanagement.com/favoritesAdd.cfm?ID=192846&goto=https://onlinecasino.us.org  http://nsolvalberta.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bonbon.ratata.fi/blogg/article-48112-414571-kommentarsbollar?goto=onlinecasino.us.org  http://sulma.ge/go.php?url=https://onlinecasino.us.org  http://www.khmerartsacademy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.minglebox.com/redirect.jsp?url=https://onlinecasino.us.org \nhttp://hoasites.goodwintx.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://azgnc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eastsidesex.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cognitivescience.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://senvestcapitalinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hearing-ambassador.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://okaustraliansailingteam.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://02lb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://frankkentcars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://sztolnia.org/forum/index.php?topic=26597.new#new\nhttp://www.robaloboatowners.com/RBO/viewtopic.php?f=24&t=1680733\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://forum.vikingstown.at/viewtopic.php?pid=211105#p211105\nhttp://medvedi.pw/forum/index.php?topic=2389.new#new\n", "language": "Lisp", "metadata": {"date": 1549261430, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s975045284.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s975045284", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://youthbuildtexas.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://activatemomentum.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.nkj.ru/upload/bx/ad1/ad18a1aa9b9f1d1f929975b484aafe56.swf?flash_link=onlinecasino.us.org   http://sascables.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aveacekiyormu.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sisbe.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://akaka.al.ru/gourl.php?go=https://onlinecasino.us.org  http://kottayamairport.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.0750gg.com/jump.php?url=https://onlinecasino.us.org/ \nhttp://pierremendy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://travel-caixa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fonfrance.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sallylehrman.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://doosandealers.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qgi.diyphotocards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.highlandfairviewcommunities.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wentworthpartners.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://forums.jlconline.com/forums/forum/jlc-online-expert-forums/exterior-details/1061242-whats-wrong-here?goto=onlinecasino.us.org \nhttps://ank-ugra.admhmao.ru/ie6/get.php?go=https://onlinecasino.us.org  http://143offroad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://exel-na.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://maxi.axeltechnology.com/xMAM_Demo/index.php?url=https://onlinecasino.us.org  http://www.google.ml/url?q=https://onlinecasino.us.org   http://zyq.hammerinternational.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://artisticdevices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://anesthesiarareartifacts.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://plainlanguagecontracts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.nationalfairhousing.org/LinkClick.aspx?link=https://onlinecasino.us.org  http://www.jsmcc.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.hzlitai.com.cn/bbs/redirect.php?fid=28&tid=6419&goto=onlinecasino.us.org   http://pixiebears.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://insightimagingarrowhead.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tellmycharity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.flatironsucks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ultraphaco.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.inko-balt.com/redirect.php?url=https://onlinecasino.us.org \nhttp://doxanow.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.studying.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://distilledwater.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vyksa.org/go/url?to=https://onlinecasino.us.org  http://www.2ndgenerationvehicles.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://axaadvisors.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://quinielafutbol.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://161.ru/feedback/mailto.php?m=d7bh9z42e5L%2FxFm%2B48kSVsoXVpvS4B0%3D&u=DD%2BwKhVFqtDP%2FOoGJO8DeC6QbG%2FDu%2FvYyxUDOXmGt9rY9eMcNSZfYmeTjN7c86DTHe1JWSFZdL6r&referer=https://onlinecasino.us.org   http://vietnamantique.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://pol.org.au/LinkClick.aspx?link=https://onlinecasino.us.org  http://maps.google.com.kh/url?q=https://onlinecasino.us.org   http://hbm4.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ellensblitzrevue.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nanj.an-matome.com/re.php?URL=https://onlinecasino.us.org   http://gemseries.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://collections.follettsoftware.com/navigate/?url=https://onlinecasino.us.org  http://erisa.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://maps.google.ga/url?q=https://onlinecasino.us.org \nhttp://militarygiftpack.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vip.sakuraweb.com/cgi-bin/link/tbpcount.cgi?url=https://onlinecasino.us.org   http://centralparkmortgageco.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://timsylvester.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://caribbeanbuys.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lovemyvalentine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.premium-traveller.com/booking/motor_reservas/motor/index.html?referer_skin=gis&referer_campaign=gis&hs=6515b7372a63a906d43c2b5a3414bfad6f0b6e1f&initial_booking_step=1&product_filter=8764&referer=https://onlinecasino.us.org  http://mvdemidov.com/bitrix/rk.php?goto=https://onlinecasino.us.org   http://www.domrebenok.ru/bitrix/rk.php?goto=onlinecasino.us.org \nhttp://enablementcloud.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://macmillanchildren.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.baberankings.com/cgi-bin/atx/out.cgi?id=21&trade=https://onlinecasino.us.org   http://sebastianbaker.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://drawger.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.goturkey.cn/home/link.php?url=https://onlinecasino.us.org  http://obaconferencecentre.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.onedaypaint.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dictionaryofamericanslang.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://degreeinmanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://batdiary.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mac.omeuidevice.pt/forum/index.php?thememode=full;redirect=https://onlinecasino.us.org   https://www.projectmanagement.com/favoritesAdd.cfm?ID=192846&goto=https://onlinecasino.us.org  http://nsolvalberta.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bonbon.ratata.fi/blogg/article-48112-414571-kommentarsbollar?goto=onlinecasino.us.org  http://sulma.ge/go.php?url=https://onlinecasino.us.org  http://www.khmerartsacademy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.minglebox.com/redirect.jsp?url=https://onlinecasino.us.org \nhttp://hoasites.goodwintx.com/LinkClick.aspx?link=https://onlinecasino.us.org  http://azgnc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://eastsidesex.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cognitivescience.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://senvestcapitalinc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hearing-ambassador.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://okaustraliansailingteam.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://02lb.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://frankkentcars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://sztolnia.org/forum/index.php?topic=26597.new#new\nhttp://www.robaloboatowners.com/RBO/viewtopic.php?f=24&t=1680733\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://forum.vikingstown.at/viewtopic.php?pid=211105#p211105\nhttp://medvedi.pw/forum/index.php?topic=2389.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8379, "cpu_time_ms": 90, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s639313450", "group_id": "codeNet:p03941", "input_text": "http://food168.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://heartsonfiresucks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lunabug.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ief.question.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://proamigo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cepbd.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://prachintc.com/go/onlinecasino.us.org  http://wjbainbridge.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://greatlightmusic.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.biologie.de/linker/jump.php?url=https://onlinecasino.us.org/  http://americangraduateeducation.com/cgi-bin/redir.pl?url=https://onlinecasino.us.org   http://www.gorod-kirow.ru/widgets/outside/?url=https://onlinecasino.us.org   http://620doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://m.usocial.info/away.php?url=https://onlinecasino.us.org   http://causeentertainmentagency.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fireomearth.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.tatarmaster.ru/bitrix/rk.php?goto=https://onlinecasino.us.org/   http://canoecreekranch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://maverickskateboards.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hlb.paranoid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://midlandlife.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://conceptmapping.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pandemicshield.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nolawatson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://frankpalme.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://theurbanministriesinstitute.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.berkin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://eam.573.jp/app/web/toOther.php?url=https://onlinecasino.us.org  http://millsautomotive.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lookstv.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://geistcity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.coffmanfh.com/cfi/addthis_email.cfm?url=https://onlinecasino.us.org   http://www.myxxxlesbian.com/df/out.cgi?ses=lXM0Ms1Snn&id=49&url=https://onlinecasino.us.org  http://aldoshoes.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://universaldirections.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://spiritwearcentral.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.bigtruckdepot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://veracept.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://butcherblocksarasota.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aeroholidaysweeps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.boyfriend.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clash-clans.ru/redirect.php?https://onlinecasino.us.org  http://ccpatriotsbaseball.com/Goto.asp?url=https://onlinecasino.us.org  http://larritonelli.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lgpmanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sammytattoos.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.elsewedyegypt.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cdiabetes.com/redirects/offer.php?URL=https://onlinecasino.us.org   http://ehealthresources.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wlb-online.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://westafricabound.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.debrahannxxx.com/cgi-bin/autorank/out.cgi?id=10100321&url=https://onlinecasino.us.org  http://www.wzdq.cc/go.php?url=https://onlinecasino.us.org   http://itreconomics.ch/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://digital-edu.info/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fcentersot.net&event3=%CF%EE%F1%F2-%F0%E5%EB%E8%E7+%EF%EE+%E8%F2%EE%E3%E0%EC+%F4%E8%ED%E0%EB%E0+%C2%F1%E5%F0%EE%F1%F1%E8%E9%F1%EA%EE%E3%EE+%F2%E2%EE%F0%F7%E5%F1%EA%EE%E3%EE+%EA%EE%ED%EA%F3%F0%F1%E0+%EA%F3%F0%F1%EE%E2%FB%F5%2C+%E4%E8%EF%EB%EE%EC%ED%FB%F5+%F0%E0%E1%EE%F2%2C+%F1%E2%FF%E7%E0%ED%ED%FB%F5+%F1+%E3%E5%F0%EE%E8%F7%E5%F1%EA%E8%EC+%EF%F0%EE%F8%EB%FB%EC+%D0%EE%F1%F1%E8%E8%2C+%E2%E0%E6%ED%E5%E9%F8%E8%EC%E8+%F1%EE%E1%FB%F2%E8%FF%EC%E8+%E2+%E6%E8%E7%ED%E8+%ED%E0%F0%EE%E4%E0&goto=https://onlinecasino.us.org  http://www.becomerichfast.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vuecam.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://famimacredit.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cheapelectrical.co.uk/go.php?url=https://onlinecasino.us.org   http://peterrieck.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bbs.gddahon.cn/redirect.php?goto=onlinecasino.us.org  http://prattpackaging.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.khmerdaily.com/jump.php?url=https://onlinecasino.us.org \nhttp://5000frames.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://inovabreastcareinstitute.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elementonerealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fmprod.ru/bitrix/rk.php?id=7&event1=banner&event2=click&event3=1+/+<>]+<center>1]+ц1&goto=https://onlinecasino.us.org  http://www.boafall.svenskodegaard.dk/link_hits.asp?id=83&url=https://onlinecasino.us.org   http://generationgive.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://iqonic-center.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://enclaveatcedarparkassistedliving.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://website.seonalysis.com/redirect.php?url=https://onlinecasino.us.org \nhttp://chile-wine-tours.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://advhyip.com/goto.php?url=https://onlinecasino.us.org   http://longislandbrokers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jhttransport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gorodki174.ru/include/get.php?go=https://onlinecasino.us.org   http://www.wulianwang360.com/RES/GoURL.aspx?url=onlinecasino.us.org  http://learningzone.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.medical-minutes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://scamgainsy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.decorsnob.com/goto/https://onlinecasino.us.org  http://www.hystericalsociety.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://toul.my-avantages.com/link.php?link=https://onlinecasino.us.org   http://olzatjoamt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ltciadvisors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://w4h.aghomecare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xchilli.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mylifespire.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://quantumrealtysales.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://benaibouche.com/forum/index.php?topic=9076.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php%20\nhttp://julianfrancoo.com/forum/index.php?topic=20820.new#new\nhttps://www.purerpgaming.com/foro/viewtopic.php?f=4&t=77363\nhttp://www.biosprayhealthy.com/forum/index.php?topic=1805.new#new\n", "language": "Lisp", "metadata": {"date": 1549243552, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s639313450.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s639313450", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://food168.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://heartsonfiresucks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lunabug.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ief.question.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://proamigo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cepbd.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://prachintc.com/go/onlinecasino.us.org  http://wjbainbridge.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://greatlightmusic.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.biologie.de/linker/jump.php?url=https://onlinecasino.us.org/  http://americangraduateeducation.com/cgi-bin/redir.pl?url=https://onlinecasino.us.org   http://www.gorod-kirow.ru/widgets/outside/?url=https://onlinecasino.us.org   http://620doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://m.usocial.info/away.php?url=https://onlinecasino.us.org   http://causeentertainmentagency.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fireomearth.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.tatarmaster.ru/bitrix/rk.php?goto=https://onlinecasino.us.org/   http://canoecreekranch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://maverickskateboards.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hlb.paranoid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://midlandlife.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://conceptmapping.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pandemicshield.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nolawatson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://frankpalme.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://theurbanministriesinstitute.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.berkin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://eam.573.jp/app/web/toOther.php?url=https://onlinecasino.us.org  http://millsautomotive.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lookstv.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://geistcity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.coffmanfh.com/cfi/addthis_email.cfm?url=https://onlinecasino.us.org   http://www.myxxxlesbian.com/df/out.cgi?ses=lXM0Ms1Snn&id=49&url=https://onlinecasino.us.org  http://aldoshoes.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://universaldirections.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://spiritwearcentral.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.bigtruckdepot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://veracept.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://butcherblocksarasota.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aeroholidaysweeps.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.boyfriend.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clash-clans.ru/redirect.php?https://onlinecasino.us.org  http://ccpatriotsbaseball.com/Goto.asp?url=https://onlinecasino.us.org  http://larritonelli.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lgpmanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sammytattoos.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.elsewedyegypt.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cdiabetes.com/redirects/offer.php?URL=https://onlinecasino.us.org   http://ehealthresources.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wlb-online.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://westafricabound.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.debrahannxxx.com/cgi-bin/autorank/out.cgi?id=10100321&url=https://onlinecasino.us.org  http://www.wzdq.cc/go.php?url=https://onlinecasino.us.org   http://itreconomics.ch/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://digital-edu.info/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fcentersot.net&event3=%CF%EE%F1%F2-%F0%E5%EB%E8%E7+%EF%EE+%E8%F2%EE%E3%E0%EC+%F4%E8%ED%E0%EB%E0+%C2%F1%E5%F0%EE%F1%F1%E8%E9%F1%EA%EE%E3%EE+%F2%E2%EE%F0%F7%E5%F1%EA%EE%E3%EE+%EA%EE%ED%EA%F3%F0%F1%E0+%EA%F3%F0%F1%EE%E2%FB%F5%2C+%E4%E8%EF%EB%EE%EC%ED%FB%F5+%F0%E0%E1%EE%F2%2C+%F1%E2%FF%E7%E0%ED%ED%FB%F5+%F1+%E3%E5%F0%EE%E8%F7%E5%F1%EA%E8%EC+%EF%F0%EE%F8%EB%FB%EC+%D0%EE%F1%F1%E8%E8%2C+%E2%E0%E6%ED%E5%E9%F8%E8%EC%E8+%F1%EE%E1%FB%F2%E8%FF%EC%E8+%E2+%E6%E8%E7%ED%E8+%ED%E0%F0%EE%E4%E0&goto=https://onlinecasino.us.org  http://www.becomerichfast.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vuecam.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://famimacredit.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.cheapelectrical.co.uk/go.php?url=https://onlinecasino.us.org   http://peterrieck.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bbs.gddahon.cn/redirect.php?goto=onlinecasino.us.org  http://prattpackaging.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.khmerdaily.com/jump.php?url=https://onlinecasino.us.org \nhttp://5000frames.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://inovabreastcareinstitute.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elementonerealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.fmprod.ru/bitrix/rk.php?id=7&event1=banner&event2=click&event3=1+/+<>]+<center>1]+ц1&goto=https://onlinecasino.us.org  http://www.boafall.svenskodegaard.dk/link_hits.asp?id=83&url=https://onlinecasino.us.org   http://generationgive.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://iqonic-center.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://enclaveatcedarparkassistedliving.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://website.seonalysis.com/redirect.php?url=https://onlinecasino.us.org \nhttp://chile-wine-tours.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://advhyip.com/goto.php?url=https://onlinecasino.us.org   http://longislandbrokers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jhttransport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gorodki174.ru/include/get.php?go=https://onlinecasino.us.org   http://www.wulianwang360.com/RES/GoURL.aspx?url=onlinecasino.us.org  http://learningzone.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.medical-minutes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://scamgainsy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.decorsnob.com/goto/https://onlinecasino.us.org  http://www.hystericalsociety.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://toul.my-avantages.com/link.php?link=https://onlinecasino.us.org   http://olzatjoamt.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ltciadvisors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://w4h.aghomecare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xchilli.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mylifespire.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://quantumrealtysales.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://benaibouche.com/forum/index.php?topic=9076.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php%20\nhttp://julianfrancoo.com/forum/index.php?topic=20820.new#new\nhttps://www.purerpgaming.com/foro/viewtopic.php?f=4&t=77363\nhttp://www.biosprayhealthy.com/forum/index.php?topic=1805.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8564, "cpu_time_ms": 102, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s153196402", "group_id": "codeNet:p03941", "input_text": "http://garagedoorsconroe.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wizdomware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://heifer.vg/__media__/js/trademark.php?d=onlinecasino.us.org   http://drivingcentres.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://energ-inc.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://veryoldgrannyporn.com/cgi-bin/atc/out.cgi?id=145&u=https://onlinecasino.us.org  http://537.xg4ken.com/media/redir.php?prof=383&camp=43224&affcode=kw2538&url=https://onlinecasino.us.org  http://englishmontrealplus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myronjackson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://deliciousicecoffee.blog28.fc2.com/blog-entry-4367.html?outlink=onlinecasino.us.org  http://neocaresolutions.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://itsg-saic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cognito2.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://2849421.r.bat.bing.com/?ld=d3RIQZr1MRs8MSf2Fge6Gv6TVUCUzdyVCeu5kaqKukkPX9HwcdPwDj1Jt29vLjpU_IZzmJ6-87UhYKFQrvhmKL3SO_lqrGom2B0kuo5EVXGNTUOVi9mxlgChqdWUR9VpWzZmQnFS7fdCBiHXi9Wz5hmNAgO9XfTzDpUv5CKBLLOfNPBr35&u=https://onlinecasino.us.org   http://acsbr.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mattmcconaughey.net/out.php?url=https://onlinecasino.us.org/  http://drmao.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.stocking-passion.net/out.php?url=https://onlinecasino.us.org \nhttp://bbs.pcbeta.com/redirect.php?goto=onlinecasino.us.org  http://hkcausewaybay.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bankingbpm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://europeantanningclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yardjewelry.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://counterstrike.com.tw/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.adulttds.com/go.php?url=https://onlinecasino.us.org  http://levittpavilions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://42.96.171.103/redirect.php?tid=1874&goto=onlinecasino.us.org \nhttp://certifiedlegacyplanner.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://shubinmcgrawlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.supremesearch.net/Rank.php?URL=https://onlinecasino.us.org   http://innovationgold.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://qlm.exitservices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.royalairmaroc.com/int-fr/safar-flyer/authenticate?referer=https://onlinecasino.us.org  http://customervalue.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sodexodiversity.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.topswisshotels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://disq.us/url?url=https://onlinecasino.us.org  http://www.check-pr.ru/redirect.php?url=https://onlinecasino.us.org   http://green-emeraudes-hotels.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.agenthot.com/cgi-bin/at/out.cgi?s=50&l=shemale&u=https://onlinecasino.us.org  http://moviedl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://osq.mobile.sis.xxx/forum/redirect.php?tid=5172419&goto=onlinecasino.us.org  http://academia-media.kz/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org//  https://isllm.com/wp-content/themes/BEGIN/inc/go.php?url=https://onlinecasino.us.org   http://cukierek.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://varicoceletexas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cofhdenim.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.cyprusanytime.com/out.php?link=https://onlinecasino.us.org   http://122tyc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marchlasvegas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.canlve.com/index.php?c=redirect&a=gozdm&url=https://onlinecasino.us.org  http://villapreferredaccess.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://securemail247.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://ee.08800.top/url?q=https://onlinecasino.us.org \nhttp://columbussalesjobsonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ahowland.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://walnutinsurance.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.goodfuture.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wisconsinjobsresource.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.holytrinityblacon.org/goto-link.php?link_id=1&url=https://onlinecasino.us.org  http://sonoranhotdogstand.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mauryavivah.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://dm2.co.jp/m/index.cgi?mode=redirect&ref_eid=10005&url=https://onlinecasino.us.org \nhttp://columbiareach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://keyhold.me/redirect.php?tid=1876&goto=onlinecasino.us.org   http://xn--80ajbtdg3as1b.xn--p1ai/bitrix/rk.php?id=1&site_id=s1&event1=banner&event2=click&goto=onlinecasino.us.org   https://poisk-podbor.ru/?&action=redirect&pkpk=1&owner_id=45746&global_id=30828721&url=https://onlinecasino.us.org  http://images.google.ms/url?q=https://onlinecasino.us.org   http://www.realestatevideos.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ysp.worldwideski.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ideart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sexpazintys.wip.lt/meniu/r.php?u=https://onlinecasino.us.org \nhttp://officialmayanresorts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.aransascountytx.gov/redirect.php?in=1&silent=1&url=https://onlinecasino.us.org   http://wfex.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://iloveyouverymuch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xsj.samosa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bia.mahadley.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.reno.biwi.ca/cgi-bin/r.pl?site=reno&i=526049&categ=ka503100&239&u=https://onlinecasino.us.org  http://electrobeach.royalpacific.cc/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myregionaloffice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://stjamescity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://iomenterprises.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://black-haus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.babyhotel-site.info/rank.php?mode=link&id=17&url=https://onlinecasino.us.org/  http://sitrickandcoinc.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tt-blau-weiss-reichenbach.de/index.php/component/vitabook/?fromurl=onlinecasino.us.org  http://chloevevrier.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://atn.atsumaru.jp/go/go.php?URL=https://onlinecasino.us.org   http://www.mir-stalkera.ru/go?https://onlinecasino.us.org \n \n \n \n \n \nhttp://forum.onlinefootballmanager.fr/showthread.php?88974-ieeojt-The-diarrhea-may-be-non-bloody&p=446982&posted=1#post446982\nhttps://lindaghill.com/2018/08/15/one-liner-wednesday-snail-mail/\nhttp://forum.venture.com.bd/index.php?topic=1414.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://www.association-manoirducrime.fr/forum/viewtopic.php?pid=1286612#p1286612\n", "language": "Lisp", "metadata": {"date": 1549226090, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s153196402.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s153196402", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://garagedoorsconroe.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wizdomware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://heifer.vg/__media__/js/trademark.php?d=onlinecasino.us.org   http://drivingcentres.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://energ-inc.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://veryoldgrannyporn.com/cgi-bin/atc/out.cgi?id=145&u=https://onlinecasino.us.org  http://537.xg4ken.com/media/redir.php?prof=383&camp=43224&affcode=kw2538&url=https://onlinecasino.us.org  http://englishmontrealplus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myronjackson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://deliciousicecoffee.blog28.fc2.com/blog-entry-4367.html?outlink=onlinecasino.us.org  http://neocaresolutions.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://itsg-saic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cognito2.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://2849421.r.bat.bing.com/?ld=d3RIQZr1MRs8MSf2Fge6Gv6TVUCUzdyVCeu5kaqKukkPX9HwcdPwDj1Jt29vLjpU_IZzmJ6-87UhYKFQrvhmKL3SO_lqrGom2B0kuo5EVXGNTUOVi9mxlgChqdWUR9VpWzZmQnFS7fdCBiHXi9Wz5hmNAgO9XfTzDpUv5CKBLLOfNPBr35&u=https://onlinecasino.us.org   http://acsbr.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mattmcconaughey.net/out.php?url=https://onlinecasino.us.org/  http://drmao.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.stocking-passion.net/out.php?url=https://onlinecasino.us.org \nhttp://bbs.pcbeta.com/redirect.php?goto=onlinecasino.us.org  http://hkcausewaybay.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bankingbpm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://europeantanningclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yardjewelry.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://counterstrike.com.tw/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.adulttds.com/go.php?url=https://onlinecasino.us.org  http://levittpavilions.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://42.96.171.103/redirect.php?tid=1874&goto=onlinecasino.us.org \nhttp://certifiedlegacyplanner.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://shubinmcgrawlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.supremesearch.net/Rank.php?URL=https://onlinecasino.us.org   http://innovationgold.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://qlm.exitservices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.royalairmaroc.com/int-fr/safar-flyer/authenticate?referer=https://onlinecasino.us.org  http://customervalue.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sodexodiversity.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.topswisshotels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://disq.us/url?url=https://onlinecasino.us.org  http://www.check-pr.ru/redirect.php?url=https://onlinecasino.us.org   http://green-emeraudes-hotels.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.agenthot.com/cgi-bin/at/out.cgi?s=50&l=shemale&u=https://onlinecasino.us.org  http://moviedl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://osq.mobile.sis.xxx/forum/redirect.php?tid=5172419&goto=onlinecasino.us.org  http://academia-media.kz/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino.us.org//  https://isllm.com/wp-content/themes/BEGIN/inc/go.php?url=https://onlinecasino.us.org   http://cukierek.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://varicoceletexas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cofhdenim.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.cyprusanytime.com/out.php?link=https://onlinecasino.us.org   http://122tyc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marchlasvegas.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.canlve.com/index.php?c=redirect&a=gozdm&url=https://onlinecasino.us.org  http://villapreferredaccess.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://securemail247.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://ee.08800.top/url?q=https://onlinecasino.us.org \nhttp://columbussalesjobsonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ahowland.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://walnutinsurance.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.goodfuture.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wisconsinjobsresource.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.holytrinityblacon.org/goto-link.php?link_id=1&url=https://onlinecasino.us.org  http://sonoranhotdogstand.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mauryavivah.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://dm2.co.jp/m/index.cgi?mode=redirect&ref_eid=10005&url=https://onlinecasino.us.org \nhttp://columbiareach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://keyhold.me/redirect.php?tid=1876&goto=onlinecasino.us.org   http://xn--80ajbtdg3as1b.xn--p1ai/bitrix/rk.php?id=1&site_id=s1&event1=banner&event2=click&goto=onlinecasino.us.org   https://poisk-podbor.ru/?&action=redirect&pkpk=1&owner_id=45746&global_id=30828721&url=https://onlinecasino.us.org  http://images.google.ms/url?q=https://onlinecasino.us.org   http://www.realestatevideos.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ysp.worldwideski.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ideart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sexpazintys.wip.lt/meniu/r.php?u=https://onlinecasino.us.org \nhttp://officialmayanresorts.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.aransascountytx.gov/redirect.php?in=1&silent=1&url=https://onlinecasino.us.org   http://wfex.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://iloveyouverymuch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xsj.samosa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bia.mahadley.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.reno.biwi.ca/cgi-bin/r.pl?site=reno&i=526049&categ=ka503100&239&u=https://onlinecasino.us.org  http://electrobeach.royalpacific.cc/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://myregionaloffice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://stjamescity.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://iomenterprises.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://black-haus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.babyhotel-site.info/rank.php?mode=link&id=17&url=https://onlinecasino.us.org/  http://sitrickandcoinc.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tt-blau-weiss-reichenbach.de/index.php/component/vitabook/?fromurl=onlinecasino.us.org  http://chloevevrier.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://atn.atsumaru.jp/go/go.php?URL=https://onlinecasino.us.org   http://www.mir-stalkera.ru/go?https://onlinecasino.us.org \n \n \n \n \n \nhttp://forum.onlinefootballmanager.fr/showthread.php?88974-ieeojt-The-diarrhea-may-be-non-bloody&p=446982&posted=1#post446982\nhttps://lindaghill.com/2018/08/15/one-liner-wednesday-snail-mail/\nhttp://forum.venture.com.bd/index.php?topic=1414.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://www.association-manoirducrime.fr/forum/viewtopic.php?pid=1286612#p1286612\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8440, "cpu_time_ms": 113, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s821797788", "group_id": "codeNet:p03941", "input_text": "https://besttracker.cz/redirect.php?url=https://onlinecasino.us.org  http://bryanbartels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wilsonschroeder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://foodandsport.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://join5point.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dbf-formation.fr/k2-listing/item/280-nos-formations-en-bureautique?g2_returnName=www.dbf-formation.fr&fromurl=onlinecasino.us.org  http://www.travel-news.ru/goto.php?url=https://onlinecasino.us.org  http://www.civilnet.http21.com/www.google.com/dp/ads?max_radlink_len=32&r=m&domain_name=fabulous.com&client=dp-voodoo21_3ph&hl=en&adtest=off&optimize_terms=on&swp=as-drid-2464369813134582&afdt=CiAKEwj0hNrfscnZAhXXJB8KHWwfBoAYBHExJ2hC3-OWKxIZAG06ipDH024CdhpNTkqRE9ocSrcpsPoc9g&uiopt=true&oe=UTF-8&ie=UTF-8&fexp=21404%2C17300002&format=s%7Cr5%7Cr5%7Cr3&adrep=0&num=0&output=afd_ads&v=3&adext=as1%2Csr1&bsl=8&u_his=6&u_tz=-300&dt=1519847661687&u_w=1440&u_h=900&biw=-12245933&bih=-12245933&isw=1440&ish=358&psw=-1&psh=-1&frm=2&uio=sl1sr1--st22sv16sa16lt35-st22sv16sa16lt35-st12sa12&jsv=13016&rurl=https://onlinecasino.us.org   http://bluestarphotography.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://buffalosoldiers.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://randyswart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sunmoods.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.amateurlistings.com/cgi-bin/arp/out.cgi?id=george&url=https://onlinecasino.us.org  http://ethel-barrymore-theatre.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bbwhottie.com/cgi-bin/out/out.cgi?c=1&rtt=5&s=50&u=https://onlinecasino.us.org  http://thesoulfulgroovesshow.libsyn.com/?referer=https://onlinecasino.us.org  http://idemlanguage.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://iqtask.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://kingpreownedcars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://longmeadowhighlax.com/Goto.asp?url=https://onlinecasino.us.org   http://longfences.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.chinaski.chinaski.aneta.foto.foto.dev.senzaparty.net/redir.php?link=https://onlinecasino.us.org  http://virtupaint.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://backporchmusic.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thinkrose.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://assistivetechservices.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.msquaredsolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://hollywoodeuropeanawards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.zorgkantoordsw.nl/Pages/Popup.aspx?url=https://onlinecasino.us.org   http://yesterdaytoy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.duotegame.com/phpMyDuoTe/url.php?url=https://onlinecasino.us.org  http://sipos.transindex.ro/t/?url=https://onlinecasino.us.org/   http://choung.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://uruguayo.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://inform-matik.e-monsite.com/liens/do/redirect/?url=https://onlinecasino.us.org   http://isellbargains.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.flanakin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aprendices.wikispaces.com/page/edit/un+widget+para+tu+blog?goto=https://onlinecasino.us.org   http://devel.cen.umontreal.ca/fr/journals/ont/csieci/88/850/fulltext?redirect=https://onlinecasino.us.org   http://kencolebridal.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://calblooms.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://neoralivehappy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.berkin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sgr-law.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hitch.dynim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.885care.com/web/miao1120/blog/-/blogs/140644?_33_redirect=https://onlinecasino.us.org  http://gototechnology.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ontariobusinessfunder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elitevipreward.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yln.cvstarr.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.jugendfreizeitwerk.de/Freizeit/Archiv/index.asp?url=https://onlinecasino.us.org  http://malabarfriends.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://coastalphoto.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://suihua.kuaimaonline.com/index.php?g=Appoint&c=Changecity&a=go&city=bh&referer=https://onlinecasino.us.org \nhttp://www.mcogfwc.org/guestbook/go.php?url=https://onlinecasino.us.org  http://www.crystalspamassage.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://putonpurple.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hhonors.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://uk.toptrendingoffers.com/redirect?url=https://onlinecasino.us.org   http://jacobstheater.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sistematgi.com/es/redweb.asp?iddoc=147&url=https://onlinecasino.us.org  http://montreal.ngojobs.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.larenaissance33.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.whitewetlook.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.pitterpatterdayschools.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sfcourts.org/redirect.aspx?url=https://onlinecasino.us.org/   http://ares-ir.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://valpaksuck.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://greenbeginnings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://silinvestments.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.maritimes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://apis.bvau.ro/resurse/redirect.php?url=https://onlinecasino.us.org \nhttps://abiturient.ru/bitrix/rk.php?id=59&site_id=ab&goto=https://onlinecasino.us.org  http://www.kwiaciarniapoznan.pl/do/countryAndCurrency?referer=https://onlinecasino.us.org   https://blog.ydhang.cn/wp-content/themes/begin4.6/inc/go.php?url=https://onlinecasino.us.org   http://feedthedream.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.pgpublisher.ru/go.php?url=onlinecasino.us.org   http://human-anomalies.ru/go?https://onlinecasino.us.org  http://www.zuimeng.vip/wp-content/themes/begin4.4/inc/go.php?url=https://onlinecasino.us.org  http://www.internshipabroad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://globeguides.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://justus.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sandra.metmail.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://moovasatis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://newyork-virtualoffice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bgimp.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.solet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://image.jp0.ru/ru/index.php?url=https://onlinecasino.us.org  http://www.ekbouwadvies.nl/links/redir.asp?link=onlinecasino.us.org   http://resalesmarket.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.ni28320-2.web12.nitrado.hosting/phpBB3/viewtopic.php?f=7&t=906499\nhttps://www.michiganalliancegroup.com/forum/showthread.php?tid=653469\nhttps://cinedsofa.li/showthread.php?tid=216&pid=337#pid337\nhttps://forumgalaxy.net/viewtopic.php?f=5&t=4548\nhttp://wingads.ru/open-search#comment-297\n", "language": "Lisp", "metadata": {"date": 1549196871, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s821797788.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s821797788", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://besttracker.cz/redirect.php?url=https://onlinecasino.us.org  http://bryanbartels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wilsonschroeder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://foodandsport.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://join5point.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dbf-formation.fr/k2-listing/item/280-nos-formations-en-bureautique?g2_returnName=www.dbf-formation.fr&fromurl=onlinecasino.us.org  http://www.travel-news.ru/goto.php?url=https://onlinecasino.us.org  http://www.civilnet.http21.com/www.google.com/dp/ads?max_radlink_len=32&r=m&domain_name=fabulous.com&client=dp-voodoo21_3ph&hl=en&adtest=off&optimize_terms=on&swp=as-drid-2464369813134582&afdt=CiAKEwj0hNrfscnZAhXXJB8KHWwfBoAYBHExJ2hC3-OWKxIZAG06ipDH024CdhpNTkqRE9ocSrcpsPoc9g&uiopt=true&oe=UTF-8&ie=UTF-8&fexp=21404%2C17300002&format=s%7Cr5%7Cr5%7Cr3&adrep=0&num=0&output=afd_ads&v=3&adext=as1%2Csr1&bsl=8&u_his=6&u_tz=-300&dt=1519847661687&u_w=1440&u_h=900&biw=-12245933&bih=-12245933&isw=1440&ish=358&psw=-1&psh=-1&frm=2&uio=sl1sr1--st22sv16sa16lt35-st22sv16sa16lt35-st12sa12&jsv=13016&rurl=https://onlinecasino.us.org   http://bluestarphotography.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://buffalosoldiers.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://randyswart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sunmoods.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.amateurlistings.com/cgi-bin/arp/out.cgi?id=george&url=https://onlinecasino.us.org  http://ethel-barrymore-theatre.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.bbwhottie.com/cgi-bin/out/out.cgi?c=1&rtt=5&s=50&u=https://onlinecasino.us.org  http://thesoulfulgroovesshow.libsyn.com/?referer=https://onlinecasino.us.org  http://idemlanguage.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://iqtask.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://kingpreownedcars.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://longmeadowhighlax.com/Goto.asp?url=https://onlinecasino.us.org   http://longfences.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.chinaski.chinaski.aneta.foto.foto.dev.senzaparty.net/redir.php?link=https://onlinecasino.us.org  http://virtupaint.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://backporchmusic.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thinkrose.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://assistivetechservices.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.msquaredsolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://hollywoodeuropeanawards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.zorgkantoordsw.nl/Pages/Popup.aspx?url=https://onlinecasino.us.org   http://yesterdaytoy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.duotegame.com/phpMyDuoTe/url.php?url=https://onlinecasino.us.org  http://sipos.transindex.ro/t/?url=https://onlinecasino.us.org/   http://choung.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://uruguayo.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://inform-matik.e-monsite.com/liens/do/redirect/?url=https://onlinecasino.us.org   http://isellbargains.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.flanakin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aprendices.wikispaces.com/page/edit/un+widget+para+tu+blog?goto=https://onlinecasino.us.org   http://devel.cen.umontreal.ca/fr/journals/ont/csieci/88/850/fulltext?redirect=https://onlinecasino.us.org   http://kencolebridal.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://calblooms.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://neoralivehappy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.berkin.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sgr-law.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hitch.dynim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.885care.com/web/miao1120/blog/-/blogs/140644?_33_redirect=https://onlinecasino.us.org  http://gototechnology.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ontariobusinessfunder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://elitevipreward.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://yln.cvstarr.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.jugendfreizeitwerk.de/Freizeit/Archiv/index.asp?url=https://onlinecasino.us.org  http://malabarfriends.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://coastalphoto.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://suihua.kuaimaonline.com/index.php?g=Appoint&c=Changecity&a=go&city=bh&referer=https://onlinecasino.us.org \nhttp://www.mcogfwc.org/guestbook/go.php?url=https://onlinecasino.us.org  http://www.crystalspamassage.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://putonpurple.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hhonors.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://uk.toptrendingoffers.com/redirect?url=https://onlinecasino.us.org   http://jacobstheater.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.sistematgi.com/es/redweb.asp?iddoc=147&url=https://onlinecasino.us.org  http://montreal.ngojobs.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.larenaissance33.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.whitewetlook.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.pitterpatterdayschools.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sfcourts.org/redirect.aspx?url=https://onlinecasino.us.org/   http://ares-ir.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://valpaksuck.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://greenbeginnings.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://silinvestments.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.maritimes.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://apis.bvau.ro/resurse/redirect.php?url=https://onlinecasino.us.org \nhttps://abiturient.ru/bitrix/rk.php?id=59&site_id=ab&goto=https://onlinecasino.us.org  http://www.kwiaciarniapoznan.pl/do/countryAndCurrency?referer=https://onlinecasino.us.org   https://blog.ydhang.cn/wp-content/themes/begin4.6/inc/go.php?url=https://onlinecasino.us.org   http://feedthedream.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.pgpublisher.ru/go.php?url=onlinecasino.us.org   http://human-anomalies.ru/go?https://onlinecasino.us.org  http://www.zuimeng.vip/wp-content/themes/begin4.4/inc/go.php?url=https://onlinecasino.us.org  http://www.internshipabroad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://globeguides.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://justus.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sandra.metmail.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://moovasatis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://newyork-virtualoffice.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bgimp.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.solet.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://image.jp0.ru/ru/index.php?url=https://onlinecasino.us.org  http://www.ekbouwadvies.nl/links/redir.asp?link=onlinecasino.us.org   http://resalesmarket.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.ni28320-2.web12.nitrado.hosting/phpBB3/viewtopic.php?f=7&t=906499\nhttps://www.michiganalliancegroup.com/forum/showthread.php?tid=653469\nhttps://cinedsofa.li/showthread.php?tid=216&pid=337#pid337\nhttps://forumgalaxy.net/viewtopic.php?f=5&t=4548\nhttp://wingads.ru/open-search#comment-297\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8293, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s205988576", "group_id": "codeNet:p03941", "input_text": "http://www.klus-groen.nl/gastenboek/go.php?url=https://onlinecasino.us.org  http://xxy.coo123.net/goto.php?c=&n=standard&url=https://onlinecasino.us.org   https://thepiratebay3.org/?url=https://onlinecasino.us.org   http://paulhobbswines.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hybridhospital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://merchanttailorcompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://milotex.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://huvecult.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lavendersarl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.onanist.com/rotor/link.php?gr=1&id=033fdf&url=https://onlinecasino.us.org  http://icrcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://us.member.uschoolnet.com/register_step1.php?_from=onlinecasino.us.org/   https://support.cadac.com/organice/home/pages/default.aspx?Returnurl=onlinecasino.us.org  http://www.american-history-magazine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.terracordum.ru/redirect?url=https://onlinecasino.us.org  http://makhachkala.novayaspravka.ru/go.php?url=https://onlinecasino.us.org  http://cloudecrypter.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dinnereatery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://zuffa1.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ninesigmainc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://i-4media.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://scienceforum.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kinddesign.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bigrigcustomtrucks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://financialrateinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://appsjumbo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aerogroupinc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.viluchinsk-city.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org  http://consilienthotels.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jaxfederalcreditunion.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://longmanenglish.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://temasekinternationalservices.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tubularskylight.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://iqc.joelosteen.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stemcellantibody.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ewebdesign.com.br/redirect.php?url=https://onlinecasino.us.org \nhttp://luxury4less.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zgnyzw.com/bbs/redirect.php?goto=onlinecasino.us.org   http://acninstallation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://мќјліём „кё°.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://1-800-gorolloff.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://screambuzz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://go-pgcounty.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://secure.prophoto.ua/js/go.php?srd_id=130&url=https://onlinecasino.us.org   http://grannytubes.com/cgi-bin/gtc.cgi?c=1&s=70&gtc=1&u=https://onlinecasino.us.org \nhttp://conspiracyempiricist.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.healthv.org/bbs//redirect.php?tid=24785&goto=onlinecasino.us.org   http://thesecretlivesofothers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://smokymtnfishing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ianmchenry.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yiloantong.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://809.world-surveys.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.shiranet.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org   https://personalweb.io/widget/r.php?u=https://onlinecasino.us.org \nhttp://china027.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mymichaels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://flycall.com/bbs/redirect.php?tid=288349&goto=onlinecasino.us.org   http://pricearmy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.healthycommunityalliance.org/redir.php?url=https://onlinecasino.us.org   http://realnaturalsoap.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.poketb.com/bbs///redirect.php?tid=10938&goto=onlinecasino.us.org  http://drandrewcaster.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.qoo10.sg/gmkt.inc/Mobile/Search/Default.aspx?keyword=onlinecasino.us.org \nhttp://marrella.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thepearl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.???????.net/re?url=https://onlinecasino.us.org   http://iowapokerroom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ultimatewealthcreator.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://abatasya.bahana.net/redirect.php?url=https://onlinecasino.us.org  http://acnextraincome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://honeymoonhelper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://????.com/s/r.php?mode=link&id=13488&url=https://onlinecasino.us.org \nhttp://prettyhead.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.svetlogorsk-edu.ru/bitrix/rk.php?goto=https://onlinecasino.us.org   http://newmutualismmaps.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://relevantreference.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://us-exim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kenneth-fisher.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wakeupkohls.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://proactivesurveysolutions.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gfsemail.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.granitecanyons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://royalmothertube.com/cgi-bin/crtr/out.cgi?id=168&l=topmain&u=https://onlinecasino.us.org   http://www.considerthis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clinilog.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.trafficguardbollards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://andreasulrich.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sandersbutterballporkbrand.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.h3.com.tw/redirect.asp?url=https://onlinecasino.us.org   http://lakitawright.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.reg-clan.ml/index.php?topic=27771.new#new\nhttp://www.jjhservers.com/phpbb/viewtopic.php?f=6&t=2316&p=19873#p19873\nhttps://vegetation-daheim.info/2012/11/26/vegetative-vermehrung-der-blauen-passionsblume-passiflora-caerulea/\nhttps://unicornblocks.com/forum/index.php?topic=101715.new#new\nhttp://tszh-avangard.ru/forum/viewtopic.php?f=4&t=185331\n", "language": "Lisp", "metadata": {"date": 1549185169, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s205988576.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s205988576", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.klus-groen.nl/gastenboek/go.php?url=https://onlinecasino.us.org  http://xxy.coo123.net/goto.php?c=&n=standard&url=https://onlinecasino.us.org   https://thepiratebay3.org/?url=https://onlinecasino.us.org   http://paulhobbswines.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hybridhospital.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://merchanttailorcompany.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://milotex.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://huvecult.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lavendersarl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.onanist.com/rotor/link.php?gr=1&id=033fdf&url=https://onlinecasino.us.org  http://icrcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://us.member.uschoolnet.com/register_step1.php?_from=onlinecasino.us.org/   https://support.cadac.com/organice/home/pages/default.aspx?Returnurl=onlinecasino.us.org  http://www.american-history-magazine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.terracordum.ru/redirect?url=https://onlinecasino.us.org  http://makhachkala.novayaspravka.ru/go.php?url=https://onlinecasino.us.org  http://cloudecrypter.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.dinnereatery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://zuffa1.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ninesigmainc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://i-4media.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://scienceforum.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kinddesign.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bigrigcustomtrucks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://financialrateinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://appsjumbo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aerogroupinc.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.viluchinsk-city.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org  http://consilienthotels.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jaxfederalcreditunion.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://longmanenglish.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://temasekinternationalservices.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tubularskylight.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://iqc.joelosteen.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://stemcellantibody.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ewebdesign.com.br/redirect.php?url=https://onlinecasino.us.org \nhttp://luxury4less.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.zgnyzw.com/bbs/redirect.php?goto=onlinecasino.us.org   http://acninstallation.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://мќјліём „кё°.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://1-800-gorolloff.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://screambuzz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://go-pgcounty.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://secure.prophoto.ua/js/go.php?srd_id=130&url=https://onlinecasino.us.org   http://grannytubes.com/cgi-bin/gtc.cgi?c=1&s=70&gtc=1&u=https://onlinecasino.us.org \nhttp://conspiracyempiricist.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.healthv.org/bbs//redirect.php?tid=24785&goto=onlinecasino.us.org   http://thesecretlivesofothers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://smokymtnfishing.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ianmchenry.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yiloantong.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://809.world-surveys.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.shiranet.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino.us.org   https://personalweb.io/widget/r.php?u=https://onlinecasino.us.org \nhttp://china027.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mymichaels.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://flycall.com/bbs/redirect.php?tid=288349&goto=onlinecasino.us.org   http://pricearmy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.healthycommunityalliance.org/redir.php?url=https://onlinecasino.us.org   http://realnaturalsoap.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.poketb.com/bbs///redirect.php?tid=10938&goto=onlinecasino.us.org  http://drandrewcaster.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.qoo10.sg/gmkt.inc/Mobile/Search/Default.aspx?keyword=onlinecasino.us.org \nhttp://marrella.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thepearl.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.???????.net/re?url=https://onlinecasino.us.org   http://iowapokerroom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ultimatewealthcreator.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://abatasya.bahana.net/redirect.php?url=https://onlinecasino.us.org  http://acnextraincome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://honeymoonhelper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://????.com/s/r.php?mode=link&id=13488&url=https://onlinecasino.us.org \nhttp://prettyhead.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.svetlogorsk-edu.ru/bitrix/rk.php?goto=https://onlinecasino.us.org   http://newmutualismmaps.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://relevantreference.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://us-exim.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kenneth-fisher.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wakeupkohls.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://proactivesurveysolutions.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gfsemail.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.granitecanyons.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://royalmothertube.com/cgi-bin/crtr/out.cgi?id=168&l=topmain&u=https://onlinecasino.us.org   http://www.considerthis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clinilog.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.trafficguardbollards.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://andreasulrich.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sandersbutterballporkbrand.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.h3.com.tw/redirect.asp?url=https://onlinecasino.us.org   http://lakitawright.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.reg-clan.ml/index.php?topic=27771.new#new\nhttp://www.jjhservers.com/phpbb/viewtopic.php?f=6&t=2316&p=19873#p19873\nhttps://vegetation-daheim.info/2012/11/26/vegetative-vermehrung-der-blauen-passionsblume-passiflora-caerulea/\nhttps://unicornblocks.com/forum/index.php?topic=101715.new#new\nhttp://tszh-avangard.ru/forum/viewtopic.php?f=4&t=185331\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7692, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s356701905", "group_id": "codeNet:p03941", "input_text": "http://modalinestore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mobileawesomeness.com/link.php?contact=user&id=10371&url=https://onlinecasino.us.org   http://www.nodoping.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://de-nol.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ironhorseauctions.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dieselgeneratorcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://earthcare.nationbuilder.com/r?u=https://onlinecasino.us.org  http://proofer1.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://auctions.goldenarticles.net/go.php?url=https://onlinecasino.us.org \nhttp://www.888stopirs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://onlineauctionacademy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vesabios.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.grk-rada.ru/bitrix/rk.php?goto=https://onlinecasino.us.org  http://namimedia.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.smhf-givegratitude.org/redirect?SessionGuid=739cb1b6-bb57-4ba0-b4f3-bfe2f063c996&url=https://onlinecasino.us.org  https://www.istoreil.co.il/redirect.php?u=https://onlinecasino.us.org  http://londonbusinessreport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aubsm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.hs-baeder.de/modules/html2pdf/html2pdf.php?url=https://onlinecasino.us.org  http://disruptivedialog.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gastrogenomics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fksr-2014.nichost.ru/bitrix/rk.php?id=22&event1=banner&event2=click&event3=1+%2F+%5B22%5D+%5Btop_main%5D+&goto=https://onlinecasino.us.org  http://professionalcoachingnetwork.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yehlin.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://webmaster.hooksettlacrosse.com/Goto.asp?url=https://onlinecasino.us.org  http://ebh.pandimension.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wcetveshop.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://scripts-for-ucoz.ru/go?https://onlinecasino.us.org  http://mayfairgames.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://buket-menu.com.ua/bitrix/rk.php?id=2&site_id=s1&event1=banner&event2=click&goto=https://onlinecasino.us.org   http://artisannexus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.amch-chauff.com/yacs/links/click.php?url=https://onlinecasino.us.org   http://rpz.pinnaclesports.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.art-provence-realisations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bwfinancialservices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ermgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ufcoctagongirls.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bmgparishes.org.uk/goto-link.php?link_id=15&url=https://onlinecasino.us.org   http://www.ethnoarchitecture.org/web?URL=https://onlinecasino.us.org/   http://www.lances.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.100ssul.com/index.php?mid=board&category=212&search_target=tag&search_keyword=1&document_srl=1863&fromurl=onlinecasino.us.org   http://zsx.cdkpc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pardiseparse.blogsky.com/dailylink/?go=https://onlinecasino.us.org  http://www.fuse3.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ticketpoints.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://robertroxberry.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://nklpis.ru/bitrix/rk.php?id=32&event1=banner&event2=click&event3=1+%2F+%5B32%5D+%5BLEFT_CENTER%5D+%D0%A3%D0%9C%D0%9E+29.00.00&goto=https://onlinecasino.us.org   http://mctz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://isurgeryresults.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lugosiwines.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.stuurbrevet.be/redirect.php?modus=l&link_url=https://onlinecasino.us.org  http://gengsg.com/index.php?c=reg&&referer=https://onlinecasino.us.org  http://xn--raunovodja-njb.si/go.asp?stran=4387&url=https://onlinecasino.us.org   http://umwelt-technologien.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://actionmoviefx.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://paytmpromocode.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wylene.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dieselgeneratorcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gxqsy.net/search/default.aspx?k=onlinecasino.us.org   http://supplieraddresses.com/redirect.php?url=https://onlinecasino.us.org  http://kristy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://flaglercountyhouses.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://medical-decide.es/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.22nudos.com/__media__/js/trademark.php?d=onlinecasino.us.org  http://www.gait-trial.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crazyoldbag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://topmacapp.com/go/?url=https://onlinecasino.us.org  http://xn----8sb2aijhq.com/engine/go.php?url=onlinecasino.us.org   http://tsasw.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aicpacpacff.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thebraunds.com/photos/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasino.us.org   http://qiye.163.tera-byte.com/cat/german/click.php?url=https://onlinecasino.us.org \nhttp://www.tu-ry.ru/redirect.php?to=https://onlinecasino.us.org  http://www.tartandayparade.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sitcomtchad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nebraskadirectvaloans.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://investmentroadmap.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qdia.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://greenspun.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://psychopomps.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lodoss.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.220336.com/gourl.asp?url=https://onlinecasino.us.org  http://www.cnpo.com.cn/home/link.php?url=https://onlinecasino.us.org   http://adamant-forum.ru/away.php?s=https://onlinecasino.us.org   http://thetruthfestival.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jdafinancial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.biggestasspics.com/wesgmtb/qzyoqej.cgi?c=2&s=60&r=1&u=https://onlinecasino.us.org  http://u-paid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://robgirellini.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.c-levelselling.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://lnw.bet/webboard/index.php/topic,453367.new.html#new\nhttps://primeaque.com/forum/index.php?topic=33479.new#new\nhttps://celsohl.com/?contact-form-id=50235&contact-form-sent=99041&contact-form-hash=61b7306e80c71013c4456a98c4fbb64f390ec1fb&_wpnonce=0e9ef0ca74\nhttp://2htwiz.net/support/index.php/topic,499305.new.html#new\nhttps://www.coinssouq.com/forum/showthread.php?262792-%D0%9A%D0%B0%D0%B7%D0%B0%D1%82%D1%8C%D1%81%D1%8F-%D0%B4%D0%BE%D0%B1%D0%B0%D0%B2%D0%B8%D1%82%D1%8C-%D0%B1%D0%BE%D0%BB%D1%8C%D1%88%D0%B5-%D1%81%D0%BB%D0%BE%D1%82%D0%BE%D0%B2-%D0%B2-Superomatic&p=451434&posted=1#post451434\n", "language": "Lisp", "metadata": {"date": 1549161105, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s356701905.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s356701905", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://modalinestore.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.mobileawesomeness.com/link.php?contact=user&id=10371&url=https://onlinecasino.us.org   http://www.nodoping.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://de-nol.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ironhorseauctions.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dieselgeneratorcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://earthcare.nationbuilder.com/r?u=https://onlinecasino.us.org  http://proofer1.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://auctions.goldenarticles.net/go.php?url=https://onlinecasino.us.org \nhttp://www.888stopirs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://onlineauctionacademy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vesabios.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.grk-rada.ru/bitrix/rk.php?goto=https://onlinecasino.us.org  http://namimedia.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.smhf-givegratitude.org/redirect?SessionGuid=739cb1b6-bb57-4ba0-b4f3-bfe2f063c996&url=https://onlinecasino.us.org  https://www.istoreil.co.il/redirect.php?u=https://onlinecasino.us.org  http://londonbusinessreport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://aubsm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.hs-baeder.de/modules/html2pdf/html2pdf.php?url=https://onlinecasino.us.org  http://disruptivedialog.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gastrogenomics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fksr-2014.nichost.ru/bitrix/rk.php?id=22&event1=banner&event2=click&event3=1+%2F+%5B22%5D+%5Btop_main%5D+&goto=https://onlinecasino.us.org  http://professionalcoachingnetwork.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://yehlin.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://webmaster.hooksettlacrosse.com/Goto.asp?url=https://onlinecasino.us.org  http://ebh.pandimension.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wcetveshop.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://scripts-for-ucoz.ru/go?https://onlinecasino.us.org  http://mayfairgames.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://buket-menu.com.ua/bitrix/rk.php?id=2&site_id=s1&event1=banner&event2=click&goto=https://onlinecasino.us.org   http://artisannexus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.amch-chauff.com/yacs/links/click.php?url=https://onlinecasino.us.org   http://rpz.pinnaclesports.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.art-provence-realisations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bwfinancialservices.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ermgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://ufcoctagongirls.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.bmgparishes.org.uk/goto-link.php?link_id=15&url=https://onlinecasino.us.org   http://www.ethnoarchitecture.org/web?URL=https://onlinecasino.us.org/   http://www.lances.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.100ssul.com/index.php?mid=board&category=212&search_target=tag&search_keyword=1&document_srl=1863&fromurl=onlinecasino.us.org   http://zsx.cdkpc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pardiseparse.blogsky.com/dailylink/?go=https://onlinecasino.us.org  http://www.fuse3.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ticketpoints.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://robertroxberry.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://nklpis.ru/bitrix/rk.php?id=32&event1=banner&event2=click&event3=1+%2F+%5B32%5D+%5BLEFT_CENTER%5D+%D0%A3%D0%9C%D0%9E+29.00.00&goto=https://onlinecasino.us.org   http://mctz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://isurgeryresults.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://lugosiwines.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.stuurbrevet.be/redirect.php?modus=l&link_url=https://onlinecasino.us.org  http://gengsg.com/index.php?c=reg&&referer=https://onlinecasino.us.org  http://xn--raunovodja-njb.si/go.asp?stran=4387&url=https://onlinecasino.us.org   http://umwelt-technologien.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://actionmoviefx.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://paytmpromocode.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wylene.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://dieselgeneratorcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gxqsy.net/search/default.aspx?k=onlinecasino.us.org   http://supplieraddresses.com/redirect.php?url=https://onlinecasino.us.org  http://kristy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://flaglercountyhouses.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://medical-decide.es/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.22nudos.com/__media__/js/trademark.php?d=onlinecasino.us.org  http://www.gait-trial.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://crazyoldbag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://topmacapp.com/go/?url=https://onlinecasino.us.org  http://xn----8sb2aijhq.com/engine/go.php?url=onlinecasino.us.org   http://tsasw.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aicpacpacff.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thebraunds.com/photos/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasino.us.org   http://qiye.163.tera-byte.com/cat/german/click.php?url=https://onlinecasino.us.org \nhttp://www.tu-ry.ru/redirect.php?to=https://onlinecasino.us.org  http://www.tartandayparade.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sitcomtchad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nebraskadirectvaloans.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://investmentroadmap.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://qdia.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://greenspun.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://psychopomps.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lodoss.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.220336.com/gourl.asp?url=https://onlinecasino.us.org  http://www.cnpo.com.cn/home/link.php?url=https://onlinecasino.us.org   http://adamant-forum.ru/away.php?s=https://onlinecasino.us.org   http://thetruthfestival.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jdafinancial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.biggestasspics.com/wesgmtb/qzyoqej.cgi?c=2&s=60&r=1&u=https://onlinecasino.us.org  http://u-paid.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://robgirellini.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.c-levelselling.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://lnw.bet/webboard/index.php/topic,453367.new.html#new\nhttps://primeaque.com/forum/index.php?topic=33479.new#new\nhttps://celsohl.com/?contact-form-id=50235&contact-form-sent=99041&contact-form-hash=61b7306e80c71013c4456a98c4fbb64f390ec1fb&_wpnonce=0e9ef0ca74\nhttp://2htwiz.net/support/index.php/topic,499305.new.html#new\nhttps://www.coinssouq.com/forum/showthread.php?262792-%D0%9A%D0%B0%D0%B7%D0%B0%D1%82%D1%8C%D1%81%D1%8F-%D0%B4%D0%BE%D0%B1%D0%B0%D0%B2%D0%B8%D1%82%D1%8C-%D0%B1%D0%BE%D0%BB%D1%8C%D1%88%D0%B5-%D1%81%D0%BB%D0%BE%D1%82%D0%BE%D0%B2-%D0%B2-Superomatic&p=451434&posted=1#post451434\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8114, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s871630408", "group_id": "codeNet:p03941", "input_text": "http://murphymedical.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rogerguttridge.co.uk/includes/go.php?url=onlinecasino.us.org   http://fkhcollections.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mzw.fleamarketautosales.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://whitemathem.ru/cgi-bin/redirect.cgi?url=onlinecasino.us.org   http://usdunnage.com/__media__/js/trademark.php?d=onlinecasino.us.org  http://hours-locations.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.galacticsurf.com/redirect.htm?redir=https://onlinecasino.us.org   http://bestofthebreed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://chshybridhealth.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.skrzat.com.pl/link.php?req_link=https://onlinecasino.us.org   http://theirvineprocessserver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mtbfanclubelite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://maps.google.com.sb/url?q=https://onlinecasino.us.org   https://www.oldtimer.ru/?hide=true&flash_link=onlinecasino.us.org  http://www.albert-schweitzer-haus-bonn.de/umleitung.php?link=onlinecasino.us.org  http://www.creatingserenity.laccol.com/?go=click&c=1&n=36&e=1&g=1&r=24199408&u=https://onlinecasino.us.org   http://safepapers.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.armaturshiki.ru/redirect_5124.php?url=https://onlinecasino.us.org/  http://cjm.gemedicalprotective.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lucillerobertsfranchising.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hostessmanagement.put-in-bayhotel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://powerstripebaseballs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://shopxi.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://copaah.e-monsite.com/liens/do/redirect/?url=https://onlinecasino.us.org  http://isleworthgolfandcountryclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bubbleheadthefilm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sliplessinseattle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bryanpenney.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nationalballistic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cinema-delux.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aizahealy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.jungle-park.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.over-reeen.nl/LinkClick.aspx?link=https://onlinecasino.us.org  http://mywines.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://thegrandcandy.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wheelabratortechnologies.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://keepeminstitches.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wakunaga.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tacasuan.unicordoba.edu.co/egroupware/redirect.php?go=https://onlinecasino.us.org/  https://22141.r.bat.bing.com/?ld=d3JzhjhY0pWCUg2jcQXjWE9DVUCUwzm2wNiK6g19TrQsYtbs1v-IGNctuzSwfHfUmkvUkCtZHePgveSxq3GnDebrE-Am3nkiKOq5M9chTJu_Ji6DwWS9JcidUwuySjgSE0Pq-EeB0VqQu-TxP1e9ysJrhXoQsdxdbUYLy4n0i9MdUEH86N&u=https://onlinecasino.us.org   http://vistcapital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thisisifa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://larosa.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://busesbybill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mykizomba.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://home.jnnc.com:8080/link.php?url=https://onlinecasino.us.org   http://happychristmaswallpapers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brainwavemedia.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.itsmichigan.org/track/exit.php?url=https://onlinecasino.us.org   http://www.151994domain.com/LTSanitizer.aspx?u=https://onlinecasino.us.org/  http://woopsla.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://partner-reinsurance.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://moneywallpapers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sleepchallenge.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fx-spot.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gopornhub.com/cgi-bin/a2/out.cgi?id=54&u=https://onlinecasino.us.org   http://themailmachine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://longislandcanopy.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://icvmcreative.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://la83.com/tool/alexa/index.asp?domain=onlinecasino.us.org  http://cubicfeet.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bellarminelions.uslaxteams.com/Goto.asp?url=https://onlinecasino.us.org \nhttp://xlw.worldjewelry.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://unexpectedtoy.com/dotnetnuke/LinkClick.aspx?link=https://onlinecasino.us.org   http://rasot.gov.ua/bitrix/rk.php?id=21&event1=banner&event2=click&event3=1+%2F+%5B21%5D+%5BPARTNERS_B%5D+&goto=https://onlinecasino.us.org   http://boxonomy.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://completesavings-suck.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.savemyrupee.com/redirect.php?link=https://onlinecasino.us.org  http://www.plccentral.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.oberlausitzermittelstand.de/count-allgemein.php?go=https://onlinecasino.us.org   http://www.smacts.com/cgi-bin/a2/out.cgi?id=25&u=https://onlinecasino.us.org \nhttp://www.nihadc.com/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://aadhaya.co.in/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://karate-hmao.ru/goto/https://onlinecasino.us.org   http://idc.fzl18.com/go.asp?url=https://onlinecasino.us.org  http://huntsvillehomeseller.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chesterspringspa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dermascience.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.yu-kari-ofuna.com/feed2js/feed2js.php?src=https://onlinecasino.us.org   http://www.cmwlaw.com/__media__/js/netsoltrademark.php?d=&onlinecasino.us.org \nhttps://www.jaynestars.com/?go=https://onlinecasino.us.org  http://www.marketstuff.nl/click.php?id=40&url=https://onlinecasino.us.org   http://1km.ecophyl.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ptproperties.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wrimdocs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://krylonintampa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ircsm.ir/dailylink/?go=https://onlinecasino.us.org  http://filemakeronline.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://autisminformationproject.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.leopoldsdorf-wien.info/phpbb/viewtopic.php?f=2&t=232396\nhttp://chs.my/forum/viewtopic.php?f=4&t=14989&p=154197#p154197\nhttps://khonglottaimusic.com/le-vu/\nhttps://www.propladder.com/blog/prestige-song-of-south-pre-launch-bangalore/#comment-54794\nhttp://tszh-avangard.ru/forum/viewtopic.php?f=4&t=184927\n", "language": "Lisp", "metadata": {"date": 1549149289, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s871630408.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s871630408", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://murphymedical.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://rogerguttridge.co.uk/includes/go.php?url=onlinecasino.us.org   http://fkhcollections.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mzw.fleamarketautosales.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://whitemathem.ru/cgi-bin/redirect.cgi?url=onlinecasino.us.org   http://usdunnage.com/__media__/js/trademark.php?d=onlinecasino.us.org  http://hours-locations.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.galacticsurf.com/redirect.htm?redir=https://onlinecasino.us.org   http://bestofthebreed.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://chshybridhealth.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.skrzat.com.pl/link.php?req_link=https://onlinecasino.us.org   http://theirvineprocessserver.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mtbfanclubelite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://maps.google.com.sb/url?q=https://onlinecasino.us.org   https://www.oldtimer.ru/?hide=true&flash_link=onlinecasino.us.org  http://www.albert-schweitzer-haus-bonn.de/umleitung.php?link=onlinecasino.us.org  http://www.creatingserenity.laccol.com/?go=click&c=1&n=36&e=1&g=1&r=24199408&u=https://onlinecasino.us.org   http://safepapers.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.armaturshiki.ru/redirect_5124.php?url=https://onlinecasino.us.org/  http://cjm.gemedicalprotective.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lucillerobertsfranchising.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://hostessmanagement.put-in-bayhotel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://powerstripebaseballs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://shopxi.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://copaah.e-monsite.com/liens/do/redirect/?url=https://onlinecasino.us.org  http://isleworthgolfandcountryclub.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bubbleheadthefilm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sliplessinseattle.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bryanpenney.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nationalballistic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cinema-delux.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aizahealy.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.jungle-park.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.over-reeen.nl/LinkClick.aspx?link=https://onlinecasino.us.org  http://mywines.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://thegrandcandy.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://wheelabratortechnologies.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://keepeminstitches.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://wakunaga.eu/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tacasuan.unicordoba.edu.co/egroupware/redirect.php?go=https://onlinecasino.us.org/  https://22141.r.bat.bing.com/?ld=d3JzhjhY0pWCUg2jcQXjWE9DVUCUwzm2wNiK6g19TrQsYtbs1v-IGNctuzSwfHfUmkvUkCtZHePgveSxq3GnDebrE-Am3nkiKOq5M9chTJu_Ji6DwWS9JcidUwuySjgSE0Pq-EeB0VqQu-TxP1e9ysJrhXoQsdxdbUYLy4n0i9MdUEH86N&u=https://onlinecasino.us.org   http://vistcapital.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://thisisifa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://larosa.mobi/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://busesbybill.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mykizomba.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://home.jnnc.com:8080/link.php?url=https://onlinecasino.us.org   http://happychristmaswallpapers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brainwavemedia.tv/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.itsmichigan.org/track/exit.php?url=https://onlinecasino.us.org   http://www.151994domain.com/LTSanitizer.aspx?u=https://onlinecasino.us.org/  http://woopsla.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://partner-reinsurance.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://moneywallpapers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sleepchallenge.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://fx-spot.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://gopornhub.com/cgi-bin/a2/out.cgi?id=54&u=https://onlinecasino.us.org   http://themailmachine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://longislandcanopy.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://icvmcreative.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://la83.com/tool/alexa/index.asp?domain=onlinecasino.us.org  http://cubicfeet.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bellarminelions.uslaxteams.com/Goto.asp?url=https://onlinecasino.us.org \nhttp://xlw.worldjewelry.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://unexpectedtoy.com/dotnetnuke/LinkClick.aspx?link=https://onlinecasino.us.org   http://rasot.gov.ua/bitrix/rk.php?id=21&event1=banner&event2=click&event3=1+%2F+%5B21%5D+%5BPARTNERS_B%5D+&goto=https://onlinecasino.us.org   http://boxonomy.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://completesavings-suck.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.savemyrupee.com/redirect.php?link=https://onlinecasino.us.org  http://www.plccentral.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.oberlausitzermittelstand.de/count-allgemein.php?go=https://onlinecasino.us.org   http://www.smacts.com/cgi-bin/a2/out.cgi?id=25&u=https://onlinecasino.us.org \nhttp://www.nihadc.com/modules/mod_jw_srfr/redir.php?url=https://onlinecasino.us.org  http://aadhaya.co.in/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://karate-hmao.ru/goto/https://onlinecasino.us.org   http://idc.fzl18.com/go.asp?url=https://onlinecasino.us.org  http://huntsvillehomeseller.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://chesterspringspa.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://dermascience.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.yu-kari-ofuna.com/feed2js/feed2js.php?src=https://onlinecasino.us.org   http://www.cmwlaw.com/__media__/js/netsoltrademark.php?d=&onlinecasino.us.org \nhttps://www.jaynestars.com/?go=https://onlinecasino.us.org  http://www.marketstuff.nl/click.php?id=40&url=https://onlinecasino.us.org   http://1km.ecophyl.de/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ptproperties.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wrimdocs.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://krylonintampa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ircsm.ir/dailylink/?go=https://onlinecasino.us.org  http://filemakeronline.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://autisminformationproject.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttp://www.leopoldsdorf-wien.info/phpbb/viewtopic.php?f=2&t=232396\nhttp://chs.my/forum/viewtopic.php?f=4&t=14989&p=154197#p154197\nhttps://khonglottaimusic.com/le-vu/\nhttps://www.propladder.com/blog/prestige-song-of-south-pre-launch-bangalore/#comment-54794\nhttp://tszh-avangard.ru/forum/viewtopic.php?f=4&t=184927\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7788, "cpu_time_ms": 111, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s239337472", "group_id": "codeNet:p03941", "input_text": "http://www.nanqp.com/szbbs_sznews_com/connect.php?mod=login&op=init&referer=https://onlinecasinodd.com  https://www.classicalpilates.net/banner-redirect.php?iID=470177&u=https://onlinecasinodd.com   http://www.svalborn.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ads.fdhs.cz/url.php?url=https://onlinecasinodd.com/  http://alcogol.su/go.php?url=https://onlinecasinodd.com   http://wanonn.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://vivenuevayork.com/cblog/index.php?url=https://onlinecasinodd.com  http://www.carricktimes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.torayro.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://litigationwitnesses.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://haojiabaike.com/go/jd/?u=https://onlinecasinodd.com   http://showerdeck.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kensingtonconsulting.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://narochanskij-bereg.priehali.by/go/https://onlinecasinodd.com   http://johncasablancascentermodeling.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hbw.financetemp.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.summerlandca.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://blurliving.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.strathdonpipeband.com/LinkClick.aspx?link=https://onlinecasinodd.com  http://r1f.alfatechvos.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ihzcoin.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://fca2016.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://totalfire.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kbw.opendoorworkshops.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nightwishguitars.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://refrigeratormagnets.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.westsidetennis.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://fruitis.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://toweltheft.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.splendorsofnature.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://chileware.com/proxy-url.php?url=https://onlinecasinodd.com  http://iprepap.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://varimot.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://georgevaldivia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://allergycentral.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://w4.systranlinks.com/trans?urltext=https://onlinecasinodd.com \nhttp://sdggsx.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jaguarofcolumbus.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.pillowandpill.com/bmpp/visit.php?url=https://onlinecasinodd.com   http://www.foreningsliv.nu/aselebhk/redirect.php?redir=https://onlinecasinodd.com  https://www.tngop.org/r?u=https://onlinecasinodd.com   http://forum.twbts.com/redirect.php?goto=onlinecasinodd.com  http://ffio.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.my-htd.de/redirect.ashx?typ=hersteller&url=https://onlinecasinodd.com   http://neo411.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.campaignforvermont.org/r?u=https://onlinecasinodd.com  http://adv.0763f.com/click.php?a=doclick&url=https://onlinecasinodd.com   http://southerncaliforniacosmeticsurgery.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://paul-lacroix.com/link.php?location=https://onlinecasinodd.com  http://xchgcoin.com/redirect.php?url=https://onlinecasinodd.com   http://homedos.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.find-a-product.info/redirect.php?url=https://onlinecasinodd.com  http://cblcorporation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.pydata.club/go.php?url=https://onlinecasinodd.com \nhttp://omy.liquorplus.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.photonics.com/Clickthru.aspx?CT=CIEW&MemberID=0&IEID=255&URL=https://onlinecasinodd.com   http://www.2enable.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://caldwellohumc.org/System/UserProfile.asp?id=52006&func=signup&referer=https://onlinecasinodd.com  http://miyazakinoukiguten.com/redirect.php?action=url&goto=onlinecasinodd.com   http://martiknowsparties.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://2612287.r.msn.com/?ld=d3v1-hh7uAMIIbENbXhtMzLjVUCUxnf0O_lXP20LACyj5-1EydmV_I3uFd-7muNizAsSqYQVzv5G3KnAFxl9BRk9rmbcsXilYKwpy8T3wPbBcNrvi2MO-oSeWA0IvPuUeoFAJoC3DKk6xvVui-aqUAxLt-96sZjNubwC-44hqM-_aKhdq5&u=https://onlinecasinodd.com  http://www.andhraeducation.net/rd.asp?url=https://onlinecasinodd.com   http://mapassess.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://millennialmedia.jp/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://xfan.jp/ps_search.cgi?act=jump&access=1&url=https://onlinecasinodd.com   http://phorumphilly.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://trojanfund.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ucalc.clipe.pt/out.php?link=images/5x87x45153&url=onlinecasinodd.com   http://leds.tv/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ads2.westca.com/server/adclick.php?bannerid=2977&zoneid=0&source=&dest=https://onlinecasinodd.com/  https://pawnee.ops.org/LinkClick.aspx?link=https://onlinecasinodd.com   http://www.kaikai-nb.com/outlink?url=https://onlinecasinodd.com \nhttp://qatardealers.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://roseri.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.advisorsfpw.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://sidacepatrol.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://lupusawarenessmonth.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://camillaalzetta.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dncdirector.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://zaporozhye.restoranchik.com.ua/bitrix/redirect.php?event1=rest_out&event2=Array&event3=Kukuruza+&goto=https://onlinecasinodd.com   http://www.ronnynilsen.com/link.cgi?url=https://onlinecasinodd.com \nhttp://weeklytvdeals.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.dsswdus.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hearcomfort.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.360kc.com/popupview.php?adid=6379&url=https://onlinecasinodd.com/  http://smilesfordentalhealth.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.horshamdems.org/r?u=https://onlinecasinodd.com  http://www.texaslipidclinic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.petzi.ch/link.php?link=https://onlinecasinodd.com   http://www.guitarnotes.com/tabs/gtframe.cgi?https://onlinecasinodd.com/ \n \n \n \n \n \nhttps://lindaghill.com/2018/08/15/one-liner-wednesday-snail-mail/\nhttps://www.dangeroussports.com/forum/viewtopic.php?pid=235244#p235244\nhttp://www.elveterinario10.com/foro/index.php?topic=10542.new#new\nhttps://celsohl.com/?contact-form-id=50235&contact-form-sent=98989&contact-form-hash=61b7306e80c71013c4456a98c4fbb64f390ec1fb&_wpnonce=8a934e3232\nhttps://www.kadmium.nl/forum/viewtopic.php?f=3&t=88519\n", "language": "Lisp", "metadata": {"date": 1549131813, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s239337472.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s239337472", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.nanqp.com/szbbs_sznews_com/connect.php?mod=login&op=init&referer=https://onlinecasinodd.com  https://www.classicalpilates.net/banner-redirect.php?iID=470177&u=https://onlinecasinodd.com   http://www.svalborn.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ads.fdhs.cz/url.php?url=https://onlinecasinodd.com/  http://alcogol.su/go.php?url=https://onlinecasinodd.com   http://wanonn.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://vivenuevayork.com/cblog/index.php?url=https://onlinecasinodd.com  http://www.carricktimes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.torayro.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://litigationwitnesses.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://haojiabaike.com/go/jd/?u=https://onlinecasinodd.com   http://showerdeck.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kensingtonconsulting.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://narochanskij-bereg.priehali.by/go/https://onlinecasinodd.com   http://johncasablancascentermodeling.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hbw.financetemp.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.summerlandca.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://blurliving.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.strathdonpipeband.com/LinkClick.aspx?link=https://onlinecasinodd.com  http://r1f.alfatechvos.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ihzcoin.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://fca2016.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://totalfire.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kbw.opendoorworkshops.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nightwishguitars.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://refrigeratormagnets.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.westsidetennis.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://fruitis.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://toweltheft.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.splendorsofnature.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://chileware.com/proxy-url.php?url=https://onlinecasinodd.com  http://iprepap.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://varimot.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://georgevaldivia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://allergycentral.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://w4.systranlinks.com/trans?urltext=https://onlinecasinodd.com \nhttp://sdggsx.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jaguarofcolumbus.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.pillowandpill.com/bmpp/visit.php?url=https://onlinecasinodd.com   http://www.foreningsliv.nu/aselebhk/redirect.php?redir=https://onlinecasinodd.com  https://www.tngop.org/r?u=https://onlinecasinodd.com   http://forum.twbts.com/redirect.php?goto=onlinecasinodd.com  http://ffio.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.my-htd.de/redirect.ashx?typ=hersteller&url=https://onlinecasinodd.com   http://neo411.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.campaignforvermont.org/r?u=https://onlinecasinodd.com  http://adv.0763f.com/click.php?a=doclick&url=https://onlinecasinodd.com   http://southerncaliforniacosmeticsurgery.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://paul-lacroix.com/link.php?location=https://onlinecasinodd.com  http://xchgcoin.com/redirect.php?url=https://onlinecasinodd.com   http://homedos.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.find-a-product.info/redirect.php?url=https://onlinecasinodd.com  http://cblcorporation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.pydata.club/go.php?url=https://onlinecasinodd.com \nhttp://omy.liquorplus.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.photonics.com/Clickthru.aspx?CT=CIEW&MemberID=0&IEID=255&URL=https://onlinecasinodd.com   http://www.2enable.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://caldwellohumc.org/System/UserProfile.asp?id=52006&func=signup&referer=https://onlinecasinodd.com  http://miyazakinoukiguten.com/redirect.php?action=url&goto=onlinecasinodd.com   http://martiknowsparties.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://2612287.r.msn.com/?ld=d3v1-hh7uAMIIbENbXhtMzLjVUCUxnf0O_lXP20LACyj5-1EydmV_I3uFd-7muNizAsSqYQVzv5G3KnAFxl9BRk9rmbcsXilYKwpy8T3wPbBcNrvi2MO-oSeWA0IvPuUeoFAJoC3DKk6xvVui-aqUAxLt-96sZjNubwC-44hqM-_aKhdq5&u=https://onlinecasinodd.com  http://www.andhraeducation.net/rd.asp?url=https://onlinecasinodd.com   http://mapassess.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://millennialmedia.jp/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://xfan.jp/ps_search.cgi?act=jump&access=1&url=https://onlinecasinodd.com   http://phorumphilly.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://trojanfund.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ucalc.clipe.pt/out.php?link=images/5x87x45153&url=onlinecasinodd.com   http://leds.tv/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ads2.westca.com/server/adclick.php?bannerid=2977&zoneid=0&source=&dest=https://onlinecasinodd.com/  https://pawnee.ops.org/LinkClick.aspx?link=https://onlinecasinodd.com   http://www.kaikai-nb.com/outlink?url=https://onlinecasinodd.com \nhttp://qatardealers.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://roseri.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.advisorsfpw.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://sidacepatrol.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://lupusawarenessmonth.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://camillaalzetta.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dncdirector.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://zaporozhye.restoranchik.com.ua/bitrix/redirect.php?event1=rest_out&event2=Array&event3=Kukuruza+&goto=https://onlinecasinodd.com   http://www.ronnynilsen.com/link.cgi?url=https://onlinecasinodd.com \nhttp://weeklytvdeals.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.dsswdus.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hearcomfort.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.360kc.com/popupview.php?adid=6379&url=https://onlinecasinodd.com/  http://smilesfordentalhealth.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.horshamdems.org/r?u=https://onlinecasinodd.com  http://www.texaslipidclinic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.petzi.ch/link.php?link=https://onlinecasinodd.com   http://www.guitarnotes.com/tabs/gtframe.cgi?https://onlinecasinodd.com/ \n \n \n \n \n \nhttps://lindaghill.com/2018/08/15/one-liner-wednesday-snail-mail/\nhttps://www.dangeroussports.com/forum/viewtopic.php?pid=235244#p235244\nhttp://www.elveterinario10.com/foro/index.php?topic=10542.new#new\nhttps://celsohl.com/?contact-form-id=50235&contact-form-sent=98989&contact-form-hash=61b7306e80c71013c4456a98c4fbb64f390ec1fb&_wpnonce=8a934e3232\nhttps://www.kadmium.nl/forum/viewtopic.php?f=3&t=88519\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7675, "cpu_time_ms": 91, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s869398271", "group_id": "codeNet:p03941", "input_text": "http://www.tropicalcocktails.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ei-santГ©.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.amestana.lt/url.php?url=https://onlinecasinodd.com   http://fran-chocolate.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://weatherisfun.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://disabilities-law.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.easttexansforliberty.com/r?u=https://onlinecasinodd.com  https://soaptv.me/engine/go.php?url=onlinecasinodd.com   http://www.laureloak.com/default.aspx?p=TrackHyperlink&url=https://onlinecasinodd.com \nhttp://asspros.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tuttoeros.e-z-go.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://x1x.click-chann.com/link.php?url=https://onlinecasinodd.com   http://yc.xinshizaixian.com/index.php?g=Appoint&c=Changecity&a=go&city=xsbn&referer=https://onlinecasinodd.com  http://miopportunity.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.robbinsresearchinternational.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://maps.google.dz/url?q=https://onlinecasinodd.com  http://slightly-bigger.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://fromthelens.ca/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://141007426.r.bat.bing.com/?ld=d3R1Cxl5UR-Fhgq_yDSg5pITVUCUxLXUhnd5fEnTZjjstJR6NtVdcA9Fqn89yfATlXjdajVJkjYQrQcCcZadYd-TpU9EIGhvlfh4hvbn8shtFvajtoQY8SF1UWV_9xwicg4zQUYA_e7sCsIGXBxYRsBd4B5dEmRO3C3Wn4t-NYO6f42DbS&u=https://onlinecasinodd.com  http://reeboksportsclub.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://asgrandnord.e-monsite.com/liens/do/redirect/?url=https://onlinecasinodd.com   http://clara-indiana.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pottypress.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.heartsrizing.com/cgi/mt/mt4i.cgi?id=7&mode=redirect&no=90&ref_eid=1203&url=https://onlinecasinodd.com  http://ashburndogpark.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://cletheatre.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://tfccsr.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://rometers.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://frackfreeplanet.com/c?u=https://onlinecasinodd.com   http://tessenderlotrading.cn/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://courtneyblackman.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.urban-offroad.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://m.greenchoicecarpet.com/?url=https://onlinecasinodd.com  http://totaralms.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rasot.gov.ua/bitrix/rk.php?id=21&event1=banner&event2=click&event3=1+%2F+%5B21%5D+%5BPARTNERS_B%5D+&goto=https://onlinecasinodd.com   http://www.michaelpalmerbooks.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://lsinternal.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dnepropetrovsk.restoranchik.com.ua/bitrix/redirect.php?event1=rest_out&event2=Array&event3=%CF%E0%ED%EE%F0%E0%EC%E0&goto=https://onlinecasinodd.com   https://www.ruimtevlaanderen.be/LinkClick.aspx?link=https://onlinecasinodd.com   http://mouseembryonicstemcellmedia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.novalogic.com/remote.asp?NLink=https://onlinecasinodd.com   http://boycott-this.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.azcourts.gov/LinkClick.aspx?link=https://onlinecasinodd.com  http://thegreatestrivalryinsports.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://sterlitamak.ru/bitrix/redirect.php?event1=bnr_vitrina&event2=67084&event3=&goto=https://onlinecasinodd.com \nhttp://www.northlandsensoryinsights.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://flexpowerone.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://rcuniversity.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.on-siteresponse.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://yellowpagespro.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.backbytes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.hampelmail.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://magazinereps.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.friends-project.de/wbblite/thread.php?goto=onlinecasinodd.com \nhttp://www.leisureolympics.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://summitco.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://rivervalleyopenhouses.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://likeaprice.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://track.efiliacao.com.br/servlet/effi.redir?id_compteur=11710603&url=https://onlinecasinodd.com/   http://97a.hungerbanquet.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://charmedivino.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://vinthropology.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.conanexiles.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.ksmsw.com/index.php?c=reg&&referer=https://onlinecasinodd.com  http://architecturalwooddoors.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://aarpinsurence.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://forexdengi.com/threads/43096-galleass-capital?goto=onlinecasinodd.com  http://technoengineer.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://members.mijente.net/r?u=https://onlinecasinodd.com  http://zenithsystems.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://lexingtonelife.mobi/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cignatureleasing.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://bestitched.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ehobs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cognitonyc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://r.app.xiaomi.com/login?referer=https://onlinecasinodd.com  http://www.caldwelldifilippos.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://143guys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://2p2.undclubs.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://perceptiveinvesting.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.boxeri.ackovosrot.cz/redirect.php?url=https://onlinecasinodd.com \nhttp://www.adeptera.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://vision-star.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.swimbaitnation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://oprahcruisecenter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.msighe.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://clearwaterchildrens.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ganleyapp.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://chemistryonline.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://vlaanderen.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttps://farreroboom.ml/viewtopic.php?pid=5684#p5684\nhttps://coinping.co/btc/viewtopic.php?pid=178193#p178193\nhttp://slpsfd.org/forum/index.php?topic=27646.new#new\nhttp://community.alahlyegypt.com/forum/main-forum/139579-graduation-yearbook-sayings\nhttp://certare.pl/forum/viewtopic.php?f=36&t=243118&p=423091#p423091\n", "language": "Lisp", "metadata": {"date": 1549114217, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s869398271.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s869398271", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.tropicalcocktails.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ei-santГ©.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.amestana.lt/url.php?url=https://onlinecasinodd.com   http://fran-chocolate.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://weatherisfun.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://disabilities-law.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.easttexansforliberty.com/r?u=https://onlinecasinodd.com  https://soaptv.me/engine/go.php?url=onlinecasinodd.com   http://www.laureloak.com/default.aspx?p=TrackHyperlink&url=https://onlinecasinodd.com \nhttp://asspros.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tuttoeros.e-z-go.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://x1x.click-chann.com/link.php?url=https://onlinecasinodd.com   http://yc.xinshizaixian.com/index.php?g=Appoint&c=Changecity&a=go&city=xsbn&referer=https://onlinecasinodd.com  http://miopportunity.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.robbinsresearchinternational.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://maps.google.dz/url?q=https://onlinecasinodd.com  http://slightly-bigger.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://fromthelens.ca/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://141007426.r.bat.bing.com/?ld=d3R1Cxl5UR-Fhgq_yDSg5pITVUCUxLXUhnd5fEnTZjjstJR6NtVdcA9Fqn89yfATlXjdajVJkjYQrQcCcZadYd-TpU9EIGhvlfh4hvbn8shtFvajtoQY8SF1UWV_9xwicg4zQUYA_e7sCsIGXBxYRsBd4B5dEmRO3C3Wn4t-NYO6f42DbS&u=https://onlinecasinodd.com  http://reeboksportsclub.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://asgrandnord.e-monsite.com/liens/do/redirect/?url=https://onlinecasinodd.com   http://clara-indiana.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pottypress.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.heartsrizing.com/cgi/mt/mt4i.cgi?id=7&mode=redirect&no=90&ref_eid=1203&url=https://onlinecasinodd.com  http://ashburndogpark.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://cletheatre.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://tfccsr.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://rometers.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://frackfreeplanet.com/c?u=https://onlinecasinodd.com   http://tessenderlotrading.cn/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://courtneyblackman.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.urban-offroad.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://m.greenchoicecarpet.com/?url=https://onlinecasinodd.com  http://totaralms.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rasot.gov.ua/bitrix/rk.php?id=21&event1=banner&event2=click&event3=1+%2F+%5B21%5D+%5BPARTNERS_B%5D+&goto=https://onlinecasinodd.com   http://www.michaelpalmerbooks.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://lsinternal.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dnepropetrovsk.restoranchik.com.ua/bitrix/redirect.php?event1=rest_out&event2=Array&event3=%CF%E0%ED%EE%F0%E0%EC%E0&goto=https://onlinecasinodd.com   https://www.ruimtevlaanderen.be/LinkClick.aspx?link=https://onlinecasinodd.com   http://mouseembryonicstemcellmedia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.novalogic.com/remote.asp?NLink=https://onlinecasinodd.com   http://boycott-this.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.azcourts.gov/LinkClick.aspx?link=https://onlinecasinodd.com  http://thegreatestrivalryinsports.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://sterlitamak.ru/bitrix/redirect.php?event1=bnr_vitrina&event2=67084&event3=&goto=https://onlinecasinodd.com \nhttp://www.northlandsensoryinsights.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://flexpowerone.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://rcuniversity.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.on-siteresponse.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://yellowpagespro.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.backbytes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.hampelmail.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://magazinereps.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.friends-project.de/wbblite/thread.php?goto=onlinecasinodd.com \nhttp://www.leisureolympics.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://summitco.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://rivervalleyopenhouses.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://likeaprice.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://track.efiliacao.com.br/servlet/effi.redir?id_compteur=11710603&url=https://onlinecasinodd.com/   http://97a.hungerbanquet.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://charmedivino.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://vinthropology.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.conanexiles.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.ksmsw.com/index.php?c=reg&&referer=https://onlinecasinodd.com  http://architecturalwooddoors.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://aarpinsurence.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://forexdengi.com/threads/43096-galleass-capital?goto=onlinecasinodd.com  http://technoengineer.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://members.mijente.net/r?u=https://onlinecasinodd.com  http://zenithsystems.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://lexingtonelife.mobi/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cignatureleasing.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://bestitched.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ehobs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cognitonyc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://r.app.xiaomi.com/login?referer=https://onlinecasinodd.com  http://www.caldwelldifilippos.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://143guys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://2p2.undclubs.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://perceptiveinvesting.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.boxeri.ackovosrot.cz/redirect.php?url=https://onlinecasinodd.com \nhttp://www.adeptera.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://vision-star.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.swimbaitnation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://oprahcruisecenter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.msighe.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://clearwaterchildrens.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ganleyapp.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://chemistryonline.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://vlaanderen.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttps://farreroboom.ml/viewtopic.php?pid=5684#p5684\nhttps://coinping.co/btc/viewtopic.php?pid=178193#p178193\nhttp://slpsfd.org/forum/index.php?topic=27646.new#new\nhttp://community.alahlyegypt.com/forum/main-forum/139579-graduation-yearbook-sayings\nhttp://certare.pl/forum/viewtopic.php?f=36&t=243118&p=423091#p423091\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7904, "cpu_time_ms": 98, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s068315292", "group_id": "codeNet:p03941", "input_text": "http://goli-zk.blogsky.com/dailylink/?go=https://onlinecasinodd.com  http://wnovaklaw.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://xqw.namesunlimited.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://imhoffco.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://goldmelt.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://fashionkidsonline.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.boyer-centers.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://flinttough.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://head-lice.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://vestarpropertymanagement.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sjcsvc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://wina-day.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://college-jewelry.com/go?https://onlinecasinodd.com  http://m-web-test.jword.jp/redirect/?cat=new_entame&url=https://onlinecasinodd.com   http://multidesk.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://clarkthomas.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.zamendo.com/guestbook/go.php?url=https://onlinecasinodd.com   http://kotakmakan.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://creditreport411.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://greenray.hop.ru/go.php?go=https://onlinecasinodd.com   http://floridacaregiver.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://pixel.nascimpact.com/go.php?url=https://onlinecasinodd.com  http://yomi.mobi/jump/2/onlinecasinodd.com/   http://www.247pantyhose.com/cgi-bin/atx/out.cgi?id=241&tag=perm&trade=https://onlinecasinodd.com  http://michalovskespravy.sk/url.php?adresa=https://onlinecasinodd.com  http://ups-notice.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://dstats.net/fwd.php?url=https://onlinecasinodd.com \nhttp://www.josepi.com/siteanalyzer/redirect.php?url=https://onlinecasinodd.com  http://urathletics.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.xoxohth.com/go.php?url=https://onlinecasinodd.com   http://karlboustany.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nnf.bulbtrack.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://zgx.gametowne.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://beerinthelastfrontier.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://justbusinessinsurance.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://blog.isoyu.com/go.php?url=https://onlinecasinodd.com \nhttp://downtownhoustonliving.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.seniorletters.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://k81.shaiyo-aa.com/phpinfo.php?a<>=<a+href=https://onlinecasinodd.com   http://ibansearch.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.limousinesofnevada.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://stop-list.info/go?http://mc.mos.ru/bitrix/rk.php?goto=https://onlinecasinodd.com  http://myhubbmarketplace.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jckevents.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hiredgoon.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://www.xunmeng.wang/wp-content/themes/begin/inc/go.php?url=https://onlinecasinodd.com  http://www.fu-tsuma.com/s/click.php?tcode=00010746&url=https://onlinecasinodd.com   http://justforparts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://portion-tech.com/www/twosc_portion-tech/redirect.php?action=url&goto=onlinecasinodd.com  http://commercialwireshelving.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://westevents.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://cutiesfromcalifornia.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://doudouworld.e-monsite.com/liens/do/redirect/?url=https://onlinecasinodd.com   http://www.warin.ac.th/guestbook/go.php?url=https://onlinecasinodd.com \nhttp://labeirut.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://industrialproducthq.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://stu.totaltransformation.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://shortseed.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.china-niche.com/zcljm/webCompany.php?arg=10058751&style=10&language=cn&lytype=0&charset=gbk&kflist=off&kf=836113744@qq.com&zdkf_type=1&referer=https://onlinecasinodd.com   https://sanisilesia.pl/redirect.php?action=url&goto=https://onlinecasinodd.com  http://computerdentalnetworks.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://marksmansenterprise.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://dentalsystemichealth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://aebackusmuseum.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://filequick.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.burgiengineers.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://poshpets.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://u4u.njelite.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.lalettredumusicien.fr/newsletter/redir.php?idn=46&url=https://onlinecasinodd.com  http://equsa.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://etui.valeroportarthur.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://wrightmedical.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://woh.ru/forum/%D0%B2%D1%81%D0%B5%D0%BB%D0%B5%D0%BD%D0%BD%D0%B0%D1%8F-warcraft/%D0%B0%D1%80%D1%85%D0%B8%D0%B2-world-of-warcraft/%D0%BE%D0%B1%D1%81%D1%83%D0%B6%D0%B4%D0%B5%D0%BD%D0%B8%D0%B5-%D0%B8-%D0%BE%D0%BF%D1%80%D0%BE%D1%81%D1%8B/39500-%D0%B2%D0%BE%D0%BF%D1%80%D0%BE%D1%81-%D0%BE-%D0%B3%D0%B8%D0%BB%D1%8C%D0%B4%D0%B8%D0%B8?goto=onlinecasinodd.com  http://justnatural.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://express-k.kz/bitrix/rk.php?id=6&site_id=s1&event1=banner&event2=click&event3=1+/+<>]+<MAIN>LIFE]+Конкурс+детских+рисунков&goto=https://onlinecasinodd.com   http://sleepchallenge.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mua2017.info/go/3/240219?url=https://onlinecasinodd.com   http://yourreadingsolution.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://boogiesglassbottomboat.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://donateyourstocks.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bh.qicaichuxing.com/index.php?g=Appoint&c=Changecity&a=go&city=zz&referer=https://onlinecasinodd.com \nhttp://flowershopschile.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.germanvtol.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.rusdoc.ru/go.php?https://onlinecasinodd.com   http://mailix.co.il/goto.php?d3456SDFgfgh56HRe4=765&fgh456fhFe45yfg4Fd=66681&G3e56g9FJT45lgsdf95k=https://onlinecasinodd.com  http://californiacommunityfoundation.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://yourindustrysolution.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://naturalatlanticcoast.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://a72.realitygame.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://throughthepicturewindow.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttps://truthinreality.com/2015/09/15/prayer-for-breaking-the-powers-of-witchcraft/\nhttp://danskere.jean.dk/smf/index.php?topic=87417.new#new\nhttp://www.online-einsaetze.de/forum/showthread.php?tid=1243791\nhttp://www.luxuriousgaming.com/fourms/showthread.php?tid=20541\nhttp://xn--80aihgzecn.xn--p1ai/index.php?/topic/185120-buy-pyridoxine/\n", "language": "Lisp", "metadata": {"date": 1549102265, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s068315292.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s068315292", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://goli-zk.blogsky.com/dailylink/?go=https://onlinecasinodd.com  http://wnovaklaw.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://xqw.namesunlimited.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://imhoffco.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://goldmelt.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://fashionkidsonline.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.boyer-centers.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://flinttough.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://head-lice.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://vestarpropertymanagement.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sjcsvc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://wina-day.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://college-jewelry.com/go?https://onlinecasinodd.com  http://m-web-test.jword.jp/redirect/?cat=new_entame&url=https://onlinecasinodd.com   http://multidesk.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://clarkthomas.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.zamendo.com/guestbook/go.php?url=https://onlinecasinodd.com   http://kotakmakan.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://creditreport411.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://greenray.hop.ru/go.php?go=https://onlinecasinodd.com   http://floridacaregiver.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://pixel.nascimpact.com/go.php?url=https://onlinecasinodd.com  http://yomi.mobi/jump/2/onlinecasinodd.com/   http://www.247pantyhose.com/cgi-bin/atx/out.cgi?id=241&tag=perm&trade=https://onlinecasinodd.com  http://michalovskespravy.sk/url.php?adresa=https://onlinecasinodd.com  http://ups-notice.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://dstats.net/fwd.php?url=https://onlinecasinodd.com \nhttp://www.josepi.com/siteanalyzer/redirect.php?url=https://onlinecasinodd.com  http://urathletics.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.xoxohth.com/go.php?url=https://onlinecasinodd.com   http://karlboustany.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nnf.bulbtrack.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://zgx.gametowne.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://beerinthelastfrontier.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://justbusinessinsurance.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://blog.isoyu.com/go.php?url=https://onlinecasinodd.com \nhttp://downtownhoustonliving.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.seniorletters.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://k81.shaiyo-aa.com/phpinfo.php?a<>=<a+href=https://onlinecasinodd.com   http://ibansearch.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.limousinesofnevada.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://stop-list.info/go?http://mc.mos.ru/bitrix/rk.php?goto=https://onlinecasinodd.com  http://myhubbmarketplace.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jckevents.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hiredgoon.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://www.xunmeng.wang/wp-content/themes/begin/inc/go.php?url=https://onlinecasinodd.com  http://www.fu-tsuma.com/s/click.php?tcode=00010746&url=https://onlinecasinodd.com   http://justforparts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://portion-tech.com/www/twosc_portion-tech/redirect.php?action=url&goto=onlinecasinodd.com  http://commercialwireshelving.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://westevents.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://cutiesfromcalifornia.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://doudouworld.e-monsite.com/liens/do/redirect/?url=https://onlinecasinodd.com   http://www.warin.ac.th/guestbook/go.php?url=https://onlinecasinodd.com \nhttp://labeirut.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://industrialproducthq.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://stu.totaltransformation.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://shortseed.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.china-niche.com/zcljm/webCompany.php?arg=10058751&style=10&language=cn&lytype=0&charset=gbk&kflist=off&kf=836113744@qq.com&zdkf_type=1&referer=https://onlinecasinodd.com   https://sanisilesia.pl/redirect.php?action=url&goto=https://onlinecasinodd.com  http://computerdentalnetworks.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://marksmansenterprise.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://dentalsystemichealth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://aebackusmuseum.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://filequick.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.burgiengineers.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://poshpets.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://u4u.njelite.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.lalettredumusicien.fr/newsletter/redir.php?idn=46&url=https://onlinecasinodd.com  http://equsa.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://etui.valeroportarthur.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://wrightmedical.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://woh.ru/forum/%D0%B2%D1%81%D0%B5%D0%BB%D0%B5%D0%BD%D0%BD%D0%B0%D1%8F-warcraft/%D0%B0%D1%80%D1%85%D0%B8%D0%B2-world-of-warcraft/%D0%BE%D0%B1%D1%81%D1%83%D0%B6%D0%B4%D0%B5%D0%BD%D0%B8%D0%B5-%D0%B8-%D0%BE%D0%BF%D1%80%D0%BE%D1%81%D1%8B/39500-%D0%B2%D0%BE%D0%BF%D1%80%D0%BE%D1%81-%D0%BE-%D0%B3%D0%B8%D0%BB%D1%8C%D0%B4%D0%B8%D0%B8?goto=onlinecasinodd.com  http://justnatural.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://express-k.kz/bitrix/rk.php?id=6&site_id=s1&event1=banner&event2=click&event3=1+/+<>]+<MAIN>LIFE]+Конкурс+детских+рисунков&goto=https://onlinecasinodd.com   http://sleepchallenge.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mua2017.info/go/3/240219?url=https://onlinecasinodd.com   http://yourreadingsolution.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://boogiesglassbottomboat.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://donateyourstocks.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bh.qicaichuxing.com/index.php?g=Appoint&c=Changecity&a=go&city=zz&referer=https://onlinecasinodd.com \nhttp://flowershopschile.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.germanvtol.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.rusdoc.ru/go.php?https://onlinecasinodd.com   http://mailix.co.il/goto.php?d3456SDFgfgh56HRe4=765&fgh456fhFe45yfg4Fd=66681&G3e56g9FJT45lgsdf95k=https://onlinecasinodd.com  http://californiacommunityfoundation.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://yourindustrysolution.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://naturalatlanticcoast.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://a72.realitygame.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://throughthepicturewindow.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttps://truthinreality.com/2015/09/15/prayer-for-breaking-the-powers-of-witchcraft/\nhttp://danskere.jean.dk/smf/index.php?topic=87417.new#new\nhttp://www.online-einsaetze.de/forum/showthread.php?tid=1243791\nhttp://www.luxuriousgaming.com/fourms/showthread.php?tid=20541\nhttp://xn--80aihgzecn.xn--p1ai/index.php?/topic/185120-buy-pyridoxine/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8114, "cpu_time_ms": 94, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s066171309", "group_id": "codeNet:p03941", "input_text": "http://www.euro-tails.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://740doctors.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.sd102.net/LinkClick.aspx?link=https://onlinecasinodd.com   http://www.coongames.com/out.php?link=https://onlinecasinodd.com  http://frostys5k.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.pearsoned.co.uk/Bookshop/redirect.asp?u=https://onlinecasinodd.com  http://hesnoman.com/vb/showthread.php?goto=onlinecasinodd.com  https://www.dedies-board.de/wbb2/thread.php?goto=onlinecasinodd.com   http://nationstarmortgageloan.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://flatmap.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://postureminder.co.uk/challenge/Default.aspx?uid=0779df1d-0a5f-4f0b-9b64-6b767128de6c&url=https://onlinecasinodd.com   http://drschulz.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.little500.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mercuryinflatables.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://learn101.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dullesairport.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mandingomovies.com/cgi-bin/atc/out.cgi?id=24&u=https://onlinecasinodd.com   http://motherpromo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://stantomlinson.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://energycommander.us/__media__/js/trademark.php?d=onlinecasinodd.com   http://www.dfghj.xoxohth.com/go.php?url=https://onlinecasinodd.com   http://www.morgand.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://selfservicenow.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.pchtg.ca/inventory/specsheet/emailfriend.aspx?subject=2014%20Volvo%20VNL%20630&url=https://onlinecasinodd.com  http://thearizonaprocessserver.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rollouts.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://thorlodiabetic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://tumpety.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.saintandrewsshottery.org/goto-link.php?link_id=10&url=https://onlinecasinodd.com   http://divedepotcorp.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.fsbofinder.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rwrproducts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gu-pdnp.narod.ru/go?https://onlinecasinodd.com  https://lietuviainorvegijoje.lt/scripts/redirect.php?url=https://onlinecasinodd.com  http://ce-cs.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://signaltheorie.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://forbesglobalinstittue.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://4gig.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.shalomworld.org/auth/change_region/3/?url=https://onlinecasinodd.com   http://engine.pitchengine.com/v1/util/link?i=eyJjYXRlZ29yeSI6IlBpdGNoTGluayIsImFjdGlvbiI6Ii92MS9waXRjaGVzL2IxNjI1NWNmLWY1NjgtNGZlMC1hNTVmLWQ1Y2ExM2U5MjM1NSIsInZhbHVlIjoiaHR0cDovL3d3dy5vdXRlcmJpa2UuY29tLyJ9&l=https://onlinecasinodd.com  http://pasttimesports.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://entangledsystems.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://mail.freesp.ru/redirect.php?url=onlinecasinodd.com  http://www.prostatakrebs-bezwingen.de/redirect.php?url=https://onlinecasinodd.com   http://healthquotes.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.pekids.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://wellfleet250.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://vexxiv.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://goodworkcoop.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.annuaire37.fr/index.php?page=redirect&v1=https://onlinecasinodd.com   http://jb-motorsports.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://durhamaddictiontreatment.com/redir.php?url=https://onlinecasinodd.com  http://www.simsen.com/__media__/js/trademark.php?d=onlinecasinodd.com   http://net2vox.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://marketbiodiesel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nationstarjumboloan.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.arkh-edu.ru/bitrix/rk.php?id=200&event1=banner&event2=click&event3=1+%2F+%5B200%5D+%5Bportal_slider%5D+%C2%F1%E5%F0%EE%F1%F1%E8%E9%F1%EA%E0%FF+%EE%EB%E8%EC%EF%E8%E0%E4%E0+%F8%EA%EE%EB%FC%ED%E8%EA%EE%E2&goto=https://onlinecasinodd.com   http://kashiwa.info/access/jump.cgi?class=B&num=8567&url=https://onlinecasinodd.com  http://feetpodiatry.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://dermpath.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://labs.eprofeel.com/redirect.php?id_dossier=50&?s=https://onlinecasinodd.com  http://kuivreartisanal.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://goalsguycoaching.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://apkahn.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://maharajaofindia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://naax.welco.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://satellitefirst.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://avdelaero.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://pain-freeperiods.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://65112106.r.msn.com/?ld=d3fGZZzEVOlmSaOTvvHpedszVUCUxDTVXw-J62N_s9QJiUmZWrRg_tmdgX1cOr-QhfSLlZ2WiGie3CPSYx_Kkc6uSYCbH866CYx9ClU201f7raRPBYQEYrfvRFV19AGO2wucv24vXYtrmAE9sfFGRLdNAaWfo&u=https://onlinecasinodd.com  http://forum.betonbasket.ru/go?https://onlinecasinodd.com   http://joebeartoys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://guestvu.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://urghamusicwar.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ynr.controlledrelease.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cqhlj.com/redir.php?url=https://onlinecasinodd.com  http://getdefensivevideo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.fernandosalinas.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.metrx.com.cn/link.php?url=https://onlinecasinodd.com  http://www.suffolkcountyny.gov/LinkClick.aspx?link=https://onlinecasinodd.com   http://uniqholidays.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://jir.jcoats.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://starpayments.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.tamillc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.aycc.org.au/r?u=https://onlinecasinodd.com  http://web.xcoid.com/redirect.php?url=https://onlinecasinodd.com   http://burkspanthers.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://roombond.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.holwegner.com/go.php??s=https://onlinecasinodd.com   http://mdhonours.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://certare.pl/forum/viewtopic.php?f=36&t=243118&p=419304#p419304\nhttp://taiyi.one/viewtopic.php?pid=347417#p347417\nhttp://forum.tompool.org/viewtopic.php?f=2&t=273440\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php%20%20%20%20%20%20%20%20%20%20\nhttps://forums.terraworldz.com/index.php?topic=52134.new#new\n", "language": "Lisp", "metadata": {"date": 1549084374, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s066171309.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s066171309", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.euro-tails.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://740doctors.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.sd102.net/LinkClick.aspx?link=https://onlinecasinodd.com   http://www.coongames.com/out.php?link=https://onlinecasinodd.com  http://frostys5k.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.pearsoned.co.uk/Bookshop/redirect.asp?u=https://onlinecasinodd.com  http://hesnoman.com/vb/showthread.php?goto=onlinecasinodd.com  https://www.dedies-board.de/wbb2/thread.php?goto=onlinecasinodd.com   http://nationstarmortgageloan.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://flatmap.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://postureminder.co.uk/challenge/Default.aspx?uid=0779df1d-0a5f-4f0b-9b64-6b767128de6c&url=https://onlinecasinodd.com   http://drschulz.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.little500.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mercuryinflatables.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://learn101.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dullesairport.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mandingomovies.com/cgi-bin/atc/out.cgi?id=24&u=https://onlinecasinodd.com   http://motherpromo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://stantomlinson.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://energycommander.us/__media__/js/trademark.php?d=onlinecasinodd.com   http://www.dfghj.xoxohth.com/go.php?url=https://onlinecasinodd.com   http://www.morgand.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://selfservicenow.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.pchtg.ca/inventory/specsheet/emailfriend.aspx?subject=2014%20Volvo%20VNL%20630&url=https://onlinecasinodd.com  http://thearizonaprocessserver.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rollouts.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://thorlodiabetic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://tumpety.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.saintandrewsshottery.org/goto-link.php?link_id=10&url=https://onlinecasinodd.com   http://divedepotcorp.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.fsbofinder.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rwrproducts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gu-pdnp.narod.ru/go?https://onlinecasinodd.com  https://lietuviainorvegijoje.lt/scripts/redirect.php?url=https://onlinecasinodd.com  http://ce-cs.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://signaltheorie.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://forbesglobalinstittue.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://4gig.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.shalomworld.org/auth/change_region/3/?url=https://onlinecasinodd.com   http://engine.pitchengine.com/v1/util/link?i=eyJjYXRlZ29yeSI6IlBpdGNoTGluayIsImFjdGlvbiI6Ii92MS9waXRjaGVzL2IxNjI1NWNmLWY1NjgtNGZlMC1hNTVmLWQ1Y2ExM2U5MjM1NSIsInZhbHVlIjoiaHR0cDovL3d3dy5vdXRlcmJpa2UuY29tLyJ9&l=https://onlinecasinodd.com  http://pasttimesports.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://entangledsystems.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://mail.freesp.ru/redirect.php?url=onlinecasinodd.com  http://www.prostatakrebs-bezwingen.de/redirect.php?url=https://onlinecasinodd.com   http://healthquotes.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.pekids.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://wellfleet250.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://vexxiv.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://goodworkcoop.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.annuaire37.fr/index.php?page=redirect&v1=https://onlinecasinodd.com   http://jb-motorsports.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://durhamaddictiontreatment.com/redir.php?url=https://onlinecasinodd.com  http://www.simsen.com/__media__/js/trademark.php?d=onlinecasinodd.com   http://net2vox.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://marketbiodiesel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nationstarjumboloan.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.arkh-edu.ru/bitrix/rk.php?id=200&event1=banner&event2=click&event3=1+%2F+%5B200%5D+%5Bportal_slider%5D+%C2%F1%E5%F0%EE%F1%F1%E8%E9%F1%EA%E0%FF+%EE%EB%E8%EC%EF%E8%E0%E4%E0+%F8%EA%EE%EB%FC%ED%E8%EA%EE%E2&goto=https://onlinecasinodd.com   http://kashiwa.info/access/jump.cgi?class=B&num=8567&url=https://onlinecasinodd.com  http://feetpodiatry.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://dermpath.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://labs.eprofeel.com/redirect.php?id_dossier=50&?s=https://onlinecasinodd.com  http://kuivreartisanal.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://goalsguycoaching.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://apkahn.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://maharajaofindia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://naax.welco.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://satellitefirst.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://avdelaero.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://pain-freeperiods.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://65112106.r.msn.com/?ld=d3fGZZzEVOlmSaOTvvHpedszVUCUxDTVXw-J62N_s9QJiUmZWrRg_tmdgX1cOr-QhfSLlZ2WiGie3CPSYx_Kkc6uSYCbH866CYx9ClU201f7raRPBYQEYrfvRFV19AGO2wucv24vXYtrmAE9sfFGRLdNAaWfo&u=https://onlinecasinodd.com  http://forum.betonbasket.ru/go?https://onlinecasinodd.com   http://joebeartoys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://guestvu.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://urghamusicwar.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ynr.controlledrelease.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cqhlj.com/redir.php?url=https://onlinecasinodd.com  http://getdefensivevideo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.fernandosalinas.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.metrx.com.cn/link.php?url=https://onlinecasinodd.com  http://www.suffolkcountyny.gov/LinkClick.aspx?link=https://onlinecasinodd.com   http://uniqholidays.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://jir.jcoats.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://starpayments.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.tamillc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.aycc.org.au/r?u=https://onlinecasinodd.com  http://web.xcoid.com/redirect.php?url=https://onlinecasinodd.com   http://burkspanthers.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://roombond.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.holwegner.com/go.php??s=https://onlinecasinodd.com   http://mdhonours.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://certare.pl/forum/viewtopic.php?f=36&t=243118&p=419304#p419304\nhttp://taiyi.one/viewtopic.php?pid=347417#p347417\nhttp://forum.tompool.org/viewtopic.php?f=2&t=273440\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php%20%20%20%20%20%20%20%20%20%20\nhttps://forums.terraworldz.com/index.php?topic=52134.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8385, "cpu_time_ms": 108, "memory_kb": 9188}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s353259752", "group_id": "codeNet:p03941", "input_text": "http://vv1.aisha.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mightycomputers.com.au/redirect.php?id=https://onlinecasinodd.com   http://foamcore.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://floridafertilityinstitute.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://seventyvestry.nyc/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ndo.lg.ua/ru/redirect?url=https://onlinecasinodd.com  http://kcmetro.com/localnews.php?url=https://onlinecasinodd.com  https://www.jigu.nz/go?link=https://onlinecasinodd.com   http://www.focusrh.com/_PLUG/formaguide/tracker.php?id=123675&tid=14&lien=https://onlinecasinodd.com \nhttp://www.m.antiddos.eu/ru/users/login/?referer=https://onlinecasinodd.com  http://monpoint.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://needmailing.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nicoletadvisory.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://inspectorseeek.com/go.php?id=12983&to=https://onlinecasinodd.com   http://foroseomarketingwebstravel.semanalnews.com/forum/viewthread.php?tid=72&goto=onlinecasinodd.com  http://coversexpert.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://crr.nsisas.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://billetico.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://odysseyamericareinsurance.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://johnvanzandt.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kos.bvmanagement.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://realtobaccopleasure.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://69sexgirls.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.6park.pw/redirect.php?fid=10&tid=812021&goto=onlinecasinodd.com  http://www.navi-suke.jp/link.html?url=https://onlinecasinodd.com  http://www.internout.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://filecollaboration.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://nesportsmuseum.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://aquiliniconstruction.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bellevueoffice.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nataliesmith.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ty24.ru/goto/?url=https://onlinecasinodd.com   http://necam.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pqm.advancedwatersystems.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://palmandcrescent.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://events.deloitte.cz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.ramsdelllaw.com/dnn/LinkClick.aspx?link=https://onlinecasinodd.com  https://medagog.com/link.php?url=https://onlinecasinodd.com   http://www.getlinkinfo.com/info?link=https://onlinecasinodd.com/   http://carrocampi.com.br/banner/click/?id=3739&url=https://onlinecasinodd.com  http://www.stoka-kiel.de/redirect.php?url=onlinecasinodd.com   http://winningkid.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.collectiveshout.org/r?u=https://onlinecasinodd.com  http://www.crown-chicago.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.blueslinks.nl/php/redirect.php?linkid=1924&url=onlinecasinodd.com \nhttp://ayobetting.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://floridaindianrivergrove.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://theycancometodinner.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://jenlewinart.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rootscoffee.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ww.cullenthomas.com/guestbook/go.php?url=https://onlinecasinodd.com  http://thejacksonhewitt.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ngrp.net/forum/redirect/?url=https://onlinecasinodd.com   http://hyannisporthomes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://contemporarywriters.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://youneedabishop.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://salonboothrental.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://burca.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.roofur.com/goto.php?url=onlinecasinodd.com   https://www.minedeed.com/wp-content/themes/begin/begin/inc/go.php?url=https://onlinecasinodd.com  http://starstechtest.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://allabouttunes.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://blog.faaoo.cn/go/?url=https://onlinecasinodd.com \nhttp://oregondirectvaloans.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mrstair.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://waikikidss.tk/index.asp?mod=28&paso=2&goto=https://onlinecasinodd.com   http://aimfunds.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.bigspring.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://whymesherryshouse.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.ainll.com/wp-content/themes/Begin/inc/go.php?url=https://onlinecasinodd.com  http://www.rbp.ru/go.php?https://onlinecasinodd.com   http://thombrown.eu/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://adianareversal.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ljyb.org/Goto.asp?url=https://onlinecasinodd.com   http://www.castpac.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://jenekrause.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://kriswood.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://aqf.justforyougiftbook.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://meidu.xbzl.org/goto.php?u=onlinecasinodd.com  http://www.svoong.mordv.com/go.php?url=onlinecasinodd.com   http://hottopicoutlet.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://xn----8sbaai9blupdjo.xn--p1ai/bitrix/rk.php?event1=file&event2=download&goto=onlinecasinodd.com  http://mahfund.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://appsgid.com/system/address_control/redirect.php?id=198&link=onlinecasinodd.com   http://www.trimarinegroup.com/search/index.php?a=trackClick&fsid=91&url=https://onlinecasinodd.com  http://www.poofu.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://afmheatsheets.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://opencourses.aueb.gr/modules/link/go.php?course=SES100&id=68&url=https://onlinecasinodd.com  http://www.languageisavirus.com/articles/book-reviews/go.php?url=https://onlinecasinodd.com   http://plusoffice.company/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://lessthan6.club/index.php?topic=1306.new#new\nhttp://alanlauwatch.com/forum/viewtopic.php?f=2&t=165632\nhttp://www.piterenka.ru/forum/viewtopic.php?f=4&t=34553\nhttp://vonwolkenstein.ano-host.co.in/vb4-neu/showthread.php?482136-garces-high-school-bakersfield&p=669323#post669323\nhttp://forum.italiadecals.com/viewtopic.php?f=2&t=549101\n", "language": "Lisp", "metadata": {"date": 1549060677, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s353259752.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s353259752", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://vv1.aisha.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mightycomputers.com.au/redirect.php?id=https://onlinecasinodd.com   http://foamcore.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://floridafertilityinstitute.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://seventyvestry.nyc/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ndo.lg.ua/ru/redirect?url=https://onlinecasinodd.com  http://kcmetro.com/localnews.php?url=https://onlinecasinodd.com  https://www.jigu.nz/go?link=https://onlinecasinodd.com   http://www.focusrh.com/_PLUG/formaguide/tracker.php?id=123675&tid=14&lien=https://onlinecasinodd.com \nhttp://www.m.antiddos.eu/ru/users/login/?referer=https://onlinecasinodd.com  http://monpoint.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://needmailing.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nicoletadvisory.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://inspectorseeek.com/go.php?id=12983&to=https://onlinecasinodd.com   http://foroseomarketingwebstravel.semanalnews.com/forum/viewthread.php?tid=72&goto=onlinecasinodd.com  http://coversexpert.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://crr.nsisas.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://billetico.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://odysseyamericareinsurance.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://johnvanzandt.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kos.bvmanagement.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://realtobaccopleasure.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://69sexgirls.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.6park.pw/redirect.php?fid=10&tid=812021&goto=onlinecasinodd.com  http://www.navi-suke.jp/link.html?url=https://onlinecasinodd.com  http://www.internout.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://filecollaboration.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://nesportsmuseum.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://aquiliniconstruction.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bellevueoffice.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nataliesmith.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ty24.ru/goto/?url=https://onlinecasinodd.com   http://necam.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pqm.advancedwatersystems.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://palmandcrescent.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://events.deloitte.cz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.ramsdelllaw.com/dnn/LinkClick.aspx?link=https://onlinecasinodd.com  https://medagog.com/link.php?url=https://onlinecasinodd.com   http://www.getlinkinfo.com/info?link=https://onlinecasinodd.com/   http://carrocampi.com.br/banner/click/?id=3739&url=https://onlinecasinodd.com  http://www.stoka-kiel.de/redirect.php?url=onlinecasinodd.com   http://winningkid.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.collectiveshout.org/r?u=https://onlinecasinodd.com  http://www.crown-chicago.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.blueslinks.nl/php/redirect.php?linkid=1924&url=onlinecasinodd.com \nhttp://ayobetting.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://floridaindianrivergrove.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://theycancometodinner.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://jenlewinart.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rootscoffee.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ww.cullenthomas.com/guestbook/go.php?url=https://onlinecasinodd.com  http://thejacksonhewitt.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ngrp.net/forum/redirect/?url=https://onlinecasinodd.com   http://hyannisporthomes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://contemporarywriters.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://youneedabishop.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://salonboothrental.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://burca.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.roofur.com/goto.php?url=onlinecasinodd.com   https://www.minedeed.com/wp-content/themes/begin/begin/inc/go.php?url=https://onlinecasinodd.com  http://starstechtest.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://allabouttunes.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://blog.faaoo.cn/go/?url=https://onlinecasinodd.com \nhttp://oregondirectvaloans.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mrstair.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://waikikidss.tk/index.asp?mod=28&paso=2&goto=https://onlinecasinodd.com   http://aimfunds.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.bigspring.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://whymesherryshouse.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.ainll.com/wp-content/themes/Begin/inc/go.php?url=https://onlinecasinodd.com  http://www.rbp.ru/go.php?https://onlinecasinodd.com   http://thombrown.eu/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://adianareversal.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ljyb.org/Goto.asp?url=https://onlinecasinodd.com   http://www.castpac.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://jenekrause.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://kriswood.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://aqf.justforyougiftbook.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://meidu.xbzl.org/goto.php?u=onlinecasinodd.com  http://www.svoong.mordv.com/go.php?url=onlinecasinodd.com   http://hottopicoutlet.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://xn----8sbaai9blupdjo.xn--p1ai/bitrix/rk.php?event1=file&event2=download&goto=onlinecasinodd.com  http://mahfund.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://appsgid.com/system/address_control/redirect.php?id=198&link=onlinecasinodd.com   http://www.trimarinegroup.com/search/index.php?a=trackClick&fsid=91&url=https://onlinecasinodd.com  http://www.poofu.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://afmheatsheets.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://opencourses.aueb.gr/modules/link/go.php?course=SES100&id=68&url=https://onlinecasinodd.com  http://www.languageisavirus.com/articles/book-reviews/go.php?url=https://onlinecasinodd.com   http://plusoffice.company/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://lessthan6.club/index.php?topic=1306.new#new\nhttp://alanlauwatch.com/forum/viewtopic.php?f=2&t=165632\nhttp://www.piterenka.ru/forum/viewtopic.php?f=4&t=34553\nhttp://vonwolkenstein.ano-host.co.in/vb4-neu/showthread.php?482136-garces-high-school-bakersfield&p=669323#post669323\nhttp://forum.italiadecals.com/viewtopic.php?f=2&t=549101\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7419, "cpu_time_ms": 94, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s433869875", "group_id": "codeNet:p03941", "input_text": "http://uvirinc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://ie.fukushima-sumai.com/jump.php?curl=https://onlinecasinodd.com   http://selectafax.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bielkovinovadieta.nuevobancosantafe.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tignon.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://shoa-nurse.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://wisconsinnativeplants.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://biyougeka.esthetic-esthe.com/rank.cgi?mode=link&id=848&url=https://onlinecasinodd.com   http://miners-pool.comedyclips.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.adintrend.com/banner_stat/click.php?banner_name=TopBHL_281113_SS_BTS&url=https://onlinecasinodd.com  http://getedfunding.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.91game.com/go.php?url=https://onlinecasinodd.com   http://oxygenpillow.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dncdirector.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://modabee.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://bk43.ru/links.php?go=https://onlinecasinodd.com  http://www.grassrootseast.org/r?u=https://onlinecasinodd.com   http://ricknelsonthemovie.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://c0.hitta.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://centralpark.ops.org/LinkClick.aspx?link=https://onlinecasinodd.com   http://finalfloor.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://waterbysubscription.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://drrichardhall.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://onenesscanada.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://blp.2seeclear.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://bootikeman.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.islandlaserskincare.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://iorigami.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://elmariachitacoshop.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://tucans.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.qqtxt.com/index.php?m=comment&c=index&a=init&commentid=content_16-2963-1&title=%E5%BE%AE%E4%BF%A1%E7%BB%91QQ%E9%A2%86%E9%9A%8F%E6%9C%BA%E5%A4%A9%E6%95%B0%E8%B6%85%E7%BA%A7%E4%BC%9A%E5%91%98&url=https://onlinecasinodd.com  http://tradeext.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.paginainizio.com/html_iframe/news/rss.php?rssurl=https://onlinecasinodd.com  http://alimama-corp.mobi/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tidallive.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.oneclickonly.de/redirect.php?url=https://onlinecasinodd.com \nhttp://u-pick.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://infodna.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://zzjwfh.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hobogame.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://selfx.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.ich-habe-ein-pferd.com/Inserate/UserEntries.aspx?returnurl=https://onlinecasinodd.com  http://transformationnationonline.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jctcuonline.org/redirect.php?link=https://onlinecasinodd.com   http://mitral221.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.superoffers.com/click/?merchant=TSC+Toys&partner=17&r=https://onlinecasinodd.com  http://inspireos.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://greatwhitemarineservices.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.elcarteltv.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pershingllc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bluefinrestaurant.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://buffalotours.be/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.otto-office.com/de/redirect.obtshop?wkid=BOTGODEYvqhACZnG9McKQfE&url=https://onlinecasinodd.com   http://cobbmountain.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://weiserlock.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tkyf28.com/__media__/js/trademark.php?d=onlinecasinodd.com   http://search.geass.info/rank.cgi?mode=link&id=3154&url=https://onlinecasinodd.com/   http://centraleuropeexperts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://concept-1.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ideasbc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://altapacificbank.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sexydulhan.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://golfsonar.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://ihead.ru.xx3.kz/go.php?url=https://onlinecasinodd.com  http://miniexercise.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nymphomation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://commercialbeveragerefrigerators.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://kaeserblogs.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://piratalondon.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ip-66-51-127-25.tera-byte.com/rotor/link.php?gr=1&id=bb7de8&url=onlinecasinodd.com  http://www.wakqw.com/wp-content/themes/begin5.2/inc/go.php?url=https://onlinecasinodd.com   http://worldoffreesynth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://f1rstclaim.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://miraimedia.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.perfomania.com/default.aspx?control=artist&name=julie_kagan&url=onlinecasinodd.com   http://nucorjfemexico.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nwcenterfoundation.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://alpedhuezbike.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hirgyujto.hu/tart/redirect/2858195?url=https://onlinecasinodd.com  http://www.callcenterclassifieds.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.tiresgames.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://brandenthusiasm.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jiancaopingjiedao.tieba01.com/go.php?https://onlinecasinodd.com   http://plaindealer-sun.com/Redirect.asp?UID=38375680&SubSectionID=85&AdArrayID=86&AdPosition=-1&LinkURL=https://onlinecasinodd.com   http://plugin.mediaget.com/promo/?url=https://onlinecasinodd.com/  http://www.bitsofbuzz.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://disort.ru/bitrix/rk.php?id=14&site_id=s2&event1=banner&event2=click&event3=2+%2F+%5B14%5D+%5BMAIN%5D+%CB%E0%EC%E8%ED%E0%F2+%E0%EA%F6%E8%E8+%E8+%F1%EA%E8%E4%EA%E8&goto=onlinecasinodd.com  http://innovativeoffers.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.mmobid.com/forum/showthread.php?2018-Compra-Galotam-En-Linea&goto=onlinecasinodd.com   http://www.sportsarmory.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttps://www.michiganalliancegroup.com/forum/showthread.php?tid=650837\nhttp://www.theparrotcentre.com/forum/index.php?topic=38916.new#new\nhttps://forexedu.ro/forums/topic/commander-aciclovir-en-ligne-belgique-generique-prix/page/13/#post-90275\nhttps://yancearizona.net/2010/04/17/pendaftaran-wilayah-adat-belum-jelas/\n", "language": "Lisp", "metadata": {"date": 1549023457, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s433869875.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s433869875", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://uvirinc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://ie.fukushima-sumai.com/jump.php?curl=https://onlinecasinodd.com   http://selectafax.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bielkovinovadieta.nuevobancosantafe.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tignon.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://shoa-nurse.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://wisconsinnativeplants.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://biyougeka.esthetic-esthe.com/rank.cgi?mode=link&id=848&url=https://onlinecasinodd.com   http://miners-pool.comedyclips.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.adintrend.com/banner_stat/click.php?banner_name=TopBHL_281113_SS_BTS&url=https://onlinecasinodd.com  http://getedfunding.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.91game.com/go.php?url=https://onlinecasinodd.com   http://oxygenpillow.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dncdirector.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://modabee.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://bk43.ru/links.php?go=https://onlinecasinodd.com  http://www.grassrootseast.org/r?u=https://onlinecasinodd.com   http://ricknelsonthemovie.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://c0.hitta.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://centralpark.ops.org/LinkClick.aspx?link=https://onlinecasinodd.com   http://finalfloor.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://waterbysubscription.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://drrichardhall.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://onenesscanada.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://blp.2seeclear.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://bootikeman.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.islandlaserskincare.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://iorigami.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://elmariachitacoshop.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://tucans.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.qqtxt.com/index.php?m=comment&c=index&a=init&commentid=content_16-2963-1&title=%E5%BE%AE%E4%BF%A1%E7%BB%91QQ%E9%A2%86%E9%9A%8F%E6%9C%BA%E5%A4%A9%E6%95%B0%E8%B6%85%E7%BA%A7%E4%BC%9A%E5%91%98&url=https://onlinecasinodd.com  http://tradeext.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.paginainizio.com/html_iframe/news/rss.php?rssurl=https://onlinecasinodd.com  http://alimama-corp.mobi/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tidallive.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.oneclickonly.de/redirect.php?url=https://onlinecasinodd.com \nhttp://u-pick.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://infodna.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://zzjwfh.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hobogame.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://selfx.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.ich-habe-ein-pferd.com/Inserate/UserEntries.aspx?returnurl=https://onlinecasinodd.com  http://transformationnationonline.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jctcuonline.org/redirect.php?link=https://onlinecasinodd.com   http://mitral221.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.superoffers.com/click/?merchant=TSC+Toys&partner=17&r=https://onlinecasinodd.com  http://inspireos.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://greatwhitemarineservices.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.elcarteltv.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pershingllc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bluefinrestaurant.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://buffalotours.be/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.otto-office.com/de/redirect.obtshop?wkid=BOTGODEYvqhACZnG9McKQfE&url=https://onlinecasinodd.com   http://cobbmountain.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://weiserlock.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tkyf28.com/__media__/js/trademark.php?d=onlinecasinodd.com   http://search.geass.info/rank.cgi?mode=link&id=3154&url=https://onlinecasinodd.com/   http://centraleuropeexperts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://concept-1.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ideasbc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://altapacificbank.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sexydulhan.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://golfsonar.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://ihead.ru.xx3.kz/go.php?url=https://onlinecasinodd.com  http://miniexercise.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nymphomation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://commercialbeveragerefrigerators.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://kaeserblogs.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://piratalondon.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ip-66-51-127-25.tera-byte.com/rotor/link.php?gr=1&id=bb7de8&url=onlinecasinodd.com  http://www.wakqw.com/wp-content/themes/begin5.2/inc/go.php?url=https://onlinecasinodd.com   http://worldoffreesynth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://f1rstclaim.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://miraimedia.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.perfomania.com/default.aspx?control=artist&name=julie_kagan&url=onlinecasinodd.com   http://nucorjfemexico.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nwcenterfoundation.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://alpedhuezbike.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hirgyujto.hu/tart/redirect/2858195?url=https://onlinecasinodd.com  http://www.callcenterclassifieds.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.tiresgames.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://brandenthusiasm.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jiancaopingjiedao.tieba01.com/go.php?https://onlinecasinodd.com   http://plaindealer-sun.com/Redirect.asp?UID=38375680&SubSectionID=85&AdArrayID=86&AdPosition=-1&LinkURL=https://onlinecasinodd.com   http://plugin.mediaget.com/promo/?url=https://onlinecasinodd.com/  http://www.bitsofbuzz.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://disort.ru/bitrix/rk.php?id=14&site_id=s2&event1=banner&event2=click&event3=2+%2F+%5B14%5D+%5BMAIN%5D+%CB%E0%EC%E8%ED%E0%F2+%E0%EA%F6%E8%E8+%E8+%F1%EA%E8%E4%EA%E8&goto=onlinecasinodd.com  http://innovativeoffers.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.mmobid.com/forum/showthread.php?2018-Compra-Galotam-En-Linea&goto=onlinecasinodd.com   http://www.sportsarmory.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttps://www.michiganalliancegroup.com/forum/showthread.php?tid=650837\nhttp://www.theparrotcentre.com/forum/index.php?topic=38916.new#new\nhttps://forexedu.ro/forums/topic/commander-aciclovir-en-ligne-belgique-generique-prix/page/13/#post-90275\nhttps://yancearizona.net/2010/04/17/pendaftaran-wilayah-adat-belum-jelas/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8500, "cpu_time_ms": 91, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s005135886", "group_id": "codeNet:p03941", "input_text": "http://prestige-diamond.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://webregistrations.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.bluedenimoes.com/__media__/js/trademark.php?d=onlinecasinodd.com   http://loansgo.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://kettlevalleytours.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://universitymiddleschool.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ttq.weichertfinancialplanning.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.gojoying.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasinodd.com   http://ihatecarmaxtoyota.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://cubaimovel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pathmakers.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://offshore.eatonvance.com/Login.php?referer=https://onlinecasinodd.com   http://mydigitallapps.com/shangrila/click.aspx?url=https://onlinecasinodd.com  http://infrastructuretechnologyutility.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.greenskin.ir/links/go.php?url=https://onlinecasinodd.com  http://onlinetranscriptevaluation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.ellybelly.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://browser.geekbench.com/redirect?url=https://onlinecasinodd.com \nhttp://www.miladora.vg/__media__/js/trademark.php?d=onlinecasinodd.com  http://www.mausolutions.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://adgmpartners.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.elizabethmartin.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://megamusic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://actorolivia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://fii.jdirving-novanada.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://startrazvitiu.org/?goto=https://onlinecasinodd.com   http://www.mwnsurgery.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://ccm-tia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://morningstar.dt.se/Redirect.aspx?url=https://onlinecasinodd.com   http://opendata.go.tz/id/api/1/util/snippet/api_info.html?resource_id=19e6c16a-f378-4b74-8dc6-5cb90c254b82&datastore_root_url=https://onlinecasinodd.com   http://www.gooru.pl/katalog/redir.php?url=https://onlinecasinodd.com  http://arvay.hu/info.php?a<>=gynexin+review+-+<a+href=https://onlinecasinodd.com   http://strictlymetalprints.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://amgpromo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://cross-a.net/go_out.php?url=https://onlinecasinodd.com   http://realt.infomir.kiev.ua/out.php?link=https://onlinecasinodd.com \nhttp://myhubbblog.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://myresnewlands.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://zencosa.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://liverpooltagleague.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://b-casual.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.jtzlxx.com/oblog/go.asp?url=https://onlinecasinodd.com  http://esportbook.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ncsmallbiz.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://sdbuildingchapter.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://gloriaturkel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.tuomo.ch/includes/go.php?url=onlinecasinodd.com   http://rocklandjobsmatch.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://coloradoinvestmentadvice.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://revalesioinstitute.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.tw-outlander.com/home/link.php?url=https://onlinecasinodd.com  http://www.legsnylon.com/cgi-bin/at3/out.cgi?id=45&trade=https://onlinecasinodd.com  http://972doctors.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://jennifersepulveda.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://strohmercpa.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.4477k.com/my/link.php?url=https://onlinecasinodd.com   http://www.pointography.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://yourcomics.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://aesirmediagroup.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://aufdenwatten.de/out.php?id=a1_vh_hetkaapje&appl=30&link=https://onlinecasinodd.com  http://www.kanengiser.com/redirect.php?url=https://onlinecasinodd.com  http://dir.conexcol.com/cgi-ps/rd.mpc?https://onlinecasinodd.com   http://www.coach4allthekids.com/go.php?url=https://onlinecasinodd.com \nhttp://gprocess.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://marleyandbob.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cozzolispizza.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://vtads.net/go/?bsa_pro_id=14&bsa_pro_url=onlinecasinodd.com  http://craftdecorator.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.schnorchler.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.geohide.com/click.php?bid=12&url=https://onlinecasinodd.com  http://cowboybrandbarbecuesauce.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://16.xg4ken.com/media/redir.php?prof=177&camp=124362&affcode=pg1191650&k_inner_url_encoded=1&cid=46010231383&networkType=search&kdv=c&kpid=mksa34ed&kmc=17101421&url=https://onlinecasinodd.com \nhttps://login.uat.posta.hu/openam/UI/LoginStart?realm=PublicWebRealm&module=Google&goto=https://onlinecasinodd.com  http://www.clicknwish.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://omtool.de/onlinecasinodd.com   http://bancadeinversionbancolombia.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ampathlab.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://lindaholvmgren.gq/cgi-bin/a2/out.cgi?id=159&u=https://onlinecasinodd.com  http://snippetworks.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://payelectricity.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://advhyip.com/goto.php?url=https://onlinecasinodd.com \nhttp://homeenvironmental.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://putuporshutup.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://dealstream.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://moscowtravel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://shanti.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://wealthdesktop.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.simplir.me/redirect?url=https://onlinecasinodd.com  http://www.kellanlow.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://talkbmx.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://poselokgribovo.ru/forum/index.php?topic=113961.new#new\nhttps://vegetation-daheim.info/2012/11/26/vegetative-vermehrung-der-blauen-passionsblume-passiflora-caerulea/\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://rcoindiana.com/forum/index.php?topic=27009.new#new\nhttp://lessthan6.club/index.php?topic=1306.new#new\n", "language": "Lisp", "metadata": {"date": 1549011973, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s005135886.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s005135886", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://prestige-diamond.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://webregistrations.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.bluedenimoes.com/__media__/js/trademark.php?d=onlinecasinodd.com   http://loansgo.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://kettlevalleytours.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://universitymiddleschool.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ttq.weichertfinancialplanning.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.gojoying.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasinodd.com   http://ihatecarmaxtoyota.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://cubaimovel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pathmakers.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://offshore.eatonvance.com/Login.php?referer=https://onlinecasinodd.com   http://mydigitallapps.com/shangrila/click.aspx?url=https://onlinecasinodd.com  http://infrastructuretechnologyutility.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.greenskin.ir/links/go.php?url=https://onlinecasinodd.com  http://onlinetranscriptevaluation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.ellybelly.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://browser.geekbench.com/redirect?url=https://onlinecasinodd.com \nhttp://www.miladora.vg/__media__/js/trademark.php?d=onlinecasinodd.com  http://www.mausolutions.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://adgmpartners.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.elizabethmartin.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://megamusic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://actorolivia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://fii.jdirving-novanada.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://startrazvitiu.org/?goto=https://onlinecasinodd.com   http://www.mwnsurgery.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://ccm-tia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://morningstar.dt.se/Redirect.aspx?url=https://onlinecasinodd.com   http://opendata.go.tz/id/api/1/util/snippet/api_info.html?resource_id=19e6c16a-f378-4b74-8dc6-5cb90c254b82&datastore_root_url=https://onlinecasinodd.com   http://www.gooru.pl/katalog/redir.php?url=https://onlinecasinodd.com  http://arvay.hu/info.php?a<>=gynexin+review+-+<a+href=https://onlinecasinodd.com   http://strictlymetalprints.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://amgpromo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://cross-a.net/go_out.php?url=https://onlinecasinodd.com   http://realt.infomir.kiev.ua/out.php?link=https://onlinecasinodd.com \nhttp://myhubbblog.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://myresnewlands.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://zencosa.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://liverpooltagleague.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://b-casual.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.jtzlxx.com/oblog/go.asp?url=https://onlinecasinodd.com  http://esportbook.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ncsmallbiz.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://sdbuildingchapter.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://gloriaturkel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.tuomo.ch/includes/go.php?url=onlinecasinodd.com   http://rocklandjobsmatch.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://coloradoinvestmentadvice.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://revalesioinstitute.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.tw-outlander.com/home/link.php?url=https://onlinecasinodd.com  http://www.legsnylon.com/cgi-bin/at3/out.cgi?id=45&trade=https://onlinecasinodd.com  http://972doctors.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://jennifersepulveda.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://strohmercpa.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.4477k.com/my/link.php?url=https://onlinecasinodd.com   http://www.pointography.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://yourcomics.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://aesirmediagroup.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://aufdenwatten.de/out.php?id=a1_vh_hetkaapje&appl=30&link=https://onlinecasinodd.com  http://www.kanengiser.com/redirect.php?url=https://onlinecasinodd.com  http://dir.conexcol.com/cgi-ps/rd.mpc?https://onlinecasinodd.com   http://www.coach4allthekids.com/go.php?url=https://onlinecasinodd.com \nhttp://gprocess.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://marleyandbob.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cozzolispizza.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://vtads.net/go/?bsa_pro_id=14&bsa_pro_url=onlinecasinodd.com  http://craftdecorator.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.schnorchler.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.geohide.com/click.php?bid=12&url=https://onlinecasinodd.com  http://cowboybrandbarbecuesauce.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://16.xg4ken.com/media/redir.php?prof=177&camp=124362&affcode=pg1191650&k_inner_url_encoded=1&cid=46010231383&networkType=search&kdv=c&kpid=mksa34ed&kmc=17101421&url=https://onlinecasinodd.com \nhttps://login.uat.posta.hu/openam/UI/LoginStart?realm=PublicWebRealm&module=Google&goto=https://onlinecasinodd.com  http://www.clicknwish.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://omtool.de/onlinecasinodd.com   http://bancadeinversionbancolombia.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ampathlab.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://lindaholvmgren.gq/cgi-bin/a2/out.cgi?id=159&u=https://onlinecasinodd.com  http://snippetworks.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://payelectricity.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://advhyip.com/goto.php?url=https://onlinecasinodd.com \nhttp://homeenvironmental.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://putuporshutup.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://dealstream.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://moscowtravel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://shanti.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://wealthdesktop.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.simplir.me/redirect?url=https://onlinecasinodd.com  http://www.kellanlow.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://talkbmx.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://poselokgribovo.ru/forum/index.php?topic=113961.new#new\nhttps://vegetation-daheim.info/2012/11/26/vegetative-vermehrung-der-blauen-passionsblume-passiflora-caerulea/\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://rcoindiana.com/forum/index.php?topic=27009.new#new\nhttp://lessthan6.club/index.php?topic=1306.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8154, "cpu_time_ms": 147, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s033570934", "group_id": "codeNet:p03941", "input_text": "http://americhlorllc.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://weibo.co.nf/uchome/link.php?url=https://onlinecasinodd.com   http://bdsmobedient.biz/cgi-bin/out.cgi?id=193&l=top_top&u=https://onlinecasinodd.com   http://hawaiiansalts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://iliasfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://thinkactdo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://amyloraintrujillo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ashgabad.net/go/url=https://onlinecasinodd.com   http://socialtots.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://motechsuite.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.missionproduct.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://1800gemtrends.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://alwaysbreathehealthy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://contosdereis.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://dudleymoorecd.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://clintonm.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://signoreoscuro.mastertop100.org/out.php??s=https://onlinecasinodd.com   https://restaurant-sleutelgat.be/includes/go.php?url=onlinecasinodd.com \nhttp://fortikey.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://southcarolinaorganicgrowers.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.probonoinstitute.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://archivo.unionjalisco.mx/external?url=https://onlinecasinodd.com  http://www.whatsappfunnygifs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://colthemultimedia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.bxws.org/wp-content/themes/begin/inc/go.php?url=https://onlinecasinodd.com  http://bostonuniversityapts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://futurec.ir/an/redirect.php?url=https://onlinecasinodd.com \nhttp://33rdpta.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://yeticone.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://iknowagood.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.atimanarj.com/url.php?adrs=https://onlinecasinodd.com  https://links.mikehinz.de/go.php?id=1576&url=https://onlinecasinodd.com   http://monkeezemarketing.com/go.php?url=https://onlinecasinodd.com  http://г‚№г‚«гѓ€гѓ­.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.carcabin.com/-access-numbers-you-can-make-cheap-international-calls-in-a-flash/onlinecasinodd.com*wpimages*wpa6aaa2ae.png/   http://mexicanneora.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://mos03.focusforge.ru/bitrix/rk.php?id=9&event1=banner&event2=click&event3=1+%2F+%5B9%5D+%5BTOP%5D+%C1%E0%ED%ED%E5%F0+2014+08+20&goto=https://onlinecasinodd.com  http://peterkeefe.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://domainsfordollars.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://brkfirstrealty.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://books-n-records.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://vnbroker.com/showthread.php/152621-VN-Index-se-len-vung-960-diem?goto=onlinecasinodd.com  http://hearonearth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://youknowthisguy.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://aicpacpacff.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://ipsfasteners.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://barcliftassociates.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nuke.lucatesta.it/LinkClick.aspx?link=https://onlinecasinodd.com   http://dustypeterson.net/process/RedirectN?url=https://onlinecasinodd.com  http://www.toyota120.com/forum/showthread.php?goto=onlinecasinodd.com   http://jasonabernathy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://erechimcarros.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://21enlineamexico.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://contentstrategystudio.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://tj.chinachangfang.com/login?referer=https://onlinecasinodd.com  http://worldrecordslist.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.cydak.com/go.php?url=https://onlinecasinodd.com   http://aecisneros.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://connertonfl.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://diabetesactionnow.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.hybrid-cars.ru/redir.php?go=https://onlinecasinodd.com  http://cambridgeglobalanalytics.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://glendoravolvo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://1wi.thaimenopause.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://unrosarioaldia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://imperialtex.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ahboobs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://keiseruniversity.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://decidetu.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://louisaattorneys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.farmacialacorredera.com/index.php/blog/ofertas/item/57-sesion-maquillaje-vichy?fromurl=onlinecasinodd.com   http://coredaptix.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://cyberbourn.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://crumandforsterholdingscorporation.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://maseratiranchomirage.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.fotomodo.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://lanquestcorporation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://acr.zingring.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://check-a-check.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://kalpanalubrano.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://websitereview.xyz/redirect.php?url=https://onlinecasinodd.com \nhttp://www.hotyoungerbabes.net/tp/out.php?to=onlinecasinodd.com  http://qualitytreatmentcenter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.cohassetgc.org/default.aspx?p=TrackHyperlink&url=https://onlinecasinodd.com   http://smencils.de/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://207.198.114.76/redirect.php?tid=98510&goto=onlinecasinodd.com   https://www.chicagobooth.edu/assests/redirects/?source=sbspli&rd=https://onlinecasinodd.com  http://wwwkaesercentral.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://651doctors.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.1637.com/chat/index.htm?arg=10055982&style=1&kf=&kflist=off&kf=&zdkf_type=1&lnk_overflow=0&language=cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://onlinecasinodd.com \n \n \n \n \n \nhttp://vonwolkenstein.ano-host.co.in/vb4-neu/showthread.php?476840-wet-pussey-game&p=661272#post661272\nhttps://www.coinssouq.com/forum/showthread.php?262792-%D0%9A%D0%B0%D0%B7%D0%B0%D1%82%D1%8C%D1%81%D1%8F-%D0%B4%D0%BE%D0%B1%D0%B0%D0%B2%D0%B8%D1%82%D1%8C-%D0%B1%D0%BE%D0%BB%D1%8C%D1%88%D0%B5-%D1%81%D0%BB%D0%BE%D1%82%D0%BE%D0%B2-%D0%B2-Superomatic&p=437197&posted=1#post437197\nhttp://www.forum.wirtualnyinzynier.pl/viewtopic.php?f=33&t=228789\nhttp://forum.sustainablecitizenproject.com/viewtopic.php?f=22&t=10038\nhttp://classifiedsadsnow.online/viewtopic.php?pid=2564566#p2564566\n", "language": "Lisp", "metadata": {"date": 1548866775, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s033570934.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s033570934", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://americhlorllc.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://weibo.co.nf/uchome/link.php?url=https://onlinecasinodd.com   http://bdsmobedient.biz/cgi-bin/out.cgi?id=193&l=top_top&u=https://onlinecasinodd.com   http://hawaiiansalts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://iliasfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://thinkactdo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://amyloraintrujillo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ashgabad.net/go/url=https://onlinecasinodd.com   http://socialtots.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://motechsuite.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.missionproduct.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://1800gemtrends.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://alwaysbreathehealthy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://contosdereis.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://dudleymoorecd.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://clintonm.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://signoreoscuro.mastertop100.org/out.php??s=https://onlinecasinodd.com   https://restaurant-sleutelgat.be/includes/go.php?url=onlinecasinodd.com \nhttp://fortikey.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://southcarolinaorganicgrowers.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.probonoinstitute.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://archivo.unionjalisco.mx/external?url=https://onlinecasinodd.com  http://www.whatsappfunnygifs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://colthemultimedia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.bxws.org/wp-content/themes/begin/inc/go.php?url=https://onlinecasinodd.com  http://bostonuniversityapts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://futurec.ir/an/redirect.php?url=https://onlinecasinodd.com \nhttp://33rdpta.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://yeticone.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://iknowagood.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.atimanarj.com/url.php?adrs=https://onlinecasinodd.com  https://links.mikehinz.de/go.php?id=1576&url=https://onlinecasinodd.com   http://monkeezemarketing.com/go.php?url=https://onlinecasinodd.com  http://г‚№г‚«гѓ€гѓ­.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.carcabin.com/-access-numbers-you-can-make-cheap-international-calls-in-a-flash/onlinecasinodd.com*wpimages*wpa6aaa2ae.png/   http://mexicanneora.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://mos03.focusforge.ru/bitrix/rk.php?id=9&event1=banner&event2=click&event3=1+%2F+%5B9%5D+%5BTOP%5D+%C1%E0%ED%ED%E5%F0+2014+08+20&goto=https://onlinecasinodd.com  http://peterkeefe.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://domainsfordollars.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://brkfirstrealty.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://books-n-records.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://vnbroker.com/showthread.php/152621-VN-Index-se-len-vung-960-diem?goto=onlinecasinodd.com  http://hearonearth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://youknowthisguy.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://aicpacpacff.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://ipsfasteners.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://barcliftassociates.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nuke.lucatesta.it/LinkClick.aspx?link=https://onlinecasinodd.com   http://dustypeterson.net/process/RedirectN?url=https://onlinecasinodd.com  http://www.toyota120.com/forum/showthread.php?goto=onlinecasinodd.com   http://jasonabernathy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://erechimcarros.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://21enlineamexico.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://contentstrategystudio.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://tj.chinachangfang.com/login?referer=https://onlinecasinodd.com  http://worldrecordslist.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.cydak.com/go.php?url=https://onlinecasinodd.com   http://aecisneros.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://connertonfl.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://diabetesactionnow.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.hybrid-cars.ru/redir.php?go=https://onlinecasinodd.com  http://cambridgeglobalanalytics.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://glendoravolvo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://1wi.thaimenopause.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://unrosarioaldia.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://imperialtex.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ahboobs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://keiseruniversity.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://decidetu.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://louisaattorneys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.farmacialacorredera.com/index.php/blog/ofertas/item/57-sesion-maquillaje-vichy?fromurl=onlinecasinodd.com   http://coredaptix.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://cyberbourn.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://crumandforsterholdingscorporation.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://maseratiranchomirage.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.fotomodo.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://lanquestcorporation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://acr.zingring.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://check-a-check.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://kalpanalubrano.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://websitereview.xyz/redirect.php?url=https://onlinecasinodd.com \nhttp://www.hotyoungerbabes.net/tp/out.php?to=onlinecasinodd.com  http://qualitytreatmentcenter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.cohassetgc.org/default.aspx?p=TrackHyperlink&url=https://onlinecasinodd.com   http://smencils.de/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://207.198.114.76/redirect.php?tid=98510&goto=onlinecasinodd.com   https://www.chicagobooth.edu/assests/redirects/?source=sbspli&rd=https://onlinecasinodd.com  http://wwwkaesercentral.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://651doctors.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.1637.com/chat/index.htm?arg=10055982&style=1&kf=&kflist=off&kf=&zdkf_type=1&lnk_overflow=0&language=cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://onlinecasinodd.com \n \n \n \n \n \nhttp://vonwolkenstein.ano-host.co.in/vb4-neu/showthread.php?476840-wet-pussey-game&p=661272#post661272\nhttps://www.coinssouq.com/forum/showthread.php?262792-%D0%9A%D0%B0%D0%B7%D0%B0%D1%82%D1%8C%D1%81%D1%8F-%D0%B4%D0%BE%D0%B1%D0%B0%D0%B2%D0%B8%D1%82%D1%8C-%D0%B1%D0%BE%D0%BB%D1%8C%D1%88%D0%B5-%D1%81%D0%BB%D0%BE%D1%82%D0%BE%D0%B2-%D0%B2-Superomatic&p=437197&posted=1#post437197\nhttp://www.forum.wirtualnyinzynier.pl/viewtopic.php?f=33&t=228789\nhttp://forum.sustainablecitizenproject.com/viewtopic.php?f=22&t=10038\nhttp://classifiedsadsnow.online/viewtopic.php?pid=2564566#p2564566\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8095, "cpu_time_ms": 99, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s582016160", "group_id": "codeNet:p03941", "input_text": "http://lgbtcounts.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sanantoniodoctorsoncall.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.gwatcht.com/home/link.php?url=https://onlinecasinodd.com   http://www.iaudit.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.withubtraining.org/kefu.htm?arg=withubtraining&style=1&kf=&kflist=on&kf=cisco2%2Ccisco1%2Cadobe%2Cgongye%2Cofficezfbt%2Coffice%2Ctese%2Cjava%2Citen%2Cbigdata%2Cibm%2Cqiye%2Cwithub%2C706358385%2C1580263851%2C19678429&zdkf_type=1&language=cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://onlinecasinodd.com   http://24news.lt/go.php?url=https://onlinecasinodd.com  http://clearwaterchildrenshealth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.oktotech.com/wp-content/themes/Grimag/go.php?https://onlinecasinodd.com   http://kocolenemarketing.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://andrewharpershideawayreport.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://abcnews.go.com/cgi/atransfer.pl?name=36981&srvc=nws&guid=none&goto=https://onlinecasinodd.com   http://chickintech.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.inmir.de/cms/?redirect&url=https://onlinecasinodd.com  http://waterstreetcommunityinfo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://praguevoyages.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://flack.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tlrc-en.tbzmed.ac.ir/?pageid=1&MID=22&url=https://onlinecasinodd.com   http://discountcodehotels.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://czf.edacinc.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://searchandtreat.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.lifetree.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://oce.ssiwebonline.com/track.aspx?a=3656&r=32&c=&u=https://onlinecasinodd.com  http://crispinteriors.ca/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.jessicab.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rhinestonenames.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.bwyc.org/default.aspx?p=TrackHyperlink&url=https://onlinecasinodd.com   http://harrisbales.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://42039326.r.bat.bing.com/?ld=d3UKkvyXE9ybClzux4tva3jTVUCUwXelkh2bdYJgSV-eOXMMdlTar8tVT4k4EEg4VU3DZMuxNMvP_gBUhpq4dQwO8IC6yxawbaqgFmYF43d-LRjceQo6SWycih8RbhA7VuMqGtLO40nwmx90Qfn_RT11fZpOqB6rP4Uw00ODgBGtj5TnWq&u=https://onlinecasinodd.com  http://informedigital.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://okidataorders.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://angel-kazan.ru/go.php?url=https://onlinecasinodd.com  http://midwesternmarketing.co/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://sawmillholdings.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://afandbbuckhead.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://slipn.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://savingswithpawraylah.info/click.php?id=153&url=onlinecasinodd.com \nhttp://home.shipai.net/link.php?url=https://onlinecasinodd.com  http://pashminaworld.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://movetoamend.nationbuilder.com/r?u=https://onlinecasinodd.com   http://walkforrecovery.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://bsj.internethostpilot.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://imc-holdings.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://somersetonelizabeth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://bbs.lihuasoft.com/redirect.php?tid=3984&goto=onlinecasinodd.com   http://dcdowell.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://hobnobblegobble.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://searcherama.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://eneonatalhealth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://analystz.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://directholdingsamericas.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hastingsautobody.com/gallery/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasinodd.com/  http://lyrictalent.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://stgau.ru/bitrix/rk.php?goto=https://onlinecasinodd.com/   http://mix-hub.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://hiskbc.com/includes/go.php?url=onlinecasinodd.com  http://myappshubb.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nationstarhouseloan.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://infotronicsonline.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://globalezlink.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://skylightfinancial.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://athensdream.gr/index.php/component/k2/item/7-the-beables-eng?fromurl=onlinecasinodd.com  http://firsteyeomaha.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hocc.cc/forum/redirect.php?fid=32&tid=41593&goto=onlinecasinodd.com \nhttp://flipflippen.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://enikos.smart-ads.gr/adclick.php?bannerid=2547&zoneid=0&dest=https://onlinecasinodd.com   http://pokerzion.com/Poker_Forum/showthread.php/16300-S%C3%A1%C2%BB*a-tivi-t%C3%A1%C2%BA*n-nh%C3%83*-gi%C3%83%C2%A1-r%C3%A1%C2%BA%C2%BB-uy-t%C3%83*n?goto=onlinecasinodd.com   http://womenshealthfirst.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://m.forum.detik.com/showthread.php?t=1593562&goto=onlinecasinodd.com   http://www.yoga.healthyhuman.net/go.php?url=https://onlinecasinodd.com  http://kcrels.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dlib.ischool.drexel.edu/gsdl/cgi-bin/library.cgi?e=d-00000-00---off-0cybulsk1--00-1----0-10-0---0---0direct-10---4-------0-1l--10-gl-50---20-help---00-3-1-00-0--4--0--0-0-01-10-0big5-10&a=extlink&rl=0&href=https://onlinecasinodd.com   http://www.braziliansbeautysecrets.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://apps.trutube.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://diningreservation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://risingstarscholars.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://trescerocinco.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mazaktradein.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bbwmilftube.com/cgi-bin/bmt.cgi?c=1&s=70&bmt=1&u=https://onlinecasinodd.com  http://rcaonline.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://momporntv.net/go.php?ma=17&tu=25&re=1688&url=https://onlinecasinodd.com   http://dcpracticeinsights.com/mpacms/dc/pi/link.php?p=492&c=1392&c_url=https://onlinecasinodd.com \nhttp://usedcallawayclubs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pardonmepeople.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://slateroofstlouis.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://blq.deadromans.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://beldentristatebuildingmaterials.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://doylehotel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.paywei.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://metro-ny.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.ddc.moph.go.th/banner/showimgbanner.php?id=72&url=https://onlinecasinodd.com \n \n \n \n \n \nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://www.tunturisusi.com/aforismitfoorumi/phpBB3/viewtopic.php?f=13&t=11479\nhttp://ttmicro.com/forum/index.php?topic=159322.new#new\nhttps://lavoroabergamo.it/index.php?topic=507267.new#new\nhttps://weechookeong.com/2018/05/30/masa-sekarang-menungggu-mu-part-5-tourism-msias-rm99-694-mil-speedy-gonzales-contract/\n", "language": "Lisp", "metadata": {"date": 1548855421, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s582016160.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s582016160", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://lgbtcounts.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sanantoniodoctorsoncall.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.gwatcht.com/home/link.php?url=https://onlinecasinodd.com   http://www.iaudit.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.withubtraining.org/kefu.htm?arg=withubtraining&style=1&kf=&kflist=on&kf=cisco2%2Ccisco1%2Cadobe%2Cgongye%2Cofficezfbt%2Coffice%2Ctese%2Cjava%2Citen%2Cbigdata%2Cibm%2Cqiye%2Cwithub%2C706358385%2C1580263851%2C19678429&zdkf_type=1&language=cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://onlinecasinodd.com   http://24news.lt/go.php?url=https://onlinecasinodd.com  http://clearwaterchildrenshealth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.oktotech.com/wp-content/themes/Grimag/go.php?https://onlinecasinodd.com   http://kocolenemarketing.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://andrewharpershideawayreport.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://abcnews.go.com/cgi/atransfer.pl?name=36981&srvc=nws&guid=none&goto=https://onlinecasinodd.com   http://chickintech.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.inmir.de/cms/?redirect&url=https://onlinecasinodd.com  http://waterstreetcommunityinfo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://praguevoyages.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://flack.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tlrc-en.tbzmed.ac.ir/?pageid=1&MID=22&url=https://onlinecasinodd.com   http://discountcodehotels.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://czf.edacinc.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://searchandtreat.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.lifetree.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://oce.ssiwebonline.com/track.aspx?a=3656&r=32&c=&u=https://onlinecasinodd.com  http://crispinteriors.ca/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.jessicab.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rhinestonenames.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.bwyc.org/default.aspx?p=TrackHyperlink&url=https://onlinecasinodd.com   http://harrisbales.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://42039326.r.bat.bing.com/?ld=d3UKkvyXE9ybClzux4tva3jTVUCUwXelkh2bdYJgSV-eOXMMdlTar8tVT4k4EEg4VU3DZMuxNMvP_gBUhpq4dQwO8IC6yxawbaqgFmYF43d-LRjceQo6SWycih8RbhA7VuMqGtLO40nwmx90Qfn_RT11fZpOqB6rP4Uw00ODgBGtj5TnWq&u=https://onlinecasinodd.com  http://informedigital.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://okidataorders.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://angel-kazan.ru/go.php?url=https://onlinecasinodd.com  http://midwesternmarketing.co/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://sawmillholdings.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://afandbbuckhead.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://slipn.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://savingswithpawraylah.info/click.php?id=153&url=onlinecasinodd.com \nhttp://home.shipai.net/link.php?url=https://onlinecasinodd.com  http://pashminaworld.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://movetoamend.nationbuilder.com/r?u=https://onlinecasinodd.com   http://walkforrecovery.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://bsj.internethostpilot.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://imc-holdings.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://somersetonelizabeth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://bbs.lihuasoft.com/redirect.php?tid=3984&goto=onlinecasinodd.com   http://dcdowell.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://hobnobblegobble.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://searcherama.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://eneonatalhealth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://analystz.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://directholdingsamericas.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hastingsautobody.com/gallery/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasinodd.com/  http://lyrictalent.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://stgau.ru/bitrix/rk.php?goto=https://onlinecasinodd.com/   http://mix-hub.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://hiskbc.com/includes/go.php?url=onlinecasinodd.com  http://myappshubb.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nationstarhouseloan.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://infotronicsonline.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://globalezlink.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://skylightfinancial.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://athensdream.gr/index.php/component/k2/item/7-the-beables-eng?fromurl=onlinecasinodd.com  http://firsteyeomaha.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hocc.cc/forum/redirect.php?fid=32&tid=41593&goto=onlinecasinodd.com \nhttp://flipflippen.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://enikos.smart-ads.gr/adclick.php?bannerid=2547&zoneid=0&dest=https://onlinecasinodd.com   http://pokerzion.com/Poker_Forum/showthread.php/16300-S%C3%A1%C2%BB*a-tivi-t%C3%A1%C2%BA*n-nh%C3%83*-gi%C3%83%C2%A1-r%C3%A1%C2%BA%C2%BB-uy-t%C3%83*n?goto=onlinecasinodd.com   http://womenshealthfirst.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://m.forum.detik.com/showthread.php?t=1593562&goto=onlinecasinodd.com   http://www.yoga.healthyhuman.net/go.php?url=https://onlinecasinodd.com  http://kcrels.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dlib.ischool.drexel.edu/gsdl/cgi-bin/library.cgi?e=d-00000-00---off-0cybulsk1--00-1----0-10-0---0---0direct-10---4-------0-1l--10-gl-50---20-help---00-3-1-00-0--4--0--0-0-01-10-0big5-10&a=extlink&rl=0&href=https://onlinecasinodd.com   http://www.braziliansbeautysecrets.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://apps.trutube.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://diningreservation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://risingstarscholars.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://trescerocinco.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mazaktradein.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bbwmilftube.com/cgi-bin/bmt.cgi?c=1&s=70&bmt=1&u=https://onlinecasinodd.com  http://rcaonline.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://momporntv.net/go.php?ma=17&tu=25&re=1688&url=https://onlinecasinodd.com   http://dcpracticeinsights.com/mpacms/dc/pi/link.php?p=492&c=1392&c_url=https://onlinecasinodd.com \nhttp://usedcallawayclubs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pardonmepeople.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://slateroofstlouis.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://blq.deadromans.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://beldentristatebuildingmaterials.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://doylehotel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.paywei.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://metro-ny.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.ddc.moph.go.th/banner/showimgbanner.php?id=72&url=https://onlinecasinodd.com \n \n \n \n \n \nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://www.tunturisusi.com/aforismitfoorumi/phpBB3/viewtopic.php?f=13&t=11479\nhttp://ttmicro.com/forum/index.php?topic=159322.new#new\nhttps://lavoroabergamo.it/index.php?topic=507267.new#new\nhttps://weechookeong.com/2018/05/30/masa-sekarang-menungggu-mu-part-5-tourism-msias-rm99-694-mil-speedy-gonzales-contract/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8440, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s143660186", "group_id": "codeNet:p03941", "input_text": "http://top5cpa.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://takeanorphandogtoworkday.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://redschool.or.kr/?mid=mastercoach_books&document_srl=187701&du=onlinecasinodd.com   http://philaenergyllc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://themeasurementacademy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bevflex.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.google.co.za/url?q=https://onlinecasinodd.com  http://aquacapital.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cignaturerealestate.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://wpf.ndtvmobile.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://gatepetroleum.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cooklikeagrandma.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.shopmargin.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://drinking4causes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.civvystreet.org/LinkClick.aspx?link=https://onlinecasinodd.com  http://kigi-kultura.ru/go.php?to=https://onlinecasinodd.com  http://holsterdepot.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.pichshop.ru/bitrix/rk.php?id=53&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B53%5D+%5BCATALOG_1%5D+%D0%A0%D0%B0%D0%B7%D0%B4%D0%B5%D0%BB+23+%D1%84%D0%B5%D0%B2%D1%80%D0%B0%D0%BB%D1%8F&goto=onlinecasinodd.com \nhttp://www.fdlcrewards.com/redirect?SessionGuid=5c293135-bc65-440e-96c5-8123a4f32bdf&url=https://onlinecasinodd.com  http://www.tradingcompany.com/__media__/js/trademark.php?d=onlinecasinodd.com   http://laminatedepot.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://mymichaels.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://miass.ktovgorode.su/goto/https://onlinecasinodd.com   http://www.gawinetrail.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://uaclub.net/url.php?link=https://onlinecasinodd.com  http://bibleminded.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://winghero.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://cleanairarkansas.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://3v1.celestialstar.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.hamilton.edu/goto.cfm?url=https://onlinecasinodd.com   http://operationhealourpatriots.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pictures4show.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://peiweiasianmarket.co/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://corealtors.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://websiteappraisalpro.com/onlinecasinodd.com.html   http://bigtits.com.au/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://assabetvalleyll.com/Goto.asp?url=https://onlinecasinodd.com  http://sovereigncolo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://qselect.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.dwbrooksfuneralhome.com/cfi/addthis_email_mobile.cfm?fh_id=15002&url=https://onlinecasinodd.com  http://ye-sul.com/rb/?r=home&system=popup.login&iframe=Y&referer=https://onlinecasinodd.com   http://www.1966008.com/go.php?id=270&url=https://onlinecasinodd.com  http://btt-llc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ppvotes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://leedesignerdirect.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://alternativegrounds.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://deluxelabs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://longhorn-steak-house.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://manualsonline.com.au/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hallimail.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.softwaresubmit.net/go.asp?url=https://onlinecasinodd.com  http://sweepstakesqueen.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://f3nws.com/go?q=https://onlinecasinodd.com   http://telalarm.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://wzo.kyoto.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.auswandern-nach-brasilien.de/redirect/?url=https://onlinecasinodd.com   https://jsgears.com/redirect.php?tid=3203&goto=onlinecasinodd.com   http://lsz008.3322.org/blog/link.php?url=https://onlinecasinodd.com  http://pcinsurance.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://pattontechnologiesllc.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.emmabowenfoundation.com/r?u=https://onlinecasinodd.com  http://doggietransportguy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://m.shopinannapolis.com/redirect.aspx?url=https://onlinecasinodd.com \nhttp://rondasheazillner.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.teocinc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.solveswindows.win/e/o/?/movies/go.php?id=588859_1&url=https://onlinecasinodd.com   http://www.campuscareercenter.com/redirect/redirect.asp?desturl=https://onlinecasinodd.com  http://zadoratimepieces.es/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.chinese-porn.org/cgi-bin/crtr/out.cgi?url=https://onlinecasinodd.com  http://50carleton.withbob.net/info.php?a<>=<a+href=https://onlinecasinodd.com  http://www.cock-ball-torture.net/cbt-thumbs/link.php?link=cbt&id=df35a2&gr=2&url=onlinecasinodd.com   http://www.zelaznog.com/photo/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasinodd.com \nhttp://zusds.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.xeronex.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://urbanisator.nl/shortcuts/sendlinkmessage.aspx?url=https://onlinecasinodd.com   http://far-star.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.metcom.ru/bitrix/rk.php?id=20&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B20%5D+%5Bright6%5D+%CC%E8%ED%E8%EC%E8%E7%E0%F6%E8%FF+%F0%E8%F1%EA%EE%E2&goto=https://onlinecasinodd.com   http://getsolarpanel.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://suomenlomapalvelu.fi/url.php?link=onlinecasinodd.com  http://scidaily.co.uk/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.azimuth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://plannedparentoodblogs.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.nuecesmedsociety.org/Redirect.aspx?url=https://onlinecasinodd.com   http://m.maigoo.com/link.php?url=https://onlinecasinodd.com   http://yhbio.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://cideriecotemontrigaud.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://magnusegoger.tk/latest-updates/163/?go=click&c=3&n=14&e=0&g=3&r=207803&u=https://onlinecasinodd.com  http://manspads.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://experienceconducter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nebiochar.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://www.vok-forum.ru/viewtopic.php?f=2&t=152729\nhttp://forum.fibroteam.info/showthread.php?p=434794#post434794\nhttp://worldcup062018.com/worldcup/viewtopic.php?pid=69830#p69830\nhttps://truthinreality.com/2015/09/15/prayer-for-breaking-the-powers-of-witchcraft/\nhttp://benaibouche.com/forum/index.php?topic=8087.new#new\n", "language": "Lisp", "metadata": {"date": 1548849772, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s143660186.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s143660186", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://top5cpa.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://takeanorphandogtoworkday.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://redschool.or.kr/?mid=mastercoach_books&document_srl=187701&du=onlinecasinodd.com   http://philaenergyllc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://themeasurementacademy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bevflex.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.google.co.za/url?q=https://onlinecasinodd.com  http://aquacapital.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cignaturerealestate.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://wpf.ndtvmobile.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://gatepetroleum.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cooklikeagrandma.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.shopmargin.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://drinking4causes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.civvystreet.org/LinkClick.aspx?link=https://onlinecasinodd.com  http://kigi-kultura.ru/go.php?to=https://onlinecasinodd.com  http://holsterdepot.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.pichshop.ru/bitrix/rk.php?id=53&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B53%5D+%5BCATALOG_1%5D+%D0%A0%D0%B0%D0%B7%D0%B4%D0%B5%D0%BB+23+%D1%84%D0%B5%D0%B2%D1%80%D0%B0%D0%BB%D1%8F&goto=onlinecasinodd.com \nhttp://www.fdlcrewards.com/redirect?SessionGuid=5c293135-bc65-440e-96c5-8123a4f32bdf&url=https://onlinecasinodd.com  http://www.tradingcompany.com/__media__/js/trademark.php?d=onlinecasinodd.com   http://laminatedepot.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://mymichaels.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://miass.ktovgorode.su/goto/https://onlinecasinodd.com   http://www.gawinetrail.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://uaclub.net/url.php?link=https://onlinecasinodd.com  http://bibleminded.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://winghero.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://cleanairarkansas.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://3v1.celestialstar.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.hamilton.edu/goto.cfm?url=https://onlinecasinodd.com   http://operationhealourpatriots.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pictures4show.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://peiweiasianmarket.co/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://corealtors.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://websiteappraisalpro.com/onlinecasinodd.com.html   http://bigtits.com.au/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://assabetvalleyll.com/Goto.asp?url=https://onlinecasinodd.com  http://sovereigncolo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://qselect.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.dwbrooksfuneralhome.com/cfi/addthis_email_mobile.cfm?fh_id=15002&url=https://onlinecasinodd.com  http://ye-sul.com/rb/?r=home&system=popup.login&iframe=Y&referer=https://onlinecasinodd.com   http://www.1966008.com/go.php?id=270&url=https://onlinecasinodd.com  http://btt-llc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ppvotes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://leedesignerdirect.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://alternativegrounds.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://deluxelabs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://longhorn-steak-house.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://manualsonline.com.au/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hallimail.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.softwaresubmit.net/go.asp?url=https://onlinecasinodd.com  http://sweepstakesqueen.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://f3nws.com/go?q=https://onlinecasinodd.com   http://telalarm.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://wzo.kyoto.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.auswandern-nach-brasilien.de/redirect/?url=https://onlinecasinodd.com   https://jsgears.com/redirect.php?tid=3203&goto=onlinecasinodd.com   http://lsz008.3322.org/blog/link.php?url=https://onlinecasinodd.com  http://pcinsurance.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://pattontechnologiesllc.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.emmabowenfoundation.com/r?u=https://onlinecasinodd.com  http://doggietransportguy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://m.shopinannapolis.com/redirect.aspx?url=https://onlinecasinodd.com \nhttp://rondasheazillner.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.teocinc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.solveswindows.win/e/o/?/movies/go.php?id=588859_1&url=https://onlinecasinodd.com   http://www.campuscareercenter.com/redirect/redirect.asp?desturl=https://onlinecasinodd.com  http://zadoratimepieces.es/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.chinese-porn.org/cgi-bin/crtr/out.cgi?url=https://onlinecasinodd.com  http://50carleton.withbob.net/info.php?a<>=<a+href=https://onlinecasinodd.com  http://www.cock-ball-torture.net/cbt-thumbs/link.php?link=cbt&id=df35a2&gr=2&url=onlinecasinodd.com   http://www.zelaznog.com/photo/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasinodd.com \nhttp://zusds.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.xeronex.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://urbanisator.nl/shortcuts/sendlinkmessage.aspx?url=https://onlinecasinodd.com   http://far-star.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.metcom.ru/bitrix/rk.php?id=20&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B20%5D+%5Bright6%5D+%CC%E8%ED%E8%EC%E8%E7%E0%F6%E8%FF+%F0%E8%F1%EA%EE%E2&goto=https://onlinecasinodd.com   http://getsolarpanel.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://suomenlomapalvelu.fi/url.php?link=onlinecasinodd.com  http://scidaily.co.uk/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.azimuth.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://plannedparentoodblogs.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.nuecesmedsociety.org/Redirect.aspx?url=https://onlinecasinodd.com   http://m.maigoo.com/link.php?url=https://onlinecasinodd.com   http://yhbio.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://cideriecotemontrigaud.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://magnusegoger.tk/latest-updates/163/?go=click&c=3&n=14&e=0&g=3&r=207803&u=https://onlinecasinodd.com  http://manspads.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://experienceconducter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nebiochar.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://www.vok-forum.ru/viewtopic.php?f=2&t=152729\nhttp://forum.fibroteam.info/showthread.php?p=434794#post434794\nhttp://worldcup062018.com/worldcup/viewtopic.php?pid=69830#p69830\nhttps://truthinreality.com/2015/09/15/prayer-for-breaking-the-powers-of-witchcraft/\nhttp://benaibouche.com/forum/index.php?topic=8087.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7798, "cpu_time_ms": 25, "memory_kb": 3680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s198151534", "group_id": "codeNet:p03941", "input_text": "http://元大期貨.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://consolidatedfastfrate.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.robynraby.com/437/webCompany.php?arg=9007654&style=3&referer=https://onlinecasinodd.com   http://livingforthemoment.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://blenderball.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.cudahynow.com/s?action=editReg&rurl=https://onlinecasinodd.com  http://t-mobileholiday.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ftworthexaminer.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nureba.com/r?u=https://onlinecasinodd.com \nhttps://piquadroshop.ru/bitrix/rk.php?id=349&site_id=pi&event1=banner&event2=click&event3=6+%2F+%5B349%5D+%5BPI_MAIN_TOP_RIGHT%5D+%D0%90%D0%BA%D1%81%D0%B5%D1%81%D1%81%D1%83%D0%B0%D1%80%D1%8B&goto=https://onlinecasinodd.com  http://historicdublinassociation.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.stlawrencedenton.org.uk/goto-link.php?link_id=20&url=https://onlinecasinodd.com   http://snappydoodle.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://wrightautomation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://sellingprimelots.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://keywestbeersummit.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.2012.csis.cn/bbs/redirect.php?goto=onlinecasinodd.com   http://aedwesterhaar.nl/gastenboek/index.php?permalink=onlinecasinodd.com \nhttp://www.bashedu.ru/go.php?to=onlinecasinodd.com  http://wave-fiber.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://freeyourads.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gayvideotube.com/cgi-bin/a2/out.cgi?s=50&c=1&u=https://onlinecasinodd.com  http://www.yihehui.com/sns/link.php?url=https://onlinecasinodd.com   http://fwf1.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hackerskid.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dataquality.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://preview.safra.sg/redirect.aspx?url=https://onlinecasinodd.com/ \nhttp://airlineticketsavingsinfo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jed.arabonline.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://berkshirehathawayofthetriadrealestate.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.asianec.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasinodd.com  http://campusfurniture.tc/__media__/js/trademark.php?d=onlinecasinodd.com   http://binjaffar.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mail.diakweb.ro/index.php?goto=onlinecasinodd.com  http://icecandyproduction.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://adtechsd.com/includes/go.php?url=onlinecasinodd.com \nhttp://1800mychair.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ozaydingroup.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://tennisintegrity.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://afrohaircare.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dg-nb.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://istreetpark.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sbanj.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://samson-capital.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://humanesdifferentiation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.pack365yukonok.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://eastwoodprint.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://lanceslock.libsyn.com/?referer=https://onlinecasinodd.com   http://thecarbonnetwork.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.webboxservice.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://millcitypress.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://morningstar.gd.se/Redirect.aspx?url=https://onlinecasinodd.com  http://www.stfrancis-shoreham.org.uk/goto-link.php?link_id=13&url=https://onlinecasinodd.com   http://duchessofwestminster.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://lqr.developingoptimism.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ipv6.flypt.org/forums/redirect.php?tid=122320&goto=onlinecasinodd.com   http://mksportfishing.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://medcorssucks.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://voicestress.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://mediatheque.saint-genis-pouilly.fr/?id=201972171396062991%20?%3E%20%20%20%20%20%20%20%20%20%20%20%20&referer=https://onlinecasinodd.com  http://fleshlightgirlsdirect.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://managementskillsinc.clipe.pt/go.php?code=A0Q3o4obs6QIMG&partner=tt/out.php?u=/onlinecasinodd.com   http://www.succoacido.net/backoffice/banner/frbanner.asp?bannerid=654&url=https://onlinecasinodd.com/ \nhttp://comedysmack.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://voiprecorders.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://blacktiesthemagazine.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://treasuretrek.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://aeropostalshop.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://vdsa.e-monsite.com/liens/do/redirect/?url=https://onlinecasinodd.com  http://creditrepairlexington.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://swisspartner.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kinddesign.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://mediatheque.ville-firminy.fr/opac/catalog/bibrecord?id=902637991010732387&referer=https://onlinecasinodd.com  http://www.tamebeast.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://italianuniversity.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://doitonair.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://holidaysconsultant.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.mania.gs/cgi-bin/rosyutu/out.cgi?id=erorost&url=https://onlinecasinodd.com  http://ixicorp.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://amadeustours.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://iberostarplayaparaisogolfclub.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://vacation-rewards.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sadiemadison.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://edibleradio.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kaduri.net/redir.asp?url=https://onlinecasinodd.com  http://bottlingequipment.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://pedaleverywhere.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://visionomicswest.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://thehrcorporation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://krugrabot.ru/bitrix/rk.php?goto=https://onlinecasinodd.com \n \n \n \n \n \nhttps://optimisationducapitalhumain.com/forum/index.php?topic=253133.new#new\nhttps://madness.org.ua/index.php?topic=22096.new#new\nhttp://forum.smkn1cikampek.sch.id/index.php?topic=19491.new#new\nhttp://www.criptiknetworks.com/forums/showthread.php?tid=23812\nhttps://starbase972.com/about_e/kelley-tribute/\n", "language": "Lisp", "metadata": {"date": 1548844100, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s198151534.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s198151534", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://元大期貨.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://consolidatedfastfrate.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.robynraby.com/437/webCompany.php?arg=9007654&style=3&referer=https://onlinecasinodd.com   http://livingforthemoment.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://blenderball.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.cudahynow.com/s?action=editReg&rurl=https://onlinecasinodd.com  http://t-mobileholiday.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ftworthexaminer.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://nureba.com/r?u=https://onlinecasinodd.com \nhttps://piquadroshop.ru/bitrix/rk.php?id=349&site_id=pi&event1=banner&event2=click&event3=6+%2F+%5B349%5D+%5BPI_MAIN_TOP_RIGHT%5D+%D0%90%D0%BA%D1%81%D0%B5%D1%81%D1%81%D1%83%D0%B0%D1%80%D1%8B&goto=https://onlinecasinodd.com  http://historicdublinassociation.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.stlawrencedenton.org.uk/goto-link.php?link_id=20&url=https://onlinecasinodd.com   http://snappydoodle.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://wrightautomation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://sellingprimelots.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://keywestbeersummit.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.2012.csis.cn/bbs/redirect.php?goto=onlinecasinodd.com   http://aedwesterhaar.nl/gastenboek/index.php?permalink=onlinecasinodd.com \nhttp://www.bashedu.ru/go.php?to=onlinecasinodd.com  http://wave-fiber.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://freeyourads.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gayvideotube.com/cgi-bin/a2/out.cgi?s=50&c=1&u=https://onlinecasinodd.com  http://www.yihehui.com/sns/link.php?url=https://onlinecasinodd.com   http://fwf1.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hackerskid.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dataquality.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://preview.safra.sg/redirect.aspx?url=https://onlinecasinodd.com/ \nhttp://airlineticketsavingsinfo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jed.arabonline.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://berkshirehathawayofthetriadrealestate.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.asianec.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasinodd.com  http://campusfurniture.tc/__media__/js/trademark.php?d=onlinecasinodd.com   http://binjaffar.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mail.diakweb.ro/index.php?goto=onlinecasinodd.com  http://icecandyproduction.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://adtechsd.com/includes/go.php?url=onlinecasinodd.com \nhttp://1800mychair.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ozaydingroup.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://tennisintegrity.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://afrohaircare.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://dg-nb.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://istreetpark.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sbanj.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://samson-capital.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://humanesdifferentiation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.pack365yukonok.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://eastwoodprint.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://lanceslock.libsyn.com/?referer=https://onlinecasinodd.com   http://thecarbonnetwork.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.webboxservice.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://millcitypress.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://morningstar.gd.se/Redirect.aspx?url=https://onlinecasinodd.com  http://www.stfrancis-shoreham.org.uk/goto-link.php?link_id=13&url=https://onlinecasinodd.com   http://duchessofwestminster.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://lqr.developingoptimism.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ipv6.flypt.org/forums/redirect.php?tid=122320&goto=onlinecasinodd.com   http://mksportfishing.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://medcorssucks.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://voicestress.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://mediatheque.saint-genis-pouilly.fr/?id=201972171396062991%20?%3E%20%20%20%20%20%20%20%20%20%20%20%20&referer=https://onlinecasinodd.com  http://fleshlightgirlsdirect.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://managementskillsinc.clipe.pt/go.php?code=A0Q3o4obs6QIMG&partner=tt/out.php?u=/onlinecasinodd.com   http://www.succoacido.net/backoffice/banner/frbanner.asp?bannerid=654&url=https://onlinecasinodd.com/ \nhttp://comedysmack.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://voiprecorders.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://blacktiesthemagazine.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://treasuretrek.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://aeropostalshop.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://vdsa.e-monsite.com/liens/do/redirect/?url=https://onlinecasinodd.com  http://creditrepairlexington.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://swisspartner.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kinddesign.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://mediatheque.ville-firminy.fr/opac/catalog/bibrecord?id=902637991010732387&referer=https://onlinecasinodd.com  http://www.tamebeast.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://italianuniversity.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://doitonair.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://holidaysconsultant.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.mania.gs/cgi-bin/rosyutu/out.cgi?id=erorost&url=https://onlinecasinodd.com  http://ixicorp.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://amadeustours.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://iberostarplayaparaisogolfclub.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://vacation-rewards.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sadiemadison.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://edibleradio.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kaduri.net/redir.asp?url=https://onlinecasinodd.com  http://bottlingequipment.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://pedaleverywhere.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://visionomicswest.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://thehrcorporation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://krugrabot.ru/bitrix/rk.php?goto=https://onlinecasinodd.com \n \n \n \n \n \nhttps://optimisationducapitalhumain.com/forum/index.php?topic=253133.new#new\nhttps://madness.org.ua/index.php?topic=22096.new#new\nhttp://forum.smkn1cikampek.sch.id/index.php?topic=19491.new#new\nhttp://www.criptiknetworks.com/forums/showthread.php?tid=23812\nhttps://starbase972.com/about_e/kelley-tribute/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7826, "cpu_time_ms": 92, "memory_kb": 9572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s345634565", "group_id": "codeNet:p03941", "input_text": "http://www.sheilasattic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jpxinteractive.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://marulofts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://m.51wzbj.com/home/link.php?url=https://onlinecasinodd.com  http://offshoreonly.co/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://megalac.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.emotiondv.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://impressedletterpress.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://worldrecordslist.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://myhealthriskappraisal.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://funthinker.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://datesofalmadina.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bitrix.infpol.ru/upload/bx/a12/240_400.swf?flash_link=onlinecasinodd.com  http://cityeventlink.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://appletonpapers.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://proventtherapy.sg/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://goldcoasthonda.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://codymaclake.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://www.blackbutteranchhoa.com/default.aspx?p=TrackHyperlink&url=https://onlinecasinodd.com  http://live-forums.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.thehathouse.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.xz323.com/dialog_1.htm?arg=xz323&style=1&kf=&kflist=off&kf=&zdkf_type=1&language=cn&charset=utf-8&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://onlinecasinodd.com  http://dreamercenter.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://myiproperty.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://narutopedia.gonzalo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://stornlok.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://zamin.uz/engine/go.php?url=onlinecasinodd.com \nhttp://rolandfood.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://maritimeamerica.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://aybsaonline.org/Goto.asp?url=https://onlinecasinodd.com   http://quuke.com/index.php?g=Index&c=Recognition&a=see_login_qrcode&referer=https://onlinecasinodd.com  http://tripartisan.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gozo4less.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://vietnamantique.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://theinnerlite.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.parmentier.de/cgi-bin/link.cgi?https://onlinecasinodd.com \nhttp://mountain-song.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://astrogeology.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bambergerpolymers.gs/__media__/js/trademark.php?d=onlinecasinodd.com   http://dui-dwi-drunk-driving.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://v8tvshow.com/V8TV_2/modules/mod_jw_srfr/redir.php?url=https://onlinecasinodd.com   http://promos.meetlocals.com/geo/click.php?bannerid=&campaignid=&zoneid=&rurl=https://onlinecasinodd.com  http://de.trackitonline.org/away.php?to=https://onlinecasinodd.com  http://inventoryrevolution.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://benmarinteractive.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://galowich.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://billfrankel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.mzmzj.gov.cn/page/redirect.php?url=https://onlinecasinodd.com   http://jeanbarrylifecoach.maioid.com/cgi-bin/atc/out.cgi?s=60&u=/onlinecasinodd.com  http://www.kip-k.ru/best/sql.php?=onlinecasinodd.com   http://oscarlaw.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.shoppsi.no/wp-content/themes/shoppsi/cronjob/out.php?link=onlinecasinodd.com  http://hhsaudi.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://eagle-flag.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://マイクロセラミック.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://eastmarkalliance.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://glong.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://btgondemand.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hccitynet.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://shremployment.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://lauramatter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://files.medi-cal.ca.gov/pubsdoco/manuals_menu.asp?pg=&PgDwn=Yes&hurl=onlinecasinodd.com   http://calviciecr.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.webkatalog.m106.com/jump.php?sid=934947&url=https://onlinecasinodd.com  http://lemonlands.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.sweepstakelovers.com/promo/?url=https://onlinecasinodd.com   http://ut-austin-apartments.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.bookmrk.us/bookmark/?url=https://onlinecasinodd.com/   https://chel.kp.ru/go/https://onlinecasinodd.com  http://cellercise.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://deutschebecks.de/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://club937.com/login/?referer=https://onlinecasinodd.com \nhttp://stopcyberbullying.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nvk.rayhumancapital.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://remingtonsalon.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ulroc.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rodame.com/goto/https://onlinecasinodd.com   http://sumerinvestments.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://xrijf.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://makenacareconnection.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.razorone.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://michiganfilm411.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.ludonautes.fr/index.php?thememode=full;redirect=https://onlinecasinodd.com   http://nemosaic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://seensai.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.laptop-software.com/go.php?https://onlinecasinodd.com   http://windesign.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.daqiuw.com/index.php?c=reg&&referer=https://onlinecasinodd.com  http://theapparodeo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://fzphrsk.websl.cn/link.php?url=https://onlinecasinodd.com \n \n \n \n \n \nhttp://oolgaming.com/forum/showthread.php?tid=9662&pid=13442#pid13442\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php%20%20%20%20%20%20%20%20%20%20\nhttp://www.lg-gaming.net/forums/topic/sex-dating-in-purves-texas/\nhttps://beta.i4g.tech/showthread.php?tid=35924&pid=156225#pid156225\nhttps://tg.vl-mp.com/index.php?topic=168730.new#new\n", "language": "Lisp", "metadata": {"date": 1548838235, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s345634565.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s345634565", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.sheilasattic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jpxinteractive.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://marulofts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://m.51wzbj.com/home/link.php?url=https://onlinecasinodd.com  http://offshoreonly.co/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://megalac.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.emotiondv.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://impressedletterpress.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://worldrecordslist.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://myhealthriskappraisal.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://funthinker.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://datesofalmadina.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bitrix.infpol.ru/upload/bx/a12/240_400.swf?flash_link=onlinecasinodd.com  http://cityeventlink.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://appletonpapers.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://proventtherapy.sg/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://goldcoasthonda.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://codymaclake.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://www.blackbutteranchhoa.com/default.aspx?p=TrackHyperlink&url=https://onlinecasinodd.com  http://live-forums.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.thehathouse.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.xz323.com/dialog_1.htm?arg=xz323&style=1&kf=&kflist=off&kf=&zdkf_type=1&language=cn&charset=utf-8&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://onlinecasinodd.com  http://dreamercenter.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://myiproperty.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://narutopedia.gonzalo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://stornlok.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://zamin.uz/engine/go.php?url=onlinecasinodd.com \nhttp://rolandfood.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://maritimeamerica.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://aybsaonline.org/Goto.asp?url=https://onlinecasinodd.com   http://quuke.com/index.php?g=Index&c=Recognition&a=see_login_qrcode&referer=https://onlinecasinodd.com  http://tripartisan.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gozo4less.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://vietnamantique.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://theinnerlite.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.parmentier.de/cgi-bin/link.cgi?https://onlinecasinodd.com \nhttp://mountain-song.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://astrogeology.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bambergerpolymers.gs/__media__/js/trademark.php?d=onlinecasinodd.com   http://dui-dwi-drunk-driving.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://v8tvshow.com/V8TV_2/modules/mod_jw_srfr/redir.php?url=https://onlinecasinodd.com   http://promos.meetlocals.com/geo/click.php?bannerid=&campaignid=&zoneid=&rurl=https://onlinecasinodd.com  http://de.trackitonline.org/away.php?to=https://onlinecasinodd.com  http://inventoryrevolution.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://benmarinteractive.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://galowich.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://billfrankel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.mzmzj.gov.cn/page/redirect.php?url=https://onlinecasinodd.com   http://jeanbarrylifecoach.maioid.com/cgi-bin/atc/out.cgi?s=60&u=/onlinecasinodd.com  http://www.kip-k.ru/best/sql.php?=onlinecasinodd.com   http://oscarlaw.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.shoppsi.no/wp-content/themes/shoppsi/cronjob/out.php?link=onlinecasinodd.com  http://hhsaudi.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://eagle-flag.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://マイクロセラミック.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://eastmarkalliance.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://glong.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://btgondemand.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hccitynet.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://shremployment.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://lauramatter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://files.medi-cal.ca.gov/pubsdoco/manuals_menu.asp?pg=&PgDwn=Yes&hurl=onlinecasinodd.com   http://calviciecr.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.webkatalog.m106.com/jump.php?sid=934947&url=https://onlinecasinodd.com  http://lemonlands.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.sweepstakelovers.com/promo/?url=https://onlinecasinodd.com   http://ut-austin-apartments.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.bookmrk.us/bookmark/?url=https://onlinecasinodd.com/   https://chel.kp.ru/go/https://onlinecasinodd.com  http://cellercise.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://deutschebecks.de/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://club937.com/login/?referer=https://onlinecasinodd.com \nhttp://stopcyberbullying.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nvk.rayhumancapital.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://remingtonsalon.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ulroc.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rodame.com/goto/https://onlinecasinodd.com   http://sumerinvestments.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://xrijf.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://makenacareconnection.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.razorone.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://michiganfilm411.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.ludonautes.fr/index.php?thememode=full;redirect=https://onlinecasinodd.com   http://nemosaic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://seensai.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.laptop-software.com/go.php?https://onlinecasinodd.com   http://windesign.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.daqiuw.com/index.php?c=reg&&referer=https://onlinecasinodd.com  http://theapparodeo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://fzphrsk.websl.cn/link.php?url=https://onlinecasinodd.com \n \n \n \n \n \nhttp://oolgaming.com/forum/showthread.php?tid=9662&pid=13442#pid13442\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php%20%20%20%20%20%20%20%20%20%20\nhttp://www.lg-gaming.net/forums/topic/sex-dating-in-purves-texas/\nhttps://beta.i4g.tech/showthread.php?tid=35924&pid=156225#pid156225\nhttps://tg.vl-mp.com/index.php?topic=168730.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8122, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s615247147", "group_id": "codeNet:p03941", "input_text": "http://imesenpure.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://wexfordinstitute.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://codyaustin.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://montanawildthings.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://flvirtualeducation.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://horny-granny.com/cgi-bin/crtr/out.cgi?id=97&l=top_top&u=https://onlinecasinodd.com  http://www.shemalefucker.net/cgi-bin/tss/out.cgi?blink=tmx1x68x162088&p=50&u=https://onlinecasinodd.com  http://af-supply.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://portalstrips.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://www.aquadomspb.ru/bitrix/rk.php?id=2&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B2%5D+%5Ba2%5D+&goto=https://onlinecasinodd.com  http://m.mautofied.com/directory/go.asp?link=https://onlinecasinodd.com   https://sb-sale.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasinodd.com   http://blingboxes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://theirsearches.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://flightpenny.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://toyotaofomaha.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jenniferekrause.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.aboutchina.de/goto.php?seite=https://onlinecasinodd.com \nhttp://jainbills.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.kia.luckymotors.ru/bitrix/rk.php?id=666&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B666%5D+%5BNEW_INDEX_BANNERS%5D+%D1%CF+Kia+Finance&goto=onlinecasinodd.com   https://beaujxeusa.cf/kunde?referer=https://onlinecasinodd.com   http://bbs.cottontec.cn/uch/link.php?url=https://onlinecasinodd.com/  http://socket.qualitydesign.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://intelligent-ondemand.com/__media__/js/netsoltrademark.php?d=&popup=1onlinecasinodd.com  http://rytary.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://parkingreen.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://motortruckpaclease.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://keydigitalafrica.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://snapjan.com/away.php?url=https://onlinecasinodd.com   http://infinitibridgewater.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gainesvillesbuyerandsellerhomeinspectionguide.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://doultonwaterpurifiers.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://40009757.r.bat.bing.com/?ld=d3o50UaHadyLbcSmH34HBkKjVUCUw-E4ybeRiu-IFLKQ3ETlfRwCviYAF4DNuip57mb8qJmsNWhwQre0xvjLBMweQqdYPmClIlcdHQ3MW5-RzEGdVtplQJ-mzhfRSeYwhNLNCPRk4j3Hwaqi25cHbRc5SAP-GVOVDANoyiWTJ71D56qkNQ&u=https://onlinecasinodd.com  http://sqrl.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ihatedavidweekly.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://rhomebiz.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://investorcollector.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://whatart.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.gene-simmons.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.ceriale.gov.it/servizi/Menu/menu_redirect.aspx?url=https://onlinecasinodd.com/  http://imgapi.huaihai.tv/adv/click.php?a=doclick&url=https://onlinecasinodd.com   http://slippz.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://smoxy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://maps.google.co.tz/url?q=https://onlinecasinodd.com   http://marinaplasticsurgeryassociates.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://encouer.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://lingeriebriefs.com/wp-content/themes/lifestyle/brief-redirect.php?link_url=https://onlinecasinodd.com   http://drumstube.com/?go=click&c=214&n=26&e=0&g=3&r=22546843&u=https://onlinecasinodd.com   http://borderwalk.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://awellman.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://medica-corporation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tsuma.lti.jp/kyusyu/click.php?tcode=00014004&purl=https://onlinecasinodd.com  http://www.mywife.jp/ltp_out?id=06044&go=https://onlinecasinodd.com   http://eastmarkhandlebardiner.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.5kanao.com/go.php?url=https://onlinecasinodd.com  http://www.tocny.org/LinkClick.aspx?link=https://onlinecasinodd.com   http://pietheory.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ofcdistillery.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://newmutualismmaps.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://neriumfilm.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.webnews-industry.com/redirect-forward.php?ste=0&url=https://onlinecasinodd.com  http://www.earlychildhoodalliance.com/r?u=https://onlinecasinodd.com   http://volvo-club.eu/go.php?https://onlinecasinodd.com \nhttp://www.pregnant-links.com/cgi-bin/out.cgi?ses=LJaDGeiCMh&id=305&url=https://onlinecasinodd.com  http://fixyourhomepage.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://deepfamily.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bacon.church/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://deltavanlines.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.mallettinc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.smileandhelp.co.za/modules/mod_jw_srfr/redir.php?url=https://onlinecasinodd.com  http://chateau-lido.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://scottsdalelbdchallenge.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://generalstyle.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://softwaretoolbox.ch/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.sandsifter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.igainc.com/trackthis.aspx?id=31835&goto=https://onlinecasinodd.com  http://www.rz114.cn/url.html?url=https://onlinecasinodd.com   http://hdrmanager.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://qyh.alloysurfcaesinc.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ismailicentertoronto.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bawine-uncorked.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://vpatv.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.allemarketeers.nl/index.php?url=onlinecasinodd.com   http://schoenfeldtheater.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://chicago.business/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hotelsandpubs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.etfmanagement.com/glp?r=&u=https://onlinecasinodd.com  http://northwestcoffeeschool.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rivalsystem.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://wvv.academyofartfacultysucks.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://smf.theskepticalforum.com/index.php?topic=20359.new#new\nhttps://cialisprf.us/p/0230/\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=118626\nhttp://www.institutoleonygama.mx/foro/viewtopic.php?pid=238636#p238636\nhttps://giikah.com/forum/index.php?topic=19159.new#new\n", "language": "Lisp", "metadata": {"date": 1548820572, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s615247147.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s615247147", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://imesenpure.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://wexfordinstitute.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://codyaustin.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://montanawildthings.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://flvirtualeducation.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://horny-granny.com/cgi-bin/crtr/out.cgi?id=97&l=top_top&u=https://onlinecasinodd.com  http://www.shemalefucker.net/cgi-bin/tss/out.cgi?blink=tmx1x68x162088&p=50&u=https://onlinecasinodd.com  http://af-supply.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://portalstrips.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttps://www.aquadomspb.ru/bitrix/rk.php?id=2&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B2%5D+%5Ba2%5D+&goto=https://onlinecasinodd.com  http://m.mautofied.com/directory/go.asp?link=https://onlinecasinodd.com   https://sb-sale.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasinodd.com   http://blingboxes.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://theirsearches.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://flightpenny.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://toyotaofomaha.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jenniferekrause.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.aboutchina.de/goto.php?seite=https://onlinecasinodd.com \nhttp://jainbills.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.kia.luckymotors.ru/bitrix/rk.php?id=666&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B666%5D+%5BNEW_INDEX_BANNERS%5D+%D1%CF+Kia+Finance&goto=onlinecasinodd.com   https://beaujxeusa.cf/kunde?referer=https://onlinecasinodd.com   http://bbs.cottontec.cn/uch/link.php?url=https://onlinecasinodd.com/  http://socket.qualitydesign.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://intelligent-ondemand.com/__media__/js/netsoltrademark.php?d=&popup=1onlinecasinodd.com  http://rytary.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://parkingreen.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://motortruckpaclease.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://keydigitalafrica.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://snapjan.com/away.php?url=https://onlinecasinodd.com   http://infinitibridgewater.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gainesvillesbuyerandsellerhomeinspectionguide.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://doultonwaterpurifiers.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://40009757.r.bat.bing.com/?ld=d3o50UaHadyLbcSmH34HBkKjVUCUw-E4ybeRiu-IFLKQ3ETlfRwCviYAF4DNuip57mb8qJmsNWhwQre0xvjLBMweQqdYPmClIlcdHQ3MW5-RzEGdVtplQJ-mzhfRSeYwhNLNCPRk4j3Hwaqi25cHbRc5SAP-GVOVDANoyiWTJ71D56qkNQ&u=https://onlinecasinodd.com  http://sqrl.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ihatedavidweekly.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://rhomebiz.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://investorcollector.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://whatart.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.gene-simmons.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.ceriale.gov.it/servizi/Menu/menu_redirect.aspx?url=https://onlinecasinodd.com/  http://imgapi.huaihai.tv/adv/click.php?a=doclick&url=https://onlinecasinodd.com   http://slippz.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://smoxy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://maps.google.co.tz/url?q=https://onlinecasinodd.com   http://marinaplasticsurgeryassociates.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://encouer.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://lingeriebriefs.com/wp-content/themes/lifestyle/brief-redirect.php?link_url=https://onlinecasinodd.com   http://drumstube.com/?go=click&c=214&n=26&e=0&g=3&r=22546843&u=https://onlinecasinodd.com   http://borderwalk.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://awellman.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://medica-corporation.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tsuma.lti.jp/kyusyu/click.php?tcode=00014004&purl=https://onlinecasinodd.com  http://www.mywife.jp/ltp_out?id=06044&go=https://onlinecasinodd.com   http://eastmarkhandlebardiner.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.5kanao.com/go.php?url=https://onlinecasinodd.com  http://www.tocny.org/LinkClick.aspx?link=https://onlinecasinodd.com   http://pietheory.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ofcdistillery.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://newmutualismmaps.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://neriumfilm.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.webnews-industry.com/redirect-forward.php?ste=0&url=https://onlinecasinodd.com  http://www.earlychildhoodalliance.com/r?u=https://onlinecasinodd.com   http://volvo-club.eu/go.php?https://onlinecasinodd.com \nhttp://www.pregnant-links.com/cgi-bin/out.cgi?ses=LJaDGeiCMh&id=305&url=https://onlinecasinodd.com  http://fixyourhomepage.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://deepfamily.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bacon.church/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://deltavanlines.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.mallettinc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.smileandhelp.co.za/modules/mod_jw_srfr/redir.php?url=https://onlinecasinodd.com  http://chateau-lido.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://scottsdalelbdchallenge.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://generalstyle.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://softwaretoolbox.ch/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.sandsifter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.igainc.com/trackthis.aspx?id=31835&goto=https://onlinecasinodd.com  http://www.rz114.cn/url.html?url=https://onlinecasinodd.com   http://hdrmanager.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://qyh.alloysurfcaesinc.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ismailicentertoronto.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bawine-uncorked.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://vpatv.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.allemarketeers.nl/index.php?url=onlinecasinodd.com   http://schoenfeldtheater.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://chicago.business/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hotelsandpubs.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.etfmanagement.com/glp?r=&u=https://onlinecasinodd.com  http://northwestcoffeeschool.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rivalsystem.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://wvv.academyofartfacultysucks.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \n \n \n \n \n \nhttp://smf.theskepticalforum.com/index.php?topic=20359.new#new\nhttps://cialisprf.us/p/0230/\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=118626\nhttp://www.institutoleonygama.mx/foro/viewtopic.php?pid=238636#p238636\nhttps://giikah.com/forum/index.php?topic=19159.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7889, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s653260412", "group_id": "codeNet:p03941", "input_text": "https://allexme-test.tourister.ru/go?url=https://onlinecasinodd.com  http://www.skempton.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://blogdaycon.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://synergyo2oxigeno.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nsreg.com/?a<>=<a href=https://onlinecasinodd.com>free web space</a>   http://subarupartshouse.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://virtualrealtors.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://curyr.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://xfj.babystain.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://jp.izaodao.com/url.php?link=https://onlinecasinodd.com  http://tucori.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://apistrat.com/redir.php?url=https://onlinecasinodd.com   http://mcnp.blogsky.com/dailylink/?go=https://onlinecasinodd.com  http://www.sz991dj.cn/bbs/topic.aspx?forumid=26&bid=12060&backurl=onlinecasinodd.com   http://www.songwagon.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.farmbureau.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sklep.rms.pl/pliki/avtest/url.php?url=https://onlinecasinodd.com   http://baiduhotel.tw/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://elclassificado.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://neorablog.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.immobiliensicht.de/URL_Direct.php?url=https://onlinecasinodd.com   http://freespeechradio.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://educ-ca.com/vb/showthread.php?27243-Acquista-Rabestrom-Online&goto=onlinecasinodd.com   http://iaff-fc.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://johnstonbasketballclub.com/Goto.asp?url=https://onlinecasinodd.com  http://acer.nonore.com/go.php?url=https://onlinecasinodd.com   http://www.contrabox.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://funbid.ir/go/?url=https://onlinecasinodd.com/  http://houseboatvacations.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://chamoisdor.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://deepakdhakal.com/nepalifmvideo/NewsWrap.aspx?name=https://onlinecasinodd.com  http://ladymom.com/at3/out.cgi?id=343&tag=toplist&trade=https://onlinecasinodd.com   http://babyguess.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rosstraut.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://borken-live.de/advert.php?url=https://onlinecasinodd.com   http://tarbellrealtorsonline.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://naughtyturtle.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mega-joy.info/redirect.php?tid=9401&goto=onlinecasinodd.com   http://jiaoyou2.360sheji.cn/link.php?url=https://onlinecasinodd.com/   http://www.servigalia.com/empresas/goto.asp?ID=8961&redirect=https://onlinecasinodd.com  http://turkmd.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.hustetv.net/go_hustetv.asp?go=https://onlinecasinodd.com  http://anbieterportal.de/redirect.php?url=https://onlinecasinodd.com  http://christopherireland.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cypruseducation.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://greenbudgets.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://2018tube.com/?go=click&c=60&n=5CE9-4EB2-1RDF-8AC7&e=0&g=3&u=https://onlinecasinodd.com   https://www.mystikum.at/redirect.php?url=https://onlinecasinodd.com   http://www.healthyclub2020.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://swampfoxgear.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://creativityflow.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://art-of-the-heart.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://designaspec.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.datacard.es/includes/redirect.jsp?url=https://onlinecasinodd.com \nhttp://www.nosferatu-racing.co.uk/gbook/go.php?url=https://onlinecasinodd.com  http://audit.smoget.ru/redirect.php?url=https://onlinecasinodd.com   http://www.lexingtonnc.net/redirect.aspx?url=https://onlinecasinodd.com   http://out-the-window-adventures.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://1autodr.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.mclesfaucons.ch/LinkClick.aspx?link=https://onlinecasinodd.com  http://24hourscopyservices.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://qmk.eaglesmusic.tw/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://beckenhauer.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://gridlocksolutions.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ledwarninglights.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kayakhelmets.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.motorosbolt.hu/redirect.php?id=108515&link=onlinecasinodd.com  http://omijapankorea.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://csmscholarship.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.truesystem.ru/upload/rk/094/configuratorban_240x400_micro_g20.swf?flash_link=onlinecasinodd.com  http://downloadadvisory.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://support.vigilant1.com/LinkClick.aspx?link=https://onlinecasinodd.com \nhttp://click.vnn.bz/go.php?url=onlinecasinodd.com  http://rainydayfunds.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bksolar.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hsw00.vacau.com/home/link.php?url=https://onlinecasinodd.com  http://www.hitquarter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://xjm.davidevans.de/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.daqiuw.com/index.php?c=reg&&referer=https://onlinecasinodd.com  http://www.pta.wa.gov.au/LinkClick.aspx?link=https://onlinecasinodd.com   http://www.worldhealthassistancefoundation.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://southwestcruisecenter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rosetta-consulting.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.rtiindia.org/forum/redirect-to/?redirect=https://onlinecasinodd.com   http://lunarsong.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tax.cchgroup.com/store/redir.asp?cchdc=Y6937&url=https://onlinecasinodd.com   http://wecreatemusic.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.geodevelopment.ru/redirect/?url=https://onlinecasinodd.com  http://merriamsmartcar.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.xxx-ebony.com/cgi-bin/rb4/cout.cgi?url=https://onlinecasinodd.com \n \n \n \n \n \nhttp://niklever.com/spritoon/forum/viewtopic.php?f=5&t=170720\nhttps://entmuttert.com/2016/01/24/einfache-rechnung-kein-umgangdann-kein-unterhalt/\nhttp://women.yo.md/viewtopic.php?f=11&t=262292\nhttps://tg.vl-mp.com/index.php?topic=166187.new#new\nhttps://www.dangeroussports.com/forum/viewtopic.php?pid=216709#p216709\n", "language": "Lisp", "metadata": {"date": 1548814605, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s653260412.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s653260412", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://allexme-test.tourister.ru/go?url=https://onlinecasinodd.com  http://www.skempton.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://blogdaycon.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://synergyo2oxigeno.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://nsreg.com/?a<>=<a href=https://onlinecasinodd.com>free web space</a>   http://subarupartshouse.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://virtualrealtors.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://curyr.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://xfj.babystain.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://jp.izaodao.com/url.php?link=https://onlinecasinodd.com  http://tucori.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://apistrat.com/redir.php?url=https://onlinecasinodd.com   http://mcnp.blogsky.com/dailylink/?go=https://onlinecasinodd.com  http://www.sz991dj.cn/bbs/topic.aspx?forumid=26&bid=12060&backurl=onlinecasinodd.com   http://www.songwagon.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.farmbureau.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://sklep.rms.pl/pliki/avtest/url.php?url=https://onlinecasinodd.com   http://baiduhotel.tw/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://elclassificado.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://neorablog.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.immobiliensicht.de/URL_Direct.php?url=https://onlinecasinodd.com   http://freespeechradio.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://educ-ca.com/vb/showthread.php?27243-Acquista-Rabestrom-Online&goto=onlinecasinodd.com   http://iaff-fc.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://johnstonbasketballclub.com/Goto.asp?url=https://onlinecasinodd.com  http://acer.nonore.com/go.php?url=https://onlinecasinodd.com   http://www.contrabox.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://funbid.ir/go/?url=https://onlinecasinodd.com/  http://houseboatvacations.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://chamoisdor.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://deepakdhakal.com/nepalifmvideo/NewsWrap.aspx?name=https://onlinecasinodd.com  http://ladymom.com/at3/out.cgi?id=343&tag=toplist&trade=https://onlinecasinodd.com   http://babyguess.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rosstraut.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://borken-live.de/advert.php?url=https://onlinecasinodd.com   http://tarbellrealtorsonline.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://naughtyturtle.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mega-joy.info/redirect.php?tid=9401&goto=onlinecasinodd.com   http://jiaoyou2.360sheji.cn/link.php?url=https://onlinecasinodd.com/   http://www.servigalia.com/empresas/goto.asp?ID=8961&redirect=https://onlinecasinodd.com  http://turkmd.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.hustetv.net/go_hustetv.asp?go=https://onlinecasinodd.com  http://anbieterportal.de/redirect.php?url=https://onlinecasinodd.com  http://christopherireland.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cypruseducation.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://greenbudgets.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://2018tube.com/?go=click&c=60&n=5CE9-4EB2-1RDF-8AC7&e=0&g=3&u=https://onlinecasinodd.com   https://www.mystikum.at/redirect.php?url=https://onlinecasinodd.com   http://www.healthyclub2020.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://swampfoxgear.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://creativityflow.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://art-of-the-heart.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://designaspec.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.datacard.es/includes/redirect.jsp?url=https://onlinecasinodd.com \nhttp://www.nosferatu-racing.co.uk/gbook/go.php?url=https://onlinecasinodd.com  http://audit.smoget.ru/redirect.php?url=https://onlinecasinodd.com   http://www.lexingtonnc.net/redirect.aspx?url=https://onlinecasinodd.com   http://out-the-window-adventures.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://1autodr.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.mclesfaucons.ch/LinkClick.aspx?link=https://onlinecasinodd.com  http://24hourscopyservices.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://qmk.eaglesmusic.tw/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://beckenhauer.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://gridlocksolutions.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ledwarninglights.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://kayakhelmets.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.motorosbolt.hu/redirect.php?id=108515&link=onlinecasinodd.com  http://omijapankorea.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://csmscholarship.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.truesystem.ru/upload/rk/094/configuratorban_240x400_micro_g20.swf?flash_link=onlinecasinodd.com  http://downloadadvisory.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://support.vigilant1.com/LinkClick.aspx?link=https://onlinecasinodd.com \nhttp://click.vnn.bz/go.php?url=onlinecasinodd.com  http://rainydayfunds.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bksolar.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hsw00.vacau.com/home/link.php?url=https://onlinecasinodd.com  http://www.hitquarter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://xjm.davidevans.de/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.daqiuw.com/index.php?c=reg&&referer=https://onlinecasinodd.com  http://www.pta.wa.gov.au/LinkClick.aspx?link=https://onlinecasinodd.com   http://www.worldhealthassistancefoundation.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://southwestcruisecenter.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rosetta-consulting.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.rtiindia.org/forum/redirect-to/?redirect=https://onlinecasinodd.com   http://lunarsong.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tax.cchgroup.com/store/redir.asp?cchdc=Y6937&url=https://onlinecasinodd.com   http://wecreatemusic.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://www.geodevelopment.ru/redirect/?url=https://onlinecasinodd.com  http://merriamsmartcar.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.xxx-ebony.com/cgi-bin/rb4/cout.cgi?url=https://onlinecasinodd.com \n \n \n \n \n \nhttp://niklever.com/spritoon/forum/viewtopic.php?f=5&t=170720\nhttps://entmuttert.com/2016/01/24/einfache-rechnung-kein-umgangdann-kein-unterhalt/\nhttp://women.yo.md/viewtopic.php?f=11&t=262292\nhttps://tg.vl-mp.com/index.php?topic=166187.new#new\nhttps://www.dangeroussports.com/forum/viewtopic.php?pid=216709#p216709\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7399, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s363882464", "group_id": "codeNet:p03941", "input_text": "http://buildadashboard.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.deepstop-dive.com/__media__/js/trademark.php?d=onlinecasinodd.com   http://469bc.co.uk/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://charlottesvillevaattorneys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.hklawpage.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.mirroronamerica.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://menswarhouse.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://chefsdepot.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://thepleasurekit.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://flcolo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.zscarpe.transpraia.pt/out.php?url=onlinecasinodd.com   http://strictlymetalprints.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://m.hicbc.com/i/files/acj/?url=https://onlinecasinodd.com  http://www.jasper-van-t-hof.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://graysonpartners.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://media.wiki-media.nl/click.php?id=10309&adurl=https://onlinecasinodd.com  http://www.mzmzj.gov.cn/page/redirect.php?url=https://onlinecasinodd.com   http://monptc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.ipeoplenet.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.zhuhaionline.net/bbs//redirect.php?tid=97063&goto=onlinecasinodd.com   http://everydayhookup.acquintus-investment.de/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gayboystwink.top/sr/out.php?l=0s.1.99.465.740&u=/onlinecasinodd.com  http://pcvbns.co/2048/goto.php?url=onlinecasinodd.com   https://fortyseven-dot-yamm-track.appspot.com/Redirect?ukey=1Vx3EDdNuxBY9ytx6t3RXzRyp_Sx5gufAL8k0SUA1d4M-2061394289&key=YAMMID-29464374&link=https://onlinecasinodd.com  http://haywintech.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://midwestwhitetailtv.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://jaylas.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://steelopolis.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://1worldhistory.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://m.shopinlasvegas.net/redirect.aspx?url=onlinecasinodd.com   http://onyourlist.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://donovanpainting.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bondvaluationreport.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://789film.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.new.nettfront.hu/new/hu/termek-kategoriak/askquestion/form?category_id=37&product_id=13&type=0&actual_type_ask=1&tmpl=component&referer=https://onlinecasinodd.com   http://www.correctweb.de/bitrix/redirect.php?event1=referenzen_out&event2=stark-it&event3=&goto=https://onlinecasinodd.com \nhttp://derluftmodel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://bestcarpetcleaneratlanta.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://rjh.dotcalmpromotions.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://alisonanderson.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.forumterzosettore.it/admanager/go.php?url=https://onlinecasinodd.com   http://iux.atlanticandgulf.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://axanet.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://howard.fastcommand.com/goto.php?url=onlinecasinodd.com   http://alabamacreditunion.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://walktoendlupus.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://business.gov.kz/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fwww.pma.kz&event3=%D0%9F%D0%9C%D0%90+%D0%A2%D0%9E%D0%9E&goto=https://onlinecasinodd.com   http://lowehospitalitygroup.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.bazakabel.ru/bitrix/redirect.php?event1=catalog_out&event2=http://www.вира-групп.рф&event3=ООО+&quot;ВИРА-ГРУПП&quot;&goto=https://onlinecasinodd.com  http://everypropertylisted.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://imop.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.oldtownoil.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://noras.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://jdq.mbeams.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://nautilus.inews.it/0111it/AdRedir.asp?url=https://onlinecasinodd.com/  http://www.coinsarefun.com/forums/index.php?thememode=full;redirect=https://onlinecasinodd.com   http://k2pi.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.oyeoye.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://linesell.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.btckan.com/redirect?url=https://onlinecasinodd.com  http://westcoastcannabisexchange.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.donations.com.au/redirect.asp?n=4072&u=https://onlinecasinodd.com   http://shadowglentexas.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://sauceboy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.preston-grangecc.org.uk/goto-link.php?link_id=13&url=https://onlinecasinodd.com   http://thegardenpalette.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://edusoftware.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.runagainsthunger.org/LinkClick.aspx?link=https://onlinecasinodd.com   http://fisherinvestmentpress.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.yysf.cc/go.php?url=https://onlinecasinodd.com  http://backupacronis.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://onhiv.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://qcf.greenworld.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hooked-on-reading.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://3pillar.eu/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://pacificstarbuck.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.cwedwardsfuneralhome.com/cfi/addthis_email.cfm?url=https://onlinecasinodd.com   https://mobile.uwants.com/redirect.php?tid=11359675&goto=onlinecasinodd.com  http://bridielogue.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://saveyourconcrete.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hoosierbeekeeper.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://chief-security-officer.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jerkoffer.com/cgi-bin/crtr/out.cgi?id=407&l=top&u=https://onlinecasinodd.com   http://olmoneybags.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.eastportyc.org/default.aspx?p=TrackHyperlink&url=https://onlinecasinodd.com  http://orois.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://laspas.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://newyorkhelicopterattorneys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.nikionly.com/upskirttop/out.cgi?ses=lcckqzbUV0&id=38&url=https://onlinecasinodd.com   http://m.www.666movies.com/cgi-bin/atl/out.cgi?s=60&u=https://onlinecasinodd.com \n \n \n \n \n \nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttp://ru-realty.com/forum/index.php?topic=49196.new#new\nhttps://www.knownothing.net/community2/index.php/topic,159726.new.html#new\nhttps://csrworldnews.com/forum/index.php?topic=21204.new#new\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=50860\n", "language": "Lisp", "metadata": {"date": 1548802698, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s363882464.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s363882464", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://buildadashboard.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.deepstop-dive.com/__media__/js/trademark.php?d=onlinecasinodd.com   http://469bc.co.uk/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://charlottesvillevaattorneys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.hklawpage.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.mirroronamerica.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://menswarhouse.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://chefsdepot.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://thepleasurekit.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://flcolo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.zscarpe.transpraia.pt/out.php?url=onlinecasinodd.com   http://strictlymetalprints.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://m.hicbc.com/i/files/acj/?url=https://onlinecasinodd.com  http://www.jasper-van-t-hof.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://graysonpartners.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://media.wiki-media.nl/click.php?id=10309&adurl=https://onlinecasinodd.com  http://www.mzmzj.gov.cn/page/redirect.php?url=https://onlinecasinodd.com   http://monptc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.ipeoplenet.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.zhuhaionline.net/bbs//redirect.php?tid=97063&goto=onlinecasinodd.com   http://everydayhookup.acquintus-investment.de/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gayboystwink.top/sr/out.php?l=0s.1.99.465.740&u=/onlinecasinodd.com  http://pcvbns.co/2048/goto.php?url=onlinecasinodd.com   https://fortyseven-dot-yamm-track.appspot.com/Redirect?ukey=1Vx3EDdNuxBY9ytx6t3RXzRyp_Sx5gufAL8k0SUA1d4M-2061394289&key=YAMMID-29464374&link=https://onlinecasinodd.com  http://haywintech.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://midwestwhitetailtv.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://jaylas.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://steelopolis.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://1worldhistory.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://m.shopinlasvegas.net/redirect.aspx?url=onlinecasinodd.com   http://onyourlist.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://donovanpainting.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bondvaluationreport.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://789film.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.new.nettfront.hu/new/hu/termek-kategoriak/askquestion/form?category_id=37&product_id=13&type=0&actual_type_ask=1&tmpl=component&referer=https://onlinecasinodd.com   http://www.correctweb.de/bitrix/redirect.php?event1=referenzen_out&event2=stark-it&event3=&goto=https://onlinecasinodd.com \nhttp://derluftmodel.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://bestcarpetcleaneratlanta.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://rjh.dotcalmpromotions.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://alisonanderson.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.forumterzosettore.it/admanager/go.php?url=https://onlinecasinodd.com   http://iux.atlanticandgulf.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://axanet.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://howard.fastcommand.com/goto.php?url=onlinecasinodd.com   http://alabamacreditunion.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://walktoendlupus.us/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://business.gov.kz/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fwww.pma.kz&event3=%D0%9F%D0%9C%D0%90+%D0%A2%D0%9E%D0%9E&goto=https://onlinecasinodd.com   http://lowehospitalitygroup.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.bazakabel.ru/bitrix/redirect.php?event1=catalog_out&event2=http://www.вира-групп.рф&event3=ООО+&quot;ВИРА-ГРУПП&quot;&goto=https://onlinecasinodd.com  http://everypropertylisted.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://imop.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.oldtownoil.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://noras.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://jdq.mbeams.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://nautilus.inews.it/0111it/AdRedir.asp?url=https://onlinecasinodd.com/  http://www.coinsarefun.com/forums/index.php?thememode=full;redirect=https://onlinecasinodd.com   http://k2pi.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.oyeoye.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://linesell.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.btckan.com/redirect?url=https://onlinecasinodd.com  http://westcoastcannabisexchange.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.donations.com.au/redirect.asp?n=4072&u=https://onlinecasinodd.com   http://shadowglentexas.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://sauceboy.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.preston-grangecc.org.uk/goto-link.php?link_id=13&url=https://onlinecasinodd.com   http://thegardenpalette.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://edusoftware.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.runagainsthunger.org/LinkClick.aspx?link=https://onlinecasinodd.com   http://fisherinvestmentpress.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.yysf.cc/go.php?url=https://onlinecasinodd.com  http://backupacronis.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://onhiv.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://qcf.greenworld.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://hooked-on-reading.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://3pillar.eu/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://pacificstarbuck.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.cwedwardsfuneralhome.com/cfi/addthis_email.cfm?url=https://onlinecasinodd.com   https://mobile.uwants.com/redirect.php?tid=11359675&goto=onlinecasinodd.com  http://bridielogue.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://saveyourconcrete.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://hoosierbeekeeper.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://chief-security-officer.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://jerkoffer.com/cgi-bin/crtr/out.cgi?id=407&l=top&u=https://onlinecasinodd.com   http://olmoneybags.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.eastportyc.org/default.aspx?p=TrackHyperlink&url=https://onlinecasinodd.com  http://orois.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://laspas.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://newyorkhelicopterattorneys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.nikionly.com/upskirttop/out.cgi?ses=lcckqzbUV0&id=38&url=https://onlinecasinodd.com   http://m.www.666movies.com/cgi-bin/atl/out.cgi?s=60&u=https://onlinecasinodd.com \n \n \n \n \n \nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttp://ru-realty.com/forum/index.php?topic=49196.new#new\nhttps://www.knownothing.net/community2/index.php/topic,159726.new.html#new\nhttps://csrworldnews.com/forum/index.php?topic=21204.new#new\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=50860\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7965, "cpu_time_ms": 93, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s977452295", "group_id": "codeNet:p03941", "input_text": "http://acerbrag.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.trafficguardbollards.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://fastautoloanaz.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://3dlaboratory.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://72.52.124.217/redirect.php?fid=116&tid=355672&goto=onlinecasinodd.com   http://reg2.hcu.ac.th/uchome/link.php?url=https://onlinecasinodd.com  http://www.fming.cc/home/link.php?url=https://onlinecasinodd.com  http://nsi-products.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://duluthchevrolet.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://pinsk.by/bitrix/rk.php?goto=https://onlinecasinodd.com  http://gsh-ideen.de/cms/?redirect&url=https://onlinecasinodd.com   http://www.moreafinancial.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://michaelfingold.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.shouyao123.com/Goto.asp?url=https://onlinecasinodd.com   http://comfortscience.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.energyislove.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://b2consulting.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bobschophouse.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://intl1percent.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://accountantstoday.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.alkousy.com/showthread.php?9898-Discounts!-beauty-finds&goto=onlinecasinodd.com   http://amerisbank.life/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://elulagiftshop.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://wtk.designersdirect.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://snaptions.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://antivivisection.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://docport.columbia-stmarys.org/LinkClick.aspx?link=https://onlinecasinodd.com \nhttp://pcbgames.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://960546.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cafecabaret.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.stripeymedia.equinefoundation.ca/cgi-bin/crtr/out.cgi?id=98&l=top_top&u=/onlinecasinodd.com  https://kia.kanavto.ru/bitrix/rk.php?id=601&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B601%5D+%5BNEW_INDEX_BANNERS%5D+%CB%E8%E7%E8%ED%E3+Finance&goto=onlinecasinodd.com   http://garciaselect.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ssl.realworld.jp/auth/?control=http%3A%2F%2Fwww.gendama.jp%2Frws%2Fsession.php&goto=https://onlinecasinodd.com  http://catalog15.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://thesockclub.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://halloffamemusic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.gaymovielist.com/cgi-bin/atx/out.cgi?id=182&tag=toplist&trade=https://onlinecasinodd.com   http://www.yourrealestatefriend.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://injury-lawyer.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://iviebag.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://lapin.co/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.xhamporn.com/out/4804970.php?channel=5&room=176&identify=292662&url=https://onlinecasinodd.com  http://onestepsurety.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.pimacon2017.com/refer.aspx?q=https://onlinecasinodd.com \nhttp://rauccatoma.mott.pe/redirect.php?url=https://onlinecasinodd.com  http://oldindianstuff.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://je7.decisionsdecisions-inc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://metalpricesart.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://visibilityassociates.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://brooklineapts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rlmnyc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://holidaycruisesandtours.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gzbeautyimportexportexpo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://eightyseven.mobi/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://xbq.extremeflying.eu/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.naturaltranssexuals.com/cgi-bin/a2/out.cgi?id=97&l=toplist&u=https://onlinecasinodd.com   http://crisisreadyreport.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.legistat.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://salesjobs.jp/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://thegrandview.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://knxv.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://luvuwater.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.gzhtcm.com/bbs/r.php?r=https://onlinecasinodd.com  http://lihplug.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://alienworksltd.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://redpointvc.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://centralpanasonic.com.mx/bitrix/rk.php?id=24&event1=banner&event2=click&event3=1+%2F+%5B24%5D+%5B670x120%5D+App+Blu-ray&goto=https://onlinecasinodd.com   http://rifaatalassad.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://646.sheesha.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mydentalblue.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bransoncondorentals.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://sig.marm.es/93/PrintServer/Default.aspx?url=https://onlinecasinodd.com  http://glutenfree-foodies.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://yellowgoldalloys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://goodsretailers.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://eyo.olympictorch.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://mylancns.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pierrekarlpeladeau.eu/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.ftb.pl/redirect.asp?typ=link&url=https://onlinecasinodd.com   http://your-mart.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://mycareerexplorer.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tmacareernet.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.borderknowlege.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://getprihce.gq/go.php?url=https://onlinecasinodd.com  http://globex-holding.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ws.jmsjqzf.gov.cn:8081/icity/uc/login?goto=https://onlinecasinodd.com  https://myg.vn/oauth/LoginVtc.aspx?url=https://onlinecasinodd.com  http://kidscoverups.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.gushitw.cn/sns/link.php?url=https://onlinecasinodd.com \n \n \n \n \n \nhttp://www.nerds73.org/NERDS_forum/index.php?topic=47195.new#new\nhttp://www.thorinfamily.net/archives/72#comment-16482\nhttp://royalmotorscrew.com/viewtopic.php?f=2&t=18289\nhttp://www.test.fairy-tales.org/viewtopic.php?f=2&t=1857305\nhttp://legalize.co/listings/diem-cannabis-dispensary-salem/#comment-1727\n", "language": "Lisp", "metadata": {"date": 1548790731, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s977452295.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s977452295", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://acerbrag.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.trafficguardbollards.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://fastautoloanaz.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://3dlaboratory.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://72.52.124.217/redirect.php?fid=116&tid=355672&goto=onlinecasinodd.com   http://reg2.hcu.ac.th/uchome/link.php?url=https://onlinecasinodd.com  http://www.fming.cc/home/link.php?url=https://onlinecasinodd.com  http://nsi-products.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://duluthchevrolet.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://pinsk.by/bitrix/rk.php?goto=https://onlinecasinodd.com  http://gsh-ideen.de/cms/?redirect&url=https://onlinecasinodd.com   http://www.moreafinancial.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://michaelfingold.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.shouyao123.com/Goto.asp?url=https://onlinecasinodd.com   http://comfortscience.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.energyislove.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://b2consulting.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bobschophouse.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://intl1percent.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://accountantstoday.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.alkousy.com/showthread.php?9898-Discounts!-beauty-finds&goto=onlinecasinodd.com   http://amerisbank.life/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://elulagiftshop.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://wtk.designersdirect.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://snaptions.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://antivivisection.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://docport.columbia-stmarys.org/LinkClick.aspx?link=https://onlinecasinodd.com \nhttp://pcbgames.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://960546.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://cafecabaret.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.stripeymedia.equinefoundation.ca/cgi-bin/crtr/out.cgi?id=98&l=top_top&u=/onlinecasinodd.com  https://kia.kanavto.ru/bitrix/rk.php?id=601&site_id=s3&event1=banner&event2=click&event3=1+%2F+%5B601%5D+%5BNEW_INDEX_BANNERS%5D+%CB%E8%E7%E8%ED%E3+Finance&goto=onlinecasinodd.com   http://garciaselect.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://ssl.realworld.jp/auth/?control=http%3A%2F%2Fwww.gendama.jp%2Frws%2Fsession.php&goto=https://onlinecasinodd.com  http://catalog15.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://thesockclub.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://halloffamemusic.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.gaymovielist.com/cgi-bin/atx/out.cgi?id=182&tag=toplist&trade=https://onlinecasinodd.com   http://www.yourrealestatefriend.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://injury-lawyer.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://iviebag.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://lapin.co/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.xhamporn.com/out/4804970.php?channel=5&room=176&identify=292662&url=https://onlinecasinodd.com  http://onestepsurety.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   https://www.pimacon2017.com/refer.aspx?q=https://onlinecasinodd.com \nhttp://rauccatoma.mott.pe/redirect.php?url=https://onlinecasinodd.com  http://oldindianstuff.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://je7.decisionsdecisions-inc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://metalpricesart.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://visibilityassociates.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://brooklineapts.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://rlmnyc.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://holidaycruisesandtours.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://gzbeautyimportexportexpo.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://eightyseven.mobi/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://xbq.extremeflying.eu/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.naturaltranssexuals.com/cgi-bin/a2/out.cgi?id=97&l=toplist&u=https://onlinecasinodd.com   http://crisisreadyreport.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.legistat.org/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://salesjobs.jp/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://thegrandview.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://knxv.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://luvuwater.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://www.gzhtcm.com/bbs/r.php?r=https://onlinecasinodd.com  http://lihplug.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://alienworksltd.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://redpointvc.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  https://centralpanasonic.com.mx/bitrix/rk.php?id=24&event1=banner&event2=click&event3=1+%2F+%5B24%5D+%5B670x120%5D+App+Blu-ray&goto=https://onlinecasinodd.com   http://rifaatalassad.net/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://646.sheesha.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://mydentalblue.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://bransoncondorentals.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://sig.marm.es/93/PrintServer/Default.aspx?url=https://onlinecasinodd.com  http://glutenfree-foodies.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://yellowgoldalloys.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://goodsretailers.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://eyo.olympictorch.biz/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://mylancns.info/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://pierrekarlpeladeau.eu/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://www.ftb.pl/redirect.asp?typ=link&url=https://onlinecasinodd.com   http://your-mart.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com \nhttp://mycareerexplorer.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com  http://tmacareernet.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.borderknowlege.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://getprihce.gq/go.php?url=https://onlinecasinodd.com  http://globex-holding.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://ws.jmsjqzf.gov.cn:8081/icity/uc/login?goto=https://onlinecasinodd.com  https://myg.vn/oauth/LoginVtc.aspx?url=https://onlinecasinodd.com  http://kidscoverups.com/__media__/js/netsoltrademark.php?d=onlinecasinodd.com   http://www.gushitw.cn/sns/link.php?url=https://onlinecasinodd.com \n \n \n \n \n \nhttp://www.nerds73.org/NERDS_forum/index.php?topic=47195.new#new\nhttp://www.thorinfamily.net/archives/72#comment-16482\nhttp://royalmotorscrew.com/viewtopic.php?f=2&t=18289\nhttp://www.test.fairy-tales.org/viewtopic.php?f=2&t=1857305\nhttp://legalize.co/listings/diem-cannabis-dispensary-salem/#comment-1727\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7746, "cpu_time_ms": 97, "memory_kb": 9312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s837475626", "group_id": "codeNet:p03941", "input_text": "http://www.trapola.com/click.php?url=https://playonlinecasino.us.org  http://knowledgepaks.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://2yny.com/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org   http://tphglobalsolutions.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://nphilly.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://digitalcash.club/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bbs.cfish.idv.tw/link.php?url=https://playonlinecasino.us.org  http://sunmizer.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cowper.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.standaard.be/plus/login?goto=https://playonlinecasino.us.org  http://thehebrewhomeathome.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://bff.orangehairedboy.com/flang.php?url=https://playonlinecasino.us.org   http://toastedalmond.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://usporn.tv/cgi-bin/atl/out.cgi?id=33&trade=https://playonlinecasino.us.org   http://www.cwh-cpa.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.bestsalsashoes.com/shoes/redirect.asp?linkid=22&url=https://playonlinecasino.us.org  http://www.e-hits.org/oempro/link.php?url=playonlinecasino.us.org   http://my.cdm.depaul.edu/shared/redirect.asp?url=https://playonlinecasino.us.org \nhttp://sneddonandson.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://guest-satisfaction.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://medifastmaplegrovemn.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://byrontownshiplittleleague.org/Goto.asp?url=https://playonlinecasino.us.org  http://www.coastalgaindicators.org/redir.php?url=https://playonlinecasino.us.org   http://mypyramidhouse.com/LinkClick.aspx?link=https://playonlinecasino.us.org  http://waltersholdings.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://rbcandwbc.blogsky.com/dailylink/?go=https://playonlinecasino.us.org   http://www.thaitoeng.com/redirect.php?blog=%E0%B9%80%E0%B8%99%E0%B8%B7%E0%B9%89%E0%B8%AD%E0%B9%80%E0%B8%9E%E0%B8%A5%E0%B8%87%E0%B8%AA%E0%B8%B2%E0%B8%81%E0%B8%A5%E0%B8%9E%E0%B8%A3%E0%B9%89%E0%B8%AD%E0%B8%A1%E0%B8%84%E0%B8%B3%E0%B8%AD%E0%B9%88%E0%B8%B2%E0%B8%99&url=https://playonlinecasino.us.org \nhttp://selenihouse.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://deannajordan.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rubberstamping.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://carmodelsworld.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://travelpotentials.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.perfektibilistenorden.de/topic.php?id=2694&goto=playonlinecasino.us.org  http://www.topsamachar.com/redirect.php?url=https://playonlinecasino.us.org  http://marieasimon.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.cmsignal.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://julianlennon.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://jpxinteractive.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://foxpotns.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://wellsvideo.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://renorealestatesales.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://courtyardbuckhead.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://catalog.alfikmv.ru/redirect.php?url=playonlinecasino.us.org  http://www.shejirenshudian.com/go/?url=https://playonlinecasino.us.org   http://www.webyam.com/redirect.php?id=ff3ac92305031e0a6835bc217495dfb0&url=https://playonlinecasino.us.org \nhttp://officialbruckheimertv.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://lionassociates.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://gorodsp55.com/redirect.php?url=playonlinecasino.us.org   http://fromafriendyoudontknow.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://barbarahardesty.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.marylandspending.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://playerempathy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wildwoodseries.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.ec-central.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.360gradi.info/scripts/ads.php?url=https://playonlinecasino.us.org  http://thetruffle.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://mynikevisitvisit-na.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rk-gamer.clan.su/go?https://playonlinecasino.us.org  http://sturgilllaw.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.flagshipburning.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://healthcareexpert.tv/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.rocknrolltraveler.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://petresorts.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://hinflorida.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://recanati.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://zhavari.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://aquareller.com/go.php?https://playonlinecasino.us.org  http://peacelovelight.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://bobfidler.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mrimedrealty.com/?goto=https://playonlinecasino.us.org  http://club42.ru/out.php?link=https://playonlinecasino.us.org   https://www.uinterview.com/out.php?url=https://playonlinecasino.us.org \nhttp://www.express-bloemen.be/tag/go.php?mc=euroflorist&sid=playonlinecasino.us.org  http://dynamicbarcoder.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.stmichaels-hamlet.org.uk/goto-link.php?link_id=15&url=https://playonlinecasino.us.org   http://www.raft-tether.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://masterslimousine.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://zeropointsacredstones.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mymyopiacontrol.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mustangherd.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://dues.difurnace.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttps://www.ewuxiu.com/go.html?url=https://playonlinecasino.us.org  http://7ooo.ru/engine/redirect.php?url=https://playonlinecasino.us.org   http://www.dnfeaft.top/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kkdistribution.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://stjohnscaterham.org.uk/goto-link.php?link_id=11&url=https://playonlinecasino.us.org   http://convertcom.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.cps800.com/advertising/adviewrecord.asp?id=13&url=https://playonlinecasino.us.org  http://thegreekcowboy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://pamelabrown.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://operationimpossibleboy.rachelshaven.com/index.php?topic=41264.new#new\nhttp://cnywarlock.com/forum/index.php?topic=70768.new#new\nhttp://smf.theskepticalforum.com/index.php?topic=16180.new#new\nhttp://omen.im/forum/index.php?topic=34217.new#new\nhttp://shinobinomorto.xaa.pl/viewtopic.php?f=35&t=10578\n", "language": "Lisp", "metadata": {"date": 1548728805, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s837475626.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s837475626", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.trapola.com/click.php?url=https://playonlinecasino.us.org  http://knowledgepaks.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://2yny.com/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org   http://tphglobalsolutions.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://nphilly.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://digitalcash.club/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bbs.cfish.idv.tw/link.php?url=https://playonlinecasino.us.org  http://sunmizer.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cowper.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.standaard.be/plus/login?goto=https://playonlinecasino.us.org  http://thehebrewhomeathome.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://bff.orangehairedboy.com/flang.php?url=https://playonlinecasino.us.org   http://toastedalmond.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://usporn.tv/cgi-bin/atl/out.cgi?id=33&trade=https://playonlinecasino.us.org   http://www.cwh-cpa.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.bestsalsashoes.com/shoes/redirect.asp?linkid=22&url=https://playonlinecasino.us.org  http://www.e-hits.org/oempro/link.php?url=playonlinecasino.us.org   http://my.cdm.depaul.edu/shared/redirect.asp?url=https://playonlinecasino.us.org \nhttp://sneddonandson.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://guest-satisfaction.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://medifastmaplegrovemn.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://byrontownshiplittleleague.org/Goto.asp?url=https://playonlinecasino.us.org  http://www.coastalgaindicators.org/redir.php?url=https://playonlinecasino.us.org   http://mypyramidhouse.com/LinkClick.aspx?link=https://playonlinecasino.us.org  http://waltersholdings.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://rbcandwbc.blogsky.com/dailylink/?go=https://playonlinecasino.us.org   http://www.thaitoeng.com/redirect.php?blog=%E0%B9%80%E0%B8%99%E0%B8%B7%E0%B9%89%E0%B8%AD%E0%B9%80%E0%B8%9E%E0%B8%A5%E0%B8%87%E0%B8%AA%E0%B8%B2%E0%B8%81%E0%B8%A5%E0%B8%9E%E0%B8%A3%E0%B9%89%E0%B8%AD%E0%B8%A1%E0%B8%84%E0%B8%B3%E0%B8%AD%E0%B9%88%E0%B8%B2%E0%B8%99&url=https://playonlinecasino.us.org \nhttp://selenihouse.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://deannajordan.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rubberstamping.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://carmodelsworld.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://travelpotentials.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.perfektibilistenorden.de/topic.php?id=2694&goto=playonlinecasino.us.org  http://www.topsamachar.com/redirect.php?url=https://playonlinecasino.us.org  http://marieasimon.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.cmsignal.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://julianlennon.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://jpxinteractive.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://foxpotns.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://wellsvideo.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://renorealestatesales.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://courtyardbuckhead.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://catalog.alfikmv.ru/redirect.php?url=playonlinecasino.us.org  http://www.shejirenshudian.com/go/?url=https://playonlinecasino.us.org   http://www.webyam.com/redirect.php?id=ff3ac92305031e0a6835bc217495dfb0&url=https://playonlinecasino.us.org \nhttp://officialbruckheimertv.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://lionassociates.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://gorodsp55.com/redirect.php?url=playonlinecasino.us.org   http://fromafriendyoudontknow.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://barbarahardesty.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.marylandspending.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://playerempathy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wildwoodseries.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.ec-central.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.360gradi.info/scripts/ads.php?url=https://playonlinecasino.us.org  http://thetruffle.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://mynikevisitvisit-na.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rk-gamer.clan.su/go?https://playonlinecasino.us.org  http://sturgilllaw.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.flagshipburning.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://healthcareexpert.tv/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.rocknrolltraveler.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://petresorts.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://hinflorida.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://recanati.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://zhavari.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://aquareller.com/go.php?https://playonlinecasino.us.org  http://peacelovelight.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://bobfidler.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mrimedrealty.com/?goto=https://playonlinecasino.us.org  http://club42.ru/out.php?link=https://playonlinecasino.us.org   https://www.uinterview.com/out.php?url=https://playonlinecasino.us.org \nhttp://www.express-bloemen.be/tag/go.php?mc=euroflorist&sid=playonlinecasino.us.org  http://dynamicbarcoder.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.stmichaels-hamlet.org.uk/goto-link.php?link_id=15&url=https://playonlinecasino.us.org   http://www.raft-tether.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://masterslimousine.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://zeropointsacredstones.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mymyopiacontrol.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mustangherd.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://dues.difurnace.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttps://www.ewuxiu.com/go.html?url=https://playonlinecasino.us.org  http://7ooo.ru/engine/redirect.php?url=https://playonlinecasino.us.org   http://www.dnfeaft.top/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kkdistribution.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://stjohnscaterham.org.uk/goto-link.php?link_id=11&url=https://playonlinecasino.us.org   http://convertcom.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.cps800.com/advertising/adviewrecord.asp?id=13&url=https://playonlinecasino.us.org  http://thegreekcowboy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://pamelabrown.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://operationimpossibleboy.rachelshaven.com/index.php?topic=41264.new#new\nhttp://cnywarlock.com/forum/index.php?topic=70768.new#new\nhttp://smf.theskepticalforum.com/index.php?topic=16180.new#new\nhttp://omen.im/forum/index.php?topic=34217.new#new\nhttp://shinobinomorto.xaa.pl/viewtopic.php?f=35&t=10578\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8029, "cpu_time_ms": 93, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s576132203", "group_id": "codeNet:p03941", "input_text": "http://www.aaatowing.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://gpgtools.blogsky.com/dailylink/?go=https://playonlinecasino.us.org   http://www.porrfilmtillalla.com/ept/out.php?f=1&pct=50&url=https://playonlinecasino.us.org   http://sm-sinavi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://oscarlaw.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://speaklike.in/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://images.google.kz/url?q=https://playonlinecasino.us.org  http://crm-resource.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://mbq.driverslink.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://hann.me/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://goldcountrymooneyflyin.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://startupbermuda.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://pictureripper.com/Forum/External/?url=https://playonlinecasino.us.org  http://taxisty.club/bitrix/rk.php?id=1&event1=banner&event2=click&goto=https://playonlinecasino.us.org   http://ideaenterprise.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://renaissancelasvegas.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://brown-brothers-harriman.de/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.openmypc.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://fire-holding.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://klantenportal.sightlandscaping.nl/shortcuts/sendlinkmessage.aspx?url=https://playonlinecasino.us.org   http://www.milliondollars.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://foodworthy.photos/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://niq.sicklecell.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.impressio-print.ro/index.php/component/k2/item/13-codecanyon?fromurl=playonlinecasino.us.org  http://minoritypeopleunited.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.dansmovies.com/tp/out.php?link=tubeindex&p=95&url=https://playonlinecasino.us.org   http://jdmcapitaladvisors.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://zappamoustache.de/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ishould.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://copiainteractive.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://thelawsofthought.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://amctotalrewards.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://dfwhealth.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://plantablepromotion.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://plygemholdings.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://internationalsalesforce.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://mydamnlife.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://geglmworks.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://e-enstitu.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://audienceresponsekeypads.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://apparts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://boomerlane.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mynetlabels.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://e-hampton.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://epic-research.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://parenting.goldenarticles.net/go.php?url=https://playonlinecasino.us.org  https://www.linkhaitao.com/index.php?mod=lhdeal&track=1c64_b8M5qx9heaNRLUOXE_bvVbRh9kX_b30IewSZrLdUl5fEbN9HSaA2iCRM3z&tag=_s139172_&new=https://playonlinecasino.us.org   http://www.v-dent.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.katalog.az/url.php?id=697&?s=https://playonlinecasino.us.org  http://restaurant-china.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kdc.wineclips.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://haddonfieldbaseball.org/Goto.asp?url=https://playonlinecasino.us.org  http://mail.mystar.com.my/interx/tracker?op=click&id=e71.837b&url=https://playonlinecasino.us.org/   http://www.ss-gospodarska-vz.skole.hr/redir_links2.php?l_id=143&url=https://playonlinecasino.us.org \nhttps://shop.mts.ru/bitrix/rk.php?id=10&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B10%5D+%5BCATALOG_TOP%5D+%D0%A1%D0%BB%D0%B0%D0%B9%D0%B4%D0%B5%D1%80+%D0%B2+%D0%BA%D0%B0%D1%82%D0%B0%D0%BB%D0%BE%D0%B3%D0%B5++%28%D0%BD%D0%B5+%D0%B2%D1%81%D1%82%D0%B0%D0%B2%D0%BB%D0%B5%D0%BD%29&goto=playonlinecasino.us.org  http://reshealthsystems.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://gwisoftware.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://remington-nursing.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.kreis-re.de/inhalte/_schulung/_fremdinhalt/index.asp?ziel=https:/playonlinecasino.us.org   http://iceemployees.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.szyzhy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://dietingdetails.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://racunovodski-prirocnik.si/go.asp?stran=5444&url=https://playonlinecasino.us.org \nhttp://cheapcamcorders.co.uk/go.php?url=https://playonlinecasino.us.org/  http://pornchixmovies.com/cgi-bin/a2/out.cgi?id=23&u=https://playonlinecasino.us.org   http://laocmc3.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.magic-of-india.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://newenglandswedding.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://doublesnack.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://drrayblog.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://timetoshinelifecoaching.ca/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://marbleimporters.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://ozd.ciqva.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://paradisevalleyonline.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.acewirespring.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.consultantlink.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://chat.nikolaev.com.ua/go.php?url=https://playonlinecasino.us.org/   http://nfrflood.co/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bae.americanpapertwine.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://burlingtonlax.com/Goto.asp?url=https://playonlinecasino.us.org   https://www.westmidlandsdeanery.nhs.uk/LinkClick.aspx?link=https://playonlinecasino.us.org \nhttp://www.mcshirt.ch/de/t-shirt-shop?action=express_checkout&goto=https://playonlinecasino.us.org  http://mystudenthubb.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.sexokasero.com/ttt-out.php?pct=100&url=playonlinecasino.us.org   http://teamstepps.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://theskeptics.guide/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://marleyordonez.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pilotgroveprivatetrustco.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://sportissue.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://accutera.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://www.test.fairy-tales.org/viewtopic.php?f=2&t=1854247\nhttp://forum.oranis.net/viewtopic.php?f=12&t=22498&p=27569#p27569\nhttps://truthinreality.com/2015/09/15/prayer-for-breaking-the-powers-of-witchcraft/\nhttp://vonwolkenstein.ano-host.co.in/vb4-neu/showthread.php?471276-cannon-computer&p=651598#post651598\nhttps://www.the-ninjarpg.com/forums/threads/persuasive-on-not-drinking.119132/\n", "language": "Lisp", "metadata": {"date": 1548710844, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s576132203.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s576132203", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.aaatowing.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://gpgtools.blogsky.com/dailylink/?go=https://playonlinecasino.us.org   http://www.porrfilmtillalla.com/ept/out.php?f=1&pct=50&url=https://playonlinecasino.us.org   http://sm-sinavi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://oscarlaw.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://speaklike.in/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://images.google.kz/url?q=https://playonlinecasino.us.org  http://crm-resource.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://mbq.driverslink.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://hann.me/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://goldcountrymooneyflyin.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://startupbermuda.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://pictureripper.com/Forum/External/?url=https://playonlinecasino.us.org  http://taxisty.club/bitrix/rk.php?id=1&event1=banner&event2=click&goto=https://playonlinecasino.us.org   http://ideaenterprise.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://renaissancelasvegas.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://brown-brothers-harriman.de/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.openmypc.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://fire-holding.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://klantenportal.sightlandscaping.nl/shortcuts/sendlinkmessage.aspx?url=https://playonlinecasino.us.org   http://www.milliondollars.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://foodworthy.photos/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://niq.sicklecell.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.impressio-print.ro/index.php/component/k2/item/13-codecanyon?fromurl=playonlinecasino.us.org  http://minoritypeopleunited.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.dansmovies.com/tp/out.php?link=tubeindex&p=95&url=https://playonlinecasino.us.org   http://jdmcapitaladvisors.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://zappamoustache.de/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ishould.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://copiainteractive.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://thelawsofthought.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://amctotalrewards.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://dfwhealth.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://plantablepromotion.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://plygemholdings.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://internationalsalesforce.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://mydamnlife.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://geglmworks.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://e-enstitu.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://audienceresponsekeypads.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://apparts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://boomerlane.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mynetlabels.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://e-hampton.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://epic-research.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://parenting.goldenarticles.net/go.php?url=https://playonlinecasino.us.org  https://www.linkhaitao.com/index.php?mod=lhdeal&track=1c64_b8M5qx9heaNRLUOXE_bvVbRh9kX_b30IewSZrLdUl5fEbN9HSaA2iCRM3z&tag=_s139172_&new=https://playonlinecasino.us.org   http://www.v-dent.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.katalog.az/url.php?id=697&?s=https://playonlinecasino.us.org  http://restaurant-china.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kdc.wineclips.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://haddonfieldbaseball.org/Goto.asp?url=https://playonlinecasino.us.org  http://mail.mystar.com.my/interx/tracker?op=click&id=e71.837b&url=https://playonlinecasino.us.org/   http://www.ss-gospodarska-vz.skole.hr/redir_links2.php?l_id=143&url=https://playonlinecasino.us.org \nhttps://shop.mts.ru/bitrix/rk.php?id=10&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B10%5D+%5BCATALOG_TOP%5D+%D0%A1%D0%BB%D0%B0%D0%B9%D0%B4%D0%B5%D1%80+%D0%B2+%D0%BA%D0%B0%D1%82%D0%B0%D0%BB%D0%BE%D0%B3%D0%B5++%28%D0%BD%D0%B5+%D0%B2%D1%81%D1%82%D0%B0%D0%B2%D0%BB%D0%B5%D0%BD%29&goto=playonlinecasino.us.org  http://reshealthsystems.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://gwisoftware.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://remington-nursing.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.kreis-re.de/inhalte/_schulung/_fremdinhalt/index.asp?ziel=https:/playonlinecasino.us.org   http://iceemployees.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.szyzhy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://dietingdetails.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://racunovodski-prirocnik.si/go.asp?stran=5444&url=https://playonlinecasino.us.org \nhttp://cheapcamcorders.co.uk/go.php?url=https://playonlinecasino.us.org/  http://pornchixmovies.com/cgi-bin/a2/out.cgi?id=23&u=https://playonlinecasino.us.org   http://laocmc3.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.magic-of-india.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://newenglandswedding.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://doublesnack.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://drrayblog.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://timetoshinelifecoaching.ca/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://marbleimporters.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://ozd.ciqva.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://paradisevalleyonline.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.acewirespring.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.consultantlink.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://chat.nikolaev.com.ua/go.php?url=https://playonlinecasino.us.org/   http://nfrflood.co/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bae.americanpapertwine.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://burlingtonlax.com/Goto.asp?url=https://playonlinecasino.us.org   https://www.westmidlandsdeanery.nhs.uk/LinkClick.aspx?link=https://playonlinecasino.us.org \nhttp://www.mcshirt.ch/de/t-shirt-shop?action=express_checkout&goto=https://playonlinecasino.us.org  http://mystudenthubb.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.sexokasero.com/ttt-out.php?pct=100&url=playonlinecasino.us.org   http://teamstepps.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://theskeptics.guide/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://marleyordonez.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pilotgroveprivatetrustco.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://sportissue.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://accutera.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://www.test.fairy-tales.org/viewtopic.php?f=2&t=1854247\nhttp://forum.oranis.net/viewtopic.php?f=12&t=22498&p=27569#p27569\nhttps://truthinreality.com/2015/09/15/prayer-for-breaking-the-powers-of-witchcraft/\nhttp://vonwolkenstein.ano-host.co.in/vb4-neu/showthread.php?471276-cannon-computer&p=651598#post651598\nhttps://www.the-ninjarpg.com/forums/threads/persuasive-on-not-drinking.119132/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8496, "cpu_time_ms": 95, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s321271035", "group_id": "codeNet:p03941", "input_text": "http://q.fbtc.ru/bitrix/rk.php?id=1&site_id=s1&event1=banner&event2=click&goto=playonlinecasino.us.org  http://stolenreward.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://212.118.48.154/SiteDetails.aspx?url=playonlinecasino.us.org   http://metairieguitarlessons.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://magicabula.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://forum.hergunkampanya.com/index.php?thememode=full;redirect=https://playonlinecasino.us.org  http://letsmt.lososcar.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://taqana.net/seo/redirect.php?url=https://playonlinecasino.us.org   http://bibleoilsforhealth.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://bancosban.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.boingo.com/leavingBoingo.php?url=https://playonlinecasino.us.org   http://www.furlongpetcremation.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://varsityembroidery.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://www.citybee.cz/go/https://playonlinecasino.us.org   http://socialworkerinsurance.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://routco.com/__media__/js/trademark.php?d=playonlinecasino.us.org  http://oldblog.andrewdor.com/go.php?https://playonlinecasino.us.org   http://insyncextra.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://weavethemovie.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://adambronfman.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://myfabpets.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://fbcsunbury.org/System/Login.asp?id=55943&referer=https://playonlinecasino.us.org  http://alteryo.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.fullservicestation.com/__media__/js/netsoltrademark.php?d=&playonlinecasino.us.org  http://schonwelt.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://brianfeury.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.sexgold.net/cgi-bin/ucj/c.cgi?url=https://playonlinecasino.us.org \nhttp://reddressbracelet.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://biblioteksbaser.dk/linkme/?bibliotek=742000&base=redirect&url=https://playonlinecasino.us.org   http://peakhabits.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://brookfieldnwt.ca/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://smithdesignview.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://frans-chocolates.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://theboldindian.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pornsearch.tv/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://energydrinkdubai.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://soz.luawiki.com/bitrix/rk.php?id=381&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B381%5D+%5BHEADER_TOP_BANNER%5D+%D0%94%D0%BE%D1%81%D1%82%D0%B0%D0%B2%D0%BA%D0%B0+%D0%BE%D1%82+200+%D1%80%D1%83%D0%B1&goto=playonlinecasino.us.org  http://tigerguys.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://warmmisthumidifiersreviews.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.webplexer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ffx3chat.createaforum.com/index.php?thememode=full;redirect=https://playonlinecasino.us.org   http://ceraunavolta.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.vranovlet.si/go?https://playonlinecasino.us.org  http://www.66hemi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.momsbusty.com/crtr/cgi/out.cgi?s=65&u=https://playonlinecasino.us.org \nhttp://taswegians.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://dragon-bowling.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://givethemhope.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://arfinancingllc.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://spradleyconstructionco.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://shorthandtraining.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://arnoldwlau.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.imacon-usa.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://ufchoy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://intl1percent.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://tatui.sp.gov.br/servicos/redirect?url=https://playonlinecasino.us.org   http://sss.lcyyy.cchgfgtcnrca.lcqti.3.gsr.anonimizing.com/home287/createSession?referer=https://playonlinecasino.us.org   http://www.exitservices.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.1csseo.com/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org   http://peachtreeford.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://arparent.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://glopol.company/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://indylasers.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://uc.18888.com/link.php?url=https://playonlinecasino.us.org  http://af-edirect.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://barnonemail.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://checkmycode.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pictrac.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.hannover-adressbuch.de/click.php?eid=213520&www=https://playonlinecasino.us.org  http://vessal.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://www.sitedirsec.com/bbs/redirect.php?tid=1720&goto=playonlinecasino.us.org   http://帝人.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://machimbombo.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://texasloot.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.heightsfinance.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://difeiya.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://myoperatingsystem.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://thelittlegentleman.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.austrade.gov.au/PrintToPDF.aspx?url=https://playonlinecasino.us.org  http://www.sublung.com/content/LinkClick.aspx?link=https://playonlinecasino.us.org   http://codyhulk.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://reexecutiveevent.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.mb4biz.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rubymayer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.roachpalace.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ヒルトンハワイバケーションズ.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kratosdefense.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://tarahan-machinery.com/eng/go.php?https://playonlinecasino.us.org  http://logi4.xiti.com/go.click?xts=292973&s2=130&p=Centre%20hospitalier&clic=N&type=click&url=https://playonlinecasino.us.org   http://myowncostume.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://forum.vikingstown.at/viewtopic.php?pid=175755#p175755\nhttp://classifiedsadsnow.online/viewtopic.php?pid=2549915#p2549915\nhttp://forum.flaggenkunde.de/viewtopic.php?f=2&t=3503501\nhttp://www.robaloboatowners.com/RBO/viewtopic.php?f=24&t=1658545\nhttps://www.okademi.com.tr/forums/topic/nursing-diagnosis-for-sepsis/\n", "language": "Lisp", "metadata": {"date": 1548704979, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s321271035.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s321271035", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://q.fbtc.ru/bitrix/rk.php?id=1&site_id=s1&event1=banner&event2=click&goto=playonlinecasino.us.org  http://stolenreward.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://212.118.48.154/SiteDetails.aspx?url=playonlinecasino.us.org   http://metairieguitarlessons.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://magicabula.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://forum.hergunkampanya.com/index.php?thememode=full;redirect=https://playonlinecasino.us.org  http://letsmt.lososcar.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://taqana.net/seo/redirect.php?url=https://playonlinecasino.us.org   http://bibleoilsforhealth.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://bancosban.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.boingo.com/leavingBoingo.php?url=https://playonlinecasino.us.org   http://www.furlongpetcremation.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://varsityembroidery.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://www.citybee.cz/go/https://playonlinecasino.us.org   http://socialworkerinsurance.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://routco.com/__media__/js/trademark.php?d=playonlinecasino.us.org  http://oldblog.andrewdor.com/go.php?https://playonlinecasino.us.org   http://insyncextra.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://weavethemovie.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://adambronfman.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://myfabpets.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://fbcsunbury.org/System/Login.asp?id=55943&referer=https://playonlinecasino.us.org  http://alteryo.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.fullservicestation.com/__media__/js/netsoltrademark.php?d=&playonlinecasino.us.org  http://schonwelt.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://brianfeury.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.sexgold.net/cgi-bin/ucj/c.cgi?url=https://playonlinecasino.us.org \nhttp://reddressbracelet.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://biblioteksbaser.dk/linkme/?bibliotek=742000&base=redirect&url=https://playonlinecasino.us.org   http://peakhabits.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://brookfieldnwt.ca/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://smithdesignview.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://frans-chocolates.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://theboldindian.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pornsearch.tv/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://energydrinkdubai.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://soz.luawiki.com/bitrix/rk.php?id=381&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B381%5D+%5BHEADER_TOP_BANNER%5D+%D0%94%D0%BE%D1%81%D1%82%D0%B0%D0%B2%D0%BA%D0%B0+%D0%BE%D1%82+200+%D1%80%D1%83%D0%B1&goto=playonlinecasino.us.org  http://tigerguys.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://warmmisthumidifiersreviews.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.webplexer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ffx3chat.createaforum.com/index.php?thememode=full;redirect=https://playonlinecasino.us.org   http://ceraunavolta.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.vranovlet.si/go?https://playonlinecasino.us.org  http://www.66hemi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.momsbusty.com/crtr/cgi/out.cgi?s=65&u=https://playonlinecasino.us.org \nhttp://taswegians.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://dragon-bowling.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://givethemhope.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://arfinancingllc.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://spradleyconstructionco.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://shorthandtraining.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://arnoldwlau.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.imacon-usa.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://ufchoy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://intl1percent.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://tatui.sp.gov.br/servicos/redirect?url=https://playonlinecasino.us.org   http://sss.lcyyy.cchgfgtcnrca.lcqti.3.gsr.anonimizing.com/home287/createSession?referer=https://playonlinecasino.us.org   http://www.exitservices.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.1csseo.com/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org   http://peachtreeford.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://arparent.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://glopol.company/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://indylasers.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://uc.18888.com/link.php?url=https://playonlinecasino.us.org  http://af-edirect.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://barnonemail.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://checkmycode.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pictrac.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.hannover-adressbuch.de/click.php?eid=213520&www=https://playonlinecasino.us.org  http://vessal.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://www.sitedirsec.com/bbs/redirect.php?tid=1720&goto=playonlinecasino.us.org   http://帝人.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://machimbombo.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://texasloot.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.heightsfinance.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://difeiya.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://myoperatingsystem.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://thelittlegentleman.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.austrade.gov.au/PrintToPDF.aspx?url=https://playonlinecasino.us.org  http://www.sublung.com/content/LinkClick.aspx?link=https://playonlinecasino.us.org   http://codyhulk.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://reexecutiveevent.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.mb4biz.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rubymayer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.roachpalace.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ヒルトンハワイバケーションズ.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kratosdefense.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://tarahan-machinery.com/eng/go.php?https://playonlinecasino.us.org  http://logi4.xiti.com/go.click?xts=292973&s2=130&p=Centre%20hospitalier&clic=N&type=click&url=https://playonlinecasino.us.org   http://myowncostume.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://forum.vikingstown.at/viewtopic.php?pid=175755#p175755\nhttp://classifiedsadsnow.online/viewtopic.php?pid=2549915#p2549915\nhttp://forum.flaggenkunde.de/viewtopic.php?f=2&t=3503501\nhttp://www.robaloboatowners.com/RBO/viewtopic.php?f=24&t=1658545\nhttps://www.okademi.com.tr/forums/topic/nursing-diagnosis-for-sepsis/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8240, "cpu_time_ms": 99, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s764962688", "group_id": "codeNet:p03941", "input_text": "http://adnetize.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wolfingtons.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://sanopt.com.ua/bitrix/rk.php?id=3&goto=https://playonlinecasino.us.org   http://www.fareasthandycrafts.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.windmillpress.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.funnice.com/link.php?url=https://playonlinecasino.us.org  http://eartfinder.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://facultycentre.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://hobohomes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttps://pensionerka.com/go/url=playonlinecasino.us.org  http://chubbypicsz.com/out.cgi?l=desc&s=60&c=1&u=https://playonlinecasino.us.org   http://www.shoppepro.com/forums/showthread.php?2253-Hello-from-D-Luxe-Lace-Wigs&goto=playonlinecasino.us.org   http://fimepinostat.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ladoshki-forum.ru/go.php?https://playonlinecasino.us.org   http://sanddoom.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ideayamedicine.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.waltonian-inn.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://tqf-inc.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://pickmyleads.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.calmh20.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.josepi.com/siteanalyzer/redirect.php?url=https://playonlinecasino.us.org   https://www.npkua.org/LinkClick.aspx?link=https://playonlinecasino.us.org  http://sitebar.lynms.edu.hk/go.php?id=66&url=https://playonlinecasino.us.org   http://www.drisag.ch/php/mhs.printme/index.php?url=https://playonlinecasino.us.org  http://cpink.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cementkiss.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://freedomlandscape.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://fightnetwork.global/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://shanghaishi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://promontoryparkcityrealestate.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://qos-web6.exigo.ch/phpinfo.php?a%5B%5D=%3Ca%20href%3Dhttp%3A%2F%2Fplayonlinecasino.us.org%2F%3E%C3%91%81%C3%90%C2%BC%C3%90%C2%B5%C3%91%E2%80%9A%C3%90%C2%B0%20%C3%90%C2%BD%C3%90%C2%B0%20%C3%90%C2%BF%C3%91%E2%82%AC%C3%90%C2%BE%C3%90%C2%B5%C3%90%C2%BA%C3%91%E2%80%9A%C3%90%C2%B8%C3%91%E2%82%AC%C3%90%C2%BE%C3%90%C2%B2%C3%90%C2%B0%C3%90%C2%BD%C3%90%C2%B8%C3%90%C2%B5%20%C3%91%C5%8D%C3%90%C2%BB%C3%90%C2%B5%C3%90%C2%BA%C3%91%E2%80%9A%C3%91%E2%82%AC%C3%90%C2%BE%C3%91%81%C3%90%C2%BD%C3%90%C2%B0%C3%90%C2%B1%C3%90%C2%B6%C3%90%C2%B5%C3%90%C2%BD%C3%90%C2%B8%C3%91%8F%3C%2Fa%3E  http://widget.детскийчат.рф/away/?to=https://playonlinecasino.us.org/   http://connecticutairportshuttle.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.aaa-fuzoku.com/ka.php?utmac=MO-407033-31&utmn=1140677973&utmr=0&utmp=/i/gravure/covergirl/5543?pid=5&guid=ON&r=https://playonlinecasino.us.org  http://kukmor-one.ru/away.php?to=https://playonlinecasino.us.org   http://talentmangement.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.banjomovies.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://expertguidebook.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://quietcompass.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://blogposh.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://delawarebusinessbankruptcy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://hxp.volvotire.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://worldofwarplanes.ru/b4r/264/go?to=https://playonlinecasino.us.org  http://worlddatingsite.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://droppingacid.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.crabme.pp.ua/go/https://playonlinecasino.us.org  https://bbs.mudbest.com/redirect.php?tid=53&goto=playonlinecasino.us.org   http://jir.jcoats.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://localservicepros.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://yomando.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://online.iservice.spb.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://playonlinecasino.us.org  http://www.asianec.cn/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org  http://jeffreywald.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kohlercompany.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://georgewbushfreedomcenter.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mtfsportsmed.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.stcharlescc.com/default.aspx?p=TrackHyperlink&url=https://playonlinecasino.us.org   http://dispatchsupersale.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bwpackages.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://openvid.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ezlearningapps.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://apocalypsenowgame.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.waterfront-place.com/__media__/js/trademark.php?d=playonlinecasino.us.org \nhttp://www.thaijobcenter.com/links.php?id=82&goto= https://playonlinecasino.us.org/  http://www.timnorton.name/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.of-mine.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://foldercollaboration.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://gregorystein.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://edwardmarsh.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://dusitd2nairobi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://360banzou.com/p/h/p/r/o/x/y/browse.php?u=https://playonlinecasino.us.org   http://chimbuom.xxxpart.com/redirect.php?url=https://playonlinecasino.us.org \nhttp://treatmyhand.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.dogosdemexico.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rfclub.net/Redirect.aspx?url=https://playonlinecasino.us.org   http://eleutheraphotographer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://lukejdavies.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://candlerhills.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://coleccion-carmen-thyssen-bornemisza.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://allsportgamecourts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://louisianafoodie.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://disasterrepairspecialists.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ssg.sebastopol.ua/go/url=https://playonlinecasino.us.org   http://johnjruggeri.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://e-taxdata.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.sfdaied.org:81/job.php?rd_previous=1&fid=19&tid=435137&fpage=36&goto=playonlinecasino.us.org   http://thepattifamily.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.therantastic.com/redirect.php?title=Tim%20Minchin's%20Website&url=https://playonlinecasino.us.org  http://holalikes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://seablue.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://vestiro.ro/forum/index.php/topic,20123.new.html#new\nhttp://femdomdesire.com/forums/showthread.php?p=452934#post452934\nhttp://wtrawie.pl/index.php?topic=528410.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://www.accomplishdreams.com/forum/index.php?topic=116174.new#new\n", "language": "Lisp", "metadata": {"date": 1548669662, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s764962688.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s764962688", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://adnetize.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wolfingtons.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://sanopt.com.ua/bitrix/rk.php?id=3&goto=https://playonlinecasino.us.org   http://www.fareasthandycrafts.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.windmillpress.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.funnice.com/link.php?url=https://playonlinecasino.us.org  http://eartfinder.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://facultycentre.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://hobohomes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttps://pensionerka.com/go/url=playonlinecasino.us.org  http://chubbypicsz.com/out.cgi?l=desc&s=60&c=1&u=https://playonlinecasino.us.org   http://www.shoppepro.com/forums/showthread.php?2253-Hello-from-D-Luxe-Lace-Wigs&goto=playonlinecasino.us.org   http://fimepinostat.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ladoshki-forum.ru/go.php?https://playonlinecasino.us.org   http://sanddoom.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ideayamedicine.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.waltonian-inn.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://tqf-inc.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://pickmyleads.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.calmh20.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.josepi.com/siteanalyzer/redirect.php?url=https://playonlinecasino.us.org   https://www.npkua.org/LinkClick.aspx?link=https://playonlinecasino.us.org  http://sitebar.lynms.edu.hk/go.php?id=66&url=https://playonlinecasino.us.org   http://www.drisag.ch/php/mhs.printme/index.php?url=https://playonlinecasino.us.org  http://cpink.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cementkiss.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://freedomlandscape.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://fightnetwork.global/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://shanghaishi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://promontoryparkcityrealestate.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://qos-web6.exigo.ch/phpinfo.php?a%5B%5D=%3Ca%20href%3Dhttp%3A%2F%2Fplayonlinecasino.us.org%2F%3E%C3%91%81%C3%90%C2%BC%C3%90%C2%B5%C3%91%E2%80%9A%C3%90%C2%B0%20%C3%90%C2%BD%C3%90%C2%B0%20%C3%90%C2%BF%C3%91%E2%82%AC%C3%90%C2%BE%C3%90%C2%B5%C3%90%C2%BA%C3%91%E2%80%9A%C3%90%C2%B8%C3%91%E2%82%AC%C3%90%C2%BE%C3%90%C2%B2%C3%90%C2%B0%C3%90%C2%BD%C3%90%C2%B8%C3%90%C2%B5%20%C3%91%C5%8D%C3%90%C2%BB%C3%90%C2%B5%C3%90%C2%BA%C3%91%E2%80%9A%C3%91%E2%82%AC%C3%90%C2%BE%C3%91%81%C3%90%C2%BD%C3%90%C2%B0%C3%90%C2%B1%C3%90%C2%B6%C3%90%C2%B5%C3%90%C2%BD%C3%90%C2%B8%C3%91%8F%3C%2Fa%3E  http://widget.детскийчат.рф/away/?to=https://playonlinecasino.us.org/   http://connecticutairportshuttle.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.aaa-fuzoku.com/ka.php?utmac=MO-407033-31&utmn=1140677973&utmr=0&utmp=/i/gravure/covergirl/5543?pid=5&guid=ON&r=https://playonlinecasino.us.org  http://kukmor-one.ru/away.php?to=https://playonlinecasino.us.org   http://talentmangement.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.banjomovies.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://expertguidebook.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://quietcompass.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://blogposh.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://delawarebusinessbankruptcy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://hxp.volvotire.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://worldofwarplanes.ru/b4r/264/go?to=https://playonlinecasino.us.org  http://worlddatingsite.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://droppingacid.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.crabme.pp.ua/go/https://playonlinecasino.us.org  https://bbs.mudbest.com/redirect.php?tid=53&goto=playonlinecasino.us.org   http://jir.jcoats.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://localservicepros.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://yomando.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://online.iservice.spb.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://playonlinecasino.us.org  http://www.asianec.cn/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org  http://jeffreywald.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kohlercompany.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://georgewbushfreedomcenter.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mtfsportsmed.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.stcharlescc.com/default.aspx?p=TrackHyperlink&url=https://playonlinecasino.us.org   http://dispatchsupersale.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bwpackages.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://openvid.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ezlearningapps.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://apocalypsenowgame.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.waterfront-place.com/__media__/js/trademark.php?d=playonlinecasino.us.org \nhttp://www.thaijobcenter.com/links.php?id=82&goto= https://playonlinecasino.us.org/  http://www.timnorton.name/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.of-mine.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://foldercollaboration.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://gregorystein.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://edwardmarsh.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://dusitd2nairobi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://360banzou.com/p/h/p/r/o/x/y/browse.php?u=https://playonlinecasino.us.org   http://chimbuom.xxxpart.com/redirect.php?url=https://playonlinecasino.us.org \nhttp://treatmyhand.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.dogosdemexico.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rfclub.net/Redirect.aspx?url=https://playonlinecasino.us.org   http://eleutheraphotographer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://lukejdavies.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://candlerhills.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://coleccion-carmen-thyssen-bornemisza.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://allsportgamecourts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://louisianafoodie.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://disasterrepairspecialists.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://ssg.sebastopol.ua/go/url=https://playonlinecasino.us.org   http://johnjruggeri.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://e-taxdata.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.sfdaied.org:81/job.php?rd_previous=1&fid=19&tid=435137&fpage=36&goto=playonlinecasino.us.org   http://thepattifamily.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.therantastic.com/redirect.php?title=Tim%20Minchin's%20Website&url=https://playonlinecasino.us.org  http://holalikes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://seablue.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://vestiro.ro/forum/index.php/topic,20123.new.html#new\nhttp://femdomdesire.com/forums/showthread.php?p=452934#post452934\nhttp://wtrawie.pl/index.php?topic=528410.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttp://www.accomplishdreams.com/forum/index.php?topic=116174.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8589, "cpu_time_ms": 116, "memory_kb": 9312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s595197714", "group_id": "codeNet:p03941", "input_text": "http://dottie-herman.tv/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://lc.xinshizaixian.com/index.php?g=Appoint&c=Changecity&a=go&city=th&referer=https://playonlinecasino.us.org   http://www.carollittle.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://aveailetisimhizmetleri.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cychopath.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cyamailsafe.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pranit.in/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://m.vitalbmx.com/redirect?url=https://playonlinecasino.us.org   http://gabrielletayac.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://abo-ch.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://vzu.ihatestonepigman.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kenkinghorn.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://fortissolar.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://top.fark.com/aggr/redirect/?url=https://playonlinecasino.us.org   http://borderwalk.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://doctorgoodguy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.ellawelch.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://romaniaoil.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://jardinesonline.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://armmortgage.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://redneckhuntingclub.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.whichwaytopay.com/apply-CFD.asp?url=https://playonlinecasino.us.org  http://www.dz-recrute.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://microsite.nintendo-europe.com/disclaimer/index.php?target=playonlinecasino.us.org  http://kohle-zahnpasta.eu/wp-content/plugins/AND-AntiBounce/redirector.php?url=https://playonlinecasino.us.org  http://degaopticalold.4u.kz/ru/go.php?go=https://playonlinecasino.us.org   http://rpgfan.les-forums.com/message/139813/?backto=playonlinecasino.us.org \nhttp://his.links.cn/queryhistory.asp?weburl=https://playonlinecasino.us.org  http://phxzoo.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.gfhousing.org/LinkClick.aspx?link=https://playonlinecasino.us.org   http://bamboleos.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bionicareu.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://aaesaonline.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wilderinalaska.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.gfpusa.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://tasiastmauritania.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttps://socialpubli.com/site/redirect?url=https://playonlinecasino.us.org  http://isellnewmexicohomes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.beverlybank.com/external/?url=https://playonlinecasino.us.org/   http://coaxcable.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wiesenthal-everagain.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://spatialbusiness.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://it.bestshopping.com/hotel/jump.php?id=1457408&url=https://playonlinecasino.us.org  http://allianceercare.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://debtanalysis.ca/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://d-click.anapar.com.br/u/18149/157/612/154_0/89aa7/?url=https://playonlinecasino.us.org  http://safepassageohio.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.gilshoppingnews.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://richpenna.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.vkfinspo.com/out.php?link=https://playonlinecasino.us.org   http://instrumart.mobi/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://makenacareconnection.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://false-teeth.ru/bitrix/rk.php?goto=https://playonlinecasino.us.org   http://mydjschool.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://airportparkingfordummies.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://musclebuildingabsreviews.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.asone.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://hsnshopbyremote.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.top-of-the-alps.at/goto.php?id=5870&url=https://playonlinecasino.us.org   http://medzilla.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.rivcoeh.org/LinkClick.aspx?link=https://playonlinecasino.us.org  http://matures4a.com/go.php?track=d1sGdzdFZGlCdUUL&url=https://playonlinecasino.us.org   http://stressfest.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://indiablo.ru/go?https://playonlinecasino.us.org  http://www.craneconsumer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.acgdmw.cn/wp-content/themes/begin5.2/inc/go.php?url=https://playonlinecasino.us.org   http://internationaltravelmanagement.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://www.yourethecure.org/r?u=https://playonlinecasino.us.org   http://underwearcorpofamerica.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://200galleries.com/go.php?url=https://playonlinecasino.us.org  http://009.ev-mart.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://sotkarealty.com/SearchPoint/redir.asp?reg_id=pTypes&sname=/searchpoint/search.asp&lid=0&sponsor=LAN&url=playonlinecasino.us.org \nhttps://www.shadymaple.ca/redirect.aspx?url=https://playonlinecasino.us.org  http://outreachtochildren.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rpds-download.com/protetor/redirect/link/?url=https://playonlinecasino.us.org   http://www.globalrecyclingideas.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.jzwzx.com/link.php?action=previous&fid=36&tid=926&fpage=0&goto=playonlinecasino.us.org   http://www.graines-et-plantes.com/clic.php?site=279&lien=https://playonlinecasino.us.org  http://hospitalmedicinegroups.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wildarts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cellularonewireless.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.hametai.com/ranking/out.cgi?id=stnavi&url=https://playonlinecasino.us.org  http://best-salon-long-island.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.cbhealthins.com/LinkClick.aspx?link=https://playonlinecasino.us.org   http://qingyangmovie.be/exlink.php?uri=https://playonlinecasino.us.org  http://www.groendyke.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.mjsmanagement.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://members.iif.hu/vitez/php3prob/index.php3?a<>=<a+href=https://playonlinecasino.us.org  http://behdasht1393.blogsky.com/dailylink/?go=https://playonlinecasino.us.org   http://outsourceresults.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://tigershop.se/forum/showthread.php?tid=163735\nhttp://www.evolvedstrategies.com/smf/index.php?topic=1028541.new#new\nhttp://wtrawie.pl/index.php?topic=528410.new#new\nhttp://graphfolio.com/forum/index.php?topic=57625.new#new\nhttp://greenplanet.ie/index.php?topic=108112.new#new\n", "language": "Lisp", "metadata": {"date": 1548658045, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s595197714.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s595197714", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://dottie-herman.tv/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://lc.xinshizaixian.com/index.php?g=Appoint&c=Changecity&a=go&city=th&referer=https://playonlinecasino.us.org   http://www.carollittle.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://aveailetisimhizmetleri.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cychopath.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cyamailsafe.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pranit.in/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://m.vitalbmx.com/redirect?url=https://playonlinecasino.us.org   http://gabrielletayac.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://abo-ch.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://vzu.ihatestonepigman.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kenkinghorn.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://fortissolar.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://top.fark.com/aggr/redirect/?url=https://playonlinecasino.us.org   http://borderwalk.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://doctorgoodguy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.ellawelch.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://romaniaoil.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://jardinesonline.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://armmortgage.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://redneckhuntingclub.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.whichwaytopay.com/apply-CFD.asp?url=https://playonlinecasino.us.org  http://www.dz-recrute.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://microsite.nintendo-europe.com/disclaimer/index.php?target=playonlinecasino.us.org  http://kohle-zahnpasta.eu/wp-content/plugins/AND-AntiBounce/redirector.php?url=https://playonlinecasino.us.org  http://degaopticalold.4u.kz/ru/go.php?go=https://playonlinecasino.us.org   http://rpgfan.les-forums.com/message/139813/?backto=playonlinecasino.us.org \nhttp://his.links.cn/queryhistory.asp?weburl=https://playonlinecasino.us.org  http://phxzoo.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.gfhousing.org/LinkClick.aspx?link=https://playonlinecasino.us.org   http://bamboleos.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bionicareu.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://aaesaonline.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wilderinalaska.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.gfpusa.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://tasiastmauritania.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttps://socialpubli.com/site/redirect?url=https://playonlinecasino.us.org  http://isellnewmexicohomes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.beverlybank.com/external/?url=https://playonlinecasino.us.org/   http://coaxcable.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wiesenthal-everagain.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://spatialbusiness.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://it.bestshopping.com/hotel/jump.php?id=1457408&url=https://playonlinecasino.us.org  http://allianceercare.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://debtanalysis.ca/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://d-click.anapar.com.br/u/18149/157/612/154_0/89aa7/?url=https://playonlinecasino.us.org  http://safepassageohio.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.gilshoppingnews.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://richpenna.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.vkfinspo.com/out.php?link=https://playonlinecasino.us.org   http://instrumart.mobi/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://makenacareconnection.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://false-teeth.ru/bitrix/rk.php?goto=https://playonlinecasino.us.org   http://mydjschool.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://airportparkingfordummies.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://musclebuildingabsreviews.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.asone.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://hsnshopbyremote.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.top-of-the-alps.at/goto.php?id=5870&url=https://playonlinecasino.us.org   http://medzilla.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.rivcoeh.org/LinkClick.aspx?link=https://playonlinecasino.us.org  http://matures4a.com/go.php?track=d1sGdzdFZGlCdUUL&url=https://playonlinecasino.us.org   http://stressfest.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://indiablo.ru/go?https://playonlinecasino.us.org  http://www.craneconsumer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.acgdmw.cn/wp-content/themes/begin5.2/inc/go.php?url=https://playonlinecasino.us.org   http://internationaltravelmanagement.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://www.yourethecure.org/r?u=https://playonlinecasino.us.org   http://underwearcorpofamerica.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://200galleries.com/go.php?url=https://playonlinecasino.us.org  http://009.ev-mart.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://sotkarealty.com/SearchPoint/redir.asp?reg_id=pTypes&sname=/searchpoint/search.asp&lid=0&sponsor=LAN&url=playonlinecasino.us.org \nhttps://www.shadymaple.ca/redirect.aspx?url=https://playonlinecasino.us.org  http://outreachtochildren.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rpds-download.com/protetor/redirect/link/?url=https://playonlinecasino.us.org   http://www.globalrecyclingideas.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.jzwzx.com/link.php?action=previous&fid=36&tid=926&fpage=0&goto=playonlinecasino.us.org   http://www.graines-et-plantes.com/clic.php?site=279&lien=https://playonlinecasino.us.org  http://hospitalmedicinegroups.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wildarts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cellularonewireless.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.hametai.com/ranking/out.cgi?id=stnavi&url=https://playonlinecasino.us.org  http://best-salon-long-island.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.cbhealthins.com/LinkClick.aspx?link=https://playonlinecasino.us.org   http://qingyangmovie.be/exlink.php?uri=https://playonlinecasino.us.org  http://www.groendyke.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.mjsmanagement.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://members.iif.hu/vitez/php3prob/index.php3?a<>=<a+href=https://playonlinecasino.us.org  http://behdasht1393.blogsky.com/dailylink/?go=https://playonlinecasino.us.org   http://outsourceresults.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://tigershop.se/forum/showthread.php?tid=163735\nhttp://www.evolvedstrategies.com/smf/index.php?topic=1028541.new#new\nhttp://wtrawie.pl/index.php?topic=528410.new#new\nhttp://graphfolio.com/forum/index.php?topic=57625.new#new\nhttp://greenplanet.ie/index.php?topic=108112.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8010, "cpu_time_ms": 98, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s067631718", "group_id": "codeNet:p03941", "input_text": "http://nuttygrad.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://vietnamantique.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://paidsold.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://alticeusasucks.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://theintegratornetwork.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://optionbackdatinglawsuits.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://forum.bilandima.ru/blog.php?b=27765&goto=playonlinecasino.us.org  http://deviltwinkel.palmislandbeauty.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://markeast.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://hottux.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://vuecam.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.ru2gether.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://donnerpartyrescue.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cancerpatientresource.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://poljoprivredni-forum.com/showthread.php?goto=playonlinecasino.us.org  http://firstimpressionsmagazine.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cisnerosholdings.tv/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.shi688.com/php/go.php?id=103008&url=https://playonlinecasino.us.org \nhttp://plumedc.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://merchantconstructon.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://takemyex.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://ceracool.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://opensolariswiki.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rtboptimizer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://higherintelligenceagency.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bingotube.com/?go=click&c=349&n=86&e=0&g=3&r=40576310&u=https://playonlinecasino.us.org   http://jobsaroundthearea.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://gabrielmojay.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://163075481.r.bat.bing.com/?ld=d3zfDuoCzYBGGFKkUozFQkiDVUCUy5kHfX_gE-MRWM9zIP3OSzfiejPM8EOFEHumhkcSwrlnrsYm9JLP2SbGm7ul2PEZr1TpwZ13HEJ0f3Pd06R9KXlhIFzB0nqhdK5HLQbRvD-J3hqohso6Dh-GSDiy7mRzpYYXpIEHwlSJuMzqqPDpcf&u=https://playonlinecasino.us.org   http://www.splicedbread.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://suffolkdwiattorney.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://forum.aretacollege.com/forum/forum-belajar-linux/1193-casio-wk-1250?goto=playonlinecasino.us.org   http://???z.com/st-affiliate-manager/click/track?id=1110&type=banner&url=https://playonlinecasino.us.org  http://fishingarea.awardspace.com/go.php?url=https://playonlinecasino.us.org  http://enrolme-cn.yiiloo.com/link.php?url=https://playonlinecasino.us.org   http://firesafetydrape.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.youlist.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://shaneology.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://jacobstheater.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.kaimihehuo.com/wp-content/themes/begin-lts/inc/go.php?url=https://playonlinecasino.us.org  http://www.hmrps.co/ext_link?url=https://playonlinecasino.us.org   http://sunandnutrition.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.gvoconference.com/redir.php?msg=6e965bd0eae7c2748e474ab921414abc&url=https://playonlinecasino.us.org  http://flexprofen.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://forum.sruu.pl/redirect.php?url=https://playonlinecasino.us.org \nhttp://acquielawson.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://judd1776coin.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kidsrocknrun.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://tornado-foosball-table.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.dallarivolley.com/banner/adredir.asp?url=https://playonlinecasino.us.org   http://academyoutdoors.tv/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cellotapesmartproduct.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://arisitappliances.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://quidol.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.aileen.in/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://serenityprayergroup.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.bcpjpm.com/?link.php?url=https://playonlinecasino.us.org   http://www.moviesport.net/movieeasy/it/link.asp?tb=tb_pageitem&id=id_pageitem&n=1000001481&u=https://playonlinecasino.us.org  http://www.coopcavalese.it/public/contaclick/redirect.asp?url=https://playonlinecasino.us.org   http://calindira.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://bukkit.org/proxy.php?link=https://playonlinecasino.us.org  http://tbl.halflog.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.c21bowman.com/entryPoint.rhtml?source=iwantaparkglenhome.com&goto=https://playonlinecasino.us.org \nhttp://bigrigpipes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://b4u.lawandordercriminalintent.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cosmeticcomplaint.management/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://markanichols.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://livinglongerlivingbetter.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://biosecurityinternational.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://johnjcarroll.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://avocados.pro/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://marshfieldlaboratories.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://bigmatureladiestube.com/cgi-bin/crtr/out.cgi?id=499&l=topmain&u=https://playonlinecasino.us.org  http://falafull.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://z-ultimate.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://gasswebermullins.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://artlease.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.payhealth.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.etidol.com/link.php?url=https://playonlinecasino.us.org  http://conroegaragedoors.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.prmpromise.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://media-com.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://handsoflight.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://semme.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://minnesotachamber.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://americanmedbilling.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.okcmaa.org/default.aspx?p=TrackHyperlink&url=https://playonlinecasino.us.org  http://thunderbirdinvestors.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.sharebabe.com/crtr/cgi/out.cgi?id=107&tag=hardtop&trade=https://playonlinecasino.us.org   http://djotjog.com/cp2/tred?url=https://playonlinecasino.us.org/ \n \n \n \n \n \nhttp://slpsfd.org/forum/index.php?topic=24161.new#new\nhttp://xn--80aihgzecn.xn--p1ai/index.php?/topic/169614-317-source-download-list/\nhttp://rusavtonomgaz.ru/forum/?PAGE_NAME=message&FID=5&TID=4532&TITLE_SEO=4532-naked-padme-amidala&MID=89543&sessid=6e78325503b264e6b89cb52ea717b2dc&TOPIC_SUBSCRIBE=Y&FORUM_SUBSCRIBE=Y&result=new\nhttps://forum.radio-fresh.net/index.php?topic=542087.new#new\nhttps://optimisationducapitalhumain.com/forum/index.php?topic=249966.new#new\n", "language": "Lisp", "metadata": {"date": 1548652048, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s067631718.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s067631718", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://nuttygrad.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://vietnamantique.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://paidsold.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://alticeusasucks.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://theintegratornetwork.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://optionbackdatinglawsuits.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://forum.bilandima.ru/blog.php?b=27765&goto=playonlinecasino.us.org  http://deviltwinkel.palmislandbeauty.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://markeast.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://hottux.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://vuecam.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.ru2gether.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://donnerpartyrescue.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cancerpatientresource.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://poljoprivredni-forum.com/showthread.php?goto=playonlinecasino.us.org  http://firstimpressionsmagazine.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cisnerosholdings.tv/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.shi688.com/php/go.php?id=103008&url=https://playonlinecasino.us.org \nhttp://plumedc.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://merchantconstructon.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://takemyex.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://ceracool.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://opensolariswiki.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://rtboptimizer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://higherintelligenceagency.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bingotube.com/?go=click&c=349&n=86&e=0&g=3&r=40576310&u=https://playonlinecasino.us.org   http://jobsaroundthearea.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://gabrielmojay.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://163075481.r.bat.bing.com/?ld=d3zfDuoCzYBGGFKkUozFQkiDVUCUy5kHfX_gE-MRWM9zIP3OSzfiejPM8EOFEHumhkcSwrlnrsYm9JLP2SbGm7ul2PEZr1TpwZ13HEJ0f3Pd06R9KXlhIFzB0nqhdK5HLQbRvD-J3hqohso6Dh-GSDiy7mRzpYYXpIEHwlSJuMzqqPDpcf&u=https://playonlinecasino.us.org   http://www.splicedbread.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://suffolkdwiattorney.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://forum.aretacollege.com/forum/forum-belajar-linux/1193-casio-wk-1250?goto=playonlinecasino.us.org   http://???z.com/st-affiliate-manager/click/track?id=1110&type=banner&url=https://playonlinecasino.us.org  http://fishingarea.awardspace.com/go.php?url=https://playonlinecasino.us.org  http://enrolme-cn.yiiloo.com/link.php?url=https://playonlinecasino.us.org   http://firesafetydrape.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.youlist.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://shaneology.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://jacobstheater.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.kaimihehuo.com/wp-content/themes/begin-lts/inc/go.php?url=https://playonlinecasino.us.org  http://www.hmrps.co/ext_link?url=https://playonlinecasino.us.org   http://sunandnutrition.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.gvoconference.com/redir.php?msg=6e965bd0eae7c2748e474ab921414abc&url=https://playonlinecasino.us.org  http://flexprofen.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://forum.sruu.pl/redirect.php?url=https://playonlinecasino.us.org \nhttp://acquielawson.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://judd1776coin.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kidsrocknrun.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://tornado-foosball-table.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.dallarivolley.com/banner/adredir.asp?url=https://playonlinecasino.us.org   http://academyoutdoors.tv/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cellotapesmartproduct.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://arisitappliances.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://quidol.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.aileen.in/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://serenityprayergroup.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.bcpjpm.com/?link.php?url=https://playonlinecasino.us.org   http://www.moviesport.net/movieeasy/it/link.asp?tb=tb_pageitem&id=id_pageitem&n=1000001481&u=https://playonlinecasino.us.org  http://www.coopcavalese.it/public/contaclick/redirect.asp?url=https://playonlinecasino.us.org   http://calindira.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://bukkit.org/proxy.php?link=https://playonlinecasino.us.org  http://tbl.halflog.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.c21bowman.com/entryPoint.rhtml?source=iwantaparkglenhome.com&goto=https://playonlinecasino.us.org \nhttp://bigrigpipes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://b4u.lawandordercriminalintent.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cosmeticcomplaint.management/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://markanichols.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://livinglongerlivingbetter.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://biosecurityinternational.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://johnjcarroll.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://avocados.pro/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://marshfieldlaboratories.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://bigmatureladiestube.com/cgi-bin/crtr/out.cgi?id=499&l=topmain&u=https://playonlinecasino.us.org  http://falafull.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://z-ultimate.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://gasswebermullins.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://artlease.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.payhealth.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.etidol.com/link.php?url=https://playonlinecasino.us.org  http://conroegaragedoors.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.prmpromise.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://media-com.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://handsoflight.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://semme.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://minnesotachamber.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://americanmedbilling.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.okcmaa.org/default.aspx?p=TrackHyperlink&url=https://playonlinecasino.us.org  http://thunderbirdinvestors.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.sharebabe.com/crtr/cgi/out.cgi?id=107&tag=hardtop&trade=https://playonlinecasino.us.org   http://djotjog.com/cp2/tred?url=https://playonlinecasino.us.org/ \n \n \n \n \n \nhttp://slpsfd.org/forum/index.php?topic=24161.new#new\nhttp://xn--80aihgzecn.xn--p1ai/index.php?/topic/169614-317-source-download-list/\nhttp://rusavtonomgaz.ru/forum/?PAGE_NAME=message&FID=5&TID=4532&TITLE_SEO=4532-naked-padme-amidala&MID=89543&sessid=6e78325503b264e6b89cb52ea717b2dc&TOPIC_SUBSCRIBE=Y&FORUM_SUBSCRIBE=Y&result=new\nhttps://forum.radio-fresh.net/index.php?topic=542087.new#new\nhttps://optimisationducapitalhumain.com/forum/index.php?topic=249966.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8496, "cpu_time_ms": 73, "memory_kb": 5476}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s500799911", "group_id": "codeNet:p03941", "input_text": "http://lexconx.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://alghurairexchange.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://nationstarfhaloans.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://azt.ggeek.ru/azt-zbt.php?p=ggeek&backurl=https://playonlinecasino.us.org  https://www.publichealth.pitt.edu/LinkClick.aspx?link=https://playonlinecasino.us.org   http://horoshevo-mnevniki.mos.ru/bitrix/rk.php?id=6434&goto=https://playonlinecasino.us.org  http://www.sofehfree.blogsky.com/dailylink/?go=https://playonlinecasino.us.org  http://fmoon.cn/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org   http://appida.tstory.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://m.shopinphoenix.com/redirect.aspx?url=https://playonlinecasino.us.org  http://zowieprocessing.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.bengtssons-mapskin.gq/e/o/?/movies/go.php?id=1129999_1&url=https://playonlinecasino.us.org   http://independent-sponsors.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pmu.nodarksuits.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://webmail.znet.net/x/util/go.php?url=https://playonlinecasino.us.org  http://www.dgyymd.com/118/redirect.php?url=https://playonlinecasino.us.org  http://aquariusasset.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://700riverdistrict.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://researchspider.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://sorn.eagle-engineering.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://ichair.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://forum.freidenkerin.at/forum/thread.php?goto=playonlinecasino.us.org  http://burriandcompany.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kakdelarussia.ru/engine/go.php?url=playonlinecasino.us.org  http://eyewitnesssports.me/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://touchquote.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kraynakfamily.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://sbomag.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://phoenixranchcamp.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://computer.xtu.xk.hnlat.com/index.php?m=currency&c=free&a=show&catid=2486&id=236&url=https://playonlinecasino.us.org   http://eosmith.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://simplybackyard.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.boyfriendtv.com/videos/most-popular/today/?go=click&c=3&n=13&e=0&g=3&r=2099294&u=https://playonlinecasino.us.org  http://chaparri.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://guidestonefinancialgroup.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://beitsafafa.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://blagovest-vlg.ru/bitrix/rk.php?goto=https://playonlinecasino.us.org/  http://unibetlivecasino.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.cnymk.com/ad/url.php?url=https://playonlinecasino.us.org   http://lougheskeresort.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://picoryu.com/mt/mt4i.cgi?id=1&mode=redirect&no=78&ref_eid=827&url=https://playonlinecasino.us.org   http://leaseup.rentals/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://seattlevetspecialists.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://solumatics.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.charities.com.au/redirect.asp?n=4345&u=https://playonlinecasino.us.org \nhttp://newsfrombree.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://trakgrad.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://martin-seelhofer.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.bigtitsmovie.xtopsite.info/out.cgi?ses=DhgmYnC5hi&id=189&url=https://playonlinecasino.us.org  http://islandofsong.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://157061541.r.bat.bing.com/?ld=d3406WL54FL-1EhhUIL8O7sjVUCUzK-Fwsl0RX9d0BpxSu0Vz0MwomwShxwaJxLnoFesJ3ERXoHEIefOU0s1Cb50GVKmY2lOc7YBLLMRCpqSfTdipAG7il9fiwkcAByPs4zTX9Ioe8NDQ1zn09s3zeF4uuI_5HLq2p4J_Z5li7ZNEvkFKV&u=https://playonlinecasino.us.org  http://digitallandrun.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://theprocessadvantage.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://my-building-rocks.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://scholarnet.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://paylessloans.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://paradeofponds.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://5talk.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://shoutoutcd.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://mainpostcapital.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://www.boots-sampling.co.uk/track.ashx?r=https://playonlinecasino.us.org  http://cellardoorservice.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://sherlockwashington.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://k4capitalpartners.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://67.220.92.12/forum/redirect.php?fid=230&tid=1668583&goto=playonlinecasino.us.org   http://gradtassel.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://relevancetank.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://embed-marin.thehcn.net/redir.php?url=https://playonlinecasino.us.org   http://totalrewardsinstitute.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.didattica-cps.unito.it/do/home.pl/Accessibility?referer=https://playonlinecasino.us.org  http://www.foodscan.com.hk/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cc13.com/sitebar/go.php?id=258&url=https://playonlinecasino.us.org \nhttp://velvethead.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.hgzw.gov.cn/icity/uc/login?goto=https://playonlinecasino.us.org   http://www.action-bearing.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.ferrarichat.com/forum/index.php?referer=http%3A%2F%2Fwww.ferrarichat.com%2Fforum%2Fshowthread.php%3Ft%3D525943&code=999fc4259349264074e8063f309a5965&board_url=https://playonlinecasino.us.org  http://victoriapearson.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://smartycamhd.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://instrumart.co.nz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://catholicbusinesses.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://horselabels.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://healthyagingnewsletter.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://loydtruevalue.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://gsagency.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://orgonetherapy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.recycleamericaalliance.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://ydkn.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://joynts.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://irpanasonic.blogsky.com/dailylink/?go=https://playonlinecasino.us.org   http://ydb.ccmpcapital.be/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://0.0.0.ehhkzg.mannlist.com/viewtopic.php?f=10&t=45892535\nhttp://optcement.kiev.ua/forum/showthread.php?p=687513#post687513\nhttps://kokifilmaziureti.lt/2016/07/24/we-need-to-talk-about-kevin-2011/\nhttps://i2insights.org/2018/09/11/strengthening-environmental-humanities/\nhttp://www.goblinopera.com/forum/index.php?topic=58439.new#new\n", "language": "Lisp", "metadata": {"date": 1548645989, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s500799911.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s500799911", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://lexconx.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://alghurairexchange.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://nationstarfhaloans.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://azt.ggeek.ru/azt-zbt.php?p=ggeek&backurl=https://playonlinecasino.us.org  https://www.publichealth.pitt.edu/LinkClick.aspx?link=https://playonlinecasino.us.org   http://horoshevo-mnevniki.mos.ru/bitrix/rk.php?id=6434&goto=https://playonlinecasino.us.org  http://www.sofehfree.blogsky.com/dailylink/?go=https://playonlinecasino.us.org  http://fmoon.cn/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org   http://appida.tstory.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://m.shopinphoenix.com/redirect.aspx?url=https://playonlinecasino.us.org  http://zowieprocessing.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.bengtssons-mapskin.gq/e/o/?/movies/go.php?id=1129999_1&url=https://playonlinecasino.us.org   http://independent-sponsors.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pmu.nodarksuits.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://webmail.znet.net/x/util/go.php?url=https://playonlinecasino.us.org  http://www.dgyymd.com/118/redirect.php?url=https://playonlinecasino.us.org  http://aquariusasset.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://700riverdistrict.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://researchspider.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://sorn.eagle-engineering.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://ichair.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://forum.freidenkerin.at/forum/thread.php?goto=playonlinecasino.us.org  http://burriandcompany.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kakdelarussia.ru/engine/go.php?url=playonlinecasino.us.org  http://eyewitnesssports.me/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://touchquote.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://kraynakfamily.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://sbomag.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://phoenixranchcamp.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://computer.xtu.xk.hnlat.com/index.php?m=currency&c=free&a=show&catid=2486&id=236&url=https://playonlinecasino.us.org   http://eosmith.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://simplybackyard.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.boyfriendtv.com/videos/most-popular/today/?go=click&c=3&n=13&e=0&g=3&r=2099294&u=https://playonlinecasino.us.org  http://chaparri.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://guidestonefinancialgroup.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://beitsafafa.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://blagovest-vlg.ru/bitrix/rk.php?goto=https://playonlinecasino.us.org/  http://unibetlivecasino.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.cnymk.com/ad/url.php?url=https://playonlinecasino.us.org   http://lougheskeresort.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://picoryu.com/mt/mt4i.cgi?id=1&mode=redirect&no=78&ref_eid=827&url=https://playonlinecasino.us.org   http://leaseup.rentals/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://seattlevetspecialists.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://solumatics.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.charities.com.au/redirect.asp?n=4345&u=https://playonlinecasino.us.org \nhttp://newsfrombree.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://trakgrad.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://martin-seelhofer.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.bigtitsmovie.xtopsite.info/out.cgi?ses=DhgmYnC5hi&id=189&url=https://playonlinecasino.us.org  http://islandofsong.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://157061541.r.bat.bing.com/?ld=d3406WL54FL-1EhhUIL8O7sjVUCUzK-Fwsl0RX9d0BpxSu0Vz0MwomwShxwaJxLnoFesJ3ERXoHEIefOU0s1Cb50GVKmY2lOc7YBLLMRCpqSfTdipAG7il9fiwkcAByPs4zTX9Ioe8NDQ1zn09s3zeF4uuI_5HLq2p4J_Z5li7ZNEvkFKV&u=https://playonlinecasino.us.org  http://digitallandrun.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://theprocessadvantage.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://my-building-rocks.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://scholarnet.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://paylessloans.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://paradeofponds.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://5talk.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://shoutoutcd.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://mainpostcapital.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://www.boots-sampling.co.uk/track.ashx?r=https://playonlinecasino.us.org  http://cellardoorservice.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://sherlockwashington.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://k4capitalpartners.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://67.220.92.12/forum/redirect.php?fid=230&tid=1668583&goto=playonlinecasino.us.org   http://gradtassel.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://relevancetank.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://embed-marin.thehcn.net/redir.php?url=https://playonlinecasino.us.org   http://totalrewardsinstitute.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.didattica-cps.unito.it/do/home.pl/Accessibility?referer=https://playonlinecasino.us.org  http://www.foodscan.com.hk/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cc13.com/sitebar/go.php?id=258&url=https://playonlinecasino.us.org \nhttp://velvethead.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.hgzw.gov.cn/icity/uc/login?goto=https://playonlinecasino.us.org   http://www.action-bearing.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.ferrarichat.com/forum/index.php?referer=http%3A%2F%2Fwww.ferrarichat.com%2Fforum%2Fshowthread.php%3Ft%3D525943&code=999fc4259349264074e8063f309a5965&board_url=https://playonlinecasino.us.org  http://victoriapearson.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://smartycamhd.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://instrumart.co.nz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://catholicbusinesses.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://horselabels.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://healthyagingnewsletter.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://loydtruevalue.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://gsagency.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://orgonetherapy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.recycleamericaalliance.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://ydkn.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://joynts.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://irpanasonic.blogsky.com/dailylink/?go=https://playonlinecasino.us.org   http://ydb.ccmpcapital.be/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://0.0.0.ehhkzg.mannlist.com/viewtopic.php?f=10&t=45892535\nhttp://optcement.kiev.ua/forum/showthread.php?p=687513#post687513\nhttps://kokifilmaziureti.lt/2016/07/24/we-need-to-talk-about-kevin-2011/\nhttps://i2insights.org/2018/09/11/strengthening-environmental-humanities/\nhttp://www.goblinopera.com/forum/index.php?topic=58439.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8412, "cpu_time_ms": 107, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s179798746", "group_id": "codeNet:p03941", "input_text": "http://worldmarketconsultants.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://businessfruit.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://seattledoctorlaw.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://forum.gsi.de/index.php?t=tree&th=4080&goto=playonlinecasino.us.org  http://www.standrewseaton.org.uk/goto-link.php?link_id=22&url=https://playonlinecasino.us.org   http://www27.smutserver.com/cgi-bin/a2/out.cgi?s=80&u=https://playonlinecasino.us.org  http://budgetmotelsinc.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://driving-the-world.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.pjaf.org/__media__/js/trademark.php?d=playonlinecasino.us.org \nhttps://megaskrepka.ru/bitrix/rk.php?id=8293&goto=playonlinecasino.us.org  http://www.electric-valve.com/dialog_2.htm?arg=kldcn&style=2&kf=&kflist=on&kf=100308300&zdkf_type=2&language=cn&charset=utf-8&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://playonlinecasino.us.org   http://elearningmakeovers.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://bhpva.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://blog.ckun.vip/wp-content/themes/begin-1/inc/go.php?url=https://playonlinecasino.us.org   http://affittistagionali.it/go.php?url=https://playonlinecasino.us.org/  http://recycleamerica.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.tmchemicalslp.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://chevrolised.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://pegasusflyingcafe.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://panatlanticbankandtrustltd.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.kantil.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.yanwo.jjjtech.com/public/register.html?referer=https://playonlinecasino.us.org  http://www.nosovski.com/redirect.php?url=playonlinecasino.us.org   http://www.e-kwiaciarnia.radom.pl/do/countryAndCurrency?referer=https://playonlinecasino.us.org  http://sultanalolama.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://scalventurepartners.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://tecdsl.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://piratia.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wolframinvestments.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://remathensltd.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.horsestable.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://abettermenow.com/go.php?url=https://playonlinecasino.us.org   http://valleycoop.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.happy10th.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://jackbinion.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cisnerosandsonsgroup.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://astonmartinofsandiego.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://tnteeninstitute.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.lincolnindustrial.com/LinkClick.aspx?link=https://playonlinecasino.us.org   http://transformkohls.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://uncein.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://mynetworthchannel.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://immigrationinsight.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://qkc.westsidetennis.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.regionale-schienen.at/redirect.asp?link=https://playonlinecasino.us.org \nhttp://blognamegenerator.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://halloffamemusic.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://internationalpaymentbank.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://statemanager.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://brightling-thestarchild.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://usartmuseums.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://nascarimages.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://trilogyspiceextracts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.allsaintscottenham.org.uk/goto-link.php?link_id=22&url=https://playonlinecasino.us.org \nhttp://onlinegaytube.top/sr/out.php?l=0s.1.7.288.376&u=/playonlinecasino.us.org  http://roadburner.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://officialmayanresorts.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.fvacances.com/redir.asp?url=https://playonlinecasino.us.org  http://castlerocktx.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://playtone.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://vpncalculator.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.lain1978.com/baby/urlredirect.php?go=https://playonlinecasino.us.org   http://7tides.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://greatercommunitybancorp.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.teenshare.club/go?url=https://playonlinecasino.us.org   https://www.vodafone.es/mivodafone/es/alta-mivodafone?referrer=forum%3Freferer=https://playonlinecasino.us.org   http://www.trendbbs.com/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org  http://designdogs.net/phpinfo?a<>=<a href=https://playonlinecasino.us.org>ftp replacement</a>   http://www.89zsw.com/go.asp?url=https://playonlinecasino.us.org  http://images.google.com.do/url?q=https://playonlinecasino.us.org  http://nachhaltigeentwicklung.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://forum.powerbasic.com/forum/cv/hardware-software-os-networking/751986-can-exe-file-extensions-always-be-replaced-with-com?goto=playonlinecasino.us.org \nhttp://www.premiermicroscopyresource.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://thingsthatblink.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://pointsbeyond.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://capitalvisions.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://rape-portal.biz/cgi-bin/out.cgi?id=720&l=top_top&u=https://playonlinecasino.us.org   http://universaldjacademy.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bbs.fengqiyc.com/home.php?mod=space&uid=63442&do=album&picid=8424&goto=playonlinecasino.us.org  http://www.taotaomeiya.com/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org   http://www.meckabc.com/LinkClick.aspx?link=https://playonlinecasino.us.org \nhttp://www.bluehillfarm.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://quo.peiweiasiandinner.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cwa4100.org/uebimiau/redir.php?https://playonlinecasino.us.org/   http://privateyoung.pro/cgi-bin/out.cgi?id=13&l=site&u=https://playonlinecasino.us.org  http://new.ordo.kg/bitrix/redirect.php?event1=news_out&event2=http://www.demirbank.kg&event3=Демир+Кыргыз+Интернэшнл+Банк+(ДКИБ)&goto=https://playonlinecasino.us.org   http://navarredesigngroup.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.ishidazaka.net/m/r.php?https://playonlinecasino.us.org  http://businessofsex.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://top-of-the-mountains.at/goto.php?id=5198&url=https://playonlinecasino.us.org \n \n \n \n \n \nhttp://forum.2dar2.de/index.php?topic=143386.new#new\nhttps://meresparaxenes.com/2016/04/19/max-spiers-%cf%8c%ce%bb%ce%b7-%ce%b7-%ce%bc%ce%bf%cf%85%cf%83%ce%b9%ce%ba%ce%ae-%ce%b2%ce%b9%ce%bf%ce%bc%ce%b7%cf%87%ce%b1%ce%bd%ce%af%ce%b1-%cf%83%cf%84%ce%b7%cf%81%ce%af%ce%b6%ce%b5%cf%84%ce%b1/\nhttp://wtrawie.pl/index.php?topic=1285877.new#new\nhttps://kokifilmaziureti.lt/2016/07/24/we-need-to-talk-about-kevin-2011/\nhttps://www.oix.legal/ico-forum/index.php?topic=1569756.new#new\n", "language": "Lisp", "metadata": {"date": 1548634230, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s179798746.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s179798746", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://worldmarketconsultants.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://businessfruit.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://seattledoctorlaw.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://forum.gsi.de/index.php?t=tree&th=4080&goto=playonlinecasino.us.org  http://www.standrewseaton.org.uk/goto-link.php?link_id=22&url=https://playonlinecasino.us.org   http://www27.smutserver.com/cgi-bin/a2/out.cgi?s=80&u=https://playonlinecasino.us.org  http://budgetmotelsinc.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://driving-the-world.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.pjaf.org/__media__/js/trademark.php?d=playonlinecasino.us.org \nhttps://megaskrepka.ru/bitrix/rk.php?id=8293&goto=playonlinecasino.us.org  http://www.electric-valve.com/dialog_2.htm?arg=kldcn&style=2&kf=&kflist=on&kf=100308300&zdkf_type=2&language=cn&charset=utf-8&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://playonlinecasino.us.org   http://elearningmakeovers.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://bhpva.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://blog.ckun.vip/wp-content/themes/begin-1/inc/go.php?url=https://playonlinecasino.us.org   http://affittistagionali.it/go.php?url=https://playonlinecasino.us.org/  http://recycleamerica.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.tmchemicalslp.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://chevrolised.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://pegasusflyingcafe.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://panatlanticbankandtrustltd.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.kantil.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.yanwo.jjjtech.com/public/register.html?referer=https://playonlinecasino.us.org  http://www.nosovski.com/redirect.php?url=playonlinecasino.us.org   http://www.e-kwiaciarnia.radom.pl/do/countryAndCurrency?referer=https://playonlinecasino.us.org  http://sultanalolama.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://scalventurepartners.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://tecdsl.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://piratia.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://wolframinvestments.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://remathensltd.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.horsestable.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://abettermenow.com/go.php?url=https://playonlinecasino.us.org   http://valleycoop.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.happy10th.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://jackbinion.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cisnerosandsonsgroup.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://astonmartinofsandiego.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://tnteeninstitute.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.lincolnindustrial.com/LinkClick.aspx?link=https://playonlinecasino.us.org   http://transformkohls.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://uncein.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://mynetworthchannel.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://immigrationinsight.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://qkc.westsidetennis.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.regionale-schienen.at/redirect.asp?link=https://playonlinecasino.us.org \nhttp://blognamegenerator.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://halloffamemusic.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://internationalpaymentbank.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://statemanager.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://brightling-thestarchild.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://usartmuseums.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://nascarimages.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://trilogyspiceextracts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.allsaintscottenham.org.uk/goto-link.php?link_id=22&url=https://playonlinecasino.us.org \nhttp://onlinegaytube.top/sr/out.php?l=0s.1.7.288.376&u=/playonlinecasino.us.org  http://roadburner.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://officialmayanresorts.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.fvacances.com/redir.asp?url=https://playonlinecasino.us.org  http://castlerocktx.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://playtone.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://vpncalculator.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.lain1978.com/baby/urlredirect.php?go=https://playonlinecasino.us.org   http://7tides.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://greatercommunitybancorp.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.teenshare.club/go?url=https://playonlinecasino.us.org   https://www.vodafone.es/mivodafone/es/alta-mivodafone?referrer=forum%3Freferer=https://playonlinecasino.us.org   http://www.trendbbs.com/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org  http://designdogs.net/phpinfo?a<>=<a href=https://playonlinecasino.us.org>ftp replacement</a>   http://www.89zsw.com/go.asp?url=https://playonlinecasino.us.org  http://images.google.com.do/url?q=https://playonlinecasino.us.org  http://nachhaltigeentwicklung.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://forum.powerbasic.com/forum/cv/hardware-software-os-networking/751986-can-exe-file-extensions-always-be-replaced-with-com?goto=playonlinecasino.us.org \nhttp://www.premiermicroscopyresource.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://thingsthatblink.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://pointsbeyond.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://capitalvisions.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://rape-portal.biz/cgi-bin/out.cgi?id=720&l=top_top&u=https://playonlinecasino.us.org   http://universaldjacademy.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://bbs.fengqiyc.com/home.php?mod=space&uid=63442&do=album&picid=8424&goto=playonlinecasino.us.org  http://www.taotaomeiya.com/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org   http://www.meckabc.com/LinkClick.aspx?link=https://playonlinecasino.us.org \nhttp://www.bluehillfarm.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://quo.peiweiasiandinner.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://cwa4100.org/uebimiau/redir.php?https://playonlinecasino.us.org/   http://privateyoung.pro/cgi-bin/out.cgi?id=13&l=site&u=https://playonlinecasino.us.org  http://new.ordo.kg/bitrix/redirect.php?event1=news_out&event2=http://www.demirbank.kg&event3=Демир+Кыргыз+Интернэшнл+Банк+(ДКИБ)&goto=https://playonlinecasino.us.org   http://navarredesigngroup.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.ishidazaka.net/m/r.php?https://playonlinecasino.us.org  http://businessofsex.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://top-of-the-mountains.at/goto.php?id=5198&url=https://playonlinecasino.us.org \n \n \n \n \n \nhttp://forum.2dar2.de/index.php?topic=143386.new#new\nhttps://meresparaxenes.com/2016/04/19/max-spiers-%cf%8c%ce%bb%ce%b7-%ce%b7-%ce%bc%ce%bf%cf%85%cf%83%ce%b9%ce%ba%ce%ae-%ce%b2%ce%b9%ce%bf%ce%bc%ce%b7%cf%87%ce%b1%ce%bd%ce%af%ce%b1-%cf%83%cf%84%ce%b7%cf%81%ce%af%ce%b6%ce%b5%cf%84%ce%b1/\nhttp://wtrawie.pl/index.php?topic=1285877.new#new\nhttps://kokifilmaziureti.lt/2016/07/24/we-need-to-talk-about-kevin-2011/\nhttps://www.oix.legal/ico-forum/index.php?topic=1569756.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8577, "cpu_time_ms": 24, "memory_kb": 4200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s737044532", "group_id": "codeNet:p03941", "input_text": "http://completeandsave.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://twinkcute.com/cgi-bin/out.cgi?id=31&l=top_top&req=1&t=100t&u=https://playonlinecasino.us.org   http://winetubes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://escondidoaccidentattorney.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://rephreshprob.co.uk/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://spuni.is/sitebar/go.php?id=490&url=https://playonlinecasino.us.org  http://velvetroom.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.mwsab.de/LinkClick.aspx?link=https://playonlinecasino.us.org   http://guardian-life-insurance.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://qataria.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://seedpvt.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://dianesimon.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://deltacommunitysb.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://citysavingsinsurance.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.moteco.net/jump.php?u=https://playonlinecasino.us.org  http://so.wenxinyizhan.com/url.php?url=https://playonlinecasino.us.org  http://www.howfox.com/redirect.php?fid=392&tid=1168022&goto=playonlinecasino.us.org   http://www.lewisbrisbois.vg/__media__/js/trademark.php?d=playonlinecasino.us.org \nhttp://royalislandrentals.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://usachinacars.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.faxremovalservice.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://integracja-z-hurtowniami-sklep-internetowy.sklepywww.pl/redirect.php?action=url&goto=https://playonlinecasino.us.org  http://blog.wjedu.net/go.asp?url=https://playonlinecasino.us.org   http://www.szerelvenyhaz.hu/index.php/redir.php?id=19&link=https://playonlinecasino.us.org  http://bianpingeishui.com/go.asp?url=https://playonlinecasino.us.org  https://go.kamyabscript.ir/index.php?url=https://playonlinecasino.us.org   http://christyswwtools.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://precisionadvocacy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://firmenregister.de/click.php?eid=286401&www=https://playonlinecasino.us.org   http://www.hlr.com.ua/bitrix/redirect.php?event1=&event2=&event3=&goto=https://playonlinecasino.us.org   http://1-800-stopdwi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://georgann.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://freelancerhall.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.tim-flachdachbau.ch/index.php??s=https://playonlinecasino.us.org  http://airsafetyexperts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.iwow.it/en/utility/redirect.asp?ID=1&url=https://playonlinecasino.us.org \nhttp://bryancavellp.tw/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.pulseit.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://ameritexfabrics.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://gloris-nsk.com/outlink.php?link=https://playonlinecasino.us.org  http://www.wecompy.com/605/uact/login?referer=https://playonlinecasino.us.org   http://webstrider.com/news/go.php?playonlinecasino.us.org  http://alltrak.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.lacombelive.ca/LinkClick.aspx?link=https://playonlinecasino.us.org   http://thegrasslands.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://caldirect.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://eng101winter2010.wikispaces.com/page/edit/P2+Group+Pages?goto=https://playonlinecasino.us.org   http://www.1branson.com/forum/redirector.php?url=https://playonlinecasino.us.org   http://www.mauricezetena.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://my4dx.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://insuranceportfolioanalysis.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://rationallyspeakingpodcast.org/process/RedirectN?url=https://playonlinecasino.us.org  http://www.fs0745.com/bbs/redirect.php?tid=36858&goto=playonlinecasino.us.org   http://xxxtree.com/out.php?v=https://playonlinecasino.us.org \nhttp://publispot.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://paymentfort.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://skystarts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://jetfizz.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://audicincinnatiwest.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://peconicbayimpressionists.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://jidoshaseibishi.com/click3.cgi?cnt=jaspa&url=https://playonlinecasino.us.org/  http://v-s-bellido.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://tueskina.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttps://api.bitrix24.com/bitrix/rk.php?id=5&site_id=ua&event1=banner&event2=click&event3=1+/+<>]+<MAIN>PAGE1]+Баннер+на+главной+(многоязычность)+UA&goto=https://playonlinecasino.us.org  http://sso.aoa.org/Authenticate.aspx?Return=https://playonlinecasino.us.org   http://wingГҐrdh.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://nudinsk.ru/go/url=https://playonlinecasino.us.org  http://forexbox.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://saanenbank.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://whatshappeninatusfood.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://warsaw.ixpat.com/?p=classifieds&cat=5&partner=playonlinecasino.us.org   http://www.harbordodge.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://images.google.co.bw/url?q=https://playonlinecasino.us.org  http://saveonhealthandfitness.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://freesmartcreditreports360.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://orangeyouproud.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://thesandyspringlocksmith.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://f-palme.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://tripplertravel.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://mycsharp.de/wbb2/thread.php?goto=playonlinecasino.us.org   http://lifeateastmark.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://levittpavilions.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://geyjar.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://archiverwww.lanecat.com.tw/redirect.php?tid=20323&goto=playonlinecasino.us.org   http://orobird.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://antiqueclothier.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://i-hate-david-weekley-homes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://www.lulupao.me/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org  http://yaserp.net/site-info/surf.17227461.vkrugudruzei.ru/x/outlink?url=playonlinecasino.us.org   http://carbeq.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://dbo-alliance.com/viewtopic.php?f=3&t=3636\nhttp://www.everythingisundercontrol.org/bb/viewtopic.php?f=4&t=120930\nhttp://mewatidunya.com/forum/viewtopic.php?pid=709907#p709907\nhttp://xn-iexed-eja832dbar49b214w.mannlist.com/viewtopic.php?f=10&t=45878135\nhttp://yallalive.live/vb/showthread.php?p=175489#post175489\n", "language": "Lisp", "metadata": {"date": 1548581308, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s737044532.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s737044532", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://completeandsave.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://twinkcute.com/cgi-bin/out.cgi?id=31&l=top_top&req=1&t=100t&u=https://playonlinecasino.us.org   http://winetubes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://escondidoaccidentattorney.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://rephreshprob.co.uk/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://spuni.is/sitebar/go.php?id=490&url=https://playonlinecasino.us.org  http://velvetroom.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.mwsab.de/LinkClick.aspx?link=https://playonlinecasino.us.org   http://guardian-life-insurance.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://qataria.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://seedpvt.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://dianesimon.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://deltacommunitysb.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://citysavingsinsurance.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.moteco.net/jump.php?u=https://playonlinecasino.us.org  http://so.wenxinyizhan.com/url.php?url=https://playonlinecasino.us.org  http://www.howfox.com/redirect.php?fid=392&tid=1168022&goto=playonlinecasino.us.org   http://www.lewisbrisbois.vg/__media__/js/trademark.php?d=playonlinecasino.us.org \nhttp://royalislandrentals.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://usachinacars.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.faxremovalservice.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://integracja-z-hurtowniami-sklep-internetowy.sklepywww.pl/redirect.php?action=url&goto=https://playonlinecasino.us.org  http://blog.wjedu.net/go.asp?url=https://playonlinecasino.us.org   http://www.szerelvenyhaz.hu/index.php/redir.php?id=19&link=https://playonlinecasino.us.org  http://bianpingeishui.com/go.asp?url=https://playonlinecasino.us.org  https://go.kamyabscript.ir/index.php?url=https://playonlinecasino.us.org   http://christyswwtools.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://precisionadvocacy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://firmenregister.de/click.php?eid=286401&www=https://playonlinecasino.us.org   http://www.hlr.com.ua/bitrix/redirect.php?event1=&event2=&event3=&goto=https://playonlinecasino.us.org   http://1-800-stopdwi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://georgann.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://freelancerhall.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.tim-flachdachbau.ch/index.php??s=https://playonlinecasino.us.org  http://airsafetyexperts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.iwow.it/en/utility/redirect.asp?ID=1&url=https://playonlinecasino.us.org \nhttp://bryancavellp.tw/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.pulseit.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://ameritexfabrics.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://gloris-nsk.com/outlink.php?link=https://playonlinecasino.us.org  http://www.wecompy.com/605/uact/login?referer=https://playonlinecasino.us.org   http://webstrider.com/news/go.php?playonlinecasino.us.org  http://alltrak.us/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.lacombelive.ca/LinkClick.aspx?link=https://playonlinecasino.us.org   http://thegrasslands.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://caldirect.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://eng101winter2010.wikispaces.com/page/edit/P2+Group+Pages?goto=https://playonlinecasino.us.org   http://www.1branson.com/forum/redirector.php?url=https://playonlinecasino.us.org   http://www.mauricezetena.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://my4dx.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://insuranceportfolioanalysis.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://rationallyspeakingpodcast.org/process/RedirectN?url=https://playonlinecasino.us.org  http://www.fs0745.com/bbs/redirect.php?tid=36858&goto=playonlinecasino.us.org   http://xxxtree.com/out.php?v=https://playonlinecasino.us.org \nhttp://publispot.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://paymentfort.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://skystarts.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://jetfizz.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://audicincinnatiwest.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://peconicbayimpressionists.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://jidoshaseibishi.com/click3.cgi?cnt=jaspa&url=https://playonlinecasino.us.org/  http://v-s-bellido.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://tueskina.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttps://api.bitrix24.com/bitrix/rk.php?id=5&site_id=ua&event1=banner&event2=click&event3=1+/+<>]+<MAIN>PAGE1]+Баннер+на+главной+(многоязычность)+UA&goto=https://playonlinecasino.us.org  http://sso.aoa.org/Authenticate.aspx?Return=https://playonlinecasino.us.org   http://wingГҐrdh.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://nudinsk.ru/go/url=https://playonlinecasino.us.org  http://forexbox.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://saanenbank.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://whatshappeninatusfood.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://warsaw.ixpat.com/?p=classifieds&cat=5&partner=playonlinecasino.us.org   http://www.harbordodge.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://images.google.co.bw/url?q=https://playonlinecasino.us.org  http://saveonhealthandfitness.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://freesmartcreditreports360.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://orangeyouproud.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://thesandyspringlocksmith.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://f-palme.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://tripplertravel.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://mycsharp.de/wbb2/thread.php?goto=playonlinecasino.us.org   http://lifeateastmark.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://levittpavilions.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://geyjar.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://archiverwww.lanecat.com.tw/redirect.php?tid=20323&goto=playonlinecasino.us.org   http://orobird.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://antiqueclothier.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://i-hate-david-weekley-homes.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://www.lulupao.me/wp-content/themes/begin/inc/go.php?url=https://playonlinecasino.us.org  http://yaserp.net/site-info/surf.17227461.vkrugudruzei.ru/x/outlink?url=playonlinecasino.us.org   http://carbeq.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \n \n \n \n \n \nhttp://dbo-alliance.com/viewtopic.php?f=3&t=3636\nhttp://www.everythingisundercontrol.org/bb/viewtopic.php?f=4&t=120930\nhttp://mewatidunya.com/forum/viewtopic.php?pid=709907#p709907\nhttp://xn-iexed-eja832dbar49b214w.mannlist.com/viewtopic.php?f=10&t=45878135\nhttp://yallalive.live/vb/showthread.php?p=175489#post175489\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8050, "cpu_time_ms": 77, "memory_kb": 7780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s331424134", "group_id": "codeNet:p03941", "input_text": "http://www.jiag.com/index.php?c=recognition&a=see_login_qrcode&referer=https://playonlinecasino.us.org  http://eduaids.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://q-vac.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://outofstock.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://guerrinhafilmes.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://nationaltruckday.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://museumcare.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://hockey-blimp.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://brothermeansbusiness.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://wemustvote.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.freehub.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.davidficklingbooks.com/Register.php?referer=https://playonlinecasino.us.org   http://www.organgrinderfilm.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://walk-and-photo.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.oga-architect.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://imgsports.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://guitarcenterspo.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://flvirtualeducation.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://chevychasebankhomeloan.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.serialblog.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://myrydexsgi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.rf114.com/main/index.php?mode=search&subact=goto&sseq=3513&url=https://playonlinecasino.us.org  http://biorigg.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.cliptags.net/Rd?u=https://playonlinecasino.us.org/  http://smilestrips.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://classstore.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://crillontours.com/latc/index.php/2015-11-27-00-58-29/2015-12-22-20-34-34/peru/item/8-boating-holiday-in-madeira-portugalgoto=playonlinecasino.us.org \nhttp://greenwichfisbo.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mulka.net/engine/redirect.php?url=https://playonlinecasino.us.org   http://johannastoeckler.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://revengetruck.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://omegastocks.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://saratov-citystar.ru/go?to=https://playonlinecasino.us.org  http://insightstohealing.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://aiakujundus.paranjape.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://prolavie.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.bloskyassociates.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://chevronhavoline.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://adventace.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://manufacturersjunctionrailway.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://live62.ru/redirect?url=https://playonlinecasino.us.org   http://www.smartshanghai.com/redirect/mar/12866&url=https://playonlinecasino.us.org  http://kassih.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://kaliningrad.2-berega.ru/bitrix/rk.php?id=1083&goto=playonlinecasino.us.org   http://alure.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.xoxohth.com/go.php?url=https://playonlinecasino.us.org  http://birminghamexaminer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://americasgreed.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://globalinfrafacility.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cameronvideo.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://talsar.reefs.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://destinydeploymentuniversity.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://world-address-guide.com/redirect.php?url=https://playonlinecasino.us.org   http://dryridgeharley.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://tracfonedevs.createaforum.com/index.php?thememode=full;redirect=https://playonlinecasino.us.org  http://kpwholesale.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://coleccion-carmen-thyssen-bornemisza.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://wearyparent.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.hypnosisdirect.16mb.com/lifestyle/success/go.php?url=https://playonlinecasino.us.org   http://www.kabukicho-girls.com/gal-links/click.php?id=209656&u=https://playonlinecasino.us.org  http://clubuzon.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.fudou-san.com/link/rank.cgi?mode=link&id=2898&url=https://playonlinecasino.us.org   http://gloryhelmets.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://backyardgamecourt.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://swimwithluey.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://intermarineusa.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://jimthren.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://247couplecams.com/cgi-bin/a2/out.cgi?id=41&l=top5&u=https://playonlinecasino.us.org   http://traveltoday247.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://tohefcu.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://smithsoniantween.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://pawnmagiq.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://calfery.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.ourtx.com/ourtx/info/go.php?to=https://playonlinecasino.us.org   http://dreamplanwed.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.openaudit.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.stalkershop.ru/bitrix/rk.php?id=9&site_id=s1&event1=banner&event2=click&event3=2+%2F+%5B9%5D+%5Bleft_0%5D+%D4%EB%E5%F8+%E1%E0%ED%ED%E5%F0+%F1+%E7%E0%E3%EB%F3%F8%EA%EE%E9+%28%F0%E0%E1%EE%F7%E0%FF+%EE%E4%E5%E6%E4%E0+249%F5323%29&goto=https://playonlinecasino.us.org   http://hyperoxy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pvhlimited.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://166.78.194.238/forums/blog.php?b=821&goto=playonlinecasino.us.org   http://fuggaya.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://deepdivingguide.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.israwow.com/go.php?id=playonlinecasino.us.org   http://supertrucks.mobi/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.zzwenshi.net/forum/redirect.php?fid=352&tid=5199&goto=playonlinecasino.us.org  http://bd.university/Proxy/index.php?url=playonlinecasino.us.org   http://myharkins.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://iwataboltmex.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://oncalldentist.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.cluejustice.org/r?u=https://playonlinecasino.us.org \n \n \n \n \n \nhttp://7e-it.net/vb/showthread.php?p=788688&posted=1#post788688\nhttp://forum.sustainablecitizenproject.com/viewtopic.php?f=22&t=6680\nhttp://sxt.ch/forum/viewtopic.php?pid=120868#p120868\nhttp://forum.mannlist.com/viewtopic.php?f=10&t=45875290\nhttp://forum.2dar2.de/index.php?topic=142693.new#new\n", "language": "Lisp", "metadata": {"date": 1548567891, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s331424134.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s331424134", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.jiag.com/index.php?c=recognition&a=see_login_qrcode&referer=https://playonlinecasino.us.org  http://eduaids.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://q-vac.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://outofstock.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://guerrinhafilmes.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://nationaltruckday.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://museumcare.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://hockey-blimp.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://brothermeansbusiness.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://wemustvote.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.freehub.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.davidficklingbooks.com/Register.php?referer=https://playonlinecasino.us.org   http://www.organgrinderfilm.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://walk-and-photo.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.oga-architect.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://imgsports.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://guitarcenterspo.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://flvirtualeducation.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://chevychasebankhomeloan.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.serialblog.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://myrydexsgi.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.rf114.com/main/index.php?mode=search&subact=goto&sseq=3513&url=https://playonlinecasino.us.org  http://biorigg.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.cliptags.net/Rd?u=https://playonlinecasino.us.org/  http://smilestrips.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://classstore.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://crillontours.com/latc/index.php/2015-11-27-00-58-29/2015-12-22-20-34-34/peru/item/8-boating-holiday-in-madeira-portugalgoto=playonlinecasino.us.org \nhttp://greenwichfisbo.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://mulka.net/engine/redirect.php?url=https://playonlinecasino.us.org   http://johannastoeckler.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://revengetruck.biz/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://omegastocks.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://saratov-citystar.ru/go?to=https://playonlinecasino.us.org  http://insightstohealing.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://aiakujundus.paranjape.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://prolavie.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.bloskyassociates.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://chevronhavoline.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://adventace.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://manufacturersjunctionrailway.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://live62.ru/redirect?url=https://playonlinecasino.us.org   http://www.smartshanghai.com/redirect/mar/12866&url=https://playonlinecasino.us.org  http://kassih.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  https://kaliningrad.2-berega.ru/bitrix/rk.php?id=1083&goto=playonlinecasino.us.org   http://alure.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://www.xoxohth.com/go.php?url=https://playonlinecasino.us.org  http://birminghamexaminer.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://americasgreed.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://globalinfrafacility.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://cameronvideo.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://talsar.reefs.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://destinydeploymentuniversity.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://world-address-guide.com/redirect.php?url=https://playonlinecasino.us.org   http://dryridgeharley.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://tracfonedevs.createaforum.com/index.php?thememode=full;redirect=https://playonlinecasino.us.org  http://kpwholesale.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://coleccion-carmen-thyssen-bornemisza.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://wearyparent.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.hypnosisdirect.16mb.com/lifestyle/success/go.php?url=https://playonlinecasino.us.org   http://www.kabukicho-girls.com/gal-links/click.php?id=209656&u=https://playonlinecasino.us.org  http://clubuzon.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.fudou-san.com/link/rank.cgi?mode=link&id=2898&url=https://playonlinecasino.us.org   http://gloryhelmets.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://backyardgamecourt.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://swimwithluey.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://intermarineusa.info/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://jimthren.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://247couplecams.com/cgi-bin/a2/out.cgi?id=41&l=top5&u=https://playonlinecasino.us.org   http://traveltoday247.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://tohefcu.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://smithsoniantween.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://pawnmagiq.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://calfery.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.ourtx.com/ourtx/info/go.php?to=https://playonlinecasino.us.org   http://dreamplanwed.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.openaudit.org/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.stalkershop.ru/bitrix/rk.php?id=9&site_id=s1&event1=banner&event2=click&event3=2+%2F+%5B9%5D+%5Bleft_0%5D+%D4%EB%E5%F8+%E1%E0%ED%ED%E5%F0+%F1+%E7%E0%E3%EB%F3%F8%EA%EE%E9+%28%F0%E0%E1%EE%F7%E0%FF+%EE%E4%E5%E6%E4%E0+249%F5323%29&goto=https://playonlinecasino.us.org   http://hyperoxy.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://pvhlimited.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://166.78.194.238/forums/blog.php?b=821&goto=playonlinecasino.us.org   http://fuggaya.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org \nhttp://deepdivingguide.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://www.israwow.com/go.php?id=playonlinecasino.us.org   http://supertrucks.mobi/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   http://www.zzwenshi.net/forum/redirect.php?fid=352&tid=5199&goto=playonlinecasino.us.org  http://bd.university/Proxy/index.php?url=playonlinecasino.us.org   http://myharkins.net/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://iwataboltmex.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org  http://oncalldentist.com/__media__/js/netsoltrademark.php?d=playonlinecasino.us.org   https://www.cluejustice.org/r?u=https://playonlinecasino.us.org \n \n \n \n \n \nhttp://7e-it.net/vb/showthread.php?p=788688&posted=1#post788688\nhttp://forum.sustainablecitizenproject.com/viewtopic.php?f=22&t=6680\nhttp://sxt.ch/forum/viewtopic.php?pid=120868#p120868\nhttp://forum.mannlist.com/viewtopic.php?f=10&t=45875290\nhttp://forum.2dar2.de/index.php?topic=142693.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8197, "cpu_time_ms": 92, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s949457738", "group_id": "codeNet:p03941", "input_text": "http://www1.realclearpolitics.com/printpage/?url=https://onlinecasino.us.org  http://www.coimpreneur.tabefy.com/category/tentang-bisnis/go.php?ID=2637&url=https://onlinecasino.us.org   http://mileclosertospace.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://build-muscle.goldenarticles.net/go.php?url=https://onlinecasino.us.org  http://privatelaunch.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://garciavespa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://videobranson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.yiplainview.com/track.php?id=0f0c60fa98ec4991a69cf4ea00b5ac26&url=https://onlinecasino.us.org   http://firstmile.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://dshotwell.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bbs.qrrfo.com/html/go/rb?url=https://onlinecasino.us.org   http://premierfoodshields.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://escultpancreatic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://merchandiseforall.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.nuolanyl.com/go.asp?url=https://onlinecasino.us.org  http://erection-specialists.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marcogarro.com/includes/go.php?url=onlinecasino.us.org   http://smileinvitations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mnpastors.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fatwa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://440doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.jakadi.dk/atc/out.cgi?s=60&l=topgallery&c=1&u=https://onlinecasino.us.org  http://www.jpgtech.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://geneerco.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://michaelpurser.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thikafoy.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bobsrandomdeals.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://uvarovo.org/go/url=onlinecasino.us.org  http://invinylwetrust.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://s5.stc.all.kpcdn.net/go/https://onlinecasino.us.org   http://partnerrelife.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ihatescionsatcarmax.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brevagenreport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eprimers.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.boatdockshower.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cisnerosbeergroup.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.youngerlove.com/cgi-bin/atc/out.cgi?id=118&u=https://onlinecasino.us.org  http://veggieclock.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mplp.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stephensandis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.nzsy.com/bbs/redirect.php?tid=17919&goto=onlinecasino.us.org   http://onlinekits.net/cgi-bin/atl/out.cgi?s=60&u=https://onlinecasino.us.org  http://www.historiesittard.nl/kapittel/web/redirect.php?letters=medium&url=https://onlinecasino.us.org  http://dreyfusconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lvshitop.com/home/link.php?url=https://onlinecasino.us.org \nhttp://dvdbingo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.autabuy.com/LinkOut/?goto=https://onlinecasino.us.org   http://451degreesproductions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sugarantsinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.burdicklawfirm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.icumed.com/australia-popup-form.aspx?referer=https://onlinecasino.us.org  http://www.1avnews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://zbf.deepjoymedia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mckinleypaper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://uhdmv.org/engine/go.php?url=onlinecasino.us.org  http://ulink.li/__media__/js/trademark.php?d=onlinecasino.us.org   http://ccrd-bc.ca/business/busclick.php?bid=&url=https://onlinecasino.us.org/   http://bcl2.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vankidok.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://arborschools.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fastpitchcentral.com/php2/redirect.php?t=Forums&?s=https://onlinecasino.us.org  http://creditrevolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.catwalk.com.au/scripts/redir.asp?link=https://onlinecasino.us.org \nhttp://markvandevelde.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.m-support.nl/zara/gastenboek/go.php?url=https://onlinecasino.us.org   http://rate-stroiteljstvo-pod-kluch.dirx.ru/click.php?url=https://onlinecasino.us.org   http://powergentrader.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.vanderbiltfinancial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lehmansrestaurant.com/__media__/js/trademark.php?d=onlinecasino.us.org  http://www.google.kz/url?q=https://onlinecasino.us.org  http://hagglys.com/bitrix/rk.php?goto=https://onlinecasino.us.org//   http://thelegendarysanta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://nlm.profitablestrategies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kinozal-zerkalo.appspot.com/groupexlist.php?q=go/https://onlinecasino.us.org   http://www.livingmart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.uark.biz/ru/go.php?go=https://onlinecasino.us.org  http://sales.hiremedical.com/home/redirect/??s=https://onlinecasino.us.org   http://touchpointmanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://keep-tube-0.blogsky.com/dailylink/?go=https://onlinecasino.us.org  http://hedwigbroadway.com/redirect.php?url=https://onlinecasino.us.org   http://www.scriptsnapps.com/redirect.php?url=https://onlinecasino.us.org \nhttp://enchantmarks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jmgplan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vistagestore.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://feelinginvincible.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://1800paydayloan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ec-central.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.visposi.it/redirect.jsp?f=Dettaglio+Albergo+www.hoteltretorri.it&url=onlinecasino.us.org  http://whywewine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://supersweetcuties.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://www.michiganalliancegroup.com/forum/showthread.php?tid=641111\nhttp://www.xo-x.net/vb/showthread.php?p=175811#post175811\nhttp://omen.im/forum/index.php?topic=31670.new#new\nhttp://www.twoweekwait.com/community/viewtopic.php?f=11&t=250521\nhttp://www.elveterinario10.com/foro/index.php?topic=9021.new#new\n", "language": "Lisp", "metadata": {"date": 1548510932, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s949457738.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s949457738", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www1.realclearpolitics.com/printpage/?url=https://onlinecasino.us.org  http://www.coimpreneur.tabefy.com/category/tentang-bisnis/go.php?ID=2637&url=https://onlinecasino.us.org   http://mileclosertospace.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://build-muscle.goldenarticles.net/go.php?url=https://onlinecasino.us.org  http://privatelaunch.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://garciavespa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://videobranson.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.yiplainview.com/track.php?id=0f0c60fa98ec4991a69cf4ea00b5ac26&url=https://onlinecasino.us.org   http://firstmile.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://dshotwell.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://bbs.qrrfo.com/html/go/rb?url=https://onlinecasino.us.org   http://premierfoodshields.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://escultpancreatic.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://merchandiseforall.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.nuolanyl.com/go.asp?url=https://onlinecasino.us.org  http://erection-specialists.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marcogarro.com/includes/go.php?url=onlinecasino.us.org   http://smileinvitations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://mnpastors.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fatwa.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://440doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.jakadi.dk/atc/out.cgi?s=60&l=topgallery&c=1&u=https://onlinecasino.us.org  http://www.jpgtech.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://geneerco.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://michaelpurser.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.thikafoy.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://bobsrandomdeals.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://uvarovo.org/go/url=onlinecasino.us.org  http://invinylwetrust.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://s5.stc.all.kpcdn.net/go/https://onlinecasino.us.org   http://partnerrelife.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ihatescionsatcarmax.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://brevagenreport.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://eprimers.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.boatdockshower.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cisnerosbeergroup.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.youngerlove.com/cgi-bin/atc/out.cgi?id=118&u=https://onlinecasino.us.org  http://veggieclock.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://mplp.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://stephensandis.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.nzsy.com/bbs/redirect.php?tid=17919&goto=onlinecasino.us.org   http://onlinekits.net/cgi-bin/atl/out.cgi?s=60&u=https://onlinecasino.us.org  http://www.historiesittard.nl/kapittel/web/redirect.php?letters=medium&url=https://onlinecasino.us.org  http://dreyfusconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lvshitop.com/home/link.php?url=https://onlinecasino.us.org \nhttp://dvdbingo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.autabuy.com/LinkOut/?goto=https://onlinecasino.us.org   http://451degreesproductions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sugarantsinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.burdicklawfirm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.icumed.com/australia-popup-form.aspx?referer=https://onlinecasino.us.org  http://www.1avnews.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://zbf.deepjoymedia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.mckinleypaper.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://uhdmv.org/engine/go.php?url=onlinecasino.us.org  http://ulink.li/__media__/js/trademark.php?d=onlinecasino.us.org   http://ccrd-bc.ca/business/busclick.php?bid=&url=https://onlinecasino.us.org/   http://bcl2.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://vankidok.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://arborschools.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.fastpitchcentral.com/php2/redirect.php?t=Forums&?s=https://onlinecasino.us.org  http://creditrevolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.catwalk.com.au/scripts/redir.asp?link=https://onlinecasino.us.org \nhttp://markvandevelde.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.m-support.nl/zara/gastenboek/go.php?url=https://onlinecasino.us.org   http://rate-stroiteljstvo-pod-kluch.dirx.ru/click.php?url=https://onlinecasino.us.org   http://powergentrader.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.vanderbiltfinancial.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.lehmansrestaurant.com/__media__/js/trademark.php?d=onlinecasino.us.org  http://www.google.kz/url?q=https://onlinecasino.us.org  http://hagglys.com/bitrix/rk.php?goto=https://onlinecasino.us.org//   http://thelegendarysanta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://nlm.profitablestrategies.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://kinozal-zerkalo.appspot.com/groupexlist.php?q=go/https://onlinecasino.us.org   http://www.livingmart.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.uark.biz/ru/go.php?go=https://onlinecasino.us.org  http://sales.hiremedical.com/home/redirect/??s=https://onlinecasino.us.org   http://touchpointmanagement.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://keep-tube-0.blogsky.com/dailylink/?go=https://onlinecasino.us.org  http://hedwigbroadway.com/redirect.php?url=https://onlinecasino.us.org   http://www.scriptsnapps.com/redirect.php?url=https://onlinecasino.us.org \nhttp://enchantmarks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jmgplan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vistagestore.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://feelinginvincible.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://1800paydayloan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.ec-central.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.visposi.it/redirect.jsp?f=Dettaglio+Albergo+www.hoteltretorri.it&url=onlinecasino.us.org  http://whywewine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://supersweetcuties.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://www.michiganalliancegroup.com/forum/showthread.php?tid=641111\nhttp://www.xo-x.net/vb/showthread.php?p=175811#post175811\nhttp://omen.im/forum/index.php?topic=31670.new#new\nhttp://www.twoweekwait.com/community/viewtopic.php?f=11&t=250521\nhttp://www.elveterinario10.com/foro/index.php?topic=9021.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7545, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s563458796", "group_id": "codeNet:p03941", "input_text": "http://hyperionservicesllc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://twn.northwestmassage.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://m.shopinelpaso.com/redirect.aspx?url=https://onlinecasino.us.org   http://sportybeach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://qualitytm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://texascollegiateleague.com/tracker/index.html?t=ad&pool_id=14&ad_id=48&url=https://onlinecasino.us.org  http://caecery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pittsburghlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.reality2003.com/akasaka/w3a/redirect.php?redirect=https://onlinecasino.us.org \nhttp://brandt.nonore.com/go.php?url=https://onlinecasino.us.org  http://www.elempaque.com/b2bportales/rlv.jsp?mail=EMAIL&codigoPortal=EE&numBoletin=2&tipoBoletin=em&url=https://onlinecasino.us.org   http://veloxitas.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.aziaten.com/goto.php?https://onlinecasino.us.org  http://www.digojp.com/goto/https://onlinecasino.us.org   http://c2bloc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hebosales.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sibdepo.ru/upload/rk/102/10215005c5ddd14ad871370330430517.swf?flash_link=onlinecasino.us.org   http://sulpizifamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://dootychamp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.nchomeownersalliance.org/r?u=https://onlinecasino.us.org   http://midlandlife.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vanburencountydem.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cfpsbc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.kyoto-ogoto.net/s/click.php?tcode=00013928&url=https://onlinecasino.us.org  http://integrityautofinance.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sunbeachmotel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.beachesquest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://jobsinelectronics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://benschetterer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://connectmycommunity.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lainkcasting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://peteremerson.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://piano-della-localita.ch/url.php?url=https://onlinecasino.us.org  http://poigraem-online.ru/go/url=https://onlinecasino.us.org  http://www.amicadvisor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clusters.okidatatonercartridges.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://vivalasvegasweddingreception.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://physics-animations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.dekoracie-vianoce.sk/plugins/guestbook/go.php?url=https://onlinecasino.us.org   http://mcobject.cn/bbs/redirect.php?goto=onlinecasino.us.org  http://www.taankoptometrists.co.uk/index.php?section=1139&tellafriend=go&url=https://onlinecasino.us.org&title=taank   http://virtualairportparking.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.rigidply.ms/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://personaenongrata.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.probiogenic.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.fishrod.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gregoryrogerbrown.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://voghouse.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://app.primal.com/crm/sales/deals/artificial%20intelligence;information;responses;contacts;author;change;admin;ways?u=https://onlinecasino.us.org  http://www.thefloridadesigngroup.com/seo-scan/onlinecasino.us.org/update   http://mlxinnovia.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://evoceutical.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://facultycentre.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://monument.amathsystems.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://solidaritycenters.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marketcapcentral.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nataliawestminster.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://atgreenbuild.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gar86.tmweb.ru/bitrix/rk.php?goto=https://onlinecasino.us.org   http://wap95.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://av.myauto.by/away.php?url=https://onlinecasino.us.org  http://www.boardchannels.com.cn/redirect.php?goto=onlinecasino.us.org   http://www.1-888-shelter.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://vegeliciouscafe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ウィンブルドン.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fwmedtech.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vossconsult.co.nz/ra.asp?url=https://onlinecasino.us.org  http://governanceoncloud.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://resellerservices.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.noconventions.mobi/x!/go.php?https://onlinecasino.us.org  http://oneautodr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rahn-ag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://analbac.fr/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://itv-goggles.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.selektimmo.com/banniere/adclick.php?bannerid=224&zoneid=0&source=&dest=https://onlinecasino.us.org   http://yjams.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gourmetstyle.ru/bitrix/rk.php?goto=https://onlinecasino.us.org/   http://sportingeyes.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://paymentgram.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.072550.cn/goto.php?url=onlinecasino.us.org   http://iqorams.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://fumcseguin.com/System/UserProfile.asp?id=60278&func=signup&referer=https://onlinecasino.us.org  http://gotjax.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.no1dianji.com/index.php?m=poster&c=index&a=poster_click&sitespaceid=1&id=129&url=https://onlinecasino.us.org   http://dutplanet.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://atouchofelegancelimo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://icwgrp.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://clusterz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://w.ptsf.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.cslregister.com/forum/showthread.php?goto=onlinecasino.us.org \n \n \n \n \n \nhttps://sample.baapstore.com/forum1/index.php/topic,5475.new.html#new\nhttp://asomatous.net/forum/index.php?topic=12003.new#new\nhttp://graphfolio.com/forum/index.php?topic=52192.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttps://lindaghill.com/2018/08/15/one-liner-wednesday-snail-mail/\n", "language": "Lisp", "metadata": {"date": 1548502982, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s563458796.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s563458796", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://hyperionservicesllc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://twn.northwestmassage.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://m.shopinelpaso.com/redirect.aspx?url=https://onlinecasino.us.org   http://sportybeach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://qualitytm.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://texascollegiateleague.com/tracker/index.html?t=ad&pool_id=14&ad_id=48&url=https://onlinecasino.us.org  http://caecery.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pittsburghlaw.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.reality2003.com/akasaka/w3a/redirect.php?redirect=https://onlinecasino.us.org \nhttp://brandt.nonore.com/go.php?url=https://onlinecasino.us.org  http://www.elempaque.com/b2bportales/rlv.jsp?mail=EMAIL&codigoPortal=EE&numBoletin=2&tipoBoletin=em&url=https://onlinecasino.us.org   http://veloxitas.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.aziaten.com/goto.php?https://onlinecasino.us.org  http://www.digojp.com/goto/https://onlinecasino.us.org   http://c2bloc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hebosales.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sibdepo.ru/upload/rk/102/10215005c5ddd14ad871370330430517.swf?flash_link=onlinecasino.us.org   http://sulpizifamily.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://dootychamp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.nchomeownersalliance.org/r?u=https://onlinecasino.us.org   http://midlandlife.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vanburencountydem.co/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://cfpsbc.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.kyoto-ogoto.net/s/click.php?tcode=00013928&url=https://onlinecasino.us.org  http://integrityautofinance.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sunbeachmotel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.beachesquest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://jobsinelectronics.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://benschetterer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://connectmycommunity.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://lainkcasting.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://peteremerson.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://piano-della-localita.ch/url.php?url=https://onlinecasino.us.org  http://poigraem-online.ru/go/url=https://onlinecasino.us.org  http://www.amicadvisor.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://clusters.okidatatonercartridges.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://vivalasvegasweddingreception.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://physics-animations.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.dekoracie-vianoce.sk/plugins/guestbook/go.php?url=https://onlinecasino.us.org   http://mcobject.cn/bbs/redirect.php?goto=onlinecasino.us.org  http://www.taankoptometrists.co.uk/index.php?section=1139&tellafriend=go&url=https://onlinecasino.us.org&title=taank   http://virtualairportparking.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.rigidply.ms/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://personaenongrata.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.probiogenic.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.fishrod.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gregoryrogerbrown.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://voghouse.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://app.primal.com/crm/sales/deals/artificial%20intelligence;information;responses;contacts;author;change;admin;ways?u=https://onlinecasino.us.org  http://www.thefloridadesigngroup.com/seo-scan/onlinecasino.us.org/update   http://mlxinnovia.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://evoceutical.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://facultycentre.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://monument.amathsystems.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://solidaritycenters.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://marketcapcentral.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://nataliawestminster.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://atgreenbuild.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://gar86.tmweb.ru/bitrix/rk.php?goto=https://onlinecasino.us.org   http://wap95.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://av.myauto.by/away.php?url=https://onlinecasino.us.org  http://www.boardchannels.com.cn/redirect.php?goto=onlinecasino.us.org   http://www.1-888-shelter.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://vegeliciouscafe.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://ウィンブルドン.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fwmedtech.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vossconsult.co.nz/ra.asp?url=https://onlinecasino.us.org  http://governanceoncloud.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://resellerservices.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.noconventions.mobi/x!/go.php?https://onlinecasino.us.org  http://oneautodr.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rahn-ag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://analbac.fr/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://itv-goggles.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.selektimmo.com/banniere/adclick.php?bannerid=224&zoneid=0&source=&dest=https://onlinecasino.us.org   http://yjams.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.gourmetstyle.ru/bitrix/rk.php?goto=https://onlinecasino.us.org/   http://sportingeyes.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://paymentgram.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.072550.cn/goto.php?url=onlinecasino.us.org   http://iqorams.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://fumcseguin.com/System/UserProfile.asp?id=60278&func=signup&referer=https://onlinecasino.us.org  http://gotjax.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.no1dianji.com/index.php?m=poster&c=index&a=poster_click&sitespaceid=1&id=129&url=https://onlinecasino.us.org   http://dutplanet.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://atouchofelegancelimo.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://icwgrp.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://clusterz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://w.ptsf.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.cslregister.com/forum/showthread.php?goto=onlinecasino.us.org \n \n \n \n \n \nhttps://sample.baapstore.com/forum1/index.php/topic,5475.new.html#new\nhttp://asomatous.net/forum/index.php?topic=12003.new#new\nhttp://graphfolio.com/forum/index.php?topic=52192.new#new\nhttp://taiwan.yam.org.tw/womenweb/bookclub/forum1/edit-response.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/womenweb/bookclub/forum1/get.cgi/newreply.php\nhttps://lindaghill.com/2018/08/15/one-liner-wednesday-snail-mail/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8289, "cpu_time_ms": 330, "memory_kb": 23008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s604077253", "group_id": "codeNet:p03941", "input_text": "http://dayoungenterprises.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://centrum.wrgb.by/go.php?url=https://cbdoilamericano.com   http://realestatefinancialplanningsystems.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aseasyas1234inc.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.clc.cat/click-email.php?url=https://cbdoilamericano.com   http://o2shop.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.bartonandloguidice.com/LinkClick.aspx?link=https://cbdoilamericano.com  http://www.varius.kz/go.php?go=https://cbdoilamericano.com   http://www.tumwaterchambermap.org/LinkClick.aspx?link=https://cbdoilamericano.com \nhttps://www.deluxepornstarmovies.com/cgi-bin/atx/out.cgi?id=47&tag=text_top_right&trade=https://cbdoilamericano.com  http://theyhavemydrink.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.wudabbs.com/job.php?action=previous&fid=56&tid=64510&fpage=0&goto=cbdoilamericano.com   http://bahaipublishingus.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ohiocollegetour.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://b4usign.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://wagonmonsters.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://engine.stockwatch.pl/app/click/5287?param=wywiad&go=https://cbdoilamericano.com   http://qhh.draw50.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://bessiehead.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://consult-lgs.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.a6a7.com/redirect.php?url=https://cbdoilamericano.com   http://www.lorrainephotography.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ikeda-daisaku.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://petiteteenager.com/cgi-bin/atx/out.cgi?id=182&amp;trade=https://cbdoilamericano.com  http://imprintsol.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.aninnocentinvitation.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://laurenbennardo.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.tuningout.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://mapspain.ru/redirect.php?to=https://cbdoilamericano.com   http://yashabab.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.hdtv.com.pl/forum/redirect-to/?redirect=https://cbdoilamericano.com  http://botham.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://college.lavc.edu:8888/sites/academicaffairs/_layouts/OSSSearchResults.aspx?k=%20&cs=This%20Site&u=https://cbdoilamericano.com  http://mail.eshops.pro/?go=https://cbdoilamericano.com  http://thecampuscomic.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://pussyprincess.pro/cgi-bin/out.cgi?id=20&l=site&u=https://cbdoilamericano.com \nhttp://diparadise.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ryeford-subaru.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://justgourds.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ckdexperts.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.momgalleries.net/cgi-bin/atc/out.cgi?id=37&u=https://cbdoilamericano.com   http://dxm.quiltersdelight.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://issisystems.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.cybam.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thedockerylawfirm.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://tweenshop.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://www.cuadrosdecor.com/index.php?url=https://cbdoilamericano.com   http://nrasecondamendment.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://irc-galleria.net/redir.php?campaign=netari&key_id=hmacsha1&hmac=3fc9e44351d9c97ff322529f55f24ac3f84ad291&url=https://cbdoilamericano.com  http://gulfstateparksharkweek.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://euromarca.ru/bitrix/rk.php?id=40&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B40%5D+%5Btop%5D+%D0%A1%D1%83%D0%BF%D0%B5%D1%80%D1%84%D0%B8%D1%82+new+2018&goto=https://cbdoilamericano.com  http://www.shit-porn.com/cgi-bin/out.cgi?ses=3EUGP7PKaD&id=1180&url=https://cbdoilamericano.com  http://yespornpleasr.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.social.black-team.org/go/url=cbdoilamericano.com \nhttp://baldheadfredmusic.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://katrina-bledsoe.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.wan1.biz/shop/outurl.html?cd=00020761&url=https://cbdoilamericano.com/   http://www.prochile.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.johnspensimmsfamilyreunion.com/clickfeed.asp?url=https://cbdoilamericano.com   http://nwf.usliabilityinsurance.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://creditlanding.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://eps-intl.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://warnertreasures.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://newshawker.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.lamritewest.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aojdaily.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bankcd.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.levelon.net/__media__/js/trademark.php?d=cbdoilamericano.com   http://jackryanlawford.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://jhym666.com/url?q=https://cbdoilamericano.com  http://rixosru.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://crushus-s7.crushus.com/www.google.nl/url?q=https://cbdoilamericano.com \nhttp://blackcheese.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://racedek.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://journal-option-binaire.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://tdmmo.tehran.ir/LinkClick.aspx?link=https://cbdoilamericano.com  http://clinicalmediamarketing.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://fengfei.org/url?q=https://cbdoilamericano.com  http://testmasterspeprep.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://rightsandresponsibility.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://jackglaser.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.pinebulls.fi/gbook/go.php?url=https://cbdoilamericano.com  https://2342292.r.bat.bing.com/?ld=d3Jtze65nGHS0EC0xeyjcQOzVUCUyvWx7IuqBcn4KoRoCle6XydkC1YAC1u7JRW7_XlCXqQguk4vG-epFttB4-HwaIIowuXAtZefi_oeiM6dVKE-HqAWJqLSX1P7wUbYzfFBD4SmNLAd0B98XtkUIrYpezp_LeiIZI-SKbRKN42hnEdnbe&u=https://cbdoilamericano.com   http://www.beltscrapers.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://pda.mts.by/bonus/bitrix/rk.php?goto=https://cbdoilamericano.com/  http://fryscredit.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.newyeya.com/index.php?m=comment&c=index&a=init&commentid=content_236-1112-1&title=%E6%B6%B2%E5%8E%8B%E9%9B%B6%E4%BB%B6%E7%9A%84%E6%B8%85%E6%B4%97%E5%B7%A5%E8%89%BA&url=https://cbdoilamericano.com  http://tvali.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://movementforblacklives.nationbuilder.com/r?u=https://cbdoilamericano.com   http://williamsoninc.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttp://www.xo-x.net/vb/showthread.php?p=168141#post168141\nhttp://proeuropeans.co.uk/Forums/viewtopic.php?pid=27594#p27594\nhttp://marketsquaremusic.com/product/eleanor-mcevoy-yola/#comment-12166\nhttps://www.kadmium.nl/forum/viewtopic.php?f=3&t=68360\nhttp://sgi-ci.net/forum3/index.php?topic=55688.new#new\n", "language": "Lisp", "metadata": {"date": 1548452867, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s604077253.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s604077253", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://dayoungenterprises.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://centrum.wrgb.by/go.php?url=https://cbdoilamericano.com   http://realestatefinancialplanningsystems.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aseasyas1234inc.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.clc.cat/click-email.php?url=https://cbdoilamericano.com   http://o2shop.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.bartonandloguidice.com/LinkClick.aspx?link=https://cbdoilamericano.com  http://www.varius.kz/go.php?go=https://cbdoilamericano.com   http://www.tumwaterchambermap.org/LinkClick.aspx?link=https://cbdoilamericano.com \nhttps://www.deluxepornstarmovies.com/cgi-bin/atx/out.cgi?id=47&tag=text_top_right&trade=https://cbdoilamericano.com  http://theyhavemydrink.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.wudabbs.com/job.php?action=previous&fid=56&tid=64510&fpage=0&goto=cbdoilamericano.com   http://bahaipublishingus.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ohiocollegetour.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://b4usign.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://wagonmonsters.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://engine.stockwatch.pl/app/click/5287?param=wywiad&go=https://cbdoilamericano.com   http://qhh.draw50.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://bessiehead.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://consult-lgs.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.a6a7.com/redirect.php?url=https://cbdoilamericano.com   http://www.lorrainephotography.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ikeda-daisaku.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://petiteteenager.com/cgi-bin/atx/out.cgi?id=182&amp;trade=https://cbdoilamericano.com  http://imprintsol.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.aninnocentinvitation.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://laurenbennardo.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.tuningout.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://mapspain.ru/redirect.php?to=https://cbdoilamericano.com   http://yashabab.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.hdtv.com.pl/forum/redirect-to/?redirect=https://cbdoilamericano.com  http://botham.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://college.lavc.edu:8888/sites/academicaffairs/_layouts/OSSSearchResults.aspx?k=%20&cs=This%20Site&u=https://cbdoilamericano.com  http://mail.eshops.pro/?go=https://cbdoilamericano.com  http://thecampuscomic.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://pussyprincess.pro/cgi-bin/out.cgi?id=20&l=site&u=https://cbdoilamericano.com \nhttp://diparadise.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ryeford-subaru.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://justgourds.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ckdexperts.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.momgalleries.net/cgi-bin/atc/out.cgi?id=37&u=https://cbdoilamericano.com   http://dxm.quiltersdelight.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://issisystems.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.cybam.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thedockerylawfirm.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://tweenshop.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://www.cuadrosdecor.com/index.php?url=https://cbdoilamericano.com   http://nrasecondamendment.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://irc-galleria.net/redir.php?campaign=netari&key_id=hmacsha1&hmac=3fc9e44351d9c97ff322529f55f24ac3f84ad291&url=https://cbdoilamericano.com  http://gulfstateparksharkweek.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://euromarca.ru/bitrix/rk.php?id=40&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B40%5D+%5Btop%5D+%D0%A1%D1%83%D0%BF%D0%B5%D1%80%D1%84%D0%B8%D1%82+new+2018&goto=https://cbdoilamericano.com  http://www.shit-porn.com/cgi-bin/out.cgi?ses=3EUGP7PKaD&id=1180&url=https://cbdoilamericano.com  http://yespornpleasr.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.social.black-team.org/go/url=cbdoilamericano.com \nhttp://baldheadfredmusic.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://katrina-bledsoe.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.wan1.biz/shop/outurl.html?cd=00020761&url=https://cbdoilamericano.com/   http://www.prochile.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.johnspensimmsfamilyreunion.com/clickfeed.asp?url=https://cbdoilamericano.com   http://nwf.usliabilityinsurance.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://creditlanding.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://eps-intl.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://warnertreasures.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://newshawker.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.lamritewest.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aojdaily.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bankcd.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.levelon.net/__media__/js/trademark.php?d=cbdoilamericano.com   http://jackryanlawford.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://jhym666.com/url?q=https://cbdoilamericano.com  http://rixosru.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://crushus-s7.crushus.com/www.google.nl/url?q=https://cbdoilamericano.com \nhttp://blackcheese.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://racedek.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://journal-option-binaire.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://tdmmo.tehran.ir/LinkClick.aspx?link=https://cbdoilamericano.com  http://clinicalmediamarketing.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://fengfei.org/url?q=https://cbdoilamericano.com  http://testmasterspeprep.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://rightsandresponsibility.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://jackglaser.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.pinebulls.fi/gbook/go.php?url=https://cbdoilamericano.com  https://2342292.r.bat.bing.com/?ld=d3Jtze65nGHS0EC0xeyjcQOzVUCUyvWx7IuqBcn4KoRoCle6XydkC1YAC1u7JRW7_XlCXqQguk4vG-epFttB4-HwaIIowuXAtZefi_oeiM6dVKE-HqAWJqLSX1P7wUbYzfFBD4SmNLAd0B98XtkUIrYpezp_LeiIZI-SKbRKN42hnEdnbe&u=https://cbdoilamericano.com   http://www.beltscrapers.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://pda.mts.by/bonus/bitrix/rk.php?goto=https://cbdoilamericano.com/  http://fryscredit.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.newyeya.com/index.php?m=comment&c=index&a=init&commentid=content_236-1112-1&title=%E6%B6%B2%E5%8E%8B%E9%9B%B6%E4%BB%B6%E7%9A%84%E6%B8%85%E6%B4%97%E5%B7%A5%E8%89%BA&url=https://cbdoilamericano.com  http://tvali.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://movementforblacklives.nationbuilder.com/r?u=https://cbdoilamericano.com   http://williamsoninc.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttp://www.xo-x.net/vb/showthread.php?p=168141#post168141\nhttp://proeuropeans.co.uk/Forums/viewtopic.php?pid=27594#p27594\nhttp://marketsquaremusic.com/product/eleanor-mcevoy-yola/#comment-12166\nhttps://www.kadmium.nl/forum/viewtopic.php?f=3&t=68360\nhttp://sgi-ci.net/forum3/index.php?topic=55688.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8094, "cpu_time_ms": 94, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s976365399", "group_id": "codeNet:p03941", "input_text": "https://www.offworldent.com/r?u=https://cbdoilamericano.com  http://ohiodairyproducers.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ultrameterii.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://metbex.net/redir.php?url=https://cbdoilamericano.com  http://sch112.ru/forum/away.php?s=https://cbdoilamericano.com   http://cobra-investigations.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.playgroundghosts.com/yabb/YaBB.pl?action=dereferer;url=https://cbdoilamericano.com  http://mail.baptist.sk/horde/util/go.php?url=https://cbdoilamericano.com   http://vecchiamano.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://logisticscube.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://vina4u.pro/go.php?url=cbdoilamericano.com   http://babyguess.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://maziecrocker.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://equityfrenzy.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.uwtn.org/LinkClick.aspx?link=https://cbdoilamericano.com  http://zoz.nancity.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://videopreservation.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://kingdom-leaks.com/index.php?/go/&url=https://cbdoilamericano.com \nhttp://baystateinvestmentservice.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://thinvigorate.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.geoversum.by/go/url=https://cbdoilamericano.com   http://lexingtonelife.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://openkazan.info/links.php?go=https://cbdoilamericano.com   http://bbfestival.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://noteams.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.fbckyle.com/System/ForgotPassword.asp?id=22252&referer=https://cbdoilamericano.com   http://jeanbarrylifecoach.maioid.com/cgi-bin/atc/out.cgi?s=60&u=/cbdoilamericano.com \nhttp://www.leichte.info/verlinken.php?Url=https://cbdoilamericano.com/  http://googooballoon.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://otterbaby.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://lesson-planhub.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://delawareairportparking.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://forum.wartune.com/redirect.php?goto=cbdoilamericano.com  http://mamamidetkam.ru/forum/away.php?s=https://cbdoilamericano.com  http://scorecoaching.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://jimbishopchevrolet.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://bluehillsbank.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://aicglobal.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.aluminumprofessionals.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://speedierealty.com/searchpoint/redir.asp?reg_id=ptypes&sname=/searchpoint/search.asp&lid=1&sponsor=lan&url=https://cbdoilamericano.com  http://xn--b1agamapucodmagd9k.xn--p1ai/bitrix/rk.php?id=21&site_id=s2&goto=cbdoilamericano.com   http://epiphonesolutions.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://credothermalsoultions.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://agqr-headline.jp/redirect.php?l=https://cbdoilamericano.com   http://www.backtothehits.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://diol.monstercableinc.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://lovemelt.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://zoey.wildrose.net/cgi-bin/friends/out.cgi?id=secret&url=https://cbdoilamericano.com   http://www.auduboncc.org/default.aspx?p=TrackHyperlink&url=https://cbdoilamericano.com  http://thephyx.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://planeandpilot.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.fyens.dk/modules/userbaseclient/user_logout.php?return=https://cbdoilamericano.com  http://ditchfielddesigns.com.au/garmentphotos/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://cbdoilamericano.com   http://haikou.38ca.com/index.php?g=Appoint&c=Changecity&a=go&city=gz&referer=https://cbdoilamericano.com \nhttp://www.atomicpr.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://uzv.utahapartmentfinders.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.roplanzo.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.g-tune.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.ducati-superbikes.com/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fwww.ducati-superbikes.com%2Findex.php%2Ftopic%2F20391-tps-reset%2F&code=d41d8cd98f00b204e9800998ecf8427e&board_url=https://cbdoilamericano.com   https://ukb-shib.hosted.exlibrisgroup.com/goto/https://cbdoilamericano.com  http://www.celebritymovieblog.com/crtr/cgi/out.cgi?id=49&url=https://cbdoilamericano.com  http://radiocommunications-usa.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://86g.ratos.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://sbufan.createaforum.com/index.php?thememode=full;redirect=https://cbdoilamericano.com  http://medequiz.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.cameltubeclips.com/dtr/link.php?thumb_id=&tag_id=&c=gay&url=https://cbdoilamericano.com   http://www.iact1.com/mxi/Enroll/Apply.cfm?EnrollerID=52774&Theme=VIP&ReturnURL=&Lcbdoilamericano.com  http://auctionandappraise.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.adiumpharma.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.slocountryclub.com/default.aspx?p=TrackHyperlink&url=https://cbdoilamericano.com  http://www.museumvereniging.nl/LinkClick.aspx?link=https://cbdoilamericano.com   http://takeadetour.blogsky.com/dailylink/?go=https://cbdoilamericano.com \nhttp://gracemaldives.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.bestwestern-nrh.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://mwtuxonline.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://realtobaccopleasure.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://giannahester.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://citc-92.citci.clipe.pt/cgi-bin/atc/out.cgi?id=95&u=/cbdoilamericano.com  http://islamicunion.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://freeholidayquotes.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://makemeyounger.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://studentstripers.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://wildriversgallery.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://esubrohub.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://diverite.tw/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://1hotels.cc/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://amateursau.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://retirewired.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://elizabethchase.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.blogtraffic.de/click.php?user=18660&link=https://cbdoilamericano.com \n \n \n \n \n \nhttp://xn--80aihgzecn.xn--p1ai/index.php?/topic/159532-mary-oliver-morning-poem/\nhttps://forumgalaxy.net/viewtopic.php?f=5&t=3427\nhttp://www.vannella.com/asme-b31-1-2018-what-is-changed/#comment-574\nhttp://futsal5cotland.com/viewtopic.php?pid=24094#p24094\nhttp://m3.site.nfoservers.com/forums/viewtopic.php?f=13&t=87738\n", "language": "Lisp", "metadata": {"date": 1548420670, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s976365399.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s976365399", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://www.offworldent.com/r?u=https://cbdoilamericano.com  http://ohiodairyproducers.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ultrameterii.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://metbex.net/redir.php?url=https://cbdoilamericano.com  http://sch112.ru/forum/away.php?s=https://cbdoilamericano.com   http://cobra-investigations.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.playgroundghosts.com/yabb/YaBB.pl?action=dereferer;url=https://cbdoilamericano.com  http://mail.baptist.sk/horde/util/go.php?url=https://cbdoilamericano.com   http://vecchiamano.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://logisticscube.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://vina4u.pro/go.php?url=cbdoilamericano.com   http://babyguess.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://maziecrocker.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://equityfrenzy.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.uwtn.org/LinkClick.aspx?link=https://cbdoilamericano.com  http://zoz.nancity.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://videopreservation.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://kingdom-leaks.com/index.php?/go/&url=https://cbdoilamericano.com \nhttp://baystateinvestmentservice.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://thinvigorate.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.geoversum.by/go/url=https://cbdoilamericano.com   http://lexingtonelife.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://openkazan.info/links.php?go=https://cbdoilamericano.com   http://bbfestival.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://noteams.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.fbckyle.com/System/ForgotPassword.asp?id=22252&referer=https://cbdoilamericano.com   http://jeanbarrylifecoach.maioid.com/cgi-bin/atc/out.cgi?s=60&u=/cbdoilamericano.com \nhttp://www.leichte.info/verlinken.php?Url=https://cbdoilamericano.com/  http://googooballoon.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://otterbaby.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://lesson-planhub.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://delawareairportparking.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://forum.wartune.com/redirect.php?goto=cbdoilamericano.com  http://mamamidetkam.ru/forum/away.php?s=https://cbdoilamericano.com  http://scorecoaching.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://jimbishopchevrolet.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://bluehillsbank.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://aicglobal.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.aluminumprofessionals.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://speedierealty.com/searchpoint/redir.asp?reg_id=ptypes&sname=/searchpoint/search.asp&lid=1&sponsor=lan&url=https://cbdoilamericano.com  http://xn--b1agamapucodmagd9k.xn--p1ai/bitrix/rk.php?id=21&site_id=s2&goto=cbdoilamericano.com   http://epiphonesolutions.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://credothermalsoultions.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://agqr-headline.jp/redirect.php?l=https://cbdoilamericano.com   http://www.backtothehits.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://diol.monstercableinc.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://lovemelt.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://zoey.wildrose.net/cgi-bin/friends/out.cgi?id=secret&url=https://cbdoilamericano.com   http://www.auduboncc.org/default.aspx?p=TrackHyperlink&url=https://cbdoilamericano.com  http://thephyx.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://planeandpilot.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.fyens.dk/modules/userbaseclient/user_logout.php?return=https://cbdoilamericano.com  http://ditchfielddesigns.com.au/garmentphotos/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://cbdoilamericano.com   http://haikou.38ca.com/index.php?g=Appoint&c=Changecity&a=go&city=gz&referer=https://cbdoilamericano.com \nhttp://www.atomicpr.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://uzv.utahapartmentfinders.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.roplanzo.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.g-tune.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.ducati-superbikes.com/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fwww.ducati-superbikes.com%2Findex.php%2Ftopic%2F20391-tps-reset%2F&code=d41d8cd98f00b204e9800998ecf8427e&board_url=https://cbdoilamericano.com   https://ukb-shib.hosted.exlibrisgroup.com/goto/https://cbdoilamericano.com  http://www.celebritymovieblog.com/crtr/cgi/out.cgi?id=49&url=https://cbdoilamericano.com  http://radiocommunications-usa.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://86g.ratos.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://sbufan.createaforum.com/index.php?thememode=full;redirect=https://cbdoilamericano.com  http://medequiz.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.cameltubeclips.com/dtr/link.php?thumb_id=&tag_id=&c=gay&url=https://cbdoilamericano.com   http://www.iact1.com/mxi/Enroll/Apply.cfm?EnrollerID=52774&Theme=VIP&ReturnURL=&Lcbdoilamericano.com  http://auctionandappraise.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.adiumpharma.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.slocountryclub.com/default.aspx?p=TrackHyperlink&url=https://cbdoilamericano.com  http://www.museumvereniging.nl/LinkClick.aspx?link=https://cbdoilamericano.com   http://takeadetour.blogsky.com/dailylink/?go=https://cbdoilamericano.com \nhttp://gracemaldives.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.bestwestern-nrh.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://mwtuxonline.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://realtobaccopleasure.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://giannahester.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://citc-92.citci.clipe.pt/cgi-bin/atc/out.cgi?id=95&u=/cbdoilamericano.com  http://islamicunion.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://freeholidayquotes.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://makemeyounger.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://studentstripers.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://wildriversgallery.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://esubrohub.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://diverite.tw/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://1hotels.cc/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://amateursau.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://retirewired.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://elizabethchase.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.blogtraffic.de/click.php?user=18660&link=https://cbdoilamericano.com \n \n \n \n \n \nhttp://xn--80aihgzecn.xn--p1ai/index.php?/topic/159532-mary-oliver-morning-poem/\nhttps://forumgalaxy.net/viewtopic.php?f=5&t=3427\nhttp://www.vannella.com/asme-b31-1-2018-what-is-changed/#comment-574\nhttp://futsal5cotland.com/viewtopic.php?pid=24094#p24094\nhttp://m3.site.nfoservers.com/forums/viewtopic.php?f=13&t=87738\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7939, "cpu_time_ms": 92, "memory_kb": 9312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s391301679", "group_id": "codeNet:p03941", "input_text": "http://eyecms.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://instoremarketingexpo.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://braking-sunstar.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://web-studium.ru/away.php?href=https://cbdoilamericano.com  http://questorpartnerfunds.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://americhlorllc.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://martsville.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://emiratesmed.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://mapradio.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://harbourridgepoa.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://transunion-credit-reports.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://arunaproducts.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://tandatacorp.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.gardentutoronline.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://spatravelsecrets.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://realtorsofchina.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://tenroxexpense.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://tallandpluscatalogs.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.lesbipulse.com/sr/out.php?l=0s.6.41.2407.4314&u=/cbdoilamericano.com  http://loudupload.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.victoriaairport.com/includes/extlink.php?url=https://cbdoilamericano.com   http://www.ozmasterfunds.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://smdtravel.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://sohel.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://nantz.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://remedialtutor.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://itvcollege.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://qfb.outsourceresults.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ugrb.ru/bitrix/rk.php?goto=https://cbdoilamericano.com   http://www.scxlsb.com/wp-content/themes/begin4.6/inc/go.php?url=https://cbdoilamericano.com   http://www.ladyboyshere.com/at3/out.cgi?id=35&tag=topline&trade=https://cbdoilamericano.com  http://theglobalfurnituregroup.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://watchdognews.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.svumik.sumy.ua/go.php?url=https://cbdoilamericano.com  http://ainokii.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://agoman.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://caribq2.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://livelihood-business-directory.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://mcu.banlinhkien.vn/mobiquo/smartbanner/welcome.php?referer=http%3A%2F%2Fmcu.banlinhkien.vn%2Fthreads%2Fled-matrix-8x8-3mm-max7219.562%2F&code=&board_url=https://cbdoilamericano.com   http://cumbiacaliente.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://medicalheroes.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://gr8fuldog.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://thelovecontract.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://northcaicosvillas.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://inedithing.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://recliney.cf/cgi-bin/atl/out.cgi?s=60&u=https://cbdoilamericano.com  http://www.5ys.org/go.asp?url=https://cbdoilamericano.com   http://ihz.lake-metigoshe.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ubatogo.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://peloarproperties.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://pickupdaddy.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://login.mailpartner.be/visit.asp?MID=15774&url=https://cbdoilamericano.com  http://mortgagexpress.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://support.vendhq.com/hc/en-us/articles/201378590-Magento-CE-Magento-Go-integration-with-Vend?mobile_?s=https://cbdoilamericano.com \nhttp://200oceandrivesouthbeach.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://americasbestbuilt.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://yppa.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.coolmail.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://postcardinnresort.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://uzj.tomford.name/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.kibrispostasi.com/scrape.php?url=https://cbdoilamericano.com  http://althuisiusfamily.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://edentity.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttps://www.liyege.com/wp-content/themes/begin5.2/inc/go.php?url=https://cbdoilamericano.com  http://sinfo.utamap.com/cgi-bin/t_search.cgi?act=jump&access=1&url=https://cbdoilamericano.com   https://www.holdem.ro/forum/entries/605-Sarbatori-fericite!?goto=cbdoilamericano.com   http://affordabledenturesmoment.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://blastmaster.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.luminitze.ro/visit.php?url=https://cbdoilamericano.com  http://iprepap.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://placementdirectscotia.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.kupirebenku.ru/bitrix/rk.php?id=119&event1=banner&event2=click&event3=1+%2F+%5B119%5D+%5Bmain_carusel%5D+%CB%E5%E4%E8+%C1%E0%E3+&goto=https://cbdoilamericano.com \nhttp://www.gerolf.org/modemomail/redirect.php?url=https://cbdoilamericano.com  http://aranda-mauritius.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://creditcards-best.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://cobraresponder.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.specialtysupplies.com/redirect.php?action=url&goto=www.cbdoilamericano.com   http://davidplumb.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://pwk.bk-entertainment.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.radio-directory.com/webtop.cfm?site=https://cbdoilamericano.com   http://birthcam.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://acethorn.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.mxxm.cc/home/link.php?url=https://cbdoilamericano.com   https://motorstate.com.ua/product-123-motorst%3C/goto.php?url=https://cbdoilamericano.com   http://europa.acustudents.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://faselekootah.com/redirect.aspx?url=https://cbdoilamericano.com   http://dreamhooker.com/cgi-bin/at3/out.cgi?id=456&tag=toplist&trade=https://cbdoilamericano.com  http://businesssoftwareconsulting.net/Services/Redirect.aspx?url=https://cbdoilamericano.com  https://www.friendsoftheuschamber.com/r?u=https://cbdoilamericano.com   http://seasonofpursuit.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttps://qc-print.tech/index.php/topic,3199.new.html#new\nhttp://forum.flaggenkunde.de/viewtopic.php?f=2&t=3462361\nhttp://www.embrey.net/forum/index.php?topic=181055.new#new\nhttp://tigershop.se/forum/showthread.php?tid=131086\nhttp://proeuropeans.co.uk/Forums/viewtopic.php?pid=26753#p26753\n", "language": "Lisp", "metadata": {"date": 1548405647, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s391301679.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s391301679", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://eyecms.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://instoremarketingexpo.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://braking-sunstar.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://web-studium.ru/away.php?href=https://cbdoilamericano.com  http://questorpartnerfunds.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://americhlorllc.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://martsville.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://emiratesmed.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://mapradio.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://harbourridgepoa.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://transunion-credit-reports.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://arunaproducts.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://tandatacorp.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.gardentutoronline.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://spatravelsecrets.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://realtorsofchina.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://tenroxexpense.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://tallandpluscatalogs.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.lesbipulse.com/sr/out.php?l=0s.6.41.2407.4314&u=/cbdoilamericano.com  http://loudupload.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.victoriaairport.com/includes/extlink.php?url=https://cbdoilamericano.com   http://www.ozmasterfunds.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://smdtravel.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://sohel.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://nantz.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://remedialtutor.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://itvcollege.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://qfb.outsourceresults.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ugrb.ru/bitrix/rk.php?goto=https://cbdoilamericano.com   http://www.scxlsb.com/wp-content/themes/begin4.6/inc/go.php?url=https://cbdoilamericano.com   http://www.ladyboyshere.com/at3/out.cgi?id=35&tag=topline&trade=https://cbdoilamericano.com  http://theglobalfurnituregroup.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://watchdognews.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.svumik.sumy.ua/go.php?url=https://cbdoilamericano.com  http://ainokii.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://agoman.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://caribq2.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://livelihood-business-directory.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://mcu.banlinhkien.vn/mobiquo/smartbanner/welcome.php?referer=http%3A%2F%2Fmcu.banlinhkien.vn%2Fthreads%2Fled-matrix-8x8-3mm-max7219.562%2F&code=&board_url=https://cbdoilamericano.com   http://cumbiacaliente.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://medicalheroes.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://gr8fuldog.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://thelovecontract.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://northcaicosvillas.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://inedithing.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://recliney.cf/cgi-bin/atl/out.cgi?s=60&u=https://cbdoilamericano.com  http://www.5ys.org/go.asp?url=https://cbdoilamericano.com   http://ihz.lake-metigoshe.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ubatogo.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://peloarproperties.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://pickupdaddy.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://login.mailpartner.be/visit.asp?MID=15774&url=https://cbdoilamericano.com  http://mortgagexpress.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://support.vendhq.com/hc/en-us/articles/201378590-Magento-CE-Magento-Go-integration-with-Vend?mobile_?s=https://cbdoilamericano.com \nhttp://200oceandrivesouthbeach.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://americasbestbuilt.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://yppa.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.coolmail.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://postcardinnresort.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://uzj.tomford.name/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.kibrispostasi.com/scrape.php?url=https://cbdoilamericano.com  http://althuisiusfamily.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://edentity.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttps://www.liyege.com/wp-content/themes/begin5.2/inc/go.php?url=https://cbdoilamericano.com  http://sinfo.utamap.com/cgi-bin/t_search.cgi?act=jump&access=1&url=https://cbdoilamericano.com   https://www.holdem.ro/forum/entries/605-Sarbatori-fericite!?goto=cbdoilamericano.com   http://affordabledenturesmoment.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://blastmaster.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.luminitze.ro/visit.php?url=https://cbdoilamericano.com  http://iprepap.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://placementdirectscotia.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.kupirebenku.ru/bitrix/rk.php?id=119&event1=banner&event2=click&event3=1+%2F+%5B119%5D+%5Bmain_carusel%5D+%CB%E5%E4%E8+%C1%E0%E3+&goto=https://cbdoilamericano.com \nhttp://www.gerolf.org/modemomail/redirect.php?url=https://cbdoilamericano.com  http://aranda-mauritius.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://creditcards-best.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://cobraresponder.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.specialtysupplies.com/redirect.php?action=url&goto=www.cbdoilamericano.com   http://davidplumb.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://pwk.bk-entertainment.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.radio-directory.com/webtop.cfm?site=https://cbdoilamericano.com   http://birthcam.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://acethorn.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.mxxm.cc/home/link.php?url=https://cbdoilamericano.com   https://motorstate.com.ua/product-123-motorst%3C/goto.php?url=https://cbdoilamericano.com   http://europa.acustudents.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://faselekootah.com/redirect.aspx?url=https://cbdoilamericano.com   http://dreamhooker.com/cgi-bin/at3/out.cgi?id=456&tag=toplist&trade=https://cbdoilamericano.com  http://businesssoftwareconsulting.net/Services/Redirect.aspx?url=https://cbdoilamericano.com  https://www.friendsoftheuschamber.com/r?u=https://cbdoilamericano.com   http://seasonofpursuit.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttps://qc-print.tech/index.php/topic,3199.new.html#new\nhttp://forum.flaggenkunde.de/viewtopic.php?f=2&t=3462361\nhttp://www.embrey.net/forum/index.php?topic=181055.new#new\nhttp://tigershop.se/forum/showthread.php?tid=131086\nhttp://proeuropeans.co.uk/Forums/viewtopic.php?pid=26753#p26753\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7900, "cpu_time_ms": 98, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s309892760", "group_id": "codeNet:p03941", "input_text": "http://mymatcutter.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://netitout.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://restaurant-events.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://31000773.r.bat.bing.com/?ld=d3XV01XkM4fhnA95h0liZYrzVUCUzm_vMNYTfWmTntOk6QJF0iNTXr09gkohbKGF2yU8fI9cSdcSlE8OjYabp89CxRmKDDedgRzlMvQWnPDFQQAwTMCub-51U_tAXHNwJact5SzAtN2tmKLaXwxgU9FFkLtjk&u=https://cbdoilamericano.com  http://fullereffects.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://harcourthighschool.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://uoatr.tomsk.ru/bitrix/rk.php?id=9&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B9%5D+%5BSIDEBAR_TEXT%5D+%D0%A1%D0%BF%D1%80%D0%B0%D0%B2%D0%BE%D1%87%D0%BD%D0%B8%D0%BA+%D0%A2%D0%BE%D0%BC%D1%81%D0%BA%D0%BE%D0%B3%D0%BE+%D1%80%D0%B0%D0%B9%D0%BE%D0%BD%D0%B0&goto=https://cbdoilamericano.com  http://www.tulipstarhotel.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bdsmtubeo.com/go.php?track=dxtMen4MYGpKe0I=&url=https://cbdoilamericano.com \nhttp://uskitchens.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://cirqueworks.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aetnaabsenceadvocate.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://hgmff.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.eliteairlines.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://karkis.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://dangerbdsm.com/cgi-bin/at3/out.cgi?id=95&tag=toplist&trade=https://cbdoilamericano.com  http://soundtrackcollector.org/click.php?url=https://cbdoilamericano.com   http://dofinger.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://epipenatschool.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://114.255.108.171/gate/big5/cbdoilamericano.com   http://etnlight.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://crestron-electronics.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://pimpbikerclothing.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://axaeqla.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.fleursdefrance.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://noesisdata.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://nfpannuity.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://pizapp.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.dfscincy.org/default.aspx?p=TrackHyperlink&url=https://cbdoilamericano.com   http://fran-chocolates.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ddi.ironhorseconcrete.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://rostart.ru/links.php?go=https://cbdoilamericano.com   http://www.nypbtfsb.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://temasekholdingsadvisors.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://highachieversscorecard.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://hardyscolony.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://home.hkesp.com/link.php?url=https://cbdoilamericano.com  http://www.motorpasionmoto.com/redirect?url=https://cbdoilamericano.com/   http://www.seniorpolls.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ad.startlap.hu/rd.php?id=428704&u=https://cbdoilamericano.com  http://greenbuildingweek.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://animesonlinetk.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://circutor.ru/upload/bx/df9/trans.swf?link=%2Fbitrix%2Frk.php%3Fid%3D27%26amp%3Bevent1%3Dbanner%26amp%3Bevent2%3Dclick%26amp%3Bevent3%3D1%2B%252F%2B%255B27%255D%2B%255BLEFT4%255D%2B%25D2%25F0%25E0%25ED%25F1%25F4%25EE%25F0%25EC%25E0%25F2%25EE%25F0%25FB%2B%25F2%25EE%25EA%25E0%2B%25ED%25E0%2B%25C0%25ED%25E0%25EB%25E8%25E7%25E5%25F0%25F1%26amp%3Bgoto%3Dhttp%253A%252F%252Fwww.analyzers.ru%252Fanalyzers%252Ftransformator%252F&flash_url=cbdoilamericano.com  http://www.cwsbds.com/bbs/connect.php?mod=login&op=init&referer=https://cbdoilamericano.com   http://whatisblueprintmn.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://frontstreetinvestment.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ebghealthlaw.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://jiaochengbao.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://soluciona.indicator.es/Default.aspx?Returnurl=https://cbdoilamericano.com  http://therestaurantcircle.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://dipenta.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.teentel.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://hudsonriver.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://anyrim.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.hku.hk/www/edm/redirect.php?url=https://cbdoilamericano.com  http://www.stgeorgemoc.com/LinkClick.aspx?link=https://cbdoilamericano.com   http://ambulatorymedicine.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://alaricthegoth.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://losangalex.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://stephenchiatovich.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://bandemanufacturing.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://hip-triggers.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://the-upperroom-store.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://f-score.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://sulma.ge/go.php?url=https://cbdoilamericano.com   http://m.safindit.co.za/sycamore-avenue-treehouse-lodge-guesthouse/redirect?url=https://cbdoilamericano.com   http://sexexpanse.com/cgi-bin/at3/out.cgi?s=75&u=https://cbdoilamericano.com  http://www.ville-ge.ch/web-newsletter/newsletter_vdg/go/qui.php?l=743_2702&c=https://cbdoilamericano.com   http://statedivorcelaws.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.alfanika.com/bitrix/rk.php?goto=https://cbdoilamericano.com  http://ketabyab.net/redirect.php?store_id=4&keyword=718&link=https://cbdoilamericano.com   http://zoo-clips.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.quarterhorsedirectory.org/redirect.asp?url=https://cbdoilamericano.com  http://www.casajonas.com.ar/goto.php?banner=1&l=https://cbdoilamericano.com   http://savingthestarving.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.galaxy-cable.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://fourpointsinstitutes.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://airstreamsa.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.guide.jewelshop.com.hk/redirect.php?url=cbdoilamericano.com  http://www.smsfilm.be/ept/out.php?f=1&pct=40&url=https://cbdoilamericano.com   http://my24seven.eu/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.dayfuneralhomes.com/link.asp?l=cbdoilamericano.com  http://moviemagicsuite.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.avenueconstruction.co.nz/contact/?subject=House+of+the+Year+Event+2012+Photos+and+Awards&referer=https://cbdoilamericano.com   http://mykidmademodern.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://portlytuxedos.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.fiolent.ru/go.php?url=https://cbdoilamericano.com  http://adawebrewing.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://learningtreecamps.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://imlivecash.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttp://poselokgribovo.ru/forum/index.php?topic=59443.new#new\nhttps://khonglottaimusic.com/le-vu/?like_comment=4237\nhttp://lezzetinur.com/corba-terbiye-cesitleri/#comment-40508\nhttps://ingenieriainversa.org/forum/index.php?topic=86203.new#new\nhttps://forum.rf-kraken.com/viewtopic.php?f=4&t=33979\n", "language": "Lisp", "metadata": {"date": 1548356634, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s309892760.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s309892760", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://mymatcutter.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://netitout.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://restaurant-events.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://31000773.r.bat.bing.com/?ld=d3XV01XkM4fhnA95h0liZYrzVUCUzm_vMNYTfWmTntOk6QJF0iNTXr09gkohbKGF2yU8fI9cSdcSlE8OjYabp89CxRmKDDedgRzlMvQWnPDFQQAwTMCub-51U_tAXHNwJact5SzAtN2tmKLaXwxgU9FFkLtjk&u=https://cbdoilamericano.com  http://fullereffects.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://harcourthighschool.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://uoatr.tomsk.ru/bitrix/rk.php?id=9&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B9%5D+%5BSIDEBAR_TEXT%5D+%D0%A1%D0%BF%D1%80%D0%B0%D0%B2%D0%BE%D1%87%D0%BD%D0%B8%D0%BA+%D0%A2%D0%BE%D0%BC%D1%81%D0%BA%D0%BE%D0%B3%D0%BE+%D1%80%D0%B0%D0%B9%D0%BE%D0%BD%D0%B0&goto=https://cbdoilamericano.com  http://www.tulipstarhotel.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bdsmtubeo.com/go.php?track=dxtMen4MYGpKe0I=&url=https://cbdoilamericano.com \nhttp://uskitchens.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://cirqueworks.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aetnaabsenceadvocate.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://hgmff.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.eliteairlines.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://karkis.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://dangerbdsm.com/cgi-bin/at3/out.cgi?id=95&tag=toplist&trade=https://cbdoilamericano.com  http://soundtrackcollector.org/click.php?url=https://cbdoilamericano.com   http://dofinger.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://epipenatschool.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://114.255.108.171/gate/big5/cbdoilamericano.com   http://etnlight.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://crestron-electronics.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://pimpbikerclothing.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://axaeqla.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.fleursdefrance.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://noesisdata.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://nfpannuity.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://pizapp.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.dfscincy.org/default.aspx?p=TrackHyperlink&url=https://cbdoilamericano.com   http://fran-chocolates.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ddi.ironhorseconcrete.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://rostart.ru/links.php?go=https://cbdoilamericano.com   http://www.nypbtfsb.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://temasekholdingsadvisors.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://highachieversscorecard.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://hardyscolony.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://home.hkesp.com/link.php?url=https://cbdoilamericano.com  http://www.motorpasionmoto.com/redirect?url=https://cbdoilamericano.com/   http://www.seniorpolls.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ad.startlap.hu/rd.php?id=428704&u=https://cbdoilamericano.com  http://greenbuildingweek.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://animesonlinetk.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://circutor.ru/upload/bx/df9/trans.swf?link=%2Fbitrix%2Frk.php%3Fid%3D27%26amp%3Bevent1%3Dbanner%26amp%3Bevent2%3Dclick%26amp%3Bevent3%3D1%2B%252F%2B%255B27%255D%2B%255BLEFT4%255D%2B%25D2%25F0%25E0%25ED%25F1%25F4%25EE%25F0%25EC%25E0%25F2%25EE%25F0%25FB%2B%25F2%25EE%25EA%25E0%2B%25ED%25E0%2B%25C0%25ED%25E0%25EB%25E8%25E7%25E5%25F0%25F1%26amp%3Bgoto%3Dhttp%253A%252F%252Fwww.analyzers.ru%252Fanalyzers%252Ftransformator%252F&flash_url=cbdoilamericano.com  http://www.cwsbds.com/bbs/connect.php?mod=login&op=init&referer=https://cbdoilamericano.com   http://whatisblueprintmn.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://frontstreetinvestment.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ebghealthlaw.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://jiaochengbao.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://soluciona.indicator.es/Default.aspx?Returnurl=https://cbdoilamericano.com  http://therestaurantcircle.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://dipenta.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.teentel.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://hudsonriver.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://anyrim.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.hku.hk/www/edm/redirect.php?url=https://cbdoilamericano.com  http://www.stgeorgemoc.com/LinkClick.aspx?link=https://cbdoilamericano.com   http://ambulatorymedicine.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://alaricthegoth.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://losangalex.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://stephenchiatovich.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://bandemanufacturing.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://hip-triggers.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://the-upperroom-store.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://f-score.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://sulma.ge/go.php?url=https://cbdoilamericano.com   http://m.safindit.co.za/sycamore-avenue-treehouse-lodge-guesthouse/redirect?url=https://cbdoilamericano.com   http://sexexpanse.com/cgi-bin/at3/out.cgi?s=75&u=https://cbdoilamericano.com  http://www.ville-ge.ch/web-newsletter/newsletter_vdg/go/qui.php?l=743_2702&c=https://cbdoilamericano.com   http://statedivorcelaws.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.alfanika.com/bitrix/rk.php?goto=https://cbdoilamericano.com  http://ketabyab.net/redirect.php?store_id=4&keyword=718&link=https://cbdoilamericano.com   http://zoo-clips.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.quarterhorsedirectory.org/redirect.asp?url=https://cbdoilamericano.com  http://www.casajonas.com.ar/goto.php?banner=1&l=https://cbdoilamericano.com   http://savingthestarving.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.galaxy-cable.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://fourpointsinstitutes.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://airstreamsa.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.guide.jewelshop.com.hk/redirect.php?url=cbdoilamericano.com  http://www.smsfilm.be/ept/out.php?f=1&pct=40&url=https://cbdoilamericano.com   http://my24seven.eu/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.dayfuneralhomes.com/link.asp?l=cbdoilamericano.com  http://moviemagicsuite.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.avenueconstruction.co.nz/contact/?subject=House+of+the+Year+Event+2012+Photos+and+Awards&referer=https://cbdoilamericano.com   http://mykidmademodern.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://portlytuxedos.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.fiolent.ru/go.php?url=https://cbdoilamericano.com  http://adawebrewing.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://learningtreecamps.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://imlivecash.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttp://poselokgribovo.ru/forum/index.php?topic=59443.new#new\nhttps://khonglottaimusic.com/le-vu/?like_comment=4237\nhttp://lezzetinur.com/corba-terbiye-cesitleri/#comment-40508\nhttps://ingenieriainversa.org/forum/index.php?topic=86203.new#new\nhttps://forum.rf-kraken.com/viewtopic.php?f=4&t=33979\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8381, "cpu_time_ms": 12, "memory_kb": 3296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s143237256", "group_id": "codeNet:p03941", "input_text": "http://www.dff.jp/nocookie/redirect.php?url=https://cbdoilamericano.com  https://ruzgarcevretasarim.com/cms/home/switch?goto=cbdoilamericano.com   http://www.clubsurvey.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://crclookup.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.petrolnews.net/click.php?r=135&url=https://cbdoilamericano.com   http://vote4flattax.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://sickofthesameoldshit.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://steveheflin.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://routedesbieres.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://t1dexchange.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://twcmail.de/deref.php?https://cbdoilamericano.com/   http://associatedclimate.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://andrewspade.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://aclittleleague.com/Goto.asp?url=https://cbdoilamericano.com   http://www.secnews.ru/russian/bitrix/rk.php?id=193&event1=impuls_193&goto=https://cbdoilamericano.com  http://www.lemoncc.com/link.php?url=https://cbdoilamericano.com  http://2xk.jreeves-law.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.manke8.com/other/Link.asp?action=go&fl_id=30&url=https://cbdoilamericano.com \nhttp://hamilton-international-airport.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://seejanebreath.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thesolarmoviehd.com/go.php?url=https://cbdoilamericano.com   http://pawlyn.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.prolistsolutions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://wolframkids.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.yanxin.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.ogersystems.com/en/index.php/component/k2/item/230-2015-02-23-12-52-38?fromurl=cbdoilamericano.com   http://neriumyoungentrepreneur.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://388.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://batterysolutions.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://hawkforum.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ksldeals.mobi/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://xn--80aealotwbjpid2k.xn--80aze9d.xn--p1ai/bitrix/rk.php?id=78&event1=banner&event2=click&event3=1+%2F+%5B78%5D+%5Bfooter%5D+Prava%2C+obyazannosti+i+trebovaniya+k+sluzhebnomu+povedeniyu&goto=cbdoilamericano.com   http://gaylovecall.com/dtr/link.php?gr=2&id=e4927b&url=https://cbdoilamericano.com  http://www.integratingmindandbody.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://wealthcontrol.com/massMutualSpecific/generalRedirect.asp?url=http://cbdoilamericano.com   http://гѓ¦гѓ‹гѓ»гѓЃгѓЈгѓјгѓ .com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://pyi.nestlogistics.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://grazianosbroggio.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.itogi.ru/bitrix/rk.php?id=3447&event1=banner&event2=click&event3=4+/+<>447]+<Itogi>top_B994]+Nomobile/Samsung+PS51D550&goto=https://cbdoilamericano.com   http://langsdekust.nl/out.php?id=vh-rablaan8&appl=2&link=https://cbdoilamericano.com  http://auto-news.su/go.php?http://www.viknadveri.com.ua/modules/redir.php?url=https://cbdoilamericano.com   http://sitrickcompany.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.mao35.com/url.php?url=https://cbdoilamericano.com  http://snapeace.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://scrubby-creek.com/redir.asp?link=cbdoilamericano.com \nhttp://onlytuition.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://weddingideastips.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://irarubenstein.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bedandbre.mastertop100.net/out.php??s=https://cbdoilamericano.com  http://hvq.whyamericansdiy.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://saffronauctions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://martysplacedogsanctuary.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://sakiokacompany.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.thearchitectsincorporated.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttps://www.kainatau.lt/redirect.php?url=https://cbdoilamericano.com  http://astrobomb.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://womansoul.ru/redirect?url=https://cbdoilamericano.com   http://whole-deal.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://night.jp/jump.php?url=https://cbdoilamericano.com   http://bobandtracycarver.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://209.97.193.62/redirect.php?url=https://cbdoilamericano.com  http://12pick.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://alczervik.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://unfoldingnews.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://myrna-blyth.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://lovebind.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://masseffect3.ru/link.php?url=https://cbdoilamericano.com  http://asila.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://davesilkett.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.datarecovery-blog.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://american-capitalreit.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.campusguru.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://upsconsulting.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://usapokerplayer.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.skinnytwinks.net/young/out.php?l=gYSJoYiyTXgM&u=/cbdoilamericano.com   http://social-habitat.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://yarauvi.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://blackrosesto.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://lorettalepore.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.qeuuke.ga/out.php?l=https://cbdoilamericano.com   http://jtycctv.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://carefulbynature.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://dreamsmeaning.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thompson-properties.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://scorefightnight.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://shrewsburycrossing.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.tannoy-rus.ru/bitrix/rk.php?goto=https://cbdoilamericano.com  http://xn--80aahfcd7bb3dwf.xn--p1ai/bitrix/rk.php?id=1&event1=banner&event2=click&goto=cbdoilamericano.com  http://yvu.hande.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://coleellison.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttps://forum.itabcabc.ru/viewtopic.php?f=5&t=130431\nhttp://asomatous.net/forum/index.php?topic=11466.new#new\nhttp://xn--iexed-ngaa6qrbbh.mannlist.com/viewtopic.php?f=10&t=45825469\nhttp://ru-realty.com/forum/index.php?topic=45644.new#new\nhttp://ntcinet.com/forum/index.php?topic=20561.new#new\n", "language": "Lisp", "metadata": {"date": 1548327809, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s143237256.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s143237256", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.dff.jp/nocookie/redirect.php?url=https://cbdoilamericano.com  https://ruzgarcevretasarim.com/cms/home/switch?goto=cbdoilamericano.com   http://www.clubsurvey.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://crclookup.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.petrolnews.net/click.php?r=135&url=https://cbdoilamericano.com   http://vote4flattax.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://sickofthesameoldshit.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://steveheflin.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://routedesbieres.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://t1dexchange.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://twcmail.de/deref.php?https://cbdoilamericano.com/   http://associatedclimate.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://andrewspade.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://aclittleleague.com/Goto.asp?url=https://cbdoilamericano.com   http://www.secnews.ru/russian/bitrix/rk.php?id=193&event1=impuls_193&goto=https://cbdoilamericano.com  http://www.lemoncc.com/link.php?url=https://cbdoilamericano.com  http://2xk.jreeves-law.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.manke8.com/other/Link.asp?action=go&fl_id=30&url=https://cbdoilamericano.com \nhttp://hamilton-international-airport.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://seejanebreath.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thesolarmoviehd.com/go.php?url=https://cbdoilamericano.com   http://pawlyn.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.prolistsolutions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://wolframkids.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.yanxin.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.ogersystems.com/en/index.php/component/k2/item/230-2015-02-23-12-52-38?fromurl=cbdoilamericano.com   http://neriumyoungentrepreneur.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://388.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://batterysolutions.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://hawkforum.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ksldeals.mobi/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://xn--80aealotwbjpid2k.xn--80aze9d.xn--p1ai/bitrix/rk.php?id=78&event1=banner&event2=click&event3=1+%2F+%5B78%5D+%5Bfooter%5D+Prava%2C+obyazannosti+i+trebovaniya+k+sluzhebnomu+povedeniyu&goto=cbdoilamericano.com   http://gaylovecall.com/dtr/link.php?gr=2&id=e4927b&url=https://cbdoilamericano.com  http://www.integratingmindandbody.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://wealthcontrol.com/massMutualSpecific/generalRedirect.asp?url=http://cbdoilamericano.com   http://гѓ¦гѓ‹гѓ»гѓЃгѓЈгѓјгѓ .com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://pyi.nestlogistics.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://grazianosbroggio.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.itogi.ru/bitrix/rk.php?id=3447&event1=banner&event2=click&event3=4+/+<>447]+<Itogi>top_B994]+Nomobile/Samsung+PS51D550&goto=https://cbdoilamericano.com   http://langsdekust.nl/out.php?id=vh-rablaan8&appl=2&link=https://cbdoilamericano.com  http://auto-news.su/go.php?http://www.viknadveri.com.ua/modules/redir.php?url=https://cbdoilamericano.com   http://sitrickcompany.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.mao35.com/url.php?url=https://cbdoilamericano.com  http://snapeace.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://scrubby-creek.com/redir.asp?link=cbdoilamericano.com \nhttp://onlytuition.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://weddingideastips.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://irarubenstein.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bedandbre.mastertop100.net/out.php??s=https://cbdoilamericano.com  http://hvq.whyamericansdiy.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://saffronauctions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://martysplacedogsanctuary.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://sakiokacompany.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.thearchitectsincorporated.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttps://www.kainatau.lt/redirect.php?url=https://cbdoilamericano.com  http://astrobomb.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://womansoul.ru/redirect?url=https://cbdoilamericano.com   http://whole-deal.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://night.jp/jump.php?url=https://cbdoilamericano.com   http://bobandtracycarver.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://209.97.193.62/redirect.php?url=https://cbdoilamericano.com  http://12pick.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://alczervik.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://unfoldingnews.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://myrna-blyth.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://lovebind.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://masseffect3.ru/link.php?url=https://cbdoilamericano.com  http://asila.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://davesilkett.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.datarecovery-blog.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://american-capitalreit.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.campusguru.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://upsconsulting.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://usapokerplayer.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.skinnytwinks.net/young/out.php?l=gYSJoYiyTXgM&u=/cbdoilamericano.com   http://social-habitat.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://yarauvi.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://blackrosesto.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://lorettalepore.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.qeuuke.ga/out.php?l=https://cbdoilamericano.com   http://jtycctv.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://carefulbynature.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://dreamsmeaning.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thompson-properties.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://scorefightnight.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://shrewsburycrossing.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.tannoy-rus.ru/bitrix/rk.php?goto=https://cbdoilamericano.com  http://xn--80aahfcd7bb3dwf.xn--p1ai/bitrix/rk.php?id=1&event1=banner&event2=click&goto=cbdoilamericano.com  http://yvu.hande.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://coleellison.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttps://forum.itabcabc.ru/viewtopic.php?f=5&t=130431\nhttp://asomatous.net/forum/index.php?topic=11466.new#new\nhttp://xn--iexed-ngaa6qrbbh.mannlist.com/viewtopic.php?f=10&t=45825469\nhttp://ru-realty.com/forum/index.php?topic=45644.new#new\nhttp://ntcinet.com/forum/index.php?topic=20561.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7817, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s807075970", "group_id": "codeNet:p03941", "input_text": "http://xxx1.teen-nudism-pics.info/cgi-bin/out.cgi?ses=HKRSKzoFXz&id=37&url=https://cbdoilamericano.com  https://pinoyeshop.com/go/zalora/?url=https://cbdoilamericano.com   http://www.falsestart.biz/tc/i.cgi?cat=15&mode=redirect&ref_eid=8700&url=https://cbdoilamericano.com   http://www.ewcuw.com/bbs/redirect.php?tid=286&goto=cbdoilamericano.com  https://www.asyl-clinic.kz/bitrix/rk.php?id=4&site_id=ru&event1=banner&event2=click&event3=1+%2F+%5B4%5D+%5Bmain_middle%5D+%D0%9A%D0%BE%D0%BD%D1%82%D0%B5%D0%B9%D0%BD%D0%B5%D1%80+%D0%BD%D0%B0+%D0%B3%D0%BB%D0%B0%D0%B2%D0%BD%D0%BE%D0%B9+-+%D0%9F%D1%80%D0%B0%D0%B2%D1%8B%D0%B9+%D0%B1%D0%B0%D0%BD%D0%BD%D0%B5%D1%80&goto=cbdoilamericano.com   http://www.tandcassoc.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.chongwu.cc/home/link.php?url=https://cbdoilamericano.com  http://www.handsurgeryindia.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://chicagolandelectric.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttps://go.newberry.org/page.redir?target=https://cbdoilamericano.com  http://www.marksmanporn.com/crtr/cgi/out.cgi?c=99&s=&u=https://cbdoilamericano.com   http://equalexperience.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://geriatricservicesorganization.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.forgetbranding.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://margret.jhn.se/link.php?linkid=19&url=https://cbdoilamericano.com  http://174.127.195.205/bbs/redirect.php?tid=7663079&goto=cbdoilamericano.com  http://chryslerkansascity.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://consiliumbillingservices.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://davegarrett.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://camppeninsulas.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thedominospizzastand.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://gravitio.net/redir.php?url=https://cbdoilamericano.com  http://www.koinonia.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.correx.eu/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://sunwatercompany.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://shms.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ashrei.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://us.writeaprisoner.com/form-report-web-problem.aspx?a=https://cbdoilamericano.com/  http://tim.mackey.ie/ct.ashx?id=b9184d35-b02d-4ffb-a363-7a0743263e4a&url=https://cbdoilamericano.com   http://impedimed.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aber-diamonds.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://running79.e-monsite.com/liens/do_redirect/?url=https://cbdoilamericano.com   http://beaute.tv/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://fortlauderdalechristmas.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://e-rentier.ru.arzai.ru/bitrix/rk.php?id=1&site_id=s1&event1=banner&event2=click&goto=cbdoilamericano.com   http://aculoan.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://xkf.intensivecare.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://wardsfranchise.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://mixespowders.com/gepatit-forum/go.php?https://cbdoilamericano.com   http://www.lactose.at/content/link.php?url=https://cbdoilamericano.com/  http://ryefordsucks.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://disabilityworks.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://longs-drugsstores.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://donateyourstocks.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://robiots.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.vividedge.com/__media__/js/netsoltrademark.php?d=&x=0&y=0cbdoilamericano.com  https://www.belgbook.be/?url=cbdoilamericano.com   http://primeira.emktsender.net/registra_clique.php?id=TH%7Cteste%7C82893%7C26959&url=https://cbdoilamericano.com   http://emiratesherbals.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://paccess-sourcing.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://images.google.to/url?q=https://cbdoilamericano.com  http://genesisscience.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://americandreamworld.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://pack365yukonok.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://pacersignup.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://nugrowth.digital/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://cssrpg.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bjtube.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://greenlightfs.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.epitbull.ru/.go.php?url=https://cbdoilamericano.com  http://gzfishing.com/home.php?mod=space&uid=6995&do=album&picid=3023&goto=cbdoilamericano.com  http://centralfloridahockeyclub.com/Goto.asp?url=https://cbdoilamericano.com   http://menaassistanceinc.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://mysmartcreditreport.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://quebecicewine.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://galapagosaffairmovie.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://cunardregistry.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://chymistry.cd.lib.hnlat.com/index.php?m=content&c=index&a=show&catid=1013&id=2066&siteid=26&url=https://cbdoilamericano.com   http://dumbcunt-miriam-lazewatsky.xoxohth.com/go.php?url=https://cbdoilamericano.com  http://social-habitat.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://kepler542b.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://blissparty.club/sessions/new?goto=https://cbdoilamericano.com \nhttps://gimatria.net/redirect.php?target=https://cbdoilamericano.com  http://pertuity.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.kiteaddicts.co.uk/mobiquo/smartbanner/welcome.php?referer=http%3A%2F%2Fwww.kiteaddicts.co.uk%2Fshowthread.php%3F16004-XCWeather-forecast-as-19-49-Sun-22-12-13&code=b36c42071b95c0211791bbdc91a7e665&board_url=https://cbdoilamericano.com   http://localillness.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://00h.nodarksuits.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bpiinsurance.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.kauai.gs/__media__/js/trademark.php?d=cbdoilamericano.com  http://www.signalsbinaryoptions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://canacorporation.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://amsexperts.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://drsuhaspatil.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aristechglobal.jp/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.fullboost.com.au/forum/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fwww.fullboost.com.au%2Fforum%2Fshowthread.php%3F8840-FS-SA-Garrett-TO4-S-1050-delivered&code=383c7f0a1d2d0bb10f9695b658ba1800&board_url=https://cbdoilamericano.com  http://let-me-guess.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://fxtradespace.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://jaynecastle.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://infinitiofbridgewater.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://finecosimonline.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttp://foro.comopeces.com/showthread.php?tid=21716&pid=33794#pid33794\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttp://inquisitor.dk/web/forum/viewtopic.php?f=36&t=77321\nhttp://www.waterpointmapper.org/forum/showthread.php?tid=121086\nhttps://tretho.info/threads/2801704-lady-vols-radio.html?p=36874734#post36874734\n", "language": "Lisp", "metadata": {"date": 1548318951, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s807075970.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s807075970", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://xxx1.teen-nudism-pics.info/cgi-bin/out.cgi?ses=HKRSKzoFXz&id=37&url=https://cbdoilamericano.com  https://pinoyeshop.com/go/zalora/?url=https://cbdoilamericano.com   http://www.falsestart.biz/tc/i.cgi?cat=15&mode=redirect&ref_eid=8700&url=https://cbdoilamericano.com   http://www.ewcuw.com/bbs/redirect.php?tid=286&goto=cbdoilamericano.com  https://www.asyl-clinic.kz/bitrix/rk.php?id=4&site_id=ru&event1=banner&event2=click&event3=1+%2F+%5B4%5D+%5Bmain_middle%5D+%D0%9A%D0%BE%D0%BD%D1%82%D0%B5%D0%B9%D0%BD%D0%B5%D1%80+%D0%BD%D0%B0+%D0%B3%D0%BB%D0%B0%D0%B2%D0%BD%D0%BE%D0%B9+-+%D0%9F%D1%80%D0%B0%D0%B2%D1%8B%D0%B9+%D0%B1%D0%B0%D0%BD%D0%BD%D0%B5%D1%80&goto=cbdoilamericano.com   http://www.tandcassoc.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.chongwu.cc/home/link.php?url=https://cbdoilamericano.com  http://www.handsurgeryindia.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://chicagolandelectric.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttps://go.newberry.org/page.redir?target=https://cbdoilamericano.com  http://www.marksmanporn.com/crtr/cgi/out.cgi?c=99&s=&u=https://cbdoilamericano.com   http://equalexperience.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://geriatricservicesorganization.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.forgetbranding.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://margret.jhn.se/link.php?linkid=19&url=https://cbdoilamericano.com  http://174.127.195.205/bbs/redirect.php?tid=7663079&goto=cbdoilamericano.com  http://chryslerkansascity.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://consiliumbillingservices.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://davegarrett.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://camppeninsulas.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thedominospizzastand.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://gravitio.net/redir.php?url=https://cbdoilamericano.com  http://www.koinonia.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.correx.eu/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://sunwatercompany.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://shms.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ashrei.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://us.writeaprisoner.com/form-report-web-problem.aspx?a=https://cbdoilamericano.com/  http://tim.mackey.ie/ct.ashx?id=b9184d35-b02d-4ffb-a363-7a0743263e4a&url=https://cbdoilamericano.com   http://impedimed.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aber-diamonds.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://running79.e-monsite.com/liens/do_redirect/?url=https://cbdoilamericano.com   http://beaute.tv/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://fortlauderdalechristmas.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://e-rentier.ru.arzai.ru/bitrix/rk.php?id=1&site_id=s1&event1=banner&event2=click&goto=cbdoilamericano.com   http://aculoan.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://xkf.intensivecare.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://wardsfranchise.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://mixespowders.com/gepatit-forum/go.php?https://cbdoilamericano.com   http://www.lactose.at/content/link.php?url=https://cbdoilamericano.com/  http://ryefordsucks.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://disabilityworks.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://longs-drugsstores.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://donateyourstocks.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://robiots.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.vividedge.com/__media__/js/netsoltrademark.php?d=&x=0&y=0cbdoilamericano.com  https://www.belgbook.be/?url=cbdoilamericano.com   http://primeira.emktsender.net/registra_clique.php?id=TH%7Cteste%7C82893%7C26959&url=https://cbdoilamericano.com   http://emiratesherbals.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://paccess-sourcing.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://images.google.to/url?q=https://cbdoilamericano.com  http://genesisscience.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://americandreamworld.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://pack365yukonok.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://pacersignup.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://nugrowth.digital/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://cssrpg.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bjtube.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://greenlightfs.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.epitbull.ru/.go.php?url=https://cbdoilamericano.com  http://gzfishing.com/home.php?mod=space&uid=6995&do=album&picid=3023&goto=cbdoilamericano.com  http://centralfloridahockeyclub.com/Goto.asp?url=https://cbdoilamericano.com   http://menaassistanceinc.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://mysmartcreditreport.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://quebecicewine.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://galapagosaffairmovie.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://cunardregistry.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://chymistry.cd.lib.hnlat.com/index.php?m=content&c=index&a=show&catid=1013&id=2066&siteid=26&url=https://cbdoilamericano.com   http://dumbcunt-miriam-lazewatsky.xoxohth.com/go.php?url=https://cbdoilamericano.com  http://social-habitat.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://kepler542b.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://blissparty.club/sessions/new?goto=https://cbdoilamericano.com \nhttps://gimatria.net/redirect.php?target=https://cbdoilamericano.com  http://pertuity.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.kiteaddicts.co.uk/mobiquo/smartbanner/welcome.php?referer=http%3A%2F%2Fwww.kiteaddicts.co.uk%2Fshowthread.php%3F16004-XCWeather-forecast-as-19-49-Sun-22-12-13&code=b36c42071b95c0211791bbdc91a7e665&board_url=https://cbdoilamericano.com   http://localillness.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://00h.nodarksuits.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bpiinsurance.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.kauai.gs/__media__/js/trademark.php?d=cbdoilamericano.com  http://www.signalsbinaryoptions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://canacorporation.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://amsexperts.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://drsuhaspatil.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aristechglobal.jp/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.fullboost.com.au/forum/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fwww.fullboost.com.au%2Fforum%2Fshowthread.php%3F8840-FS-SA-Garrett-TO4-S-1050-delivered&code=383c7f0a1d2d0bb10f9695b658ba1800&board_url=https://cbdoilamericano.com  http://let-me-guess.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://fxtradespace.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://jaynecastle.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://infinitiofbridgewater.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://finecosimonline.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttp://foro.comopeces.com/showthread.php?tid=21716&pid=33794#pid33794\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttp://inquisitor.dk/web/forum/viewtopic.php?f=36&t=77321\nhttp://www.waterpointmapper.org/forum/showthread.php?tid=121086\nhttps://tretho.info/threads/2801704-lady-vols-radio.html?p=36874734#post36874734\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8359, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s150359140", "group_id": "codeNet:p03941", "input_text": "http://www.rural-health-clinic.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://peak.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://lrheart.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://gorod-belgorod.ru/widgets/outside/?url=https://cbdoilamericano.com  http://www.kadokado.com/redir?url=https://cbdoilamericano.com   http://dfc.ipnetworksolutions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://calwaterlaw.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://elisabettacord.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://travelsystem.de/travelshops/1_tt/index.php?id=106983&ud1=assreisen&url1=cbdoilamericano.com \nhttp://www.dycenturyfabric.lk/index.php?option=com_k2&view=item&id=7:new-millenium-lines&fromurl=cbdoilamericano.com  http://alternatecapitalsolutions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://chicagodealline.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://jaffon.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://a-prostine.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.emmasballoons.com/cgi-bin/arp/out.cgi?id=frisky&url=https://cbdoilamericano.com  http://www.saboresdelnorte.com/redirect.php?action=url&goto=cbdoilamericano.com  http://kyouwa-housing1.sakura.pshav.com/feed2js/feed2js.php?src=https://cbdoilamericano.com   http://organizationalchartsoftware.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.zh-sc.com/go.php?url=cbdoilamericano.com  http://www.gobiapartments.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://knowyourlab.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.photoshop.in.ua/index.php?option=com_toplinks&Itemid=97&linkid=90&task=redirect&url=https://cbdoilamericano.com  https://www.ucpaloalto.com/default.aspx?p=TrackHyperlink&url=https://cbdoilamericano.com   http://www.toysrus.com.sg/scripts/redir.asp?link=https://cbdoilamericano.com  http://www.hubber.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://creativecreditshopper.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://coin-list.net/goto.php?url=https://cbdoilamericano.com \nhttp://myhomedatanow.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://lotsogreatstuff.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ns1.rusich.biz/goto.php?https://cbdoilamericano.com   http://everyhalfhour.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://yourgamehere.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aetnaabsenceadvocate.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://e0758.cn/link.php?action=previous&fid=2&tid=45&fpage=0&goto=cbdoilamericano.com  http://canalytica.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://construquimicos.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://wetseed.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://depression.goldenarticles.net/go.php?url=https://cbdoilamericano.com   http://crazy-bdsm.com/cgi-bin/at3/out.cgi?id=148&tag=toplist&trade=https://cbdoilamericano.com   http://obstv.at.ua/go?https://cbdoilamericano.com  http://hockeyresearch.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://bigcats.pl/redirect.php?action=url&goto=https://cbdoilamericano.com  http://wrestling.isport.com/Default.aspx?link=https://cbdoilamericano.com  http://www.olentangyindiancaverns.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://washington.hirecentral.com/home/redirect/?site=https://cbdoilamericano.com \nhttp://andes2amazon.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://alisister.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.necharters.org/r?u=https://cbdoilamericano.com   http://www.hotmixvideo.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://harmonautos.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thetruthaboutaps.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://espourse.cf/bitrix/rk.php?id=114&event1=banner&event2=click&event3=1%2B/%2B%5B114%5D%2B%5BBACKGROUND]%2B%5Bback_trikdis%5D&goto=cbdoilamericano.com  http://www.tryteengirls.com/video.php?p=s2&url=tube.php?go=https://cbdoilamericano.com   http://klickarchiv.de/redirect.php?url=https://cbdoilamericano.com \nhttps://smart-stb.net/index.php?_url=cbdoilamericano.com  http://qkhire.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://squirrelcoder.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.seculife.co.il/redir.asp?url=https://cbdoilamericano.com  http://rus-url.ru/redirect.php?url=cbdoilamericano.com   http://worldfoodlatinamerica.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://iranianduilawyer.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://thisgoesto11.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://daymarkmedia.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://kimberlyven.be/gastenboek/go.php?url=https://cbdoilamericano.com  http://connectingmarketingcontent.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://rootme.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://transformationnationonline.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://momzcare.co.in/cgi-bin/redirect.pl?cbdoilamericano.com   http://tennesseedirectvaloans.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://shoppingvermont.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://bfcwcs.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://207doctors.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://elmonteautopaint.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://plan4profi.com/bitrix/rk.php?id=7&site_id=s2&goto=https://cbdoilamericano.com   http://global-autonews.com/shop/bannerhit.php?bn_id=307&url=https://cbdoilamericano.com   http://www.daddona.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.gamblingonlinemag.co.uk/Banners/adclick.php?bannerid=59&zoneid=1&source=&dest=https://cbdoilamericano.com/   http://codesria.org/spip.php?article2609&action=converser&var_lang=fr&redirect=https://cbdoilamericano.com  http://www.probusinesstv.ru/bitrix/rk.php?id=1378&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B1378%5D+%5Bunder_afisha%5D+%D0%BD%D0%B4%D0%BE+5.07&goto=cbdoilamericano.com  http://ledsignsamerica.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://checkdincampaign.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://tencriticalquestions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://haessly.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://westhavendentalcare.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://davidmstanton.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.8000dy.com/go.php?url=https://cbdoilamericano.com   http://yanbal-international-corporation.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://secretalienlife.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://kohlstn.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://105.aeweb.com.tw/redir.php?url=https://cbdoilamericano.com \n \n \n \n \n \nhttps://foro.easygamer.cl/showthread.php?tid=368&pid=3456#pid3456\nhttp://www.leopoldsdorf-wien.info/phpbb/viewtopic.php?f=2&t=166901\nhttps://i2insights.org/2018/09/11/strengthening-environmental-humanities/\nhttp://mamnontrithuc.edu.vn/forum/showthread.php?10326-sophomore-powderpuff-sayings&p=32472#post32472\nhttp://sztolnia.org/forum/index.php?topic=13752.new#new\n", "language": "Lisp", "metadata": {"date": 1548294895, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s150359140.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s150359140", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.rural-health-clinic.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://peak.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://lrheart.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://gorod-belgorod.ru/widgets/outside/?url=https://cbdoilamericano.com  http://www.kadokado.com/redir?url=https://cbdoilamericano.com   http://dfc.ipnetworksolutions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://calwaterlaw.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://elisabettacord.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://travelsystem.de/travelshops/1_tt/index.php?id=106983&ud1=assreisen&url1=cbdoilamericano.com \nhttp://www.dycenturyfabric.lk/index.php?option=com_k2&view=item&id=7:new-millenium-lines&fromurl=cbdoilamericano.com  http://alternatecapitalsolutions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://chicagodealline.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://jaffon.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://a-prostine.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.emmasballoons.com/cgi-bin/arp/out.cgi?id=frisky&url=https://cbdoilamericano.com  http://www.saboresdelnorte.com/redirect.php?action=url&goto=cbdoilamericano.com  http://kyouwa-housing1.sakura.pshav.com/feed2js/feed2js.php?src=https://cbdoilamericano.com   http://organizationalchartsoftware.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.zh-sc.com/go.php?url=cbdoilamericano.com  http://www.gobiapartments.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://knowyourlab.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.photoshop.in.ua/index.php?option=com_toplinks&Itemid=97&linkid=90&task=redirect&url=https://cbdoilamericano.com  https://www.ucpaloalto.com/default.aspx?p=TrackHyperlink&url=https://cbdoilamericano.com   http://www.toysrus.com.sg/scripts/redir.asp?link=https://cbdoilamericano.com  http://www.hubber.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://creativecreditshopper.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://coin-list.net/goto.php?url=https://cbdoilamericano.com \nhttp://myhomedatanow.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://lotsogreatstuff.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ns1.rusich.biz/goto.php?https://cbdoilamericano.com   http://everyhalfhour.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://yourgamehere.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aetnaabsenceadvocate.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://e0758.cn/link.php?action=previous&fid=2&tid=45&fpage=0&goto=cbdoilamericano.com  http://canalytica.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://construquimicos.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://wetseed.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://depression.goldenarticles.net/go.php?url=https://cbdoilamericano.com   http://crazy-bdsm.com/cgi-bin/at3/out.cgi?id=148&tag=toplist&trade=https://cbdoilamericano.com   http://obstv.at.ua/go?https://cbdoilamericano.com  http://hockeyresearch.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://bigcats.pl/redirect.php?action=url&goto=https://cbdoilamericano.com  http://wrestling.isport.com/Default.aspx?link=https://cbdoilamericano.com  http://www.olentangyindiancaverns.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://washington.hirecentral.com/home/redirect/?site=https://cbdoilamericano.com \nhttp://andes2amazon.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://alisister.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.necharters.org/r?u=https://cbdoilamericano.com   http://www.hotmixvideo.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://harmonautos.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thetruthaboutaps.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://espourse.cf/bitrix/rk.php?id=114&event1=banner&event2=click&event3=1%2B/%2B%5B114%5D%2B%5BBACKGROUND]%2B%5Bback_trikdis%5D&goto=cbdoilamericano.com  http://www.tryteengirls.com/video.php?p=s2&url=tube.php?go=https://cbdoilamericano.com   http://klickarchiv.de/redirect.php?url=https://cbdoilamericano.com \nhttps://smart-stb.net/index.php?_url=cbdoilamericano.com  http://qkhire.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://squirrelcoder.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.seculife.co.il/redir.asp?url=https://cbdoilamericano.com  http://rus-url.ru/redirect.php?url=cbdoilamericano.com   http://worldfoodlatinamerica.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://iranianduilawyer.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://thisgoesto11.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://daymarkmedia.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://kimberlyven.be/gastenboek/go.php?url=https://cbdoilamericano.com  http://connectingmarketingcontent.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://rootme.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://transformationnationonline.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://momzcare.co.in/cgi-bin/redirect.pl?cbdoilamericano.com   http://tennesseedirectvaloans.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://shoppingvermont.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://bfcwcs.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://207doctors.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://elmonteautopaint.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://plan4profi.com/bitrix/rk.php?id=7&site_id=s2&goto=https://cbdoilamericano.com   http://global-autonews.com/shop/bannerhit.php?bn_id=307&url=https://cbdoilamericano.com   http://www.daddona.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.gamblingonlinemag.co.uk/Banners/adclick.php?bannerid=59&zoneid=1&source=&dest=https://cbdoilamericano.com/   http://codesria.org/spip.php?article2609&action=converser&var_lang=fr&redirect=https://cbdoilamericano.com  http://www.probusinesstv.ru/bitrix/rk.php?id=1378&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B1378%5D+%5Bunder_afisha%5D+%D0%BD%D0%B4%D0%BE+5.07&goto=cbdoilamericano.com  http://ledsignsamerica.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://checkdincampaign.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://tencriticalquestions.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://haessly.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://westhavendentalcare.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://davidmstanton.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.8000dy.com/go.php?url=https://cbdoilamericano.com   http://yanbal-international-corporation.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://secretalienlife.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://kohlstn.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   https://105.aeweb.com.tw/redir.php?url=https://cbdoilamericano.com \n \n \n \n \n \nhttps://foro.easygamer.cl/showthread.php?tid=368&pid=3456#pid3456\nhttp://www.leopoldsdorf-wien.info/phpbb/viewtopic.php?f=2&t=166901\nhttps://i2insights.org/2018/09/11/strengthening-environmental-humanities/\nhttp://mamnontrithuc.edu.vn/forum/showthread.php?10326-sophomore-powderpuff-sayings&p=32472#post32472\nhttp://sztolnia.org/forum/index.php?topic=13752.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7924, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s950487242", "group_id": "codeNet:p03941", "input_text": "http://orbispace.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.stopnuclearpower.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://solimar.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.gmnaturalstone.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://cybersmartwithmcgruff.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ipngxxxx.xxxha.com/crtr/cgi/out.cgi?id=114&tag=foottop&trade=https://cbdoilamericano.com  http://tageisnerllc.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://cooloa.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://59reniao.com/redirect.php?goto=cbdoilamericano.com \nhttp://www.justshemalesex.com/cgi-bin/at3/out.cgi?id=89&tag=top&trade=https://cbdoilamericano.com  http://kneelatthecross.com/testblog/wp-content/plugins/wp-js-external-link-info/redirect.php?blog=Chester+County+Bank&url=https://cbdoilamericano.com/   http://ubaethiopia.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://relaxic.at.ua/go?https://cbdoilamericano.com  http://logp3.xiti.com/go.url?xts=201912&xtor=AL-211-<TVtrip>-<VideoDate>-<IT>-<www>tvtrip.it]-<>]-<>]&url=https://cbdoilamericano.com   http://tfcgo.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://reservedurangocolorado.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://redwhiteandgreenwines.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.businesssoftwaredevelopers.net/Services/Redirect.aspx?url=https://cbdoilamericano.com \nhttp://undeadads.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.microchip.com.cn/newcommunity//forum/redirect.php?tid=3163&goto=cbdoilamericano.com   http://financeready.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://btgpactual.co/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://sunstudentcourses.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thechibridge.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ur-tech.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://webformsite.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://folkeopplysningen.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://greeneville.graderesults.com/gr/modules/login/logout.php?referrer=https://cbdoilamericano.com  http://rongevansdds.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.unionpacificrewards.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.miksike.ee/en/gtests.html?test=7511&gametype=0&clnr=&subject_id=&referer=https://cbdoilamericano.com  http://lindseyworldwide.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://acehowto.com/forum/away.php?s=https://cbdoilamericano.com  http://mariesdip.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.thassos-forum.de/go.php?to=https://cbdoilamericano.com   http://jiggumbob.theaterofpompey.com/atta8.jp/feed2js/feed2js.php?src=https://cbdoilamericano.com \nhttp://lotterymusicstore.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://pensacolabeachlodging.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://15.pro.tok2.com/~koro/cutlinks/rank.php?url=https://cbdoilamericano.com   http://tcarbone.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://myappshubb.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://megatorrents.org/forum/url.php?url=https://cbdoilamericano.com  http://matthewbakey.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.glorioustronics.com/redirect.php?link=https://cbdoilamericano.com   http://gottofly.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://nb949.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://viralsections.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://logcabin.nationbuilder.com/r?u=https://cbdoilamericano.com   http://www.topgun-a.com/index.asp?ordencomercio=fecha_desc&goto=https://cbdoilamericano.com  http://www.riseupwv.org/r?u=https://cbdoilamericano.com   http://it4pal.com/ar/go.php?url=https://cbdoilamericano.com  http://www.desertquest.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://cntumor.cn/bbs/redirect.php?tid=128099&goto=cbdoilamericano.com   https://bluf.com/go.php?https://cbdoilamericano.com \nhttp://www.ocean-energy.co.uk/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://mss.in.ua/go.php?to=https://cbdoilamericano.com   http://www.advogadoonline.net/goto/https://cbdoilamericano.com   http://www.humor.portalnews.de/go.php?url=https://cbdoilamericano.com  http://yourpurecredit.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.magnequench.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://aizahealy.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://umcpreaching.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thechocolateshoe.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://ticklebugs.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://travelbaseballtournaments.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.tea26.com/api/redirect.php?url=https://cbdoilamericano.com   http://cellularoneservices.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://mail.orss.ru/?outlink=https://cbdoilamericano.com   http://ohiosdairyfarmers.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.kcsd.k12.or.us/HitAndGo.asp?AdID=221&URL=https://cbdoilamericano.com  http://www.xxxvintageart.com/crtr/cgi/out.cgi?id=116&l=top_top&u=https://cbdoilamericano.com   http://westpalmchevrolet.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://111.75.206.153/bbs/redirect.php?tid=4952&goto=cbdoilamericano.com  http://bobantia.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://placespatialad.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://margaritamergentime.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://racingworld.no-ip.org/redirect.php?fid=287&tid=107548&goto=cbdoilamericano.com   http://www.kfia.org/LinkClick.aspx?link=https://cbdoilamericano.com  http://www.onlinemoviespro.tk/moviestime/go.php?title=Running+on+the+Sun+The+Badwater+135&url=cbdoilamericano.com  http://allisonmang.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://yvonnebartlett.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.goote.co.il/refurl.php?url=https://cbdoilamericano.com  http://asiainspection.name/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://simplehappyeasy.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.ivslbd.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://hbieureka.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.test99.com/url.asp?url=https://cbdoilamericano.com  https://41032774.r.bat.bing.com/?ld=d3g67Lon_IkLWaLEN-9e0NezVUCUxpq7cWOAbbdeYGU_8FNeYm48rlTuqZNdN_QdLbR_iqrh2CTR8rUvAOgjsKE0x5-TRj1liHLYzjIWpe5-mhgaQ3YRbYe2eRBtr0YkPkEjbPZJQS5pPUHlgrIpYw0KOKSp4&u=https://cbdoilamericano.com  http://gonetouring.com.au/LinkClick.aspx?link=https://cbdoilamericano.com   http://pcosmiles.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttp://dbo-alliance.com/viewtopic.php?f=3&t=3351\nhttp://0.0.0.ehhkzg.mannlist.com/viewtopic.php?f=10&t=45814069\nhttp://forum.plastverkstan.se/viewtopic.php?f=2&t=226785&p=705025#p705025\nhttp://www.deliberarchia.org/forum/index.php?topic=12936.new#new\nhttp://slpsfd.org/forum/index.php?topic=21164.new#new\n", "language": "Lisp", "metadata": {"date": 1548274943, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s950487242.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s950487242", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://orbispace.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.stopnuclearpower.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://solimar.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.gmnaturalstone.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://cybersmartwithmcgruff.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ipngxxxx.xxxha.com/crtr/cgi/out.cgi?id=114&tag=foottop&trade=https://cbdoilamericano.com  http://tageisnerllc.info/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://cooloa.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://59reniao.com/redirect.php?goto=cbdoilamericano.com \nhttp://www.justshemalesex.com/cgi-bin/at3/out.cgi?id=89&tag=top&trade=https://cbdoilamericano.com  http://kneelatthecross.com/testblog/wp-content/plugins/wp-js-external-link-info/redirect.php?blog=Chester+County+Bank&url=https://cbdoilamericano.com/   http://ubaethiopia.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://relaxic.at.ua/go?https://cbdoilamericano.com  http://logp3.xiti.com/go.url?xts=201912&xtor=AL-211-<TVtrip>-<VideoDate>-<IT>-<www>tvtrip.it]-<>]-<>]&url=https://cbdoilamericano.com   http://tfcgo.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://reservedurangocolorado.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://redwhiteandgreenwines.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.businesssoftwaredevelopers.net/Services/Redirect.aspx?url=https://cbdoilamericano.com \nhttp://undeadads.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.microchip.com.cn/newcommunity//forum/redirect.php?tid=3163&goto=cbdoilamericano.com   http://financeready.us/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://btgpactual.co/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://sunstudentcourses.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thechibridge.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://ur-tech.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://webformsite.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://folkeopplysningen.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://greeneville.graderesults.com/gr/modules/login/logout.php?referrer=https://cbdoilamericano.com  http://rongevansdds.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.unionpacificrewards.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.miksike.ee/en/gtests.html?test=7511&gametype=0&clnr=&subject_id=&referer=https://cbdoilamericano.com  http://lindseyworldwide.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://acehowto.com/forum/away.php?s=https://cbdoilamericano.com  http://mariesdip.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.thassos-forum.de/go.php?to=https://cbdoilamericano.com   http://jiggumbob.theaterofpompey.com/atta8.jp/feed2js/feed2js.php?src=https://cbdoilamericano.com \nhttp://lotterymusicstore.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://pensacolabeachlodging.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://15.pro.tok2.com/~koro/cutlinks/rank.php?url=https://cbdoilamericano.com   http://tcarbone.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://myappshubb.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://megatorrents.org/forum/url.php?url=https://cbdoilamericano.com  http://matthewbakey.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.glorioustronics.com/redirect.php?link=https://cbdoilamericano.com   http://gottofly.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://nb949.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://viralsections.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://logcabin.nationbuilder.com/r?u=https://cbdoilamericano.com   http://www.topgun-a.com/index.asp?ordencomercio=fecha_desc&goto=https://cbdoilamericano.com  http://www.riseupwv.org/r?u=https://cbdoilamericano.com   http://it4pal.com/ar/go.php?url=https://cbdoilamericano.com  http://www.desertquest.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://cntumor.cn/bbs/redirect.php?tid=128099&goto=cbdoilamericano.com   https://bluf.com/go.php?https://cbdoilamericano.com \nhttp://www.ocean-energy.co.uk/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://mss.in.ua/go.php?to=https://cbdoilamericano.com   http://www.advogadoonline.net/goto/https://cbdoilamericano.com   http://www.humor.portalnews.de/go.php?url=https://cbdoilamericano.com  http://yourpurecredit.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.magnequench.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://aizahealy.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://umcpreaching.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thechocolateshoe.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://ticklebugs.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://travelbaseballtournaments.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.tea26.com/api/redirect.php?url=https://cbdoilamericano.com   http://cellularoneservices.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://mail.orss.ru/?outlink=https://cbdoilamericano.com   http://ohiosdairyfarmers.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.kcsd.k12.or.us/HitAndGo.asp?AdID=221&URL=https://cbdoilamericano.com  http://www.xxxvintageart.com/crtr/cgi/out.cgi?id=116&l=top_top&u=https://cbdoilamericano.com   http://westpalmchevrolet.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://111.75.206.153/bbs/redirect.php?tid=4952&goto=cbdoilamericano.com  http://bobantia.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://placespatialad.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://margaritamergentime.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://racingworld.no-ip.org/redirect.php?fid=287&tid=107548&goto=cbdoilamericano.com   http://www.kfia.org/LinkClick.aspx?link=https://cbdoilamericano.com  http://www.onlinemoviespro.tk/moviestime/go.php?title=Running+on+the+Sun+The+Badwater+135&url=cbdoilamericano.com  http://allisonmang.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://yvonnebartlett.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.goote.co.il/refurl.php?url=https://cbdoilamericano.com  http://asiainspection.name/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://simplehappyeasy.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.ivslbd.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://hbieureka.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.test99.com/url.asp?url=https://cbdoilamericano.com  https://41032774.r.bat.bing.com/?ld=d3g67Lon_IkLWaLEN-9e0NezVUCUxpq7cWOAbbdeYGU_8FNeYm48rlTuqZNdN_QdLbR_iqrh2CTR8rUvAOgjsKE0x5-TRj1liHLYzjIWpe5-mhgaQ3YRbYe2eRBtr0YkPkEjbPZJQS5pPUHlgrIpYw0KOKSp4&u=https://cbdoilamericano.com  http://gonetouring.com.au/LinkClick.aspx?link=https://cbdoilamericano.com   http://pcosmiles.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \n \n \n \n \n \nhttp://dbo-alliance.com/viewtopic.php?f=3&t=3351\nhttp://0.0.0.ehhkzg.mannlist.com/viewtopic.php?f=10&t=45814069\nhttp://forum.plastverkstan.se/viewtopic.php?f=2&t=226785&p=705025#p705025\nhttp://www.deliberarchia.org/forum/index.php?topic=12936.new#new\nhttp://slpsfd.org/forum/index.php?topic=21164.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7807, "cpu_time_ms": 119, "memory_kb": 9440}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s732350472", "group_id": "codeNet:p03941", "input_text": "http://www.ahighlandshouse.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://mosavito.ru/redirect/?go=https://cbdoilamericano.com   http://militarygiftpack.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://kallista.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://zogdesk.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://wshed.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://cottondirect.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://nasdaqpresscentre.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://instituteforgood.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://planetdsp.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://berkshirehathawayofthetriadrealestate.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://luxurylivinginkeller.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thestocktonprocessserver.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.uzmk.su/go.php?url=cbdoilamericano.com   http://lyndasales.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.vividamateurs.maioid.com/te3/out.php?s=0&u=/cbdoilamericano.com  http://honoluluexaminer.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.uunfpasa.gq/link.php?url=https://cbdoilamericano.com \nhttp://www.bostonwineweek.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://goodbyecholesterol.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://edtrustny.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ordertostore.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://3oe.edwattsgolf.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://huddenpath2paradise.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://web.cmta.net/redirect.php?redirect=https://cbdoilamericano.com  http://kingstonquiltshop.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://commtechsystems.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://forums.pnwr.org/cs/utility/Redirect.aspx?U=https://cbdoilamericano.com  http://synergyo2oxigeno.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://intheatrenetwork.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://exit1a.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://reliefsocietycookbook.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aji-network.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://bezugsquellen.mo-oberflaeche.de/mo/mo-bezugsquellen.nsf/(Redirect)?OpenAgent&Typ=URL&Target=https://cbdoilamericano.com  http://b4c.can-am.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://railwaymarket.ru/my/redirect.php?url=https://cbdoilamericano.com \nhttp://tempapp.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://minisicksack.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://omniaindustries.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://hoteltorrenova.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://pillow1kids.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://trustyourfood.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://overwhichpodcast.libsyn.com/?referer=https://cbdoilamericano.com  http://www.missmalaysiauniverse.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://dir.tifaa.com/go.php?url=https://cbdoilamericano.com \nhttp://click-cash.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.2481.com.au/stats_collect.php?goto=https://cbdoilamericano.com   http://www.1max2liens.com/ref.php?url=https://cbdoilamericano.com/   http://limb-lengthening.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://vkrugudruzei.ru/x/outlink?url=https://cbdoilamericano.com/   http://wags.ultrathinclient.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://savepell.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://chessace.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.milltube.com/?go=click&c=285&n=42&e=0&g=3&r=42524788&u=https://cbdoilamericano.com \nhttp://www.thecorrectemplate.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://alanyabjk.equinefoundation.ca/go.php?code=gZUfTij7q0mq&partner=ftt2/o.php?u=/cbdoilamericano.com   http://tony-sjd.com/redirect.php?action=url&goto=cbdoilamericano.com   http://pfgip.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://barflynyc.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://voertuigdelen.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.ldsfamilyhomeevening.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.infowebsolution.http14.com/go.php?link=cbdoilamericano.com   http://www.focalpointbackoffice.com/ClickThru.aspx?MsgID=8047166&goto=https://cbdoilamericano.com \nhttp://sunvalleyskiresort.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://wesa.net/Goto.asp?url=https://cbdoilamericano.com   http://salsavideo.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://fma-advisors.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.coponesapeso.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://artisticlicense.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.klatovy.cz/www/redir.asp?url=cbdoilamericano.com  http://videosvibe.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://newfishhawkhomes.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.lostfingers.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.tallmouse.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://qen.devilsburn.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ticomoney.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://oemchryslerpart.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bbs.52kiki.cc/index.php?c=login&&referer=https://cbdoilamericano.com  http://www.healthcarebuyinggroup.com/membersearch.aspx?returnurl=https://cbdoilamericano.com/  http://news.azzxx.com/wp-content/themes/azzxx/inc/go.php?url=https://cbdoilamericano.com   http://www.embedded-developer.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://savarino.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://jnx.gnyftgft.lnhtr.3.gsr.anonimizing.com/home287/createSession?referer=https://cbdoilamericano.com   http://aedown.cn/wp-content/themes/begin/inc/go.php?url=https://cbdoilamericano.com   http://whycollections.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://burriandcompany.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://minutedeals.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://hienergynow.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://modblue.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://8499.r.msn.com/?ld=d3kvI7J5aQYkb98JJic_i-yjVUCUzz30HXpDSxw-YPYB72n9HOjGLq3twYfPj_A2FXVfnB7_a-YHoYUgKsE3tKnoZZ8Uc2E9ilny-bY2ZObC7ontveq74LR5sey8DcMcNBH7Qi6vnNQtgJzj9rar6jMzIRyug&u=https://cbdoilamericano.com \n \n \n \n \n \nhttps://bazingacoin.com/forum/viewtopic.php?f=5&t=1668108\nhttp://www.ni28320-2.web12.nitrado.hosting/phpBB3/viewtopic.php?f=7&t=832703\nhttp://forum.yerdeniz.biz/viewtopic.php?f=6&t=62952\nhttps://forum.fucklowes.com/index.php/topic,531767.new.html#new\nhttp://shinobinomorto.pl/viewtopic.php?f=35&t=10139\n", "language": "Lisp", "metadata": {"date": 1548262279, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s732350472.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s732350472", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.ahighlandshouse.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  https://mosavito.ru/redirect/?go=https://cbdoilamericano.com   http://militarygiftpack.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://kallista.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://zogdesk.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://wshed.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://cottondirect.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://nasdaqpresscentre.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://instituteforgood.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://planetdsp.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://berkshirehathawayofthetriadrealestate.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://luxurylivinginkeller.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://thestocktonprocessserver.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.uzmk.su/go.php?url=cbdoilamericano.com   http://lyndasales.biz/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.vividamateurs.maioid.com/te3/out.php?s=0&u=/cbdoilamericano.com  http://honoluluexaminer.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.uunfpasa.gq/link.php?url=https://cbdoilamericano.com \nhttp://www.bostonwineweek.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://goodbyecholesterol.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://edtrustny.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ordertostore.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://3oe.edwattsgolf.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://huddenpath2paradise.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://web.cmta.net/redirect.php?redirect=https://cbdoilamericano.com  http://kingstonquiltshop.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://commtechsystems.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://forums.pnwr.org/cs/utility/Redirect.aspx?U=https://cbdoilamericano.com  http://synergyo2oxigeno.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://intheatrenetwork.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://exit1a.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://reliefsocietycookbook.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://aji-network.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://bezugsquellen.mo-oberflaeche.de/mo/mo-bezugsquellen.nsf/(Redirect)?OpenAgent&Typ=URL&Target=https://cbdoilamericano.com  http://b4c.can-am.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://railwaymarket.ru/my/redirect.php?url=https://cbdoilamericano.com \nhttp://tempapp.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://minisicksack.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://omniaindustries.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://hoteltorrenova.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://pillow1kids.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://trustyourfood.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://overwhichpodcast.libsyn.com/?referer=https://cbdoilamericano.com  http://www.missmalaysiauniverse.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://dir.tifaa.com/go.php?url=https://cbdoilamericano.com \nhttp://click-cash.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.2481.com.au/stats_collect.php?goto=https://cbdoilamericano.com   http://www.1max2liens.com/ref.php?url=https://cbdoilamericano.com/   http://limb-lengthening.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://vkrugudruzei.ru/x/outlink?url=https://cbdoilamericano.com/   http://wags.ultrathinclient.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://savepell.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://chessace.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://www.milltube.com/?go=click&c=285&n=42&e=0&g=3&r=42524788&u=https://cbdoilamericano.com \nhttp://www.thecorrectemplate.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://alanyabjk.equinefoundation.ca/go.php?code=gZUfTij7q0mq&partner=ftt2/o.php?u=/cbdoilamericano.com   http://tony-sjd.com/redirect.php?action=url&goto=cbdoilamericano.com   http://pfgip.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://barflynyc.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://voertuigdelen.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.ldsfamilyhomeevening.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.infowebsolution.http14.com/go.php?link=cbdoilamericano.com   http://www.focalpointbackoffice.com/ClickThru.aspx?MsgID=8047166&goto=https://cbdoilamericano.com \nhttp://sunvalleyskiresort.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://wesa.net/Goto.asp?url=https://cbdoilamericano.com   http://salsavideo.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://fma-advisors.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.coponesapeso.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://artisticlicense.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.klatovy.cz/www/redir.asp?url=cbdoilamericano.com  http://videosvibe.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://newfishhawkhomes.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://www.lostfingers.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://www.tallmouse.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://qen.devilsburn.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://ticomoney.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://oemchryslerpart.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://bbs.52kiki.cc/index.php?c=login&&referer=https://cbdoilamericano.com  http://www.healthcarebuyinggroup.com/membersearch.aspx?returnurl=https://cbdoilamericano.com/  http://news.azzxx.com/wp-content/themes/azzxx/inc/go.php?url=https://cbdoilamericano.com   http://www.embedded-developer.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com \nhttp://savarino.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://jnx.gnyftgft.lnhtr.3.gsr.anonimizing.com/home287/createSession?referer=https://cbdoilamericano.com   http://aedown.cn/wp-content/themes/begin/inc/go.php?url=https://cbdoilamericano.com   http://whycollections.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://burriandcompany.org/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://minutedeals.net/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://hienergynow.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com  http://modblue.com/__media__/js/netsoltrademark.php?d=cbdoilamericano.com   http://8499.r.msn.com/?ld=d3kvI7J5aQYkb98JJic_i-yjVUCUzz30HXpDSxw-YPYB72n9HOjGLq3twYfPj_A2FXVfnB7_a-YHoYUgKsE3tKnoZZ8Uc2E9ilny-bY2ZObC7ontveq74LR5sey8DcMcNBH7Qi6vnNQtgJzj9rar6jMzIRyug&u=https://cbdoilamericano.com \n \n \n \n \n \nhttps://bazingacoin.com/forum/viewtopic.php?f=5&t=1668108\nhttp://www.ni28320-2.web12.nitrado.hosting/phpBB3/viewtopic.php?f=7&t=832703\nhttp://forum.yerdeniz.biz/viewtopic.php?f=6&t=62952\nhttps://forum.fucklowes.com/index.php/topic,531767.new.html#new\nhttp://shinobinomorto.pl/viewtopic.php?f=35&t=10139\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7782, "cpu_time_ms": 31, "memory_kb": 4580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s160509988", "group_id": "codeNet:p03941", "input_text": "http://allsportsgamecourts.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://shygirlies.com/out.php?https://moderncbdoil.com   http://vallace.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://entrehouse.awardspace.com/go.php?url=https://moderncbdoil.com  http://bankonfidelity.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://rndschool61.org.ru/bitrix/rk.php?goto=moderncbdoil.com  http://richardcousins.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://bbs.mudbest.com/redirect.php?tid=53&goto=moderncbdoil.com   http://teenslutsplash.com/crtr/cgi/out.cgi?id=243&l=top_top&u=https://moderncbdoil.com \nhttp://retropornmovies.net/cgi-bin/a2/out.cgi?s=65&u=https://moderncbdoil.com  http://worldwidepantsinc.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://kevkutina.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://liuliangtu.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://magicsquat.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   https://www.kadabra.co.za/domain/moderncbdoil.com  http://divaswhosave.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.kafa-info.ru/link.php?link=https://moderncbdoil.com   http://www.ponos.co.jp/sp/taisenbaka/redirect.php?url=https://moderncbdoil.com \nhttp://dsc.cheney.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://sechenov.ru/bitrix/rk.php?id=12&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B12%5D+%5Ben_foot_1%5D+%D0%9C%D0%B0%D1%81%D1%82%D0%B5%D1%80+%D0%BF%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC&goto=https://moderncbdoil.com   http://www.job-ete.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://foxcitiesstorage.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://gwinnettmoms.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://tonyjanssen.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://alwood.be/includes/go.php?url=moderncbdoil.com  http://alfaofarlington.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://flyfishinginbahamas.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://ocbcbibleschool.cceg.ca/www.boinit.nl/go.php?code=gYUwTLk0sv&partner=tt/out.php?u=/moderncbdoil.com  http://biblio.unibg.it/goto/https://moderncbdoil.com   http://bombsbagsanshine.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://yrsgcc.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://torrentway.com/redirect.php?url=https://moderncbdoil.com   http://santabarbarasoundproject.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.emssafetyservices.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.oglesbyco.info/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://marketingatretailcareers.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://lifeisahoot.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://bocaratoninsurance.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://thelykae.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://xlcool.com/bbs/redirect.php?fid=39&tid=2873&goto=moderncbdoil.com  http://isdirekt.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://workinbali.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://proamstock.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://bydba.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://wal-martglasses.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://ruhzvu.com/go/url=https://moderncbdoil.com  http://yachtsofbaja.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://tran-source.us/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://superbiotics.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://commongoals.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://gypsumrecycling.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://fxqq168.com/goto/https://moderncbdoil.com  http://greenhousemetrics.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://invoicechevy.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://ihz.lake-metigoshe.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.lijit.com/informer?uri=https://moderncbdoil.com   http://texasbath.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://foleyvending.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://fisheranalysis.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://bnxie.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://rudn.club/go.php?url=moderncbdoil.com  http://artisanalproducts.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.aomss.org.sg/popup.php?url=https://moderncbdoil.com \nhttp://standupguy.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://drugdd.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://testmastersact.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://shoesoutlet.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://poezdok.net/go/url=https://moderncbdoil.com   http://mitchtollerud.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://monkeydeals.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.ichooseinb.us/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.cj-design.com/demos/cjlinkoutv1/top.php?out=https://moderncbdoil.com/ \nhttp://www.xiaoniuyl.com/go.php?url=https://moderncbdoil.com  http://www.autotrader.com.au/cars-for-sale/2010-HOLDEN-COMMODORE-SV6-VE-II-ATFD3449370?backurl=https://moderncbdoil.com/   http://is74.ru/my/redirect.php?link=https://moderncbdoil.com   http://panda1.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://waltzesinc.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://phisigmapi.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://trucksathand.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://wickedwonderlandfestival.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://igpslogistics.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://prsany.info/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://teresa-earnhardt.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://spoje.net/piwik/index.php?module=API&method=Live.getLastVisitsDetails&id?s=https://moderncbdoil.com   http://smarterexecutive.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://store.bigcedarcreek.com/eb.asp?go=https://moderncbdoil.com   http://xylan.memagazine.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://eastmarkrealestate.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://caummerce.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   https://www.heikejishidai.cn/wp-content/themes/begin/inc/go.php?url=https://moderncbdoil.com \n \n \n \n \n \nhttp://forum.smkn1cikampek.sch.id/index.php?topic=15271.new#new\nhttps://theforum.alanadams.net/viewtopic.php?f=75&t=87&p=76317#p76317\nhttp://xn--iexed-mu5i.mannlist.com/viewtopic.php?f=10&t=45806154\nhttps://www.jiubeiros.com/index.php?topic=37697.new#new\nhttps://forum.asdrlabels.com/index.php?topic=350901.new#new\n", "language": "Lisp", "metadata": {"date": 1548237840, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s160509988.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s160509988", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://allsportsgamecourts.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://shygirlies.com/out.php?https://moderncbdoil.com   http://vallace.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://entrehouse.awardspace.com/go.php?url=https://moderncbdoil.com  http://bankonfidelity.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://rndschool61.org.ru/bitrix/rk.php?goto=moderncbdoil.com  http://richardcousins.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://bbs.mudbest.com/redirect.php?tid=53&goto=moderncbdoil.com   http://teenslutsplash.com/crtr/cgi/out.cgi?id=243&l=top_top&u=https://moderncbdoil.com \nhttp://retropornmovies.net/cgi-bin/a2/out.cgi?s=65&u=https://moderncbdoil.com  http://worldwidepantsinc.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://kevkutina.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://liuliangtu.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://magicsquat.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   https://www.kadabra.co.za/domain/moderncbdoil.com  http://divaswhosave.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.kafa-info.ru/link.php?link=https://moderncbdoil.com   http://www.ponos.co.jp/sp/taisenbaka/redirect.php?url=https://moderncbdoil.com \nhttp://dsc.cheney.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://sechenov.ru/bitrix/rk.php?id=12&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B12%5D+%5Ben_foot_1%5D+%D0%9C%D0%B0%D1%81%D1%82%D0%B5%D1%80+%D0%BF%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC&goto=https://moderncbdoil.com   http://www.job-ete.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://foxcitiesstorage.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://gwinnettmoms.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://tonyjanssen.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://alwood.be/includes/go.php?url=moderncbdoil.com  http://alfaofarlington.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://flyfishinginbahamas.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://ocbcbibleschool.cceg.ca/www.boinit.nl/go.php?code=gYUwTLk0sv&partner=tt/out.php?u=/moderncbdoil.com  http://biblio.unibg.it/goto/https://moderncbdoil.com   http://bombsbagsanshine.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://yrsgcc.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://torrentway.com/redirect.php?url=https://moderncbdoil.com   http://santabarbarasoundproject.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.emssafetyservices.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.oglesbyco.info/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://marketingatretailcareers.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://lifeisahoot.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://bocaratoninsurance.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://thelykae.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://xlcool.com/bbs/redirect.php?fid=39&tid=2873&goto=moderncbdoil.com  http://isdirekt.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://workinbali.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://proamstock.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://bydba.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://wal-martglasses.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://ruhzvu.com/go/url=https://moderncbdoil.com  http://yachtsofbaja.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://tran-source.us/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://superbiotics.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://commongoals.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://gypsumrecycling.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://fxqq168.com/goto/https://moderncbdoil.com  http://greenhousemetrics.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://invoicechevy.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://ihz.lake-metigoshe.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.lijit.com/informer?uri=https://moderncbdoil.com   http://texasbath.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://foleyvending.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://fisheranalysis.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://bnxie.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://rudn.club/go.php?url=moderncbdoil.com  http://artisanalproducts.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.aomss.org.sg/popup.php?url=https://moderncbdoil.com \nhttp://standupguy.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://drugdd.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://testmastersact.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://shoesoutlet.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://poezdok.net/go/url=https://moderncbdoil.com   http://mitchtollerud.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://monkeydeals.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.ichooseinb.us/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.cj-design.com/demos/cjlinkoutv1/top.php?out=https://moderncbdoil.com/ \nhttp://www.xiaoniuyl.com/go.php?url=https://moderncbdoil.com  http://www.autotrader.com.au/cars-for-sale/2010-HOLDEN-COMMODORE-SV6-VE-II-ATFD3449370?backurl=https://moderncbdoil.com/   http://is74.ru/my/redirect.php?link=https://moderncbdoil.com   http://panda1.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://waltzesinc.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://phisigmapi.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://trucksathand.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://wickedwonderlandfestival.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://igpslogistics.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://prsany.info/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://teresa-earnhardt.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://spoje.net/piwik/index.php?module=API&method=Live.getLastVisitsDetails&id?s=https://moderncbdoil.com   http://smarterexecutive.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://store.bigcedarcreek.com/eb.asp?go=https://moderncbdoil.com   http://xylan.memagazine.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://eastmarkrealestate.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://caummerce.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   https://www.heikejishidai.cn/wp-content/themes/begin/inc/go.php?url=https://moderncbdoil.com \n \n \n \n \n \nhttp://forum.smkn1cikampek.sch.id/index.php?topic=15271.new#new\nhttps://theforum.alanadams.net/viewtopic.php?f=75&t=87&p=76317#p76317\nhttp://xn--iexed-mu5i.mannlist.com/viewtopic.php?f=10&t=45806154\nhttps://www.jiubeiros.com/index.php?topic=37697.new#new\nhttps://forum.asdrlabels.com/index.php?topic=350901.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7317, "cpu_time_ms": 31, "memory_kb": 4704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s013538596", "group_id": "codeNet:p03941", "input_text": "http://zyc.kyoto.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://ru.dsplib.org/forum/app.php/url.php?https://moderncbdoil.com   http://gencorpinsurancenetwork.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://jpnavi.com/hen/r/out.cgi?id=gyaa99ee&url=https://moderncbdoil.com  http://apgdrawer.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.jxjjw.net/go.php?url=https://moderncbdoil.com  http://volvodealsdirect.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://arc9journals.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://livelihoodwp.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://gg.jiajiaoba.cn/Go.asp?url=https://moderncbdoil.com  http://wiketext.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://artofcommunity.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://gloveangels.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://bluehorizonfoundation.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://gratis-clasificados.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://blog.foolpin.com/redirect.php?url=https://moderncbdoil.com  http://puc.rugstore.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://nrafreehunter.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://awhllc.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.petitegalaxy.hk-1.com/outlink.php?l=MzF4MjJ4MjYwMg==&url=moderncbdoil.com   http://sfo.smwauto.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://alj.nickeltel.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://kalra.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://xoou.net/redirect.php?fid=10&tid=772361&goto=moderncbdoil.com  http://applianceandtvcenter.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://wwwwyndham.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.cauldwell.net/patrick/blog/ct.ashx?id=097dca6d-ec5a-4fed-a28c-8e581401e5c7&url=https://moderncbdoil.com \nhttp://roseville-kawasaki.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://athleticsauckland.co.nz/LinkClick.aspx?link=https://moderncbdoil.com   http://legacyinstituteforfarmers.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.societas.cl/a/portal/modules/mod_jw_srfr/redir.php?url=https://moderncbdoil.com  http://thefw.com/redirect?url=https://moderncbdoil.com   http://cherrycreekrotary.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://huntingtonscholarship.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://domecapital.info/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.smartmedicalproducts.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://www.lulubirdwell.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://ifrecrealestateschools.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.fumcwausau.org/System/UserProfile.asp?id=34002&func=signup&referer=https://moderncbdoil.com   http://pennstate.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://timetravelersguide.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://u-entertain.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://ns1.vird.ru/go.php?url=https://moderncbdoil.com  https://www.moebeldepot.at/include/pages/redirect/redirect.php/type=link/url=https://moderncbdoil.com   http://kullancsok.parazitak.hu/go?url=https://moderncbdoil.com \nhttp://forum.mybeatbuddy.com/proxy.php?link=moderncbdoil.com  http://hearingprotectionplan.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://rwf.headtable.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://greenarctires.ca/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://smartcompaniesthinkingbigger.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://hzt.fscconsulting.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://penspinning.kz/go?https://moderncbdoil.com  http://remflorida.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://gamercrush.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://mypoledance.ru/links.php?go=https://moderncbdoil.com  http://greecelux.ru/bitrix/redirect.php?event1=1&event2=&event3=&goto=https://moderncbdoil.com   http://nvsds.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://copperalliance.octhen.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://vet-tek.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://mi-comisariato.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://nextrealtydevelopment.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://bukva.ua/en?flash_link=moderncbdoil.com   http://www.atlantaterrierclub.org/LinkClick.aspx?link=https://moderncbdoil.com \nhttp://kelseygere.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://fpalme.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://exactamessenger.com/refer.php?referer=https://moderncbdoil.com   http://2014.–∏—Ç-–æ–±—Ä–∞–∑–æ–≤–∞–Ω–∏–µ.—Ä—Ñ/bitrix/redirect.php?event1=catalog_out&event2=/upload/iblock/f28/f28cd408ffbb0750f037dcc308e0b14a.docx&event3=–∑–∞—è–≤–∫–∞+–Ω–∞+–∫–æ–Ω—Ñ–µ—Ä–µ–Ω—Ü–∏—é+–ö–∞–∑–∞–Ω—å.docx&goto=https://moderncbdoil.com  http://avination.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://zabor.com/r.asp?url=https://moderncbdoil.com/  http://www.inrap.fr/redirect.php?li=287&r=https://moderncbdoil.com  http://thewallstreetgame.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.farnworthcf.org.uk/goto-link.php?link_id=14&url=https://moderncbdoil.com \nhttp://10mz.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://uminewton.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://klb.dsmiv.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.dawnbreaker.com/doephase0/redirect.php?url=https://moderncbdoil.com  http://floristnet.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   https://www.cbmmortgage.com/modules/mod_jw_srfr/redir.php?url=https://moderncbdoil.com  http://franciscanvocations.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://freeasianpornhub.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://lavetaterrace.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://yardhouseonline.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://go.1li.ir/go/?url=https://moderncbdoil.com   http://www.hittaporr.eu/ept/out.php?f=1&pct=50&url=https://moderncbdoil.com/   http://canoecreekranch.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://planetabelarus.by/bitrix/rk.php?id=10&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B10%5D+%5Bfooter%5D+old_photo&goto=moderncbdoil.com   http://pikecorporation.tv/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://bjorkvik.org/index.pl/list_view?id=157&referer=https://moderncbdoil.com  https://forums.opensuse.org/blog.php?b=44&goto=moderncbdoil.com   http://everydayacrossamerica.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \n \n \n \n \n \nhttp://probeersel.com/forum/viewtopic.php?pid=171390#p171390\nhttps://blackdiamond-casino.com/forum/viewtopic.php?pid=320910#p320910\nhttp://nightsense.ml/viewtopic.php?pid=60865#p60865\nhttp://www.cursillouk.org/forum/index.php?topic=212928.new#new\nhttp://ntcinet.com/forum/index.php?topic=19045.new#new\n", "language": "Lisp", "metadata": {"date": 1548224107, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s013538596.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s013538596", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://zyc.kyoto.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://ru.dsplib.org/forum/app.php/url.php?https://moderncbdoil.com   http://gencorpinsurancenetwork.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://jpnavi.com/hen/r/out.cgi?id=gyaa99ee&url=https://moderncbdoil.com  http://apgdrawer.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.jxjjw.net/go.php?url=https://moderncbdoil.com  http://volvodealsdirect.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://arc9journals.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://livelihoodwp.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://gg.jiajiaoba.cn/Go.asp?url=https://moderncbdoil.com  http://wiketext.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://artofcommunity.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://gloveangels.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://bluehorizonfoundation.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://gratis-clasificados.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://blog.foolpin.com/redirect.php?url=https://moderncbdoil.com  http://puc.rugstore.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://nrafreehunter.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://awhllc.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.petitegalaxy.hk-1.com/outlink.php?l=MzF4MjJ4MjYwMg==&url=moderncbdoil.com   http://sfo.smwauto.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://alj.nickeltel.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://kalra.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://xoou.net/redirect.php?fid=10&tid=772361&goto=moderncbdoil.com  http://applianceandtvcenter.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://wwwwyndham.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.cauldwell.net/patrick/blog/ct.ashx?id=097dca6d-ec5a-4fed-a28c-8e581401e5c7&url=https://moderncbdoil.com \nhttp://roseville-kawasaki.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://athleticsauckland.co.nz/LinkClick.aspx?link=https://moderncbdoil.com   http://legacyinstituteforfarmers.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.societas.cl/a/portal/modules/mod_jw_srfr/redir.php?url=https://moderncbdoil.com  http://thefw.com/redirect?url=https://moderncbdoil.com   http://cherrycreekrotary.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://huntingtonscholarship.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://domecapital.info/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.smartmedicalproducts.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://www.lulubirdwell.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://ifrecrealestateschools.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.fumcwausau.org/System/UserProfile.asp?id=34002&func=signup&referer=https://moderncbdoil.com   http://pennstate.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://timetravelersguide.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://u-entertain.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://ns1.vird.ru/go.php?url=https://moderncbdoil.com  https://www.moebeldepot.at/include/pages/redirect/redirect.php/type=link/url=https://moderncbdoil.com   http://kullancsok.parazitak.hu/go?url=https://moderncbdoil.com \nhttp://forum.mybeatbuddy.com/proxy.php?link=moderncbdoil.com  http://hearingprotectionplan.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://rwf.headtable.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://greenarctires.ca/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://smartcompaniesthinkingbigger.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://hzt.fscconsulting.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://penspinning.kz/go?https://moderncbdoil.com  http://remflorida.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://gamercrush.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://mypoledance.ru/links.php?go=https://moderncbdoil.com  http://greecelux.ru/bitrix/redirect.php?event1=1&event2=&event3=&goto=https://moderncbdoil.com   http://nvsds.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://copperalliance.octhen.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://vet-tek.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://mi-comisariato.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://nextrealtydevelopment.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://bukva.ua/en?flash_link=moderncbdoil.com   http://www.atlantaterrierclub.org/LinkClick.aspx?link=https://moderncbdoil.com \nhttp://kelseygere.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://fpalme.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://exactamessenger.com/refer.php?referer=https://moderncbdoil.com   http://2014.–∏—Ç-–æ–±—Ä–∞–∑–æ–≤–∞–Ω–∏–µ.—Ä—Ñ/bitrix/redirect.php?event1=catalog_out&event2=/upload/iblock/f28/f28cd408ffbb0750f037dcc308e0b14a.docx&event3=–∑–∞—è–≤–∫–∞+–Ω–∞+–∫–æ–Ω—Ñ–µ—Ä–µ–Ω—Ü–∏—é+–ö–∞–∑–∞–Ω—å.docx&goto=https://moderncbdoil.com  http://avination.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://zabor.com/r.asp?url=https://moderncbdoil.com/  http://www.inrap.fr/redirect.php?li=287&r=https://moderncbdoil.com  http://thewallstreetgame.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.farnworthcf.org.uk/goto-link.php?link_id=14&url=https://moderncbdoil.com \nhttp://10mz.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://uminewton.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://klb.dsmiv.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.dawnbreaker.com/doephase0/redirect.php?url=https://moderncbdoil.com  http://floristnet.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   https://www.cbmmortgage.com/modules/mod_jw_srfr/redir.php?url=https://moderncbdoil.com  http://franciscanvocations.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://freeasianpornhub.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://lavetaterrace.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://yardhouseonline.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://go.1li.ir/go/?url=https://moderncbdoil.com   http://www.hittaporr.eu/ept/out.php?f=1&pct=50&url=https://moderncbdoil.com/   http://canoecreekranch.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://planetabelarus.by/bitrix/rk.php?id=10&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B10%5D+%5Bfooter%5D+old_photo&goto=moderncbdoil.com   http://pikecorporation.tv/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://bjorkvik.org/index.pl/list_view?id=157&referer=https://moderncbdoil.com  https://forums.opensuse.org/blog.php?b=44&goto=moderncbdoil.com   http://everydayacrossamerica.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \n \n \n \n \n \nhttp://probeersel.com/forum/viewtopic.php?pid=171390#p171390\nhttps://blackdiamond-casino.com/forum/viewtopic.php?pid=320910#p320910\nhttp://nightsense.ml/viewtopic.php?pid=60865#p60865\nhttp://www.cursillouk.org/forum/index.php?topic=212928.new#new\nhttp://ntcinet.com/forum/index.php?topic=19045.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7948, "cpu_time_ms": 114, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s162646368", "group_id": "codeNet:p03941", "input_text": "http://josephineblanc.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://audicincinnati.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://et.ps.im/?url=https://moderncbdoil.com   http://energymfgparts.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.belgro.ru/bitrix/redirect.php?goto=https://moderncbdoil.com   http://sales-finder.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://tastespots.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://qatarlab.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.bqao.com/go/go.php?url=https://moderncbdoil.com \nhttp://www.txfgsales.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://wattshumphrey.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://codebreakers-elite.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://keysextube.net/best_out.php?c=31&n=2&e=0&g=3&r=25407735&u=https://moderncbdoil.com  http://kyzyl-online.ru/go/url=moderncbdoil.com   http://wow.filmzitate.info/index-link.php?link=https://moderncbdoil.com  https://liralandcom.frantov.com.ua/bitrix/redirect.php?event1=catalog_out&event2=http%3A%2F%2Fprogresi.com.ge&event3=PROGRESI&goto=https://moderncbdoil.com  http://connecttocongress.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://leetheatreplaza.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://wcapdd.dina.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://beatles.kiev.ua/go/url=moderncbdoil.com   http://contemporaryhome.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://yashabab.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://www.simost.ru/bitrix/rk.php?id=9&site_id=s1&goto=https://moderncbdoil.com   http://kbchapter11.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.worldtraveltips.net/redirect.cgi?url=https://moderncbdoil.com/  http://peppergays.com/cgi-bin/crtr/out.cgi?id=66&l=top_top&u=https://moderncbdoil.com   http://sphericalharmonicsrecords.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://profoodsafety.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://bretten.schachvereine.de/gbook133e/go.php?url=https://moderncbdoil.com   http://www.choi-pachi.com/redirect.php?url=https://moderncbdoil.com   https://www.acgdmw.cn/wp-content/themes/begin5.2/inc/go.php?url=https://moderncbdoil.com  http://buildinggreenology.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://olympusvaluationgroup.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://www.2007hq.com/forums/showthread.php?goto=moderncbdoil.com  http://jhp.sleepycatguestranch.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://white-society.org/go.php?url=https://moderncbdoil.com \nhttp://hollywoodglobeawards.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://a-okay.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://kjs.newyorkveincenter.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.newmilfsex.com/cgi-bin/at3/out.cgi?id=60&tag=toplist&trade=https://moderncbdoil.com  http://ez-forex.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://psycheandimage.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.fw-su.de/include.php?path=link&contentid=44&link=moderncbdoil.com  http://dotnetwhatnot.pixata.co.uk/ct.ashx?id=87ee17d0-cc75-4439-9b10-c45d6de8172c&url=https://moderncbdoil.com   http://www.parrish-hare.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://imprimante.nonore.com/go.php?url=https://moderncbdoil.com  http://sfpto.org/LinkClick.aspx?link=https://moderncbdoil.com   http://jlbwork.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://cleanshred.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://anmc.co.kr/index.php?url=https://moderncbdoil.com   http://broadbandmetrofones.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://гѓЇгѓјгѓ«гѓ‰е·ҐиЉё.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://blueskytechstudios.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://lagosforexexpo.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://printcalendarsite.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.little-hen.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://let-it-bit.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://m.keibayoso.jp/rank/out.cgi?id=corerank&url=https://moderncbdoil.com  http://clevod.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   https://www.bocawestcc.org/default.aspx?p=TrackHyperlink&url=https://moderncbdoil.com  https://tuul.tv/revive/www/delivery/afr.php?zoneid=2322&referer=https://moderncbdoil.com  http://www.cukjobs.co.uk/redirect.php?source=CSW,V3&target=https://moderncbdoil.com   http://valverepair201.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://aceelectricinc.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://lumberville1740house.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.kokoro-web.com/cgi-bin/yomi-search/rank.cgi?mode=link&id=2879&url=https://moderncbdoil.com   http://adultcontemporaryradio.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://amitdeshmukh.co.in/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://digimonlinkz.sugiru.tv/out.php?id=68447&jump=https://moderncbdoil.com  http://little-jumps.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://divemeetinfo.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://skipragsdale.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://upwarduniversity.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://liveateastmain.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.comelv.com/plus/redirect.php?id=6902342&url=https://moderncbdoil.com   http://estufafria.cm-lisboa.pt/index.php?eID=fontsizer&size=5&redirect=https://moderncbdoil.com  http://designvista.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://uniabroad.ir/go/?url=https://moderncbdoil.com  http://mp4moviez.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://keystonecustomhome.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://pabloagave.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://tokyonodai.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://evertecepstest.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://selltextiles.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://giftbasketpos.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://gross.thesources.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://wnh.andrewskurth.co.uk/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.commutity.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://scuntime.gq/latest-updates/163/?c=3&e=0&g=3&go=click&r=206130&u=https://moderncbdoil.com   http://save4yourfuture.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \n \n \n \n \n \nhttp://tigershop.se/forum/showthread.php?tid=110433\nhttp://conceptsnclarity.com/forum/index.php?topic=143543.new#new\nhttp://www.laboutiquedelautomovil.com/forum.laboutiquedelautomovil.com/showthread.php?tid=10729\nhttp://kalapati.atasteofasia.com.au/index.php?topic=239660.new#new\nhttp://www.cursillouk.org/forum/index.php?topic=211829.new#new\n", "language": "Lisp", "metadata": {"date": 1548217227, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s162646368.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s162646368", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://josephineblanc.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://audicincinnati.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://et.ps.im/?url=https://moderncbdoil.com   http://energymfgparts.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.belgro.ru/bitrix/redirect.php?goto=https://moderncbdoil.com   http://sales-finder.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://tastespots.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://qatarlab.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.bqao.com/go/go.php?url=https://moderncbdoil.com \nhttp://www.txfgsales.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://wattshumphrey.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://codebreakers-elite.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://keysextube.net/best_out.php?c=31&n=2&e=0&g=3&r=25407735&u=https://moderncbdoil.com  http://kyzyl-online.ru/go/url=moderncbdoil.com   http://wow.filmzitate.info/index-link.php?link=https://moderncbdoil.com  https://liralandcom.frantov.com.ua/bitrix/redirect.php?event1=catalog_out&event2=http%3A%2F%2Fprogresi.com.ge&event3=PROGRESI&goto=https://moderncbdoil.com  http://connecttocongress.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://leetheatreplaza.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://wcapdd.dina.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://beatles.kiev.ua/go/url=moderncbdoil.com   http://contemporaryhome.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://yashabab.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://www.simost.ru/bitrix/rk.php?id=9&site_id=s1&goto=https://moderncbdoil.com   http://kbchapter11.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.worldtraveltips.net/redirect.cgi?url=https://moderncbdoil.com/  http://peppergays.com/cgi-bin/crtr/out.cgi?id=66&l=top_top&u=https://moderncbdoil.com   http://sphericalharmonicsrecords.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://profoodsafety.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://bretten.schachvereine.de/gbook133e/go.php?url=https://moderncbdoil.com   http://www.choi-pachi.com/redirect.php?url=https://moderncbdoil.com   https://www.acgdmw.cn/wp-content/themes/begin5.2/inc/go.php?url=https://moderncbdoil.com  http://buildinggreenology.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://olympusvaluationgroup.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://www.2007hq.com/forums/showthread.php?goto=moderncbdoil.com  http://jhp.sleepycatguestranch.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://white-society.org/go.php?url=https://moderncbdoil.com \nhttp://hollywoodglobeawards.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://a-okay.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://kjs.newyorkveincenter.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.newmilfsex.com/cgi-bin/at3/out.cgi?id=60&tag=toplist&trade=https://moderncbdoil.com  http://ez-forex.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://psycheandimage.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.fw-su.de/include.php?path=link&contentid=44&link=moderncbdoil.com  http://dotnetwhatnot.pixata.co.uk/ct.ashx?id=87ee17d0-cc75-4439-9b10-c45d6de8172c&url=https://moderncbdoil.com   http://www.parrish-hare.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://imprimante.nonore.com/go.php?url=https://moderncbdoil.com  http://sfpto.org/LinkClick.aspx?link=https://moderncbdoil.com   http://jlbwork.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://cleanshred.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://anmc.co.kr/index.php?url=https://moderncbdoil.com   http://broadbandmetrofones.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://гѓЇгѓјгѓ«гѓ‰е·ҐиЉё.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://blueskytechstudios.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://lagosforexexpo.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://printcalendarsite.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.little-hen.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://let-it-bit.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://m.keibayoso.jp/rank/out.cgi?id=corerank&url=https://moderncbdoil.com  http://clevod.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   https://www.bocawestcc.org/default.aspx?p=TrackHyperlink&url=https://moderncbdoil.com  https://tuul.tv/revive/www/delivery/afr.php?zoneid=2322&referer=https://moderncbdoil.com  http://www.cukjobs.co.uk/redirect.php?source=CSW,V3&target=https://moderncbdoil.com   http://valverepair201.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://aceelectricinc.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://lumberville1740house.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.kokoro-web.com/cgi-bin/yomi-search/rank.cgi?mode=link&id=2879&url=https://moderncbdoil.com   http://adultcontemporaryradio.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://amitdeshmukh.co.in/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://digimonlinkz.sugiru.tv/out.php?id=68447&jump=https://moderncbdoil.com  http://little-jumps.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://divemeetinfo.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://skipragsdale.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://upwarduniversity.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://liveateastmain.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.comelv.com/plus/redirect.php?id=6902342&url=https://moderncbdoil.com   http://estufafria.cm-lisboa.pt/index.php?eID=fontsizer&size=5&redirect=https://moderncbdoil.com  http://designvista.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://uniabroad.ir/go/?url=https://moderncbdoil.com  http://mp4moviez.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://keystonecustomhome.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://pabloagave.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://tokyonodai.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://evertecepstest.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://selltextiles.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://giftbasketpos.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://gross.thesources.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://wnh.andrewskurth.co.uk/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.commutity.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://scuntime.gq/latest-updates/163/?c=3&e=0&g=3&go=click&r=206130&u=https://moderncbdoil.com   http://save4yourfuture.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \n \n \n \n \n \nhttp://tigershop.se/forum/showthread.php?tid=110433\nhttp://conceptsnclarity.com/forum/index.php?topic=143543.new#new\nhttp://www.laboutiquedelautomovil.com/forum.laboutiquedelautomovil.com/showthread.php?tid=10729\nhttp://kalapati.atasteofasia.com.au/index.php?topic=239660.new#new\nhttp://www.cursillouk.org/forum/index.php?topic=211829.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7534, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s709422912", "group_id": "codeNet:p03941", "input_text": "http://fkc.onlynewsgroups.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.tessemaker.nl/catalog/redirect.php?action=url&goto=moderncbdoil.com   http://koshkaikot.ru/redirect?url=https://moderncbdoil.com   http://connectigator.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://ms.eduabroad.ru/click.php?url=https://moderncbdoil.com   http://cyberteenporn.com/cgi-bin/out.cgi?id=269&l=top01&u=https://moderncbdoil.com  http://www.wpsdtv.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://www.usiouxfalls.edu/??s=https://moderncbdoil.com   http://openingnightvc.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://km-school.ru/katalog/redir.asp?url=moderncbdoil.com  http://theflavorsoffrance.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.mdprogramming.com/LinkClick.aspx?link=https://moderncbdoil.com   http://6nergygroup.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://site-analiz.postareklami.com/redirect.php?url=https://moderncbdoil.com   http://koreyoakley.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://berkshirefirst.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://mobilemortgage.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://mytmx.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://e-skydoc.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://drdosha.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.futurefocusfinancial.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.k4gorod.ru/bitrix/rk.php?id=32&event1=banner&event2=click&event3=1+%2F+%5B32%5D+%5BINI%5D+%D0%9C%D0%B5%D1%81%D1%82%D0%BD%D1%8B%D0%B5+%D0%B8%D0%BD%D0%B8%D1%86%D0%B8%D0%B0%D1%82%D0%B8%D0%B2%D1%8B&goto=moderncbdoil.com  http://douglas-quint.xoxohth.com/go.php?url=https://moderncbdoil.com   http://shelterfinbank.info/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://ejipunjmgdmjqt.ljdpn.2.gsr.anonimizing.com/home287/createSession?referer=http://ejipunjmgdmjqt.ljdpn.2.gsr.anonimizing.com/cgi-bin/a2/out.cgi?id=195&u=https://moderncbdoil.com  http://thepleasurekit.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://vantageone.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://classuniverse.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://hydeparkmanor.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://garciacarsandcredit.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.digitaldallas.org/r?u=https://moderncbdoil.com  http://banners-my.jobstreet.com/banner/redirect.asp?bid=6925&url=https://moderncbdoil.com   http://lacartonnerie.tribu-covoiturage.com/partenaires/feed2js.php?src=https://moderncbdoil.com  http://www.saintlawrence.org.uk/goto-link.php?link_id=15&url=https://moderncbdoil.com  http://xto.aaa-autoinsurance.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.gadgetzone.de/goto/https://moderncbdoil.com \nhttp://reputationcom-corruption.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.excitingtube.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://steelfusion.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://zonadeeventos.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://tecnoglass.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.eothunder.org/Goto.asp?url=https://moderncbdoil.com  http://wealthtechniques.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://tztape.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://ideasfromthelord.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://artfromisrael.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://continuumpodcast.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://mindfulorganizing.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://avapalermo.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://tapchidanba.com/goto?https://moderncbdoil.com   http://simon.tc/__media__/js/trademark.php?d=moderncbdoil.com  http://flexmaginfo.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://allhyips.co/goto.php?url=https://moderncbdoil.com   http://www.bestpubs.co.uk/cgi-bin/adschedule.asp?url=https://moderncbdoil.com \nhttp://wealthlinx.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.akcent-pro.com/bitrix/rk.php?id=22&event1=banner&event2=click&event3=1+%2F+%5B22%5D+%5BLEFT_BANNER2%5D+ITILv3-fun.+%D0%9E%D1%81%D0%BD%D0%BE%D0%B2%D1%8B+ITIL+v3.%D0%9E%D1%80%D0%B3%D0%B0%D0%BD%D0%B8%D0%B7%D0%B0%D1%86%D0%B8%D1%8F+%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D1%8B+%D0%98%D0%A2-%D0%B4%D0%B5%D0%BF%D0%B0%D1%80%D1%82%D0%B0%D0%BC%D0%B5%D0%BD%D1%82%D0%B0+%D0%BA%D0%BE%D0%BC%D0%BF%D0%B0%D0%BD%D0%B8%D0%B8&goto=https://moderncbdoil.com   http://www.rabbit-cages.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.medwatch.jp/?attachment_id=11171&goto=moderncbdoil.com  http://vistinsurance.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://997.sun-timesgroup.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://printforbusiness.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.wetdreambabes.com/cgi-bin/at/out.cgi?id=546&trade=https://moderncbdoil.com   http://www.laadeedaa.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://architecturalconcretehelp.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://theroningallery.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://swisstld.ch/tldreview/redirect.php?url=https://moderncbdoil.com   http://accessdubuquerealestate.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://caboeventplanners.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   https://ssmhealth.thehcn.net/redir.php?url=https://moderncbdoil.com  http://durhamsucks.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://seanduffyministries.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://luckychamp.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://www.formeze.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://coredaptix.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://sport.sumy.ua/go.php?url=https://moderncbdoil.com   http://karenasch.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.niubiseo.com.cn/wp-content/themes/begin/inc/go.php?url=https://moderncbdoil.com   http://www.moorfields.ae/en/Media/Release/10-12-27/Moorfields_presents_trophies_to_the_newly_crowned_champions_of_the_Moorfields_Under_12_Youth_Football_League_Emirates_Isles_FC_and_FC_Barcelona.aspx?Returnurl=https://moderncbdoil.com/  http://prosalescareer.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://uprt.volgograd.ru/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fwww.bitrixsoft.com%2Fabout%2Finfo%2Fnews%2F2125%2F&event3=%D0%92+%D1%80%D0%B5%D0%B6%D0%B8%D0%BC%D0%B5+%D0%BF%D1%80%D1%8F%D0%BC%D0%BE%D0%B3%D0%BE+%D0%B4%D0%B8%D0%B0%D0%BB%D0%BE%D0%B3%D0%B0&goto=https://moderncbdoil.com   http://svenskfotboll.se/redirect.ashx?goto=https://moderncbdoil.com \nhttp://katzenzubehoer.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://auctionspage.awardspace.com/go.php?url=https://moderncbdoil.com   http://innovatalent.es/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://1000authors.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://job-applications-online.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://integraclub.ru/go?https://moderncbdoil.com  http://razdelautoraznoe.biz-market.ru/jump.php?url=https://moderncbdoil.com  http://www.elpuertodesantamaria.es/redir.php?url=moderncbdoil.com   http://macedonia.eu.org/dir/link.aspx?url=https://moderncbdoil.com \n \n \n \n \n \nhttps://lindaghill.com/2018/08/15/one-liner-wednesday-snail-mail/\nhttps://forums.workingholidayspain.es/viewtopic.php?f=7&t=1069\nhttps://theforum.alanadams.net/viewtopic.php?f=32&t=494&p=75020#p75020\nhttp://m3.site.nfoservers.com/forums/viewtopic.php?f=13&t=68976\nhttps://vegetation-daheim.info/2012/11/26/vegetative-vermehrung-der-blauen-passionsblume-passiflora-caerulea/\n", "language": "Lisp", "metadata": {"date": 1548210681, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s709422912.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s709422912", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://fkc.onlynewsgroups.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.tessemaker.nl/catalog/redirect.php?action=url&goto=moderncbdoil.com   http://koshkaikot.ru/redirect?url=https://moderncbdoil.com   http://connectigator.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://ms.eduabroad.ru/click.php?url=https://moderncbdoil.com   http://cyberteenporn.com/cgi-bin/out.cgi?id=269&l=top01&u=https://moderncbdoil.com  http://www.wpsdtv.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://www.usiouxfalls.edu/??s=https://moderncbdoil.com   http://openingnightvc.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://km-school.ru/katalog/redir.asp?url=moderncbdoil.com  http://theflavorsoffrance.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.mdprogramming.com/LinkClick.aspx?link=https://moderncbdoil.com   http://6nergygroup.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://site-analiz.postareklami.com/redirect.php?url=https://moderncbdoil.com   http://koreyoakley.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://berkshirefirst.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://mobilemortgage.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://mytmx.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://e-skydoc.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://drdosha.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.futurefocusfinancial.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.k4gorod.ru/bitrix/rk.php?id=32&event1=banner&event2=click&event3=1+%2F+%5B32%5D+%5BINI%5D+%D0%9C%D0%B5%D1%81%D1%82%D0%BD%D1%8B%D0%B5+%D0%B8%D0%BD%D0%B8%D1%86%D0%B8%D0%B0%D1%82%D0%B8%D0%B2%D1%8B&goto=moderncbdoil.com  http://douglas-quint.xoxohth.com/go.php?url=https://moderncbdoil.com   http://shelterfinbank.info/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://ejipunjmgdmjqt.ljdpn.2.gsr.anonimizing.com/home287/createSession?referer=http://ejipunjmgdmjqt.ljdpn.2.gsr.anonimizing.com/cgi-bin/a2/out.cgi?id=195&u=https://moderncbdoil.com  http://thepleasurekit.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://vantageone.biz/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://classuniverse.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://hydeparkmanor.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://garciacarsandcredit.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.digitaldallas.org/r?u=https://moderncbdoil.com  http://banners-my.jobstreet.com/banner/redirect.asp?bid=6925&url=https://moderncbdoil.com   http://lacartonnerie.tribu-covoiturage.com/partenaires/feed2js.php?src=https://moderncbdoil.com  http://www.saintlawrence.org.uk/goto-link.php?link_id=15&url=https://moderncbdoil.com  http://xto.aaa-autoinsurance.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.gadgetzone.de/goto/https://moderncbdoil.com \nhttp://reputationcom-corruption.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.excitingtube.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://steelfusion.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://zonadeeventos.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://tecnoglass.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.eothunder.org/Goto.asp?url=https://moderncbdoil.com  http://wealthtechniques.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://tztape.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://ideasfromthelord.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://artfromisrael.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://continuumpodcast.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://mindfulorganizing.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://avapalermo.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  https://tapchidanba.com/goto?https://moderncbdoil.com   http://simon.tc/__media__/js/trademark.php?d=moderncbdoil.com  http://flexmaginfo.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://allhyips.co/goto.php?url=https://moderncbdoil.com   http://www.bestpubs.co.uk/cgi-bin/adschedule.asp?url=https://moderncbdoil.com \nhttp://wealthlinx.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.akcent-pro.com/bitrix/rk.php?id=22&event1=banner&event2=click&event3=1+%2F+%5B22%5D+%5BLEFT_BANNER2%5D+ITILv3-fun.+%D0%9E%D1%81%D0%BD%D0%BE%D0%B2%D1%8B+ITIL+v3.%D0%9E%D1%80%D0%B3%D0%B0%D0%BD%D0%B8%D0%B7%D0%B0%D1%86%D0%B8%D1%8F+%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D1%8B+%D0%98%D0%A2-%D0%B4%D0%B5%D0%BF%D0%B0%D1%80%D1%82%D0%B0%D0%BC%D0%B5%D0%BD%D1%82%D0%B0+%D0%BA%D0%BE%D0%BC%D0%BF%D0%B0%D0%BD%D0%B8%D0%B8&goto=https://moderncbdoil.com   http://www.rabbit-cages.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://www.medwatch.jp/?attachment_id=11171&goto=moderncbdoil.com  http://vistinsurance.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://997.sun-timesgroup.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://printforbusiness.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.wetdreambabes.com/cgi-bin/at/out.cgi?id=546&trade=https://moderncbdoil.com   http://www.laadeedaa.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://architecturalconcretehelp.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://theroningallery.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://swisstld.ch/tldreview/redirect.php?url=https://moderncbdoil.com   http://accessdubuquerealestate.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://caboeventplanners.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com   https://ssmhealth.thehcn.net/redir.php?url=https://moderncbdoil.com  http://durhamsucks.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://seanduffyministries.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://luckychamp.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com \nhttp://www.formeze.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://coredaptix.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://sport.sumy.ua/go.php?url=https://moderncbdoil.com   http://karenasch.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://www.niubiseo.com.cn/wp-content/themes/begin/inc/go.php?url=https://moderncbdoil.com   http://www.moorfields.ae/en/Media/Release/10-12-27/Moorfields_presents_trophies_to_the_newly_crowned_champions_of_the_Moorfields_Under_12_Youth_Football_League_Emirates_Isles_FC_and_FC_Barcelona.aspx?Returnurl=https://moderncbdoil.com/  http://prosalescareer.com/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://uprt.volgograd.ru/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fwww.bitrixsoft.com%2Fabout%2Finfo%2Fnews%2F2125%2F&event3=%D0%92+%D1%80%D0%B5%D0%B6%D0%B8%D0%BC%D0%B5+%D0%BF%D1%80%D1%8F%D0%BC%D0%BE%D0%B3%D0%BE+%D0%B4%D0%B8%D0%B0%D0%BB%D0%BE%D0%B3%D0%B0&goto=https://moderncbdoil.com   http://svenskfotboll.se/redirect.ashx?goto=https://moderncbdoil.com \nhttp://katzenzubehoer.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://auctionspage.awardspace.com/go.php?url=https://moderncbdoil.com   http://innovatalent.es/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://1000authors.net/__media__/js/netsoltrademark.php?d=moderncbdoil.com  http://job-applications-online.org/__media__/js/netsoltrademark.php?d=moderncbdoil.com   http://integraclub.ru/go?https://moderncbdoil.com  http://razdelautoraznoe.biz-market.ru/jump.php?url=https://moderncbdoil.com  http://www.elpuertodesantamaria.es/redir.php?url=moderncbdoil.com   http://macedonia.eu.org/dir/link.aspx?url=https://moderncbdoil.com \n \n \n \n \n \nhttps://lindaghill.com/2018/08/15/one-liner-wednesday-snail-mail/\nhttps://forums.workingholidayspain.es/viewtopic.php?f=7&t=1069\nhttps://theforum.alanadams.net/viewtopic.php?f=32&t=494&p=75020#p75020\nhttp://m3.site.nfoservers.com/forums/viewtopic.php?f=13&t=68976\nhttps://vegetation-daheim.info/2012/11/26/vegetative-vermehrung-der-blauen-passionsblume-passiflora-caerulea/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8271, "cpu_time_ms": 100, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s542188334", "group_id": "codeNet:p03941", "input_text": "http://rsrma.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.amyspics.com/cgi-bin/autorank/out.cgi?id=kyswing&url=https://highcbdoildrops.com   http://al1terpatientregistry.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://zausnerfoodscorp.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.erafbo.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://taladhome.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.medlive.cn/redirect.php?resource=guide_keyword_search&index=0&url=https://highcbdoildrops.com  http://www.dufferincues.com/index.php?m=comment&c=index&a=init&commentid=content_44-36-2&title=520&url=https://highcbdoildrops.com   http://www.fiolent.ru/go.php?url=https://highcbdoildrops.com \nhttp://newvictorytheater.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://demo.worldmodern.com/sessions/new?goto=https://highcbdoildrops.com   http://kochi-omotenashi.net/m/redirect.php?url=https://highcbdoildrops.com   http://luxurysegment.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://benefitmanageroftheyear.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://spatialsteam.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.tvdo.net/system/mrcamlink/index.cgi?action=jump&url=https://highcbdoildrops.com  http://absolutereturncapitalfund.tc/__media__/js/trademark.php?d=highcbdoildrops.com   http://www.aka99.com/redirect.php?tid=138013&goto=highcbdoildrops.com \nhttp://wbh.semirara.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://lukejdavies.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://hao.psefan.com/goto?https://highcbdoildrops.com   http://studentcardcomparison.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://yardhouseonline.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://flnews.ru/go.php?url=https://highcbdoildrops.com  http://thelesbianorgy.com/cgi-bin/at3/out.cgi?id=127&tag=toplist&trade=https://highcbdoildrops.com  http://www.lions-fdi.org/in/front/bin/adsclick.phtml?Nbr=link_02&url=https://highcbdoildrops.com   http://www.northwestcraneservice.com/LinkClick.aspx?link=https://highcbdoildrops.com \nhttp://vishime.labit72.portfelis.com/bitrix/rk.php?id=186&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B186%5D+%5Bmain_ad2%5D+%D1%8D%D1%82%D0%B0%D0%B6%D0%B8-%D0%BE%D0%B4%D0%BD%D1%83%D1%88%D0%BA%D0%B8&goto=https://highcbdoildrops.com  http://4jobapplications.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://suffernofools.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://cometodeadwood.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://taskidooo.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://irecyclesystem.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://b.89089.site/url?q=https://highcbdoildrops.com  http://kaduri.net/redir.asp?url=https://highcbdoildrops.com   http://www.earncashmoney.com/goto/https://highcbdoildrops.com \nhttp://alamr.cn/url?q=https://highcbdoildrops.com  http://www.hugeassanal.com/cgi-bin/atx/out.cgi?s=65&u=https://highcbdoildrops.com   http://factsabouttuition.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://cyberknifeturkey.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://halftimefrozenpizza.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://oasislocal.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://fr.videodw.com/url?q=https://highcbdoildrops.com  http://knightowlexperience.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.nancylam.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://healthylifestylereward.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://homes07090.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://waxholmskommun.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://charlottesvillevalawyers.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://drexelmed.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://gracestpetersburg.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://bon-aero.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://crispula.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.lada-largus.com/go/url=https://highcbdoildrops.com \nhttp://promotingfaith.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.embroidme.co.nz/ra.asp?url=https://highcbdoildrops.com   http://nassaucountyhockey.net/Goto.asp?url=https://highcbdoildrops.com   http://nfv.monstertrout.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://iea-adeline.de/cgi-bin/redirba.pl?url=https://highcbdoildrops.com   http://escandaloso.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://w.decarokaplen.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://theessentialchurch.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://archfaultlabeling.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://thesofarsogoods.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://sh-sigmakoki.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://suddenimpactnyc.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.visposi.it/redirect.jsp?f=Dettaglio+Albergo+www.hoteltretorri.it&url=highcbdoildrops.com  http://maryannethomas.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://???????????.com/re?url=https://highcbdoildrops.com  http://www.myhomegymequipment.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://unitiodiscoveryportal.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.amselhof.eu/gbook/go.php?url=https://highcbdoildrops.com \nhttp://230bay.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://yourmotherinc.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.vartoon.blogsky.com/dailylink/?go=https://highcbdoildrops.com   http://wentworthpartners.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://montaukmodern.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://ppad.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://hez.planoheart.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://koko-bags.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://1hotelnyc.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://lundsfordhandbooks.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://garage-alize.ch/index.php/component/k2/item/63-abarth?fromurl=highcbdoildrops.com   http://ivacationexchange.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://academyart.tc/__media__/js/trademark.php?d=highcbdoildrops.com  http://www.kiwiopinions.co.nz/promo/?url=https://highcbdoildrops.com   http://shahaniconsulting.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://kp99.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://twoyeartestdrive.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://mynraaccounts.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \n \n \n \n \n \nhttp://anasozu.com/gagauzlarin-hem-gagauzluun-gozellii-cadirin-kis-gergefi/#comment-2212\nhttps://tretho.info/threads/2792589-bored-to-death-dvd-release-date.html?p=36865494#post36865494\nhttps://xossipp.com/showthread.php?tid=347\nhttps://lnw.bet/webboard/index.php/topic,397866.new.html#new\nhttps://presofts.com/vals/showthread.php?3202-Generique-Eulexine-En-Ligne&p=26467#post26467\n", "language": "Lisp", "metadata": {"date": 1548180695, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s542188334.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s542188334", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://rsrma.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.amyspics.com/cgi-bin/autorank/out.cgi?id=kyswing&url=https://highcbdoildrops.com   http://al1terpatientregistry.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://zausnerfoodscorp.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.erafbo.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://taladhome.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.medlive.cn/redirect.php?resource=guide_keyword_search&index=0&url=https://highcbdoildrops.com  http://www.dufferincues.com/index.php?m=comment&c=index&a=init&commentid=content_44-36-2&title=520&url=https://highcbdoildrops.com   http://www.fiolent.ru/go.php?url=https://highcbdoildrops.com \nhttp://newvictorytheater.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://demo.worldmodern.com/sessions/new?goto=https://highcbdoildrops.com   http://kochi-omotenashi.net/m/redirect.php?url=https://highcbdoildrops.com   http://luxurysegment.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://benefitmanageroftheyear.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://spatialsteam.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.tvdo.net/system/mrcamlink/index.cgi?action=jump&url=https://highcbdoildrops.com  http://absolutereturncapitalfund.tc/__media__/js/trademark.php?d=highcbdoildrops.com   http://www.aka99.com/redirect.php?tid=138013&goto=highcbdoildrops.com \nhttp://wbh.semirara.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://lukejdavies.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://hao.psefan.com/goto?https://highcbdoildrops.com   http://studentcardcomparison.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://yardhouseonline.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://flnews.ru/go.php?url=https://highcbdoildrops.com  http://thelesbianorgy.com/cgi-bin/at3/out.cgi?id=127&tag=toplist&trade=https://highcbdoildrops.com  http://www.lions-fdi.org/in/front/bin/adsclick.phtml?Nbr=link_02&url=https://highcbdoildrops.com   http://www.northwestcraneservice.com/LinkClick.aspx?link=https://highcbdoildrops.com \nhttp://vishime.labit72.portfelis.com/bitrix/rk.php?id=186&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B186%5D+%5Bmain_ad2%5D+%D1%8D%D1%82%D0%B0%D0%B6%D0%B8-%D0%BE%D0%B4%D0%BD%D1%83%D1%88%D0%BA%D0%B8&goto=https://highcbdoildrops.com  http://4jobapplications.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://suffernofools.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://cometodeadwood.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://taskidooo.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://irecyclesystem.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://b.89089.site/url?q=https://highcbdoildrops.com  http://kaduri.net/redir.asp?url=https://highcbdoildrops.com   http://www.earncashmoney.com/goto/https://highcbdoildrops.com \nhttp://alamr.cn/url?q=https://highcbdoildrops.com  http://www.hugeassanal.com/cgi-bin/atx/out.cgi?s=65&u=https://highcbdoildrops.com   http://factsabouttuition.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://cyberknifeturkey.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://halftimefrozenpizza.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://oasislocal.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://fr.videodw.com/url?q=https://highcbdoildrops.com  http://knightowlexperience.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.nancylam.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://healthylifestylereward.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://homes07090.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://waxholmskommun.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://charlottesvillevalawyers.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://drexelmed.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://gracestpetersburg.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://bon-aero.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://crispula.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.lada-largus.com/go/url=https://highcbdoildrops.com \nhttp://promotingfaith.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.embroidme.co.nz/ra.asp?url=https://highcbdoildrops.com   http://nassaucountyhockey.net/Goto.asp?url=https://highcbdoildrops.com   http://nfv.monstertrout.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://iea-adeline.de/cgi-bin/redirba.pl?url=https://highcbdoildrops.com   http://escandaloso.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://w.decarokaplen.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://theessentialchurch.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://archfaultlabeling.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://thesofarsogoods.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://sh-sigmakoki.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://suddenimpactnyc.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.visposi.it/redirect.jsp?f=Dettaglio+Albergo+www.hoteltretorri.it&url=highcbdoildrops.com  http://maryannethomas.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://???????????.com/re?url=https://highcbdoildrops.com  http://www.myhomegymequipment.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://unitiodiscoveryportal.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.amselhof.eu/gbook/go.php?url=https://highcbdoildrops.com \nhttp://230bay.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://yourmotherinc.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.vartoon.blogsky.com/dailylink/?go=https://highcbdoildrops.com   http://wentworthpartners.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://montaukmodern.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://ppad.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://hez.planoheart.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://koko-bags.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://1hotelnyc.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://lundsfordhandbooks.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://garage-alize.ch/index.php/component/k2/item/63-abarth?fromurl=highcbdoildrops.com   http://ivacationexchange.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://academyart.tc/__media__/js/trademark.php?d=highcbdoildrops.com  http://www.kiwiopinions.co.nz/promo/?url=https://highcbdoildrops.com   http://shahaniconsulting.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://kp99.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://twoyeartestdrive.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://mynraaccounts.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \n \n \n \n \n \nhttp://anasozu.com/gagauzlarin-hem-gagauzluun-gozellii-cadirin-kis-gergefi/#comment-2212\nhttps://tretho.info/threads/2792589-bored-to-death-dvd-release-date.html?p=36865494#post36865494\nhttps://xossipp.com/showthread.php?tid=347\nhttps://lnw.bet/webboard/index.php/topic,397866.new.html#new\nhttps://presofts.com/vals/showthread.php?3202-Generique-Eulexine-En-Ligne&p=26467#post26467\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7807, "cpu_time_ms": 97, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s575481480", "group_id": "codeNet:p03941", "input_text": "http://wknorth.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://image-right.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://smmgecis.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://mgh.academyofartfacultysucks.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.burnsiplaw.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.santabarbaraclub.org/default.aspx?p=TrackHyperlink&url=https://highcbdoildrops.com  http://www.martin-garcia.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.openbudget.org.ua/redirect?url=https://highcbdoildrops.com   http://boxingthecompass.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://fzu.gnplp.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.bluesshowcase.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://farmacopoeia.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://hypnobabies-usa.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://mystatementonline.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://axaachivementscholarship.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.twhehills.ga/redirect.php?ID=100930&link=https://highcbdoildrops.com  http://zenergia.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.infarms.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://hearthstonehomedesign.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://apexclearingcorporation.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.seiyofukushi.com/topics/?attachment_id=9471&fromurl=highcbdoildrops.com   http://oakparkilhomesforsale.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://komunikuj.zive.sk/user/login?destination=forum/cez-pevnu-linku/www.cedarparktexas.gov/redirect.aspx?sort=asc&order=Posledn%C3%A1+odpove%C4%8F&url=https://highcbdoildrops.com   http://landiturkiye.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.lebguide.com/redir.asp?link=https://highcbdoildrops.com/  http://maternacell.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://monsunocombatchaos.es/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://search-faster.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://boonesburg.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://pokeriniowa.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://deux.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://listhousenow.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.loopinsight.com/redirect?s=/feed/&perm=https://highcbdoildrops.com  http://kduhtv.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://quotehomes.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://ngmanager.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://nicebois.pw/sr/out.php?l=0s.1.41.502.398&u=/highcbdoildrops.com  http://www.bakkal.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://londonjewellerytour.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.schanghai.info/?p=&sl=cn&cjjobid=16354&partner=highcbdoildrops.com  http://testmasterspe.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://buildersloanservices.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.woniuqipai.com/wp-content/themes/azzxx/inc/go.php?url=https://highcbdoildrops.com  http://studenthousingforrent.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.tqts0.cn/redirect.aspx?url=https://highcbdoildrops.com \nhttp://englishxpert.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://ntagil.ru/forum/go.php?https://highcbdoildrops.com/   http://balancedheartcounseling.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://adviceaboutplasticsurgeons.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.southeastlibdems.org.uk/r?u=https://highcbdoildrops.com   http://marihuanabuds.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://ezcashadvances.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://bungenorthamerica.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://temasekholding.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://69heart.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://wrayvw.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://promontoryparkcityrealestate.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.tonundmusik.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://eliteexpertwitness.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://forum.fragoria.ru/blog.php?b=40&goto=highcbdoildrops.com  http://www.bulkcctvstore.com/cart.php?m=checkout&sidebarDetailed=Y&prevCmd=product_detail&go=https://highcbdoildrops.com  http://eznetdisclose.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://chilliad.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://istampsdirect.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://wisepotatochips.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://diakonie-gmbh.de/pages/links/index.php?url=https://highcbdoildrops.com   http://www.ostarrichi.org/external.html?link=https://highcbdoildrops.com/  http://dastanak.com/dailylink/?go=https://highcbdoildrops.com   http://www.yaaaababy.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://armeniangenocidemuseumofamerica.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://kirkhorseinsurance.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.processregister.com/list/redirect.asp?sid=11818&url=https://highcbdoildrops.com \nhttp://gta-esi.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://downtoearthprovidenciacoffee.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://boldlookofkohler.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://deynasebc.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://seedippy.com/SearchPoint/redir.asp?reg_id=pTypes&sname=/searchpoint/search.asp&lid=0&sponsor=LAN&url=highcbdoildrops.com   http://bbwbootytube.com/cgi-bin/bwt.cgi?c=1&s=70&bwt=1&u=https://highcbdoildrops.com  http://www.galileointernational.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://australiasurf.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://kh9.myphilippines.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://npinsure.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://pbea.psealocals.org/LinkClick.aspx?link=https://highcbdoildrops.com   http://elias.ztonline.ch/?a<>=<a+href=https://highcbdoildrops.com   https://www.igainc.com/trackthis.aspx?id=31835&goto=https://highcbdoildrops.com  http://rsplastic.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://bibletreasures.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://asbestoslawline.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://dewittbalsa.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://catrien.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \n \n \n \n \n \nhttps://unfaire.ch/showthread.php?tid=16686&pid=18258#pid18258\nhttps://cpphc.ca/forum/showthread.php?tid=30300\nhttp://forum.tompool.org/viewtopic.php?f=2&t=210951\nhttps://www.thefhguide.com/forums/showthread.php?tid=215954\nhttp://www.institutoleonygama.mx/foro/viewtopic.php?pid=201559#p201559\n", "language": "Lisp", "metadata": {"date": 1548165942, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s575481480.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s575481480", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://wknorth.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://image-right.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://smmgecis.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://mgh.academyofartfacultysucks.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.burnsiplaw.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.santabarbaraclub.org/default.aspx?p=TrackHyperlink&url=https://highcbdoildrops.com  http://www.martin-garcia.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.openbudget.org.ua/redirect?url=https://highcbdoildrops.com   http://boxingthecompass.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://fzu.gnplp.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.bluesshowcase.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://farmacopoeia.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://hypnobabies-usa.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://mystatementonline.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://axaachivementscholarship.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.twhehills.ga/redirect.php?ID=100930&link=https://highcbdoildrops.com  http://zenergia.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.infarms.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://hearthstonehomedesign.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://apexclearingcorporation.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.seiyofukushi.com/topics/?attachment_id=9471&fromurl=highcbdoildrops.com   http://oakparkilhomesforsale.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://komunikuj.zive.sk/user/login?destination=forum/cez-pevnu-linku/www.cedarparktexas.gov/redirect.aspx?sort=asc&order=Posledn%C3%A1+odpove%C4%8F&url=https://highcbdoildrops.com   http://landiturkiye.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.lebguide.com/redir.asp?link=https://highcbdoildrops.com/  http://maternacell.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://monsunocombatchaos.es/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://search-faster.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://boonesburg.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://pokeriniowa.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://deux.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://listhousenow.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.loopinsight.com/redirect?s=/feed/&perm=https://highcbdoildrops.com  http://kduhtv.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://quotehomes.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://ngmanager.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://nicebois.pw/sr/out.php?l=0s.1.41.502.398&u=/highcbdoildrops.com  http://www.bakkal.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://londonjewellerytour.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.schanghai.info/?p=&sl=cn&cjjobid=16354&partner=highcbdoildrops.com  http://testmasterspe.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://buildersloanservices.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.woniuqipai.com/wp-content/themes/azzxx/inc/go.php?url=https://highcbdoildrops.com  http://studenthousingforrent.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.tqts0.cn/redirect.aspx?url=https://highcbdoildrops.com \nhttp://englishxpert.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://ntagil.ru/forum/go.php?https://highcbdoildrops.com/   http://balancedheartcounseling.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://adviceaboutplasticsurgeons.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.southeastlibdems.org.uk/r?u=https://highcbdoildrops.com   http://marihuanabuds.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://ezcashadvances.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://bungenorthamerica.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://temasekholding.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://69heart.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://wrayvw.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://promontoryparkcityrealestate.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.tonundmusik.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://eliteexpertwitness.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://forum.fragoria.ru/blog.php?b=40&goto=highcbdoildrops.com  http://www.bulkcctvstore.com/cart.php?m=checkout&sidebarDetailed=Y&prevCmd=product_detail&go=https://highcbdoildrops.com  http://eznetdisclose.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://chilliad.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://istampsdirect.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://wisepotatochips.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://diakonie-gmbh.de/pages/links/index.php?url=https://highcbdoildrops.com   http://www.ostarrichi.org/external.html?link=https://highcbdoildrops.com/  http://dastanak.com/dailylink/?go=https://highcbdoildrops.com   http://www.yaaaababy.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://armeniangenocidemuseumofamerica.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://kirkhorseinsurance.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.processregister.com/list/redirect.asp?sid=11818&url=https://highcbdoildrops.com \nhttp://gta-esi.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://downtoearthprovidenciacoffee.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://boldlookofkohler.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://deynasebc.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://seedippy.com/SearchPoint/redir.asp?reg_id=pTypes&sname=/searchpoint/search.asp&lid=0&sponsor=LAN&url=highcbdoildrops.com   http://bbwbootytube.com/cgi-bin/bwt.cgi?c=1&s=70&bwt=1&u=https://highcbdoildrops.com  http://www.galileointernational.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://australiasurf.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://kh9.myphilippines.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://npinsure.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://pbea.psealocals.org/LinkClick.aspx?link=https://highcbdoildrops.com   http://elias.ztonline.ch/?a<>=<a+href=https://highcbdoildrops.com   https://www.igainc.com/trackthis.aspx?id=31835&goto=https://highcbdoildrops.com  http://rsplastic.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://bibletreasures.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://asbestoslawline.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://dewittbalsa.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://catrien.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \n \n \n \n \n \nhttps://unfaire.ch/showthread.php?tid=16686&pid=18258#pid18258\nhttps://cpphc.ca/forum/showthread.php?tid=30300\nhttp://forum.tompool.org/viewtopic.php?f=2&t=210951\nhttps://www.thefhguide.com/forums/showthread.php?tid=215954\nhttp://www.institutoleonygama.mx/foro/viewtopic.php?pid=201559#p201559\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7830, "cpu_time_ms": 106, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s690446328", "group_id": "codeNet:p03941", "input_text": "http://kahite.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://cym.capscafe.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://porscheofcoloradosprings.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://qf5.c-jreporters.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://meemic.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://thedigital-lab.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://app1.emailinvest.com/link.php?track=1072_48673_354&url=https://highcbdoildrops.com  http://www.nudegirls-pics.com/cgi-bin/out.cgi?id=26&l=thumbtop&u=https://highcbdoildrops.com   http://d.ml11.flmsa.net/class/link.php?index=ATQ%3D&id=weeysetwtswtpwoseup&url=highcbdoildrops.com \nhttp://arguslabs.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.thebigeyedea.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://winstaff.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://robotics-alliance.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://hollisterholdings.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://commercialserviceguide.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://foalsearch.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://kidpowerdc.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.bookee.com/bk/bookee.redirect?url=https://highcbdoildrops.com \nhttp://jonpritzker.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.advantagemedia.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://fwsec.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://foro.infojardin.com/proxy.php?link=https://highcbdoildrops.com  http://lzfz.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.mulberryfarms.com/cart.php?m=checkout&sidebarDetailed=Y&prevCmd=cart_home&go=https://highcbdoildrops.com  http://monenergex.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://undernylon.com/cgi-bin/at3/out.cgi?id=63&trade=https://highcbdoildrops.com   http://ixi-corp.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://residentsseries.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.keylimecove.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.mercurycougar.net/forums/entry.php?364-Eliminators-on-the&goto=highcbdoildrops.com   http://planet-ballroom.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://leancatdesign.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   https://netherlands.alumni.columbia.edu/r?u=https://highcbdoildrops.com  http://www.hbajackson.com/Redirect.aspx?destination=https://highcbdoildrops.com  http://rukavinablog.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://marcschoenphd.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://www.ufo.it/asp/forms/avvistamenti/QUESTIONARIO_AVVISTAMENTO__list.asp?goto=highcbdoildrops.com  http://quantumbank.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://admin.logograph.com/redirect.php?url=https://highcbdoildrops.com   http://villages.pantheongallery.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://marketdatanetworkgroup.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://bigislandbreakingnews.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://allcatsallthetime.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://fix-my-diabetes.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://ж—Ґжњ¬й›»дїЎй›»и©±.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttps://www.educat.samregion.ru/bitrix/redirect.php?event1=catalog_out&event2=http%3A%2F%2Fwww.educat.samregion.ru%2Fexternal%2Feducat.samregion.ru%2Ffiles%2Fc_5564%2FO_Tematicheskom_uroke.1.pdf&event3=%CF%E8%F1%FC%EC%EE+%EC%E8%ED%E8%F1%F2%E5%F0%F1%F2%E2%E0+%EE%E1%F0%E0%E7%EE%E2%E0%ED%E8%FF+%E8+%ED%E0%F3%EA%E8+%D1%E0%EC%E0%F0%F1%EA%EE%E9+%EE%E1%EB%E0%F1%F2%E8+%EE%F2+09.11.2015+%B9%CC%CE-16-09-01%2F110-3-%D2%D3+&goto=https://highcbdoildrops.com  http://certifiedinterpreters.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://offers-worldwide.com/redirect.php?url=https://highcbdoildrops.com   http://www.aidjhu.org/r?u=https://highcbdoildrops.com  http://www.latexporngallery.com/cgi-bin/atc/out.cgi?id=24&l=top10&u=https://highcbdoildrops.com   http://2100finance.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://onlinetrustcorporation.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://app.convertbar.com/addClick?bar_id=1536&redirect=https://highcbdoildrops.com   http://www.lotsen.de/jump.php?sid=35&url=https://highcbdoildrops.com \nhttp://mixespowders.com/gepatit-forum/go.php?https://highcbdoildrops.com  http://interolistings.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://all-that-jazzbrand.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://test-tunity.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.jpsensor.com.tw/SearchProduct/ProductContext.php?Product_SN=187788&referer=https://highcbdoildrops.com   http://www.excluzive.net/go.php?url=https://highcbdoildrops.com  https://www.newhopecelebrates.com/partner/go-magazine/?target=https://highcbdoildrops.com  http://dynamicwebmarketing.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://tellmycampground.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://sitrickandcompanyinc.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://vk-com.aurebeshtranslator.net/away.php?to=https://highcbdoildrops.com   http://leadershiptherapy.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.kikitchew.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://mailnmore-ht.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.transpleasure.com/acj/out.php?id=60&tag=toplist&trade=https://highcbdoildrops.com  http://www.aktualnizpravy.info/go.php?u=https://highcbdoildrops.com  http://intstaffing.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://singereye.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://vk-com.aurebeshtranslator.net/away.php?to=https://highcbdoildrops.com  http://mespell.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://mars.libs.uga.edu/reflect/?https://highcbdoildrops.com   http://nicholasvperricone.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://alleganesa.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://rentsave.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.meteo.meteocap.eu/TopReferer/referer.php?top=100&referer=https://highcbdoildrops.com  http://freeenvironmentalreports.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://humanyouniverse.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttps://www.whoxy.com/highcbdoildrops.com  http://slwoffl.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://contemporaryhome.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://usedtuxedo.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.kartaca.com/modules/babel/redirect.php?newlang=tr_TR&newurl=https://highcbdoildrops.com/   http://gemhistory.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://embeddedcraft.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://sss.lcyyy.achcegdqqm.lceqo.3.gsr.anonimizing.com/home287/createSession?referer=https://highcbdoildrops.com   http://anastasiadatesmailings.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \n \n \n \n \n \nhttps://forum.possibilityspecialists.org/index.php?topic=219917.new#new\nhttps://tg.vl-mp.com/index.php?topic=103492.new#new\nhttp://kendoguadeloupe.com/forum/viewtopic.php?f=3&t=18581\nhttp://master-catalog.ru/forum/showthread.php?t=123042&p=224301#post224301\nhttp://dnpel.ru/for/index.php?topic=28344.new#new\n", "language": "Lisp", "metadata": {"date": 1548137801, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s690446328.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s690446328", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://kahite.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://cym.capscafe.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://porscheofcoloradosprings.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://qf5.c-jreporters.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://meemic.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://thedigital-lab.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://app1.emailinvest.com/link.php?track=1072_48673_354&url=https://highcbdoildrops.com  http://www.nudegirls-pics.com/cgi-bin/out.cgi?id=26&l=thumbtop&u=https://highcbdoildrops.com   http://d.ml11.flmsa.net/class/link.php?index=ATQ%3D&id=weeysetwtswtpwoseup&url=highcbdoildrops.com \nhttp://arguslabs.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.thebigeyedea.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://winstaff.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://robotics-alliance.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://hollisterholdings.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://commercialserviceguide.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://foalsearch.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://kidpowerdc.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.bookee.com/bk/bookee.redirect?url=https://highcbdoildrops.com \nhttp://jonpritzker.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.advantagemedia.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://fwsec.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://foro.infojardin.com/proxy.php?link=https://highcbdoildrops.com  http://lzfz.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.mulberryfarms.com/cart.php?m=checkout&sidebarDetailed=Y&prevCmd=cart_home&go=https://highcbdoildrops.com  http://monenergex.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://undernylon.com/cgi-bin/at3/out.cgi?id=63&trade=https://highcbdoildrops.com   http://ixi-corp.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://residentsseries.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.keylimecove.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.mercurycougar.net/forums/entry.php?364-Eliminators-on-the&goto=highcbdoildrops.com   http://planet-ballroom.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://leancatdesign.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   https://netherlands.alumni.columbia.edu/r?u=https://highcbdoildrops.com  http://www.hbajackson.com/Redirect.aspx?destination=https://highcbdoildrops.com  http://rukavinablog.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://marcschoenphd.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://www.ufo.it/asp/forms/avvistamenti/QUESTIONARIO_AVVISTAMENTO__list.asp?goto=highcbdoildrops.com  http://quantumbank.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://admin.logograph.com/redirect.php?url=https://highcbdoildrops.com   http://villages.pantheongallery.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://marketdatanetworkgroup.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://bigislandbreakingnews.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://allcatsallthetime.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://fix-my-diabetes.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://ж—Ґжњ¬й›»дїЎй›»и©±.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttps://www.educat.samregion.ru/bitrix/redirect.php?event1=catalog_out&event2=http%3A%2F%2Fwww.educat.samregion.ru%2Fexternal%2Feducat.samregion.ru%2Ffiles%2Fc_5564%2FO_Tematicheskom_uroke.1.pdf&event3=%CF%E8%F1%FC%EC%EE+%EC%E8%ED%E8%F1%F2%E5%F0%F1%F2%E2%E0+%EE%E1%F0%E0%E7%EE%E2%E0%ED%E8%FF+%E8+%ED%E0%F3%EA%E8+%D1%E0%EC%E0%F0%F1%EA%EE%E9+%EE%E1%EB%E0%F1%F2%E8+%EE%F2+09.11.2015+%B9%CC%CE-16-09-01%2F110-3-%D2%D3+&goto=https://highcbdoildrops.com  http://certifiedinterpreters.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://offers-worldwide.com/redirect.php?url=https://highcbdoildrops.com   http://www.aidjhu.org/r?u=https://highcbdoildrops.com  http://www.latexporngallery.com/cgi-bin/atc/out.cgi?id=24&l=top10&u=https://highcbdoildrops.com   http://2100finance.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://onlinetrustcorporation.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://app.convertbar.com/addClick?bar_id=1536&redirect=https://highcbdoildrops.com   http://www.lotsen.de/jump.php?sid=35&url=https://highcbdoildrops.com \nhttp://mixespowders.com/gepatit-forum/go.php?https://highcbdoildrops.com  http://interolistings.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://all-that-jazzbrand.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://test-tunity.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.jpsensor.com.tw/SearchProduct/ProductContext.php?Product_SN=187788&referer=https://highcbdoildrops.com   http://www.excluzive.net/go.php?url=https://highcbdoildrops.com  https://www.newhopecelebrates.com/partner/go-magazine/?target=https://highcbdoildrops.com  http://dynamicwebmarketing.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://tellmycampground.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://sitrickandcompanyinc.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://vk-com.aurebeshtranslator.net/away.php?to=https://highcbdoildrops.com   http://leadershiptherapy.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.kikitchew.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://mailnmore-ht.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.transpleasure.com/acj/out.php?id=60&tag=toplist&trade=https://highcbdoildrops.com  http://www.aktualnizpravy.info/go.php?u=https://highcbdoildrops.com  http://intstaffing.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://singereye.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://vk-com.aurebeshtranslator.net/away.php?to=https://highcbdoildrops.com  http://mespell.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://mars.libs.uga.edu/reflect/?https://highcbdoildrops.com   http://nicholasvperricone.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://alleganesa.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://rentsave.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.meteo.meteocap.eu/TopReferer/referer.php?top=100&referer=https://highcbdoildrops.com  http://freeenvironmentalreports.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://humanyouniverse.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttps://www.whoxy.com/highcbdoildrops.com  http://slwoffl.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://contemporaryhome.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://usedtuxedo.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.kartaca.com/modules/babel/redirect.php?newlang=tr_TR&newurl=https://highcbdoildrops.com/   http://gemhistory.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://embeddedcraft.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://sss.lcyyy.achcegdqqm.lceqo.3.gsr.anonimizing.com/home287/createSession?referer=https://highcbdoildrops.com   http://anastasiadatesmailings.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \n \n \n \n \n \nhttps://forum.possibilityspecialists.org/index.php?topic=219917.new#new\nhttps://tg.vl-mp.com/index.php?topic=103492.new#new\nhttp://kendoguadeloupe.com/forum/viewtopic.php?f=3&t=18581\nhttp://master-catalog.ru/forum/showthread.php?t=123042&p=224301#post224301\nhttp://dnpel.ru/for/index.php?topic=28344.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8193, "cpu_time_ms": 110, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s491041209", "group_id": "codeNet:p03941", "input_text": "http://www.bolshoi-tennis.ru/redirect.php?to=highcbdoildrops.com  http://www.veselica.si/go?https://highcbdoildrops.com   http://bookmyidentity.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   https://www.paldf.net/forum/entry.php?b=21940&goto=highcbdoildrops.com  http://landlordid.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://irc.ifmo.ru/go.php?url=https://highcbdoildrops.com  http://www.chicagodnn.org/LinkClick.aspx?link=https://highcbdoildrops.com  http://moiseasafra.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://conerstonepaycards.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://workingtv.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://inspirationalfamousquotes.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://jeffbelford.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://barmin.ru/go?item=question&url=https://highcbdoildrops.com  http://holidayvideoblogs.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://botavie.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://creditasia.uz/bitrix/rk.php?goto=highcbdoildrops.com  http://woopsla.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://yottasolutions.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://younginseconds.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.garliccanada.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://vizit-internet.ru/go/?https://highcbdoildrops.com   http://hearstentertainment.us/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://cuttingedgephysicaltherapy.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://beanlette.com/redir.php?url=https://highcbdoildrops.com  http://zmh.johnpostphotography.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://middleboroyouthsoftball.org/Goto.asp?url=https://highcbdoildrops.com   http://w4thu.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://ngsexpo.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://cleanwashformulas.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://itakebioastin.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.hoaghealth.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.gousa.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://mollechevrolet.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://uzscinet.uz/upload/bx/953/banner_partner.swf?flash_link=highcbdoildrops.com  http://jerry-bruckheimer.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.bobattre.se/Out.asp?UrlCat=5&Url=https://highcbdoildrops.com \nhttp://www.cubainformacion.tv/enlazar.php?video=leccionesdemanipulacion077ITA.flv&id=17321&ur=https://highcbdoildrops.com/  http://sssllc-ia.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   https://nasos.ru/bitrix/rk.php?id=6&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B6%5D+%5Bbanner1%5D+Grundfos+Skala+2+%D0%9D%D0%B0%D0%B4%D0%B5%D0%B6%D0%BD%D0%BE%D1%81%D1%82%D1%8C+%D0%B2+%D0%BA%D0%BE%D0%BC%D0%BF%D0%B0%D0%BA%D1%82%D0%BD%D0%BE%D0%BC+%D0%BA%D0%BE%D1%80%D0%BF%D1%83%D1%81%D0%B5&goto=https://highcbdoildrops.com   http://rootshairgel.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://www.vamaritime.com/link.asp?e=david@portofhamptonroads.com&job=1396350&ymlink=2433115&finalurl=https://highcbdoildrops.com   http://html5admin.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.themagictop.com/index.php?a=out&u=ScottTokar&go=https://highcbdoildrops.com  http://googli.com.ua/ext_link?url=https://highcbdoildrops.com   http://571doctors.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://98country.com/login/?referer=https://highcbdoildrops.com  http://j3b.greentreeriskmgt.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.allsaints-newhaw.org.uk/goto-link.php?link_id=6&url=https://highcbdoildrops.com   http://zxi.xlr8yourmac.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://xpicoin.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   https://shop.aptos.ru/bitrix/rk.php?id=22&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B22%5D+%5BFIRST_BANNER%5D+%D0%9F%D1%80%D0%B5%D0%B8%D0%BC%D1%83%D1%89%D0%B5%D1%81%D1%82%D0%B2%D0%B0+%D0%BF%D0%BE%D0%BA%D1%83%D0%BF%D0%BA%D0%B8&goto=highcbdoildrops.com  http://musictwentyone.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://lighthouseharbour.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   https://369213.r.bat.bing.com/?ld=d3KfDY0Vwa2nKjm4L-XeN_BTVUCUxf6HBkyBZO__KYdrfnAh1ZTJAXYvYijooiyytv_TiHx87F76VDH5EP3kIQYt_6nS_rkKzjol91qRHpEm0BdyiuYKDuckLoio7QwziSeVQ_wPWlPax1B6j0dteNNPRZIpdt9wWOywFltYi5rqcuprHj&u=https://highcbdoildrops.com \nhttp://gtitransportation.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://fisoutdoor.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.photoeye.com/emailnewsletter/gateway.cfm?Volume=10&Number=34&location=https://highcbdoildrops.com/&catnumber=ImageLink_9   http://goldenkeytour.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://keytutor.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://indiamat.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://chevydieselupgrades.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://labcapital.com/go/url=https://highcbdoildrops.com   http://fangchenggangmh.com/fe203924-go-rss/redirect.php?url=https://highcbdoildrops.com \nhttp://jbrownlee.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://performixhighplains.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://326.ev-mart.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://samsunginternet.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://sedonaland.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://watermarktv.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.aaap.org.nz/r?u=https://highcbdoildrops.com  http://vp3ops.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://hureaux.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://mp3mp3.do.am/go?https://highcbdoildrops.com  http://banner10.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://ghm.vg/__media__/js/trademark.php?d=highcbdoildrops.com   http://epits15.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://shootingsnipergames.com/game-out2.php?gl=https://highcbdoildrops.com/   http://qobracenter.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://youthworks.us/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://ie.fukushima-sumai.com/jump.php?curl=https://highcbdoildrops.com   http://advanceddiscreplacement.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://checkwaterhydration.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://gonzito.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.pennydeals.in/offer?go=https://highcbdoildrops.com   http://actionmoviefx.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://lena-chen-number-30.xoxohth.com/go.php?url=https://highcbdoildrops.com   http://dronesinternational.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://gbontv.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.jswelt.org/goto.php?url=https://highcbdoildrops.com   http://readyforachangenow.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \n \n \n \n \n \nhttp://jung.pk/viewtopic.php?f=6&t=47033\nhttp://operationimpossibleboy.rachelshaven.com/index.php?topic=14637.new#new\nhttp://anasozu.com/orhan-kuraldan-kdu-studentlarina-konferentiya/#comment-2164\nhttp://www.capitolasset.net/forum/showthread.php?tid=58406\nhttp://www.deliberarchia.org/forum/index.php?topic=12164.new#new\n", "language": "Lisp", "metadata": {"date": 1548118005, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s491041209.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s491041209", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.bolshoi-tennis.ru/redirect.php?to=highcbdoildrops.com  http://www.veselica.si/go?https://highcbdoildrops.com   http://bookmyidentity.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   https://www.paldf.net/forum/entry.php?b=21940&goto=highcbdoildrops.com  http://landlordid.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://irc.ifmo.ru/go.php?url=https://highcbdoildrops.com  http://www.chicagodnn.org/LinkClick.aspx?link=https://highcbdoildrops.com  http://moiseasafra.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://conerstonepaycards.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://workingtv.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://inspirationalfamousquotes.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://jeffbelford.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://barmin.ru/go?item=question&url=https://highcbdoildrops.com  http://holidayvideoblogs.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://botavie.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://creditasia.uz/bitrix/rk.php?goto=highcbdoildrops.com  http://woopsla.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://yottasolutions.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://younginseconds.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.garliccanada.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://vizit-internet.ru/go/?https://highcbdoildrops.com   http://hearstentertainment.us/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://cuttingedgephysicaltherapy.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://beanlette.com/redir.php?url=https://highcbdoildrops.com  http://zmh.johnpostphotography.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://middleboroyouthsoftball.org/Goto.asp?url=https://highcbdoildrops.com   http://w4thu.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://ngsexpo.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://cleanwashformulas.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://itakebioastin.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.hoaghealth.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.gousa.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://mollechevrolet.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://uzscinet.uz/upload/bx/953/banner_partner.swf?flash_link=highcbdoildrops.com  http://jerry-bruckheimer.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.bobattre.se/Out.asp?UrlCat=5&Url=https://highcbdoildrops.com \nhttp://www.cubainformacion.tv/enlazar.php?video=leccionesdemanipulacion077ITA.flv&id=17321&ur=https://highcbdoildrops.com/  http://sssllc-ia.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   https://nasos.ru/bitrix/rk.php?id=6&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B6%5D+%5Bbanner1%5D+Grundfos+Skala+2+%D0%9D%D0%B0%D0%B4%D0%B5%D0%B6%D0%BD%D0%BE%D1%81%D1%82%D1%8C+%D0%B2+%D0%BA%D0%BE%D0%BC%D0%BF%D0%B0%D0%BA%D1%82%D0%BD%D0%BE%D0%BC+%D0%BA%D0%BE%D1%80%D0%BF%D1%83%D1%81%D0%B5&goto=https://highcbdoildrops.com   http://rootshairgel.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://www.vamaritime.com/link.asp?e=david@portofhamptonroads.com&job=1396350&ymlink=2433115&finalurl=https://highcbdoildrops.com   http://html5admin.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.themagictop.com/index.php?a=out&u=ScottTokar&go=https://highcbdoildrops.com  http://googli.com.ua/ext_link?url=https://highcbdoildrops.com   http://571doctors.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://98country.com/login/?referer=https://highcbdoildrops.com  http://j3b.greentreeriskmgt.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.allsaints-newhaw.org.uk/goto-link.php?link_id=6&url=https://highcbdoildrops.com   http://zxi.xlr8yourmac.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://xpicoin.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   https://shop.aptos.ru/bitrix/rk.php?id=22&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B22%5D+%5BFIRST_BANNER%5D+%D0%9F%D1%80%D0%B5%D0%B8%D0%BC%D1%83%D1%89%D0%B5%D1%81%D1%82%D0%B2%D0%B0+%D0%BF%D0%BE%D0%BA%D1%83%D0%BF%D0%BA%D0%B8&goto=highcbdoildrops.com  http://musictwentyone.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://lighthouseharbour.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   https://369213.r.bat.bing.com/?ld=d3KfDY0Vwa2nKjm4L-XeN_BTVUCUxf6HBkyBZO__KYdrfnAh1ZTJAXYvYijooiyytv_TiHx87F76VDH5EP3kIQYt_6nS_rkKzjol91qRHpEm0BdyiuYKDuckLoio7QwziSeVQ_wPWlPax1B6j0dteNNPRZIpdt9wWOywFltYi5rqcuprHj&u=https://highcbdoildrops.com \nhttp://gtitransportation.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://fisoutdoor.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.photoeye.com/emailnewsletter/gateway.cfm?Volume=10&Number=34&location=https://highcbdoildrops.com/&catnumber=ImageLink_9   http://goldenkeytour.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://keytutor.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://indiamat.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://chevydieselupgrades.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://labcapital.com/go/url=https://highcbdoildrops.com   http://fangchenggangmh.com/fe203924-go-rss/redirect.php?url=https://highcbdoildrops.com \nhttp://jbrownlee.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://performixhighplains.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://326.ev-mart.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://samsunginternet.biz/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://sedonaland.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://watermarktv.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.aaap.org.nz/r?u=https://highcbdoildrops.com  http://vp3ops.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://hureaux.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://mp3mp3.do.am/go?https://highcbdoildrops.com  http://banner10.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://ghm.vg/__media__/js/trademark.php?d=highcbdoildrops.com   http://epits15.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://shootingsnipergames.com/game-out2.php?gl=https://highcbdoildrops.com/   http://qobracenter.org/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://youthworks.us/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  https://ie.fukushima-sumai.com/jump.php?curl=https://highcbdoildrops.com   http://advanceddiscreplacement.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \nhttp://checkwaterhydration.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://gonzito.net/__media__/js/netsoltrademark.php?d=highcbdoildrops.com   http://www.pennydeals.in/offer?go=https://highcbdoildrops.com   http://actionmoviefx.info/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://lena-chen-number-30.xoxohth.com/go.php?url=https://highcbdoildrops.com   http://dronesinternational.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://gbontv.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com  http://www.jswelt.org/goto.php?url=https://highcbdoildrops.com   http://readyforachangenow.com/__media__/js/netsoltrademark.php?d=highcbdoildrops.com \n \n \n \n \n \nhttp://jung.pk/viewtopic.php?f=6&t=47033\nhttp://operationimpossibleboy.rachelshaven.com/index.php?topic=14637.new#new\nhttp://anasozu.com/orhan-kuraldan-kdu-studentlarina-konferentiya/#comment-2164\nhttp://www.capitolasset.net/forum/showthread.php?tid=58406\nhttp://www.deliberarchia.org/forum/index.php?topic=12164.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8097, "cpu_time_ms": 105, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s171546984", "group_id": "codeNet:p03941", "input_text": "http://www.belichickbreakdowns.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://paterno-gaming.com/forums/index.php?app=core&module=system&controller=redirect&url=https://cbdoilmarketusa.com   http://qglobalconsulting.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://issuesandwhatnot.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.wine-tower.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://bocaratoninsurance.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://waggintales.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.ip-concept.ru/bitrix/redirect.php?event1=catalog_out&event2=http%3A%2F%2Fwww.tinko.ru%2Fp-214763.html&event3=PIN5%2FPIN5&goto=https://cbdoilmarketusa.com   http://happydetroit.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://o98k.fun/url/?go=https://cbdoilmarketusa.com  http://non-mentholpleasure.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://harrison-global.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://familychurchofjesus.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://michaelweprin.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.shazly.smffy.com/index.php?thememode=full;redirect=https://cbdoilmarketusa.com  http://luxotticaretaildrs.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://petmint.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.sortitionfoundation.org/r?u=https://cbdoilmarketusa.com \nhttp://speeddetailing.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ratemyhealthinsurance.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.yuzhen168.com/dialog_1.htm?arg=10134868&style=1&kf=&kflist=off&kf=2823804866%40qq.com%2C3139409435%40qq.com%2C2649705365%40qq.com&zdkf_type=1&language=zh-cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://cbdoilmarketusa.com   http://paulklebnikov.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://onkoloji.co/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://pdmexhibition.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wcbradley.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://egfrderm.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://frontporchprojects.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.tads.gr/link.php?x=T1dKaU16aGpaVFE1WkdFeU1tRmtOMlV4T1RObE1UazFORE0wTmpFNU16Z3RNVFF6TURZd09EQXpOdz09&url_n=1&from=281&size=2&to=874&ad_n=1&purl=cbdoilmarketusa.com  http://www.topsitescentral.com/cgi-bin/topsites/out.cgi?id=iamscree&url=https://cbdoilmarketusa.com   http://www.print6.ru/bitrix/redirect.php?event1=Y&event2=&event3=&goto=https://cbdoilmarketusa.com   http://fantasiapartners.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.grazhats.at/link.php?&url=https://cbdoilmarketusa.com   http://sparksandwirycries.com/LinkClick.aspx?link=https://cbdoilmarketusa.com  http://www.agence-bouquet.fr/links/redir.asp?link=cbdoilmarketusa.com  http://go4bunker.tformula.ru/go/url=https://cbdoilmarketusa.com   http://www.qualitalegno.it/forum/index.php?thememode=full;redirect=https://cbdoilmarketusa.com \nhttp://valleywelders.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://mypremiercreidcard.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://upshooting.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://melanieowens.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wirelesswatch.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://lupusnymetro.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://jember-hacker.org/go.php?url=https://cbdoilmarketusa.com  http://assuredchoices.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://forum.radmir-rp.ru/redirect/?url=https://cbdoilmarketusa.com \nhttp://towtofixrewards.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.domxssscanner.com/scan?url=https://cbdoilmarketusa.com   http://gemmanual.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.kwnow.ca/linkredir.cfm?nppage=1896&URL=https://cbdoilmarketusa.com  http://w3.mlps.ttct.edu.tw/dynaweb/netlink/hits.php?id=111&url=https://cbdoilmarketusa.com   https://oab-rn.jusbrasil.com.br/noticias/1190334/artigo-o-quimerismo-genetico-e-suas-implicacoes-para-o-mundo-do-direito?referer=https://cbdoilmarketusa.com  http://577818.cqsrgs.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://neatc.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://newwavevacations.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://sagafrontier.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://sociology.net.ru/go.php?url=https://cbdoilmarketusa.com   http://www.start1.ru/redirect/?url=https://cbdoilmarketusa.com   http://guardsecurityhardware.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://humanoidstechnology.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://newownerrewards.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://xdt.walkerplaceapartments.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://planetasp.ru/redirect.php?url=cbdoilmarketusa.com   http://www.ylpeys.fi/go.php?url=https://cbdoilmarketusa.com \nhttp://alhoover.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.buzz99.com/go?https://cbdoilmarketusa.com   http://lasvegasmagazine.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://gurufisher.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://lauramassei.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://yalong8777.com/member/login.php?lang=cn&referer=https://cbdoilmarketusa.com  http://mukdog.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://petkensa.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://onlineformz.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://parkingpassestoday.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://caboluxuryretreats.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.blutail.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.consorcielfar.org/redirect.asp?url=https://cbdoilmarketusa.com/  http://bearriverproduce.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://jamessneeringer.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.glensturtevant.com/r?u=https://cbdoilmarketusa.com  http://www.chemdrycarpetcleaning.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://southwestbyways.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttps://dbea.psealocals.org/LinkClick.aspx?link=https://cbdoilmarketusa.com  http://farmhousefreshgoods.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://mastudio.familydollar.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.gyaanzone.com/events?filter_organizer_type=Institute&filter_organizer=559&except_id=34&referer=https://cbdoilmarketusa.com  http://supportworkplace.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://craigwilliamsaz.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.zq.lovenet.cn/ienumber.php?action=assign&h=www.zq.lovenet.cn&r=http%3A%2F%2Fwww.zq.lovenet.cn%2Flove.php%3FPHPSESSID%3Dtvhg747icueq81th6569oa71n3%26did%3Dretrievepassword&u=https://cbdoilmarketusa.com  http://www.cuckold.in/cgi-bin/ucj/c.cgi?url=https://cbdoilmarketusa.com/   http://cheappoolchemicals.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \n \n \n \n \n \nhttps://realm.se/board/showthread.php?tid=19967\nhttp://community.alahlyegypt.com/forum/main-forum/117128-aplicacion-de-empleo-para-tiendas-ross-los-angeles\nhttp://zhgtk.kz/forum/viewtopic.php?pid=569622#p569622\nhttp://stadiumandmain.com/forum/index.php/topic,29249.new.html#new\nhttp://www.vok-forum.ru/viewtopic.php?f=2&t=102213\n", "language": "Lisp", "metadata": {"date": 1548093822, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s171546984.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s171546984", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.belichickbreakdowns.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://paterno-gaming.com/forums/index.php?app=core&module=system&controller=redirect&url=https://cbdoilmarketusa.com   http://qglobalconsulting.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://issuesandwhatnot.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.wine-tower.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://bocaratoninsurance.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://waggintales.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.ip-concept.ru/bitrix/redirect.php?event1=catalog_out&event2=http%3A%2F%2Fwww.tinko.ru%2Fp-214763.html&event3=PIN5%2FPIN5&goto=https://cbdoilmarketusa.com   http://happydetroit.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://o98k.fun/url/?go=https://cbdoilmarketusa.com  http://non-mentholpleasure.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://harrison-global.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://familychurchofjesus.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://michaelweprin.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.shazly.smffy.com/index.php?thememode=full;redirect=https://cbdoilmarketusa.com  http://luxotticaretaildrs.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://petmint.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.sortitionfoundation.org/r?u=https://cbdoilmarketusa.com \nhttp://speeddetailing.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ratemyhealthinsurance.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.yuzhen168.com/dialog_1.htm?arg=10134868&style=1&kf=&kflist=off&kf=2823804866%40qq.com%2C3139409435%40qq.com%2C2649705365%40qq.com&zdkf_type=1&language=zh-cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://cbdoilmarketusa.com   http://paulklebnikov.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://onkoloji.co/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://pdmexhibition.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wcbradley.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://egfrderm.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://frontporchprojects.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.tads.gr/link.php?x=T1dKaU16aGpaVFE1WkdFeU1tRmtOMlV4T1RObE1UazFORE0wTmpFNU16Z3RNVFF6TURZd09EQXpOdz09&url_n=1&from=281&size=2&to=874&ad_n=1&purl=cbdoilmarketusa.com  http://www.topsitescentral.com/cgi-bin/topsites/out.cgi?id=iamscree&url=https://cbdoilmarketusa.com   http://www.print6.ru/bitrix/redirect.php?event1=Y&event2=&event3=&goto=https://cbdoilmarketusa.com   http://fantasiapartners.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.grazhats.at/link.php?&url=https://cbdoilmarketusa.com   http://sparksandwirycries.com/LinkClick.aspx?link=https://cbdoilmarketusa.com  http://www.agence-bouquet.fr/links/redir.asp?link=cbdoilmarketusa.com  http://go4bunker.tformula.ru/go/url=https://cbdoilmarketusa.com   http://www.qualitalegno.it/forum/index.php?thememode=full;redirect=https://cbdoilmarketusa.com \nhttp://valleywelders.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://mypremiercreidcard.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://upshooting.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://melanieowens.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wirelesswatch.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://lupusnymetro.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://jember-hacker.org/go.php?url=https://cbdoilmarketusa.com  http://assuredchoices.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://forum.radmir-rp.ru/redirect/?url=https://cbdoilmarketusa.com \nhttp://towtofixrewards.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.domxssscanner.com/scan?url=https://cbdoilmarketusa.com   http://gemmanual.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.kwnow.ca/linkredir.cfm?nppage=1896&URL=https://cbdoilmarketusa.com  http://w3.mlps.ttct.edu.tw/dynaweb/netlink/hits.php?id=111&url=https://cbdoilmarketusa.com   https://oab-rn.jusbrasil.com.br/noticias/1190334/artigo-o-quimerismo-genetico-e-suas-implicacoes-para-o-mundo-do-direito?referer=https://cbdoilmarketusa.com  http://577818.cqsrgs.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://neatc.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://newwavevacations.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://sagafrontier.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://sociology.net.ru/go.php?url=https://cbdoilmarketusa.com   http://www.start1.ru/redirect/?url=https://cbdoilmarketusa.com   http://guardsecurityhardware.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://humanoidstechnology.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://newownerrewards.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://xdt.walkerplaceapartments.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://planetasp.ru/redirect.php?url=cbdoilmarketusa.com   http://www.ylpeys.fi/go.php?url=https://cbdoilmarketusa.com \nhttp://alhoover.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.buzz99.com/go?https://cbdoilmarketusa.com   http://lasvegasmagazine.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://gurufisher.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://lauramassei.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://yalong8777.com/member/login.php?lang=cn&referer=https://cbdoilmarketusa.com  http://mukdog.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://petkensa.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://onlineformz.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://parkingpassestoday.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://caboluxuryretreats.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.blutail.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.consorcielfar.org/redirect.asp?url=https://cbdoilmarketusa.com/  http://bearriverproduce.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://jamessneeringer.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.glensturtevant.com/r?u=https://cbdoilmarketusa.com  http://www.chemdrycarpetcleaning.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://southwestbyways.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttps://dbea.psealocals.org/LinkClick.aspx?link=https://cbdoilmarketusa.com  http://farmhousefreshgoods.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://mastudio.familydollar.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.gyaanzone.com/events?filter_organizer_type=Institute&filter_organizer=559&except_id=34&referer=https://cbdoilmarketusa.com  http://supportworkplace.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://craigwilliamsaz.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.zq.lovenet.cn/ienumber.php?action=assign&h=www.zq.lovenet.cn&r=http%3A%2F%2Fwww.zq.lovenet.cn%2Flove.php%3FPHPSESSID%3Dtvhg747icueq81th6569oa71n3%26did%3Dretrievepassword&u=https://cbdoilmarketusa.com  http://www.cuckold.in/cgi-bin/ucj/c.cgi?url=https://cbdoilmarketusa.com/   http://cheappoolchemicals.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \n \n \n \n \n \nhttps://realm.se/board/showthread.php?tid=19967\nhttp://community.alahlyegypt.com/forum/main-forum/117128-aplicacion-de-empleo-para-tiendas-ross-los-angeles\nhttp://zhgtk.kz/forum/viewtopic.php?pid=569622#p569622\nhttp://stadiumandmain.com/forum/index.php/topic,29249.new.html#new\nhttp://www.vok-forum.ru/viewtopic.php?f=2&t=102213\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8241, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s468384955", "group_id": "codeNet:p03941", "input_text": "http://ihateusfoodservice.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://demandresponsecoalition.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://shootingsnipergames.com/game-out2.php?gl=https://cbdoilmarketusa.com/   http://vancepa.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.honden-campings.nl/exit?url=https://cbdoilmarketusa.com   http://nudeisbeauty.com/galleries/go.php?id=96722&u=https://cbdoilmarketusa.com  http://thegalleriesxxx.biz/cgi-bin/ucj/c.cgi?url=https://cbdoilmarketusa.com  http://vcstruckservice.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.goman.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://whatsontheater.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://laballettheatre.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.skypirate.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://redlifeins.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.kellyclarksonriddle.com/gbook/go.php?url=https://cbdoilmarketusa.com   http://herblovers.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://fukuko.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://homemarketguide.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://kennyross-ford.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://voombox.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://eduardocisneros.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://hault.pl/modules/babel/redirect.php?newlang=sv_SE&newurl=https://cbdoilmarketusa.com   http://schulterothzabel.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://animalfarmfoundation.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://effectiveleadershipbaseline.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.genhs.org/LinkClick.aspx?link=https://cbdoilmarketusa.com  http://www.samenwerkendeapotheken.nl/pages/jumptourl.asp?url=https://cbdoilmarketusa.com   http://hearandknow.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://xn--huuaa15ybab104hh97fdac.chryshow.info/redirect.php?tid=103&goto=cbdoilmarketusa.com  http://conwayfarmsgolfclub.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://gracecafayate.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://jdmcapitaladvisors.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.getfitanyage.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://4america.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://qsp.a-perfect.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://solarleasect.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://io-dc.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://t582.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://mtgecp.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://tixcity.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://941wan.net/member/link.php?url=https://cbdoilmarketusa.com  http://logc8.xiti.com/go.click?xts=66392&s2&p=DCI-AGRI-UB-AGRANET&clic=N&type=click&url=https://cbdoilmarketusa.com   http://birth-announcement.birth-cards.com/?go=https://cbdoilmarketusa.com  http://treasurybond.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.kanam.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://dwhomes.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.mojetopolcany.sk/index.php?url=https://cbdoilmarketusa.com  http://reddeerrebels.com/__media__/js/trademark.php?d=cbdoilmarketusa.com   http://www.clipz.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://micronesian.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.movingchurch.org/goto-link.php?link_id=18&url=https://cbdoilmarketusa.com   http://330.echain.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://brightlightfrombrokenplaces.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.carwarsh.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://vzletim.aero/upload/rk/77f/q.swf?flash_link=cbdoilmarketusa.com \nhttp://nilsbunde.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.yesfairelections.org/outlink.php?url=https://cbdoilmarketusa.com   http://helluvadeal.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://cancer-md.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://bq--3cb67grqphiwfaa.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://newyorklimo.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.hagow.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://delusional-depression.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.sekskeks.com/cgi-bin/at3/out.cgi?s=65&l=gals&u=https://cbdoilmarketusa.com \nhttp://extensionstube.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://lexingtoncreditgroup.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://long-horn-steak-house.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://dfiesta.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.kimberleychamber.com/Redirect.aspx?destination=https://cbdoilmarketusa.com   http://www.uasean.com/redirect.php?url=https://cbdoilmarketusa.com  http://tippmannarmscompany.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.shoeprice.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://brianbischof.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://apcocorporatepartners.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://preservecap.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://ghanahomes.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://lightspeedvpisrael.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.fidelityone.com/__media__/js/trademark.php?d=cbdoilmarketusa.com   https://fiualumni.alumnidiscounts.com/perks/process/redirect?action=track_ad&url=https://cbdoilmarketusa.com  http://russkoex.cf/contents/link.php?gr=4&id=e377cc&url=https://cbdoilmarketusa.com  http://www.ebonygirlstgp.com/cgi-bin/atx/out.cgi?id=83&trade=https://cbdoilmarketusa.com   http://mypocketelections.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://krd.empas.com/r/kw_rank2/u=cbdoilmarketusa.com  http://uzmadadabhai.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://m.mister-auto.ie/newaccount.html?referer=https://cbdoilmarketusa.com   http://dobbs1.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://onlinecopyright.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://s125.ru/go/https://cbdoilmarketusa.com  http://www.letover.com/wp-content/themes/begin5.2/inc/go.php?url=https://cbdoilmarketusa.com  http://uvelir.info/?goto=jump&url=https://cbdoilmarketusa.com   http://wakegastroenterologyhollysprings.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \n \n \n \n \n \nhttp://www.ni28320-2.web12.nitrado.hosting/phpBB3/viewtopic.php?f=7&t=820736\nhttp://www.borsaekrani.net/index.php?topic=4025.new#new\nhttp://forumjudi.co/viewtopic.php?pid=396692#p396692\nhttps://www.lcb-informatique.ch/forum/viewtopic.php?pid=116066\nhttps://presofts.com/vals/showthread.php?2930-Simulador-De-Prestamos-Personales&p=22306#post22306\n", "language": "Lisp", "metadata": {"date": 1548085441, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s468384955.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s468384955", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://ihateusfoodservice.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://demandresponsecoalition.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://shootingsnipergames.com/game-out2.php?gl=https://cbdoilmarketusa.com/   http://vancepa.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.honden-campings.nl/exit?url=https://cbdoilmarketusa.com   http://nudeisbeauty.com/galleries/go.php?id=96722&u=https://cbdoilmarketusa.com  http://thegalleriesxxx.biz/cgi-bin/ucj/c.cgi?url=https://cbdoilmarketusa.com  http://vcstruckservice.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.goman.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://whatsontheater.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://laballettheatre.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.skypirate.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://redlifeins.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.kellyclarksonriddle.com/gbook/go.php?url=https://cbdoilmarketusa.com   http://herblovers.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://fukuko.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://homemarketguide.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://kennyross-ford.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://voombox.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://eduardocisneros.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://hault.pl/modules/babel/redirect.php?newlang=sv_SE&newurl=https://cbdoilmarketusa.com   http://schulterothzabel.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://animalfarmfoundation.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://effectiveleadershipbaseline.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.genhs.org/LinkClick.aspx?link=https://cbdoilmarketusa.com  http://www.samenwerkendeapotheken.nl/pages/jumptourl.asp?url=https://cbdoilmarketusa.com   http://hearandknow.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://xn--huuaa15ybab104hh97fdac.chryshow.info/redirect.php?tid=103&goto=cbdoilmarketusa.com  http://conwayfarmsgolfclub.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://gracecafayate.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://jdmcapitaladvisors.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.getfitanyage.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://4america.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://qsp.a-perfect.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://solarleasect.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://io-dc.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://t582.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://mtgecp.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://tixcity.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://941wan.net/member/link.php?url=https://cbdoilmarketusa.com  http://logc8.xiti.com/go.click?xts=66392&s2&p=DCI-AGRI-UB-AGRANET&clic=N&type=click&url=https://cbdoilmarketusa.com   http://birth-announcement.birth-cards.com/?go=https://cbdoilmarketusa.com  http://treasurybond.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.kanam.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://dwhomes.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.mojetopolcany.sk/index.php?url=https://cbdoilmarketusa.com  http://reddeerrebels.com/__media__/js/trademark.php?d=cbdoilmarketusa.com   http://www.clipz.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://micronesian.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.movingchurch.org/goto-link.php?link_id=18&url=https://cbdoilmarketusa.com   http://330.echain.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://brightlightfrombrokenplaces.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.carwarsh.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://vzletim.aero/upload/rk/77f/q.swf?flash_link=cbdoilmarketusa.com \nhttp://nilsbunde.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.yesfairelections.org/outlink.php?url=https://cbdoilmarketusa.com   http://helluvadeal.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://cancer-md.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://bq--3cb67grqphiwfaa.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://newyorklimo.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.hagow.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://delusional-depression.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.sekskeks.com/cgi-bin/at3/out.cgi?s=65&l=gals&u=https://cbdoilmarketusa.com \nhttp://extensionstube.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://lexingtoncreditgroup.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://long-horn-steak-house.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://dfiesta.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.kimberleychamber.com/Redirect.aspx?destination=https://cbdoilmarketusa.com   http://www.uasean.com/redirect.php?url=https://cbdoilmarketusa.com  http://tippmannarmscompany.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.shoeprice.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://brianbischof.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://apcocorporatepartners.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://preservecap.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://ghanahomes.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://lightspeedvpisrael.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.fidelityone.com/__media__/js/trademark.php?d=cbdoilmarketusa.com   https://fiualumni.alumnidiscounts.com/perks/process/redirect?action=track_ad&url=https://cbdoilmarketusa.com  http://russkoex.cf/contents/link.php?gr=4&id=e377cc&url=https://cbdoilmarketusa.com  http://www.ebonygirlstgp.com/cgi-bin/atx/out.cgi?id=83&trade=https://cbdoilmarketusa.com   http://mypocketelections.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://krd.empas.com/r/kw_rank2/u=cbdoilmarketusa.com  http://uzmadadabhai.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://m.mister-auto.ie/newaccount.html?referer=https://cbdoilmarketusa.com   http://dobbs1.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://onlinecopyright.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://s125.ru/go/https://cbdoilmarketusa.com  http://www.letover.com/wp-content/themes/begin5.2/inc/go.php?url=https://cbdoilmarketusa.com  http://uvelir.info/?goto=jump&url=https://cbdoilmarketusa.com   http://wakegastroenterologyhollysprings.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \n \n \n \n \n \nhttp://www.ni28320-2.web12.nitrado.hosting/phpBB3/viewtopic.php?f=7&t=820736\nhttp://www.borsaekrani.net/index.php?topic=4025.new#new\nhttp://forumjudi.co/viewtopic.php?pid=396692#p396692\nhttps://www.lcb-informatique.ch/forum/viewtopic.php?pid=116066\nhttps://presofts.com/vals/showthread.php?2930-Simulador-De-Prestamos-Personales&p=22306#post22306\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7681, "cpu_time_ms": 93, "memory_kb": 9448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s909220764", "group_id": "codeNet:p03941", "input_text": "https://phansite.net/forum/redirect.php?url=https://cbdoilmarketusa.com  http://tyentuk.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://kabillion.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.zuanji360.com/redirect.php?url=https://cbdoilmarketusa.com  http://timelockphotography.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://zxj.headtable.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://joejoelaw.com/__media__/js/trademark.php?d=cbdoilmarketusa.com  http://www.bezirk-hoefe.ch/DesktopModules/SaveAsPDF/DownloadPdf.aspx?url=https://cbdoilmarketusa.com   http://colormodeling.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.adampaulforlakewood.com/r?u=https://cbdoilmarketusa.com  http://ero-women.com/jump.php?u=https://cbdoilmarketusa.com   http://slingpost.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://rickselby.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wwl.vintagedeluxe.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://ocbcwhcn.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://brooklynheightspress.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://schoenfeldtheater.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.greenlightnc.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://samet.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://moiseazurisafra.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://ethnocosmetic.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://pqr.4think.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wallmu.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://gurigi.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.umbc.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.prophesyhope.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.gait-study.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://ensue.serialblog.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://orbitoy.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.blacktiesound.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.ieeeconferences.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wholesalesaphire.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.floridastategasprices.com/Redirect.aspx?urll=https://cbdoilmarketusa.com  http://sarayahospitality.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.puneeducation.net/rd.asp?url=https://cbdoilmarketusa.com   http://suntreevieracommercialcenter.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.cheez.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://theorientalruggalleryoftexas.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://linkable.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://craftsetc.de/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://25lightrs.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.badboyworldwide.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://thecompliancewizard.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wcbprovider.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://ronmcdougall.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://airpark101.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://sledge-bol.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.rsloboda.com/go.php?url=https://cbdoilmarketusa.com   http://charterrealtyassociates.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://hyogonet.com/l/rank.cgi?mode=link&id=3670&url=https://cbdoilmarketusa.com/   https://rewards.w88way.com/common/login.aspx?url=https://cbdoilmarketusa.com  http://www.xjgzx.com/zaixianzixun.htm?arg=9005382&style=1&kf=&kflist=on&kf=baohuifang&zdkf_type=1&language=zh-cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://cbdoilmarketusa.com  http://tapintowine.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://vacctrac.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://tef.blackbearfabrics.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ritzandfriends.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://nyccoopinfo.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://thetaxtalentnetwork.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://growveggee.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://smigitaldigital.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://skokielibrary.info/cgi-bin/j/jump.pl?https://cbdoilmarketusa.com  http://www.freshxvideos.com/vi/?go=click&c=81&n=4&e=0&g=3&r=22546689&u=https://cbdoilmarketusa.com   https://mprm-dot-yamm-track.appspot.com/Redirect?ukey=1AU67rtt5SC7dcnZ2XOTgsNDpQDa5cwGE3PVaO8A2NIY-729586178&key=YAMMID-05130478&link=https://cbdoilmarketusa.com \nhttp://www.brandhonor.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://forums-secure.horseandhound.co.uk/showthread.php?765174-Our-life-in-Germany&goto=cbdoilmarketusa.com   http://chinaski.akce.aneta.dev.senzaparty.net/redir.php?link=https://cbdoilmarketusa.com   http://www.seascapeholidays.net/cgi-bin/axs/ax.pl?https://cbdoilmarketusa.com/  http://zgl.admaeve.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://technoengineer.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://amadeusdestino.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://peaceleads.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://rmpgusa.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.reportmoney.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://tenniscapes.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.armeniahotel.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://kit-e.ru/redirect.php?link=https://cbdoilmarketusa.com  http://www.86lawyer.com/go.aspx?url=https://cbdoilmarketusa.com   https://www.annapolisyc.com/default.aspx?p=TrackHyperlink&url=https://cbdoilmarketusa.com  https://33001400.r.bat.bing.com/?ld=d3ZfO62STmYNqOAwCFg1uutjVUCUwC1MlRUHJHUbrZuUQtu_6VKMh7ZZVbyLvT43IJE5v-2d2ZK27c91bctXmoAVerUT4Y1Sytqf-npqjlmqkNIUi0iX7w0ULblnO2B8NGH3NCTf0czWbMzThGSnvrHUTwrdhXeRhuC2PfgUctVprx76Hw&u=https://cbdoilmarketusa.com  http://maxinemillerstudios.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://travel.pchome.com.tw/api/redirect.php?c=slide_agoda&url=https://cbdoilmarketusa.com \nhttp://ihaterushlimbaugh.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://racketreducing.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.xiaoyaji.net/bbs/redirect.php?tid=21516&goto=cbdoilmarketusa.com   http://credit-repair-law-firm.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://passport.linkonlineworld.com/forgotpassword.aspx?culture=en-us&returnurl=https://cbdoilmarketusa.com/   http://www.wfrcp.org.uk/goto-link.php?link_id=22&url=https://cbdoilmarketusa.com  http://gcmylove.com/index.php?g=Index&c=Recognition&a=see_login_qrcode&referer=https://cbdoilmarketusa.com  http://goldsboroopenhouse.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.stsennenchurch.org.uk/goto-link.php?link_id=15&url=https://cbdoilmarketusa.com \n \n \n \n \n \nhttp://slpsfd.org/forum/index.php?topic=20374.new#new\nhttp://marketsquaremusic.com/product/eleanor-mcevoy-yola/#comment-11074\nhttp://sxt.ch/forum/viewtopic.php?pid=94539#p94539\nhttp://www.piterenka.ru/forum/viewtopic.php?f=4&t=28037\nhttp://tszh-avangard.ru/forum/viewtopic.php?f=4&t=142785\n", "language": "Lisp", "metadata": {"date": 1548052120, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s909220764.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s909220764", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://phansite.net/forum/redirect.php?url=https://cbdoilmarketusa.com  http://tyentuk.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://kabillion.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.zuanji360.com/redirect.php?url=https://cbdoilmarketusa.com  http://timelockphotography.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://zxj.headtable.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://joejoelaw.com/__media__/js/trademark.php?d=cbdoilmarketusa.com  http://www.bezirk-hoefe.ch/DesktopModules/SaveAsPDF/DownloadPdf.aspx?url=https://cbdoilmarketusa.com   http://colormodeling.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.adampaulforlakewood.com/r?u=https://cbdoilmarketusa.com  http://ero-women.com/jump.php?u=https://cbdoilmarketusa.com   http://slingpost.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://rickselby.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wwl.vintagedeluxe.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://ocbcwhcn.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://brooklynheightspress.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://schoenfeldtheater.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.greenlightnc.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://samet.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://moiseazurisafra.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://ethnocosmetic.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://pqr.4think.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wallmu.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://gurigi.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.umbc.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.prophesyhope.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.gait-study.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://ensue.serialblog.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://orbitoy.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.blacktiesound.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.ieeeconferences.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wholesalesaphire.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.floridastategasprices.com/Redirect.aspx?urll=https://cbdoilmarketusa.com  http://sarayahospitality.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.puneeducation.net/rd.asp?url=https://cbdoilmarketusa.com   http://suntreevieracommercialcenter.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.cheez.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://theorientalruggalleryoftexas.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://linkable.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://craftsetc.de/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://25lightrs.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.badboyworldwide.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://thecompliancewizard.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://wcbprovider.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://ronmcdougall.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://airpark101.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://sledge-bol.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.rsloboda.com/go.php?url=https://cbdoilmarketusa.com   http://charterrealtyassociates.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://hyogonet.com/l/rank.cgi?mode=link&id=3670&url=https://cbdoilmarketusa.com/   https://rewards.w88way.com/common/login.aspx?url=https://cbdoilmarketusa.com  http://www.xjgzx.com/zaixianzixun.htm?arg=9005382&style=1&kf=&kflist=on&kf=baohuifang&zdkf_type=1&language=zh-cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://cbdoilmarketusa.com  http://tapintowine.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://vacctrac.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://tef.blackbearfabrics.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ritzandfriends.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://nyccoopinfo.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://thetaxtalentnetwork.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://growveggee.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://smigitaldigital.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://skokielibrary.info/cgi-bin/j/jump.pl?https://cbdoilmarketusa.com  http://www.freshxvideos.com/vi/?go=click&c=81&n=4&e=0&g=3&r=22546689&u=https://cbdoilmarketusa.com   https://mprm-dot-yamm-track.appspot.com/Redirect?ukey=1AU67rtt5SC7dcnZ2XOTgsNDpQDa5cwGE3PVaO8A2NIY-729586178&key=YAMMID-05130478&link=https://cbdoilmarketusa.com \nhttp://www.brandhonor.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://forums-secure.horseandhound.co.uk/showthread.php?765174-Our-life-in-Germany&goto=cbdoilmarketusa.com   http://chinaski.akce.aneta.dev.senzaparty.net/redir.php?link=https://cbdoilmarketusa.com   http://www.seascapeholidays.net/cgi-bin/axs/ax.pl?https://cbdoilmarketusa.com/  http://zgl.admaeve.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://technoengineer.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://amadeusdestino.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://peaceleads.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://rmpgusa.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.reportmoney.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://tenniscapes.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.armeniahotel.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://kit-e.ru/redirect.php?link=https://cbdoilmarketusa.com  http://www.86lawyer.com/go.aspx?url=https://cbdoilmarketusa.com   https://www.annapolisyc.com/default.aspx?p=TrackHyperlink&url=https://cbdoilmarketusa.com  https://33001400.r.bat.bing.com/?ld=d3ZfO62STmYNqOAwCFg1uutjVUCUwC1MlRUHJHUbrZuUQtu_6VKMh7ZZVbyLvT43IJE5v-2d2ZK27c91bctXmoAVerUT4Y1Sytqf-npqjlmqkNIUi0iX7w0ULblnO2B8NGH3NCTf0czWbMzThGSnvrHUTwrdhXeRhuC2PfgUctVprx76Hw&u=https://cbdoilmarketusa.com  http://maxinemillerstudios.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://travel.pchome.com.tw/api/redirect.php?c=slide_agoda&url=https://cbdoilmarketusa.com \nhttp://ihaterushlimbaugh.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://racketreducing.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.xiaoyaji.net/bbs/redirect.php?tid=21516&goto=cbdoilmarketusa.com   http://credit-repair-law-firm.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://passport.linkonlineworld.com/forgotpassword.aspx?culture=en-us&returnurl=https://cbdoilmarketusa.com/   http://www.wfrcp.org.uk/goto-link.php?link_id=22&url=https://cbdoilmarketusa.com  http://gcmylove.com/index.php?g=Index&c=Recognition&a=see_login_qrcode&referer=https://cbdoilmarketusa.com  http://goldsboroopenhouse.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.stsennenchurch.org.uk/goto-link.php?link_id=15&url=https://cbdoilmarketusa.com \n \n \n \n \n \nhttp://slpsfd.org/forum/index.php?topic=20374.new#new\nhttp://marketsquaremusic.com/product/eleanor-mcevoy-yola/#comment-11074\nhttp://sxt.ch/forum/viewtopic.php?pid=94539#p94539\nhttp://www.piterenka.ru/forum/viewtopic.php?f=4&t=28037\nhttp://tszh-avangard.ru/forum/viewtopic.php?f=4&t=142785\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8088, "cpu_time_ms": 93, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s245297178", "group_id": "codeNet:p03941", "input_text": "http://referencevalley.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://northtexhm.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://nova-measurements.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://columbuslocalnews.tv/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://instituto-americas.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   https://www.footez.es/index.asp?ordencomercio=titulo_desc&goto=https://cbdoilmarketusa.com  http://pqb.infinitesite.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://freightjit.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://runforantarctica.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.vulnerable-site.com/redirect.php?redirect=https://cbdoilmarketusa.com  http://ernestpevny.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://indocardboard.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://kagitbardak.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://altaexpress.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://anubia.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://travelchannelinternational.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.akynzeo.events/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://mesirowinsuranceservices.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://classicgarageshoptalk.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://dog-lang.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://srp-americas.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.klintrial.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://inva-kolesnica.ru/go/url=cbdoilmarketusa.com   http://zgh.terriann.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://offshorefinancial.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.bilgisayar.in/jump.php?url=https://cbdoilmarketusa.com   http://autoeuro.ru/bitrix/rk.php?id=12&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B12%5D+%5Bequipment%5D+Mactak&goto=https://cbdoilmarketusa.com \nhttp://vlrw.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://x-fisher.org.ua/r/go.php?url=https://cbdoilmarketusa.com   http://www.stclairbaptist.org/System/UserProfile.asp?id=44602&func=signup&referer=https://cbdoilmarketusa.com   http://vitebskjust.gov.by/bitrix/rk.php?event1=file&event2=download&goto=cbdoilmarketusa.com  http://schaeferinvestments.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://afhspatriots.com/Goto.asp?url=https://cbdoilmarketusa.com  http://officialbruckheimer.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://callidussoftware.es/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://oxfordcourtsuites.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.affiliatedsettlementagents.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://westcoastvinylwindows.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://oaklandcoin.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://amerisbanks.life/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.zamowkwiaty24.pl/do/countryAndCurrency?referer=https://cbdoilmarketusa.com   http://simivalleyperio.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://saltspachicago.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://fairnessnaturally.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://experiencialmba.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.mes-vt.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://heide-iravani-gets-fired.xoxohth.com/go.php?url=https://cbdoilmarketusa.com   https://ns.vladregion.ru/bitrix/rk.php?id=13581&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B13581%5D+%5BCENTER_2%5D+%D0%94%D0%BE%D0%B1%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%B4+%D0%91%D0%B5%D0%BB%D0%BA%D0%B0&goto=https://cbdoilmarketusa.com   http://uplandssnoqualmievalley.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://cuntworship.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://fctconline.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://vip-professionals.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://pittsburghenergylawyer.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://myfirstdog.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://shouldercushion.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://worldcomedyawards.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://remittobuy.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://dominionmandate.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ihavenoproof.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://rivercruisingauthority.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://fountain.manchesterlocalschools.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://chiptrack.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://johnstonbasketballclub.com/Goto.asp?url=https://cbdoilmarketusa.com \nhttp://www.campusfiresafety.org/LinkClick.aspx?link=https://cbdoilmarketusa.com  http://iamaboveit.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://lenapevalleypatriots.leag1.com/Goto.asp?url=https://cbdoilmarketusa.com   http://blasting-abrasives.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://leadinghealthsystemcoalition.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://nutrisurge.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://bunnyranch.jp/2ch/kowai/access.php?url=https://cbdoilmarketusa.com/  http://mdaway.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://oyj.oppllc.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.redcodewebservices.com/redirect.aspx?destination=https://cbdoilmarketusa.com/  http://www.bbcedu.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.ap.camcom.gov.it/Dati/visitexe.asp?IDDato=60374&IDUS=undefined&goto=https://cbdoilmarketusa.com   http://neacompany.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.cio360.net/index.php?m=poster&c=index&a=poster_click&sitespaceid=1&id=326&url=https://cbdoilmarketusa.com   http://lesson-planhub.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://napfa.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://huntingtonlearning.co.nz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://vvh.lampstyles.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://academystores.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ksaj.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.yessaudi.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://boszv.com/forum/redirect.php?fid=143&tid=3941726&goto=cbdoilmarketusa.com  http://factsaboutgenerics.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://greenbay-packers.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://artfilmproduction.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://kingsley.idehen.net/PivotViewer/?url=https://cbdoilmarketusa.com/   http://kickasana.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \n \n \n \n \n \nhttp://sr.leet.cz/viewtopic.php?f=16&t=215\nhttps://unfaire.ch/showthread.php?tid=15629&pid=17090#pid17090\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=30178\nhttp://theposhmedia.com/forum/showthread.php?tid=81728\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=30176\n", "language": "Lisp", "metadata": {"date": 1547958093, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s245297178.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s245297178", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://referencevalley.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://northtexhm.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://nova-measurements.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://columbuslocalnews.tv/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://instituto-americas.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   https://www.footez.es/index.asp?ordencomercio=titulo_desc&goto=https://cbdoilmarketusa.com  http://pqb.infinitesite.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://freightjit.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://runforantarctica.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.vulnerable-site.com/redirect.php?redirect=https://cbdoilmarketusa.com  http://ernestpevny.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://indocardboard.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://kagitbardak.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://altaexpress.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://anubia.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://travelchannelinternational.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.akynzeo.events/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://mesirowinsuranceservices.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://classicgarageshoptalk.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://dog-lang.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://srp-americas.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.klintrial.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://inva-kolesnica.ru/go/url=cbdoilmarketusa.com   http://zgh.terriann.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://offshorefinancial.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.bilgisayar.in/jump.php?url=https://cbdoilmarketusa.com   http://autoeuro.ru/bitrix/rk.php?id=12&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B12%5D+%5Bequipment%5D+Mactak&goto=https://cbdoilmarketusa.com \nhttp://vlrw.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://x-fisher.org.ua/r/go.php?url=https://cbdoilmarketusa.com   http://www.stclairbaptist.org/System/UserProfile.asp?id=44602&func=signup&referer=https://cbdoilmarketusa.com   http://vitebskjust.gov.by/bitrix/rk.php?event1=file&event2=download&goto=cbdoilmarketusa.com  http://schaeferinvestments.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://afhspatriots.com/Goto.asp?url=https://cbdoilmarketusa.com  http://officialbruckheimer.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://callidussoftware.es/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://oxfordcourtsuites.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.affiliatedsettlementagents.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://westcoastvinylwindows.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://oaklandcoin.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://amerisbanks.life/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.zamowkwiaty24.pl/do/countryAndCurrency?referer=https://cbdoilmarketusa.com   http://simivalleyperio.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://saltspachicago.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://fairnessnaturally.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://experiencialmba.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.mes-vt.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://heide-iravani-gets-fired.xoxohth.com/go.php?url=https://cbdoilmarketusa.com   https://ns.vladregion.ru/bitrix/rk.php?id=13581&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B13581%5D+%5BCENTER_2%5D+%D0%94%D0%BE%D0%B1%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%B4+%D0%91%D0%B5%D0%BB%D0%BA%D0%B0&goto=https://cbdoilmarketusa.com   http://uplandssnoqualmievalley.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://cuntworship.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://fctconline.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://vip-professionals.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://pittsburghenergylawyer.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://myfirstdog.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://shouldercushion.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://worldcomedyawards.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://remittobuy.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://dominionmandate.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ihavenoproof.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://rivercruisingauthority.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://fountain.manchesterlocalschools.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://chiptrack.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://johnstonbasketballclub.com/Goto.asp?url=https://cbdoilmarketusa.com \nhttp://www.campusfiresafety.org/LinkClick.aspx?link=https://cbdoilmarketusa.com  http://iamaboveit.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://lenapevalleypatriots.leag1.com/Goto.asp?url=https://cbdoilmarketusa.com   http://blasting-abrasives.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://leadinghealthsystemcoalition.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://nutrisurge.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://bunnyranch.jp/2ch/kowai/access.php?url=https://cbdoilmarketusa.com/  http://mdaway.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://oyj.oppllc.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.redcodewebservices.com/redirect.aspx?destination=https://cbdoilmarketusa.com/  http://www.bbcedu.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.ap.camcom.gov.it/Dati/visitexe.asp?IDDato=60374&IDUS=undefined&goto=https://cbdoilmarketusa.com   http://neacompany.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.cio360.net/index.php?m=poster&c=index&a=poster_click&sitespaceid=1&id=326&url=https://cbdoilmarketusa.com   http://lesson-planhub.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://napfa.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://huntingtonlearning.co.nz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://vvh.lampstyles.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://academystores.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ksaj.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.yessaudi.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://boszv.com/forum/redirect.php?fid=143&tid=3941726&goto=cbdoilmarketusa.com  http://factsaboutgenerics.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://greenbay-packers.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://artfilmproduction.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://kingsley.idehen.net/PivotViewer/?url=https://cbdoilmarketusa.com/   http://kickasana.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \n \n \n \n \n \nhttp://sr.leet.cz/viewtopic.php?f=16&t=215\nhttps://unfaire.ch/showthread.php?tid=15629&pid=17090#pid17090\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=30178\nhttp://theposhmedia.com/forum/showthread.php?tid=81728\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=30176\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8007, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s754150632", "group_id": "codeNet:p03941", "input_text": "http://www.aimbp.com/__media__/js/netsoltrademark.php?d=&ampcbdoilmarketusa.com  http://alinalyons.com/redir.php?url=https://cbdoilmarketusa.com   http://fc.standardandpoors.com/sites/client/tdanl/TDANewsletter/link_track.vm?topicId=sep10&force=true&source=pdf&redir=https://cbdoilmarketusa.com   http://tcz.wordcards.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://old.sksu.su/go/url=https://cbdoilmarketusa.com   http://www.momsnboys.com/cgi-bin/at3/out.cgi?id=242&tag=toplist&trade=https://cbdoilmarketusa.com  http://americanlottopool.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.retrotubeclips.com/acj/out.php?id=146&tag=toplist&trade=https://cbdoilmarketusa.com   http://gemclassics.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://littlesmartypants.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://edonbas.ru/go/url=cbdoilmarketusa.com   http://guysgear.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://unfinishedbusinesswithgod.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://141129485.r.bat.bing.com/?ld=d3B0rH7gwinBV3WWibQcVdtDVUCUxM4Gs9o_t2JAU__E79vHfQowlUkR47aF677Qes_b6A3x89dY5QJHiCrPkGmgeXIRUoAqRIQrEvpeeXHf_a14XZc192W3UlH7QukruWqFhdePJ-Fn-r9g7lnhpAwnQIODQvuQP2T8NhY6wSC4FSBpp7&u=https://cbdoilmarketusa.com   http://chefbaja.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://usaroof.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://lexingtoncreditspecialists.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://parallelseo.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://capecoral.eztouse.com/redirect.asp?weburl=cbdoilmarketusa.com  http://duniadropship.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://thehotwaterstore.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://fordebtreliefnow.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.prontolanka.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://facemeyerlaw.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://fhq.czechair.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://vacubagit.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://nepredators.com/Goto.asp?url=https://cbdoilmarketusa.com \nhttp://ifrecrealestateschools.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://cndongkai.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://xrosspoint.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   https://www.theresamah.com/r?u=https://cbdoilmarketusa.com  http://facialrape.com/cgi-bin/out.cgi?id=735&l=top_top&u=https://cbdoilmarketusa.com   http://www.lesbian-girlfriends.com/cgi-bin/out.cgi?ses=4G2e6Zmrd2&id=128&url=https://cbdoilmarketusa.com  https://ad-log.net/link.php?i=561e2df9139b1&m=570f5d053502c&guid=ON&url=https://cbdoilmarketusa.com  http://sanfranciscowellnesscoaching.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.allynews.com.ar/tl.php?p=125/119/rs/52f/tj/rs//https://cbdoilmarketusa.com/ \nhttp://www.tlilian.com/url.php?url=https://cbdoilmarketusa.com  http://pdsmeters.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   https://173097178.r.bat.bing.com/?ld=d3lp0vksE6FavSD6zTyWvMHDVUCUxR1vO34n4b8sLkt7wg-pncsavNc8F7wHubfa8EhSJsi07Xi-NQP-ybaHfY8M06OdtGmN-Wtr3BocTx509Ie1-YW3kucJVp11a03YyZnfvGIFenEAqjPCp4gRY9LbLsAoU&u=https://cbdoilmarketusa.com   http://xy720a.boiea.cn/dq/go.php?url=https://cbdoilmarketusa.com  http://www.peigeo.re/accueil/envoyer_a_un_ami?url=https://cbdoilmarketusa.com   http://cantech.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://packageyourdevice.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://mypocketelections.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   https://zhilan.net/url.php?url=https://cbdoilmarketusa.com \nhttp://streetpilot.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://sanfranciscoarena.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.geotrans.md/banner_sys/redirect.asp?id=364&url=https://cbdoilmarketusa.com   http://jctxwx.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://bkbtf.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.doctor-navi.com/cgi/hospital-search-engine2/rank.cgi?mode=link&id=14979&url=https://cbdoilmarketusa.com  http://proactivesurveysolutions.mobi/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.tendencias-moda.com/feedcanalmail.php?location=https://cbdoilmarketusa.com/   http://digitalindustries.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://kidskool.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://mytechprofessor.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://indyracing.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://yct.rfmonitor.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://undercovergirlenterprises.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://terni.azinet.it/aziende/clienti-sicuri-aziende-privati-pregiudizievoli-protesti/49218/link.php?id=49218&link=https://cbdoilmarketusa.com  http://www.julieharrisphotography.com/blog/go.php?https://cbdoilmarketusa.com  http://www.esp-cloud.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://airfred.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://yourchevydealeronnorthlake.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ushealthcarejobs.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://lyj.7worldtradecenter.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://alimama-group.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://gesuender-abnehmen.com/index.php?t=rview&th=5719&goto=cbdoilmarketusa.com   http://captainjoe.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://kumakun.com/cgi-bin/kboard.cgi?mode=res_html&owner=proscar&url=cbdoilmarketusa.com  http://dom-press.com/go.php?url=https://cbdoilmarketusa.com   https://cucinadisartini.com/_m/index.php?a=free_page/goto_mobile&referer=https://cbdoilmarketusa.com \nhttp://logi141.xiti.com/go.click?xts=322451&s2=1&p=doc&clic=S&type=click&url=https://cbdoilmarketusa.com  http://specialtyminerals.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://paineweber.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.hospitalmetropolitano.com.br/includes/go.php?url=cbdoilmarketusa.com  http://axevideos.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://rob.teamcaller.net/login.do?go=https://cbdoilmarketusa.com  http://www.talgals.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://aicglobal.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.ims-padds.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.hotuna.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://missuniverseturksandcaicos.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.cardinalseanblog.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://ppgadvisors.co.uk/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ownclassified.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://targetinsurance.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://handurance.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.webmovye.gq/out.php?l=https://cbdoilmarketusa.com   http://thepowerofseniors.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \n \n \n \n \n \nhttp://taiyi.one/viewtopic.php?pid=274781#p274781\nhttp://niklever.com/spritoon/forum/viewtopic.php?f=5&t=109811\nhttps://www.wasdspace.ro/forum/showthread.php?tid=18655\nhttp://forum.gta-v-trucking.com/index.php?topic=3.new#new\nhttp://www.nongyai101.org/webboard/index.php?topic=2277.new#new\n", "language": "Lisp", "metadata": {"date": 1547945228, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s754150632.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s754150632", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.aimbp.com/__media__/js/netsoltrademark.php?d=&ampcbdoilmarketusa.com  http://alinalyons.com/redir.php?url=https://cbdoilmarketusa.com   http://fc.standardandpoors.com/sites/client/tdanl/TDANewsletter/link_track.vm?topicId=sep10&force=true&source=pdf&redir=https://cbdoilmarketusa.com   http://tcz.wordcards.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://old.sksu.su/go/url=https://cbdoilmarketusa.com   http://www.momsnboys.com/cgi-bin/at3/out.cgi?id=242&tag=toplist&trade=https://cbdoilmarketusa.com  http://americanlottopool.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.retrotubeclips.com/acj/out.php?id=146&tag=toplist&trade=https://cbdoilmarketusa.com   http://gemclassics.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://littlesmartypants.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://edonbas.ru/go/url=cbdoilmarketusa.com   http://guysgear.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://unfinishedbusinesswithgod.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  https://141129485.r.bat.bing.com/?ld=d3B0rH7gwinBV3WWibQcVdtDVUCUxM4Gs9o_t2JAU__E79vHfQowlUkR47aF677Qes_b6A3x89dY5QJHiCrPkGmgeXIRUoAqRIQrEvpeeXHf_a14XZc192W3UlH7QukruWqFhdePJ-Fn-r9g7lnhpAwnQIODQvuQP2T8NhY6wSC4FSBpp7&u=https://cbdoilmarketusa.com   http://chefbaja.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://usaroof.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://lexingtoncreditspecialists.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://parallelseo.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://capecoral.eztouse.com/redirect.asp?weburl=cbdoilmarketusa.com  http://duniadropship.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://thehotwaterstore.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://fordebtreliefnow.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.prontolanka.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://facemeyerlaw.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://fhq.czechair.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://vacubagit.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://nepredators.com/Goto.asp?url=https://cbdoilmarketusa.com \nhttp://ifrecrealestateschools.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://cndongkai.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://xrosspoint.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   https://www.theresamah.com/r?u=https://cbdoilmarketusa.com  http://facialrape.com/cgi-bin/out.cgi?id=735&l=top_top&u=https://cbdoilmarketusa.com   http://www.lesbian-girlfriends.com/cgi-bin/out.cgi?ses=4G2e6Zmrd2&id=128&url=https://cbdoilmarketusa.com  https://ad-log.net/link.php?i=561e2df9139b1&m=570f5d053502c&guid=ON&url=https://cbdoilmarketusa.com  http://sanfranciscowellnesscoaching.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.allynews.com.ar/tl.php?p=125/119/rs/52f/tj/rs//https://cbdoilmarketusa.com/ \nhttp://www.tlilian.com/url.php?url=https://cbdoilmarketusa.com  http://pdsmeters.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   https://173097178.r.bat.bing.com/?ld=d3lp0vksE6FavSD6zTyWvMHDVUCUxR1vO34n4b8sLkt7wg-pncsavNc8F7wHubfa8EhSJsi07Xi-NQP-ybaHfY8M06OdtGmN-Wtr3BocTx509Ie1-YW3kucJVp11a03YyZnfvGIFenEAqjPCp4gRY9LbLsAoU&u=https://cbdoilmarketusa.com   http://xy720a.boiea.cn/dq/go.php?url=https://cbdoilmarketusa.com  http://www.peigeo.re/accueil/envoyer_a_un_ami?url=https://cbdoilmarketusa.com   http://cantech.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://packageyourdevice.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://mypocketelections.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   https://zhilan.net/url.php?url=https://cbdoilmarketusa.com \nhttp://streetpilot.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://sanfranciscoarena.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.geotrans.md/banner_sys/redirect.asp?id=364&url=https://cbdoilmarketusa.com   http://jctxwx.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://bkbtf.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.doctor-navi.com/cgi/hospital-search-engine2/rank.cgi?mode=link&id=14979&url=https://cbdoilmarketusa.com  http://proactivesurveysolutions.mobi/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.tendencias-moda.com/feedcanalmail.php?location=https://cbdoilmarketusa.com/   http://digitalindustries.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://kidskool.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://mytechprofessor.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://indyracing.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://yct.rfmonitor.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://undercovergirlenterprises.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://terni.azinet.it/aziende/clienti-sicuri-aziende-privati-pregiudizievoli-protesti/49218/link.php?id=49218&link=https://cbdoilmarketusa.com  http://www.julieharrisphotography.com/blog/go.php?https://cbdoilmarketusa.com  http://www.esp-cloud.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://airfred.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://yourchevydealeronnorthlake.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ushealthcarejobs.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://lyj.7worldtradecenter.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://alimama-group.info/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://gesuender-abnehmen.com/index.php?t=rview&th=5719&goto=cbdoilmarketusa.com   http://captainjoe.biz/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://kumakun.com/cgi-bin/kboard.cgi?mode=res_html&owner=proscar&url=cbdoilmarketusa.com  http://dom-press.com/go.php?url=https://cbdoilmarketusa.com   https://cucinadisartini.com/_m/index.php?a=free_page/goto_mobile&referer=https://cbdoilmarketusa.com \nhttp://logi141.xiti.com/go.click?xts=322451&s2=1&p=doc&clic=S&type=click&url=https://cbdoilmarketusa.com  http://specialtyminerals.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://paineweber.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.hospitalmetropolitano.com.br/includes/go.php?url=cbdoilmarketusa.com  http://axevideos.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://rob.teamcaller.net/login.do?go=https://cbdoilmarketusa.com  http://www.talgals.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://aicglobal.us/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.ims-padds.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \nhttp://www.hotuna.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://missuniverseturksandcaicos.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://www.cardinalseanblog.org/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://ppgadvisors.co.uk/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://ownclassified.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com   http://targetinsurance.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://handurance.net/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com  http://www.webmovye.gq/out.php?l=https://cbdoilmarketusa.com   http://thepowerofseniors.com/__media__/js/netsoltrademark.php?d=cbdoilmarketusa.com \n \n \n \n \n \nhttp://taiyi.one/viewtopic.php?pid=274781#p274781\nhttp://niklever.com/spritoon/forum/viewtopic.php?f=5&t=109811\nhttps://www.wasdspace.ro/forum/showthread.php?tid=18655\nhttp://forum.gta-v-trucking.com/index.php?topic=3.new#new\nhttp://www.nongyai101.org/webboard/index.php?topic=2277.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8100, "cpu_time_ms": 90, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s739777840", "group_id": "codeNet:p03941", "input_text": "http://www.chapelhouse.co.uk/kia/send-to-friend/default.aspx?url=https://cannacbdoilrx.com  http://redpeppertube.com/streamrotator/out.php?l=gXSNSNozSKHQy&u=tp/out.php?link=17&s=1&url=cannacbdoilrx.com   http://timewarnercablecenter.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.ethington.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.bip.kielce.eu/podglad/-/asset_publisher/BAkP/content/przetarg-nieograniczony-or-iii-341-3-62-09?doAsUserId=tytmerluf&redirect=https://cannacbdoilrx.com   https://www.ustinka.kz/bitrix/rk.php?id=45&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B45%5D+%5Bindex240x400_after_articles%5D+%D0%93%D0%BB%D0%B0%D0%B2%D0%BD%D0%B0%D1%8F+240x400+%D1%81%D0%BF%D1%80%D0%B0%D0%B2%D0%B0+%D0%BE%D1%82+%D1%81%D1%82%D0%B0%D1%82%D0%B5%D0%B9&goto=cannacbdoilrx.com  http://stubby2.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://worldoftibia.ru/out.php?link=https://cannacbdoilrx.com   http://harcourtlearningdirect.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.xtqgzx.com/blog/go.asp?url=https://cannacbdoilrx.com  http://bayrou2017.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://c1o.qbarbecue.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://barvaskintherapy.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://jwu.jreeves-law.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.zaragoza-web.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://baisha.huizan.top/index.php?g=Appoint&c=Changecity&a=go&city=yl&referer=https://cannacbdoilrx.com  http://tutoroctavian.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://fortlewishomes.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://citadelmgmt.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://assets7.elephone.hk/static/redirect?url=https://cannacbdoilrx.com   http://www.matureland.net/cgi-bin/atx/out.cgi?id=98&trade=https://cannacbdoilrx.com   http://forum.ahigh.ru/away.htm?link=https://cannacbdoilrx.com  http://camoplaysets.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.quilttrips.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://spring-time.org/redirect/?url=https://cannacbdoilrx.com  http://movieawards.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://desmoineshomestyle.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://tpbfcu.org/redirect.php?link=https://cannacbdoilrx.com  http://gumbum.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://everypropertylisted.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.usacademics-ar.com/redirect.php?school=UCIEP&schoolid=80&language=ar&adsize=200x100&adtype=jpg&redirect=https://cannacbdoilrx.com  http://rate-razvlechenija-i-otdyh.dirx.ru/click.php?url=https://cannacbdoilrx.com   http://www.implantcenter.it/budapest-lokal-info/1045/go?url=https://cannacbdoilrx.com  http://www.fsc-neulingen.de/mobiquo/smartbanner/welcome.php?referer=http%3A%2F%2Fwww.fsc-neulingen.de%2Findex.php%2Fforum%2Fcredits&code=ae20b84a842ecb7d4f1eb863af7e6eae&board_url=https://cannacbdoilrx.com  http://samuelspc.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://fairwaymediallc.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.abpet.co.kr/opage/redirect.php?title=%EB%B9%84%EB%B0%94%ED%85%8D&url=https://cannacbdoilrx.com  http://www.allsensor.ru/forum/away.php?s=https://cannacbdoilrx.com   http://yashabab.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://code-foundry.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.co-concepts.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://realestatesalesgalveston.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.igus.bo/iProSvc/SocialBookmarks.aspx?c=US&l=en&url=https://cannacbdoilrx.com  http://prophotoborders.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.kutjes.ws/cgi-bin/a2/out.cgi?id=18&l=toplist&u=https://cannacbdoilrx.com \nhttp://foundationsoftse.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://phpvi.com/redirect.php?tid=553&goto=cannacbdoilrx.com   http://bbs.yizuren.com/redirect.php?tid=42800&goto=cannacbdoilrx.com   http://blazingtrade.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://seaportresidences.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   https://m.ozreport.com/redirect.php?https://cannacbdoilrx.com  http://varickrealty.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.babyssmokehousefranchise.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://cuteteenie.com/cgi-bin/out.cgi?id=133&l=top_top&req=1&t=100t&u=https://cannacbdoilrx.com \nhttp://newhollywoodawards.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://addaxandorxfoundation.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://wildwoodclub.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://tellaero.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://fisher-investment-guru.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://totalipcom.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://discount-pill.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://universalcoingoldbullion.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://farmsteadingchick.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.grodna.ru/go.php?https://cannacbdoilrx.com/  http://david-weekly.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://l4d-support.com/go?https://cannacbdoilrx.com   http://dartmoor-railway.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://stlukesmagicvalley.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://enlightkids.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://chempetitive.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://us-chinatrading.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://luw.abstractsonline.at/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://imacorporate.biz/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://fredericaresales.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://search.ringscollection.com/click.php?url=https://cannacbdoilrx.com   http://austinfoodandwinefest.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://michigandentistreferrals.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://janejoyce.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://yellowaid.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://oasisforthesoul.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://takeiteasyproductions.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.arrivestaffing.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://nutriforme.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://stpetechildrens.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://myrubicon.ru/go.php?url=https://cannacbdoilrx.com  https://wssupport.ru/bitrix/rk.php?goto=https://cannacbdoilrx.com   http://en.e-hotel-pattaya.com/common/link.php?a=https://cannacbdoilrx.com  http://www.lovelymauihomes.com/index.php?setmonths=360&setpayment=0.8&setrate=0.05&jaxval=&goto=cannacbdoilrx.com  http://madna.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://afonsoferreira.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \n \n \n \n \n \nhttps://forum.sofort.support/index.php/topic,61556.new.html#new\nhttps://alvoria.pl/forum/index.php?topic=10664.new#new\nhttp://forum.rodeal.ru/viewtopic.php?f=7&t=149609\nhttp://www.rmlalliance.com/forum/index.php?topic=19781.new#new\nhttp://conceptsnclarity.com/forum/index.php?topic=116076.new#new\n", "language": "Lisp", "metadata": {"date": 1547900176, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s739777840.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s739777840", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.chapelhouse.co.uk/kia/send-to-friend/default.aspx?url=https://cannacbdoilrx.com  http://redpeppertube.com/streamrotator/out.php?l=gXSNSNozSKHQy&u=tp/out.php?link=17&s=1&url=cannacbdoilrx.com   http://timewarnercablecenter.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.ethington.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.bip.kielce.eu/podglad/-/asset_publisher/BAkP/content/przetarg-nieograniczony-or-iii-341-3-62-09?doAsUserId=tytmerluf&redirect=https://cannacbdoilrx.com   https://www.ustinka.kz/bitrix/rk.php?id=45&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B45%5D+%5Bindex240x400_after_articles%5D+%D0%93%D0%BB%D0%B0%D0%B2%D0%BD%D0%B0%D1%8F+240x400+%D1%81%D0%BF%D1%80%D0%B0%D0%B2%D0%B0+%D0%BE%D1%82+%D1%81%D1%82%D0%B0%D1%82%D0%B5%D0%B9&goto=cannacbdoilrx.com  http://stubby2.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://worldoftibia.ru/out.php?link=https://cannacbdoilrx.com   http://harcourtlearningdirect.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.xtqgzx.com/blog/go.asp?url=https://cannacbdoilrx.com  http://bayrou2017.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://c1o.qbarbecue.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://barvaskintherapy.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://jwu.jreeves-law.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.zaragoza-web.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://baisha.huizan.top/index.php?g=Appoint&c=Changecity&a=go&city=yl&referer=https://cannacbdoilrx.com  http://tutoroctavian.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://fortlewishomes.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://citadelmgmt.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://assets7.elephone.hk/static/redirect?url=https://cannacbdoilrx.com   http://www.matureland.net/cgi-bin/atx/out.cgi?id=98&trade=https://cannacbdoilrx.com   http://forum.ahigh.ru/away.htm?link=https://cannacbdoilrx.com  http://camoplaysets.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.quilttrips.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://spring-time.org/redirect/?url=https://cannacbdoilrx.com  http://movieawards.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://desmoineshomestyle.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://tpbfcu.org/redirect.php?link=https://cannacbdoilrx.com  http://gumbum.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://everypropertylisted.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.usacademics-ar.com/redirect.php?school=UCIEP&schoolid=80&language=ar&adsize=200x100&adtype=jpg&redirect=https://cannacbdoilrx.com  http://rate-razvlechenija-i-otdyh.dirx.ru/click.php?url=https://cannacbdoilrx.com   http://www.implantcenter.it/budapest-lokal-info/1045/go?url=https://cannacbdoilrx.com  http://www.fsc-neulingen.de/mobiquo/smartbanner/welcome.php?referer=http%3A%2F%2Fwww.fsc-neulingen.de%2Findex.php%2Fforum%2Fcredits&code=ae20b84a842ecb7d4f1eb863af7e6eae&board_url=https://cannacbdoilrx.com  http://samuelspc.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://fairwaymediallc.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.abpet.co.kr/opage/redirect.php?title=%EB%B9%84%EB%B0%94%ED%85%8D&url=https://cannacbdoilrx.com  http://www.allsensor.ru/forum/away.php?s=https://cannacbdoilrx.com   http://yashabab.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://code-foundry.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.co-concepts.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://realestatesalesgalveston.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.igus.bo/iProSvc/SocialBookmarks.aspx?c=US&l=en&url=https://cannacbdoilrx.com  http://prophotoborders.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.kutjes.ws/cgi-bin/a2/out.cgi?id=18&l=toplist&u=https://cannacbdoilrx.com \nhttp://foundationsoftse.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://phpvi.com/redirect.php?tid=553&goto=cannacbdoilrx.com   http://bbs.yizuren.com/redirect.php?tid=42800&goto=cannacbdoilrx.com   http://blazingtrade.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://seaportresidences.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   https://m.ozreport.com/redirect.php?https://cannacbdoilrx.com  http://varickrealty.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.babyssmokehousefranchise.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://cuteteenie.com/cgi-bin/out.cgi?id=133&l=top_top&req=1&t=100t&u=https://cannacbdoilrx.com \nhttp://newhollywoodawards.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://addaxandorxfoundation.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://wildwoodclub.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://tellaero.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://fisher-investment-guru.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://totalipcom.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://discount-pill.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://universalcoingoldbullion.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://farmsteadingchick.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.grodna.ru/go.php?https://cannacbdoilrx.com/  http://david-weekly.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://l4d-support.com/go?https://cannacbdoilrx.com   http://dartmoor-railway.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://stlukesmagicvalley.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://enlightkids.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://chempetitive.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://us-chinatrading.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://luw.abstractsonline.at/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://imacorporate.biz/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://fredericaresales.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://search.ringscollection.com/click.php?url=https://cannacbdoilrx.com   http://austinfoodandwinefest.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://michigandentistreferrals.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://janejoyce.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://yellowaid.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://oasisforthesoul.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://takeiteasyproductions.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.arrivestaffing.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://nutriforme.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://stpetechildrens.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://myrubicon.ru/go.php?url=https://cannacbdoilrx.com  https://wssupport.ru/bitrix/rk.php?goto=https://cannacbdoilrx.com   http://en.e-hotel-pattaya.com/common/link.php?a=https://cannacbdoilrx.com  http://www.lovelymauihomes.com/index.php?setmonths=360&setpayment=0.8&setrate=0.05&jaxval=&goto=cannacbdoilrx.com  http://madna.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://afonsoferreira.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \n \n \n \n \n \nhttps://forum.sofort.support/index.php/topic,61556.new.html#new\nhttps://alvoria.pl/forum/index.php?topic=10664.new#new\nhttp://forum.rodeal.ru/viewtopic.php?f=7&t=149609\nhttp://www.rmlalliance.com/forum/index.php?topic=19781.new#new\nhttp://conceptsnclarity.com/forum/index.php?topic=116076.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8021, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s772020513", "group_id": "codeNet:p03941", "input_text": "http://limbaughblog.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://rrsolutions.biz/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://glopolworld.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://trainingnews.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://arrowfeed.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://gamecrux.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.gordonroadevangelicalchurch.org.uk/goto-link.php?link_id=12&url=https://cannacbdoilrx.com  http://codes.coreskatemag.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   https://www.otimbi.com/out.php?link=https://cannacbdoilrx.com \nhttp://gulfdevelopment.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.greatlesbiansites.com/d/out?p=61&id=410011&c=145&url=https://cannacbdoilrx.com   http://sss.pgroz-kxg.lgius.anonimizing.com/home287/createSession?referer=https://cannacbdoilrx.com   http://www.katebuyshomes.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://womenofourtime.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.vintv.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://akwaibomnewsonline.webmastersofafrica.com/news/index.php?url=https://cannacbdoilrx.com  http://www.trainingetc.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://kellerspringscrossing.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://restorepaymentsolutions.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://xcelarena.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.indianworldtrade.com/redirect.php?url=https://cannacbdoilrx.com   http://portaturk.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://santcom63.ru/forum/away.php?s=https://cannacbdoilrx.com   http://www.thaiall.com/cgi/clicko.pl?20819&cannacbdoilrx.com  http://ivaudeville.pro/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.forecresults.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.vidaily.ru/go?https://cannacbdoilrx.com \nhttp://prolids.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://ixxora.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://schengenassicurazione.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://jewishvi.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.webpayrollhr.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://cdwretail.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.christchurchmarlborough.org.uk/goto-link.php?link_id=16&url=https://cannacbdoilrx.com  http://wolframlive.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://drktrll.com/cgi-bin/out.cgi?jop=dfd&link=thumbs&u=https://cannacbdoilrx.com \nhttp://www.photomalaysia.com/forums/forum/showcase/close-up-macro/102665-giant-mosquito?goto=cannacbdoilrx.com  https://officeofcivicinnovation.nationbuilder.com/r?u=https://cannacbdoilrx.com   https://k9jym.com/index.php/component/k2/item/105?fromurl=cannacbdoilrx.com   http://110disk.net/go.php?url=https://cannacbdoilrx.com  http://myopiacontroloregon.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://micacasegroup.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://tesconnect.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://tomhowlettsucks.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://thebruckheimer.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://ronrobinsandson.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://dpmurphlaw.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://vivabh.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://battletest.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.sale123.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://localtopia.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.eatwellfarms.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://hrexchange.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://cruisepoints.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.plateforme-services.com/webservices.php/utilisateur/getFrob?cle_api=56qsdf456qsd4f564ertyjxc&referer=https://cannacbdoilrx.com  http://virtualfilesystems.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://carre-frais.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.garyscohen.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.stajnia.pila.pl/kontakt.html?temat=blad404&referer=https://cannacbdoilrx.com   http://theafghanchild.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://2048.javbus2048.com/2048/goto.php?url=cannacbdoilrx.com  http://majesticwindowcleaning.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://belfinance.ru/upload/rk/892/892dff00406190ca3c07baf801af2f05.swf?flash_link=cannacbdoilrx.com \nhttp://ru.costamedia.es/go.php?u=https://cannacbdoilrx.com  http://rageplastic.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://himalayacapital.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://w.wimdekoning.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://troop.monstertrout.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://smellmyskunk.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://syroya.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.fluxpc.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://geragoslaw.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://ydq.nextgenerationlighting.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.salentomipiaci.it/index.php/en/blog-listing-page/item/21-salento-mi-piaci?fromurl=cannacbdoilrx.com   https://www.portagedemocrats.org/r?u=https://cannacbdoilrx.com   http://yourcompanionsolution.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://lynnskitchen.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.kimwmiller.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://mediatheque.quesnoysurdeule.fr/opac/catalog/bibrecord?id=8878593685442571885&referer=https://cannacbdoilrx.com  http://732doctors.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://eus-s.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.harmonicbits.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://breitling.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.clubmed.se/cm/home2014/redirect/114/ES?url=https://cannacbdoilrx.com   http://growup.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.sirisahome.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://weblistok.com/away.php?https://cannacbdoilrx.com  http://recyclemore.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://earthlink.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://dotell.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \n \n \n \n \n \nhttps://movimentodelleliberta.com/forum/index.php?topic=1353596.new#new\nhttp://cnywarlock.com/forum/index.php?topic=48687.new#new\nhttp://www.scrollsguide.com/forum/viewtopic.php?f=7&t=26904\nhttp://forums.sanityrp.us/showthread.php?tid=509&pid=31965#pid31965\nhttps://forum.itabcabc.ru/viewtopic.php?f=5&t=114810\n", "language": "Lisp", "metadata": {"date": 1547886065, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s772020513.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s772020513", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://limbaughblog.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://rrsolutions.biz/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://glopolworld.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://trainingnews.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://arrowfeed.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://gamecrux.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.gordonroadevangelicalchurch.org.uk/goto-link.php?link_id=12&url=https://cannacbdoilrx.com  http://codes.coreskatemag.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   https://www.otimbi.com/out.php?link=https://cannacbdoilrx.com \nhttp://gulfdevelopment.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.greatlesbiansites.com/d/out?p=61&id=410011&c=145&url=https://cannacbdoilrx.com   http://sss.pgroz-kxg.lgius.anonimizing.com/home287/createSession?referer=https://cannacbdoilrx.com   http://www.katebuyshomes.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://womenofourtime.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.vintv.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://akwaibomnewsonline.webmastersofafrica.com/news/index.php?url=https://cannacbdoilrx.com  http://www.trainingetc.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://kellerspringscrossing.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://restorepaymentsolutions.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://xcelarena.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.indianworldtrade.com/redirect.php?url=https://cannacbdoilrx.com   http://portaturk.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://santcom63.ru/forum/away.php?s=https://cannacbdoilrx.com   http://www.thaiall.com/cgi/clicko.pl?20819&cannacbdoilrx.com  http://ivaudeville.pro/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.forecresults.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.vidaily.ru/go?https://cannacbdoilrx.com \nhttp://prolids.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://ixxora.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://schengenassicurazione.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://jewishvi.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.webpayrollhr.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://cdwretail.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.christchurchmarlborough.org.uk/goto-link.php?link_id=16&url=https://cannacbdoilrx.com  http://wolframlive.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://drktrll.com/cgi-bin/out.cgi?jop=dfd&link=thumbs&u=https://cannacbdoilrx.com \nhttp://www.photomalaysia.com/forums/forum/showcase/close-up-macro/102665-giant-mosquito?goto=cannacbdoilrx.com  https://officeofcivicinnovation.nationbuilder.com/r?u=https://cannacbdoilrx.com   https://k9jym.com/index.php/component/k2/item/105?fromurl=cannacbdoilrx.com   http://110disk.net/go.php?url=https://cannacbdoilrx.com  http://myopiacontroloregon.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://micacasegroup.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://tesconnect.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://tomhowlettsucks.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://thebruckheimer.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://ronrobinsandson.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://dpmurphlaw.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://vivabh.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://battletest.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.sale123.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://localtopia.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.eatwellfarms.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://hrexchange.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://cruisepoints.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.plateforme-services.com/webservices.php/utilisateur/getFrob?cle_api=56qsdf456qsd4f564ertyjxc&referer=https://cannacbdoilrx.com  http://virtualfilesystems.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://carre-frais.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.garyscohen.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.stajnia.pila.pl/kontakt.html?temat=blad404&referer=https://cannacbdoilrx.com   http://theafghanchild.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://2048.javbus2048.com/2048/goto.php?url=cannacbdoilrx.com  http://majesticwindowcleaning.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://belfinance.ru/upload/rk/892/892dff00406190ca3c07baf801af2f05.swf?flash_link=cannacbdoilrx.com \nhttp://ru.costamedia.es/go.php?u=https://cannacbdoilrx.com  http://rageplastic.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://himalayacapital.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://w.wimdekoning.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://troop.monstertrout.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://smellmyskunk.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://syroya.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.fluxpc.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://geragoslaw.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://ydq.nextgenerationlighting.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.salentomipiaci.it/index.php/en/blog-listing-page/item/21-salento-mi-piaci?fromurl=cannacbdoilrx.com   https://www.portagedemocrats.org/r?u=https://cannacbdoilrx.com   http://yourcompanionsolution.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://lynnskitchen.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.kimwmiller.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://mediatheque.quesnoysurdeule.fr/opac/catalog/bibrecord?id=8878593685442571885&referer=https://cannacbdoilrx.com  http://732doctors.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://eus-s.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://www.harmonicbits.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://breitling.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.clubmed.se/cm/home2014/redirect/114/ES?url=https://cannacbdoilrx.com   http://growup.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.sirisahome.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://weblistok.com/away.php?https://cannacbdoilrx.com  http://recyclemore.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://earthlink.info/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://dotell.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \n \n \n \n \n \nhttps://movimentodelleliberta.com/forum/index.php?topic=1353596.new#new\nhttp://cnywarlock.com/forum/index.php?topic=48687.new#new\nhttp://www.scrollsguide.com/forum/viewtopic.php?f=7&t=26904\nhttp://forums.sanityrp.us/showthread.php?tid=509&pid=31965#pid31965\nhttps://forum.itabcabc.ru/viewtopic.php?f=5&t=114810\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7578, "cpu_time_ms": 117, "memory_kb": 9448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s949239690", "group_id": "codeNet:p03941", "input_text": "http://beamentor.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.xwave.cn/go.asp?url=https://cannacbdoilrx.com   http://fordgtcentral.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://deerfacts.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://ibanpayment.us/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://moeobrazovanie.ru/redirect.php?to=https://cannacbdoilrx.com  http://at.catalog.hartmann.info/hartmann-shop/login/login.html;jsessionid=TbWsdU2iXNQ7BmYdn7jOL+6b?referer=https://cannacbdoilrx.com  http://bdj.donateyourcartoday.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://cobbdailydeals.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://nuimagesurgery.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://go.cartoon-dl.ir/transfer/index.php?url=https://cannacbdoilrx.com   https://swaeq.com/vb/showthread.php?goto=cannacbdoilrx.com   http://reservationsgreatwolflodge.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.voterchoicema.org/r?u=https://cannacbdoilrx.com   http://hemispheresolutionsltd.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://qgg.badforgood.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  https://www.stop-book.com/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fwww.compromat.ru%2Fpage_36751.htm&event3=+%D7%E8%ED%EE%E2%ED%E8%EA%E8+%E8+%E8%F5+%F1%E5%EC%FC%E8.+&goto=https://cannacbdoilrx.com   http://tzblm.com/engine/go.php?url=cannacbdoilrx.com \nhttp://m.kotlas-info.ru/vustug-info/away.php?to=cannacbdoilrx.com  http://spectrumhealingartscenter.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://3gain.net/link.php?id=N0000182&adwares=A0000001&url=https://cannacbdoilrx.com   http://www.uesoundadvice.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://bcbusinessbrokers.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://theausinstitute.nationbuilder.com/r?u=https://cannacbdoilrx.com  http://bookmarketingideas.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://flatpack.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://axa-advisors.biz/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://a1chimneyservice.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.jalight.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.tjyoga.com/bbs/redirect.php?fid=74&tid=34&goto=cannacbdoilrx.com   http://wuv.makehimknown.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://belletrist.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://marshfieldclinic.co/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://drumparties.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://michaelkinney.ca/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://thrillworkz.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://pfchangscareers.us/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://mollybelle.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://comicchats.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.starlightdancesport.com/dnn/LinkClick.aspx?link=https://cannacbdoilrx.com  http://mm2lm9262.youpost.info/redirect.php?tid=3897&goto=cannacbdoilrx.com   http://p.somode.net/AP5Min.aspx?AID=20693&Auth=DDD31BD6A08A61B9E9583C5B9736446C28443B941E952073DDC88CE1A74F6C17&referer=https://cannacbdoilrx.com  http://jewelryboxshop.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://xrq.auto-point.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://filtre.nonore.com/go.php?url=https://cannacbdoilrx.com \nhttp://wayofhelp.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://202.115.72.51/reserve_sp.jsp?goto=https://cannacbdoilrx.com   http://charterlaunch.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://mainstreetawards.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://lakitawright.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://directvahomeloan.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://katahdin.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://maternite.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.mata-l-23.com/jump.php?url=https://cannacbdoilrx.com \nhttp://acinre.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://waste-technology.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://usmuscle.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.lautanindonesia.com/forum/go.php?url=https://cannacbdoilrx.com  https://www.pricefetcher.com/redirect?web?s=https://cannacbdoilrx.com   http://joshuawoodruff.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://eprog.net/clicks_inc.php?id=25052&click=2&url=https://cannacbdoilrx.com  http://www.notredamesports.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://theglobalcitizen.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://mothergoose.webfactional.com/r?u=https://cannacbdoilrx.com  http://theriverflows.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.toronto350.org/r?u=https://cannacbdoilrx.com   http://friantwaterline.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.ev.rsnow.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://bleadon.2day.ws/bleadon/search/?url=https://cannacbdoilrx.com  http://baldwinfacts.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://hearing-aids-university-heights-oh.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.unitedship.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://g2labs.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://bluehousecapital.pl/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://ohtopdocs.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://rarebookappraiser.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://wulffies.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://healthclick.tc/__media__/js/trademark.php?d=cannacbdoilrx.com  http://networkofone.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://utnecast.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.plasticcactus.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://tciresortrentals.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.minbanc.org/__media__/js/trademark.php?d=cannacbdoilrx.com   http://pikecorporation.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://theawkwardstage.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.almazon.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://antinauseawristbands.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://costcocaskets.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://jouett.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://proofer1.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \n \n \n \n \n \nhttp://computernetworktutor.com/fluxbb/viewtopic.php?pid=618556#p618556\nhttp://300house.com/forum/viewtopic.php?f=14&t=3897\nhttps://www.the-ninjarpg.com/forums/threads/taskbar-registry-keys.82579/\nhttp://katipler.org/forum/viewtopic.php?f=3&t=117960\nhttp://www.luxuriousgaming.com/fourms/showthread.php?tid=11941\n", "language": "Lisp", "metadata": {"date": 1547852557, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s949239690.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s949239690", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://beamentor.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.xwave.cn/go.asp?url=https://cannacbdoilrx.com   http://fordgtcentral.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://deerfacts.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://ibanpayment.us/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://moeobrazovanie.ru/redirect.php?to=https://cannacbdoilrx.com  http://at.catalog.hartmann.info/hartmann-shop/login/login.html;jsessionid=TbWsdU2iXNQ7BmYdn7jOL+6b?referer=https://cannacbdoilrx.com  http://bdj.donateyourcartoday.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://cobbdailydeals.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://nuimagesurgery.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://go.cartoon-dl.ir/transfer/index.php?url=https://cannacbdoilrx.com   https://swaeq.com/vb/showthread.php?goto=cannacbdoilrx.com   http://reservationsgreatwolflodge.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.voterchoicema.org/r?u=https://cannacbdoilrx.com   http://hemispheresolutionsltd.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://qgg.badforgood.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  https://www.stop-book.com/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fwww.compromat.ru%2Fpage_36751.htm&event3=+%D7%E8%ED%EE%E2%ED%E8%EA%E8+%E8+%E8%F5+%F1%E5%EC%FC%E8.+&goto=https://cannacbdoilrx.com   http://tzblm.com/engine/go.php?url=cannacbdoilrx.com \nhttp://m.kotlas-info.ru/vustug-info/away.php?to=cannacbdoilrx.com  http://spectrumhealingartscenter.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://3gain.net/link.php?id=N0000182&adwares=A0000001&url=https://cannacbdoilrx.com   http://www.uesoundadvice.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://bcbusinessbrokers.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://theausinstitute.nationbuilder.com/r?u=https://cannacbdoilrx.com  http://bookmarketingideas.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://flatpack.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://axa-advisors.biz/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://a1chimneyservice.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.jalight.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.tjyoga.com/bbs/redirect.php?fid=74&tid=34&goto=cannacbdoilrx.com   http://wuv.makehimknown.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://belletrist.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://marshfieldclinic.co/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://drumparties.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://michaelkinney.ca/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://thrillworkz.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://pfchangscareers.us/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://mollybelle.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://comicchats.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.starlightdancesport.com/dnn/LinkClick.aspx?link=https://cannacbdoilrx.com  http://mm2lm9262.youpost.info/redirect.php?tid=3897&goto=cannacbdoilrx.com   http://p.somode.net/AP5Min.aspx?AID=20693&Auth=DDD31BD6A08A61B9E9583C5B9736446C28443B941E952073DDC88CE1A74F6C17&referer=https://cannacbdoilrx.com  http://jewelryboxshop.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://xrq.auto-point.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://filtre.nonore.com/go.php?url=https://cannacbdoilrx.com \nhttp://wayofhelp.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://202.115.72.51/reserve_sp.jsp?goto=https://cannacbdoilrx.com   http://charterlaunch.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://mainstreetawards.org/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://lakitawright.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://directvahomeloan.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://katahdin.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://maternite.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.mata-l-23.com/jump.php?url=https://cannacbdoilrx.com \nhttp://acinre.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://waste-technology.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://usmuscle.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.lautanindonesia.com/forum/go.php?url=https://cannacbdoilrx.com  https://www.pricefetcher.com/redirect?web?s=https://cannacbdoilrx.com   http://joshuawoodruff.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://eprog.net/clicks_inc.php?id=25052&click=2&url=https://cannacbdoilrx.com  http://www.notredamesports.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://theglobalcitizen.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://mothergoose.webfactional.com/r?u=https://cannacbdoilrx.com  http://theriverflows.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.toronto350.org/r?u=https://cannacbdoilrx.com   http://friantwaterline.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.ev.rsnow.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://bleadon.2day.ws/bleadon/search/?url=https://cannacbdoilrx.com  http://baldwinfacts.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://hearing-aids-university-heights-oh.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.unitedship.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://g2labs.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://bluehousecapital.pl/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://ohtopdocs.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://rarebookappraiser.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://wulffies.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://healthclick.tc/__media__/js/trademark.php?d=cannacbdoilrx.com  http://networkofone.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://utnecast.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://www.plasticcactus.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \nhttp://tciresortrentals.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.minbanc.org/__media__/js/trademark.php?d=cannacbdoilrx.com   http://pikecorporation.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://theawkwardstage.net/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://www.almazon.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://antinauseawristbands.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://costcocaskets.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com  http://jouett.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com   http://proofer1.com/__media__/js/netsoltrademark.php?d=cannacbdoilrx.com \n \n \n \n \n \nhttp://computernetworktutor.com/fluxbb/viewtopic.php?pid=618556#p618556\nhttp://300house.com/forum/viewtopic.php?f=14&t=3897\nhttps://www.the-ninjarpg.com/forums/threads/taskbar-registry-keys.82579/\nhttp://katipler.org/forum/viewtopic.php?f=3&t=117960\nhttp://www.luxuriousgaming.com/fourms/showthread.php?tid=11941\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7548, "cpu_time_ms": 93, "memory_kb": 8928}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s481357487", "group_id": "codeNet:p03941", "input_text": "http://mapradio.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://seoanalysis.win/redirect.php?url=https://americacbdoilstore.com   http://gll6.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://dvdpornrip.com/engine/go.php?url=americacbdoilstore.com  http://www.catya.co.uk/gallery.php?path=al_pulford/&site=americacbdoilstore.com   http://feedsort.com/articleView.php?id=324626&goto=https://americacbdoilstore.com  http://xfv.audiencerewards.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://dev.2017.org.uk/ugle/modules/mod_jw_srfr/redir.php?url=https://americacbdoilstore.com   http://duidlaws.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://schumacherwestpalmchevy.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://sauvagerie.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://steshred.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://crawfordfreightsystems.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://mysun.biz/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://inletworldwideoil.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://wardshaw.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://shanghai-sigma-koki.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://greaterearth.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://www.dagestan.megaspravka.ru/go/url=https://americacbdoilstore.com  http://laborator.visoft.ro/goto.php?loc=https://americacbdoilstore.com   http://www.treehousepartners.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://surveyperday.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://rklm.atspace.eu/out.php?url=americacbdoilstore.com   http://cyuppa-love.net/m/redirect.php?url=https://americacbdoilstore.com  http://greenpenny.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://mantecaseniorcare.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.south-staffordshire.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://dlako.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://goimport8.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://sinfo.utamap.com/cgi-bin/t_search.cgi?act=jump&access=1&url=https://americacbdoilstore.com   http://graycommerce.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://hayden-fink.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://www.demeester-consultants.be/over-ons/item/39-luc-de-meester?fromurl=americacbdoilstore.com  http://www.contactm.de/cgi-bin/continentale/lib/pub/object/url_wrapper.cgi?url=https://americacbdoilstore.com  http://centraldistrictgirlssoftball.com/Goto.asp?url=https://americacbdoilstore.com   http://jh.tv58.net/index.php?c=account&a=qq&referer=https://americacbdoilstore.com \nhttp://deslab.uk/phpbb/go.php?https://americacbdoilstore.com  http://trauma.mathtexts.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://vpmartin.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://1-800-insects.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.appartement-krugzell.de/go.php?to=https://americacbdoilstore.com/   http://www.yourscan.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://vintagenewsmagazine.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.chiaroscurostudioofart.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.entercom.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://retirementnetcare.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://karume.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.52opn.com/wp-content/themes/begin/inc/go.php?url=https://americacbdoilstore.com   http://padsitesforlease.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://diamichels.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://brooklynhospice.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://quotes-on-tees.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://pop4pok.ru/redirect?url=https://americacbdoilstore.com   http://satcoinc.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://ecaperks.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.mayafb.com/redirect.php?fid=55&tid=2117828&goto=americacbdoilstore.com   http://indigotailor.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.reisenett.no/annonsebanner.tmpl?url=americacbdoilstore.com  http://aimhomeloans.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.carad-dvt.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.str-raion.ru/bitrix/rk.php?id=88&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B88%5D+%5BINORMATION%5D+%D0%91%D0%A3%D0%94%D0%AC%D0%A2%D0%95+%D0%91%D0%94%D0%98%D0%A2%D0%95%D0%9B%D0%AC%D0%9D%D0%AB&goto=https://americacbdoilstore.com  http://cleanchemicals.ca/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://vmoviewap.me/go/https://americacbdoilstore.com \nhttp://ovsresorts.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://diversityperformancefactor.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://kyokon.jp-adult.net/out.cgi?id=00372&url=https://americacbdoilstore.com   https://www.rrxfw.cn/wp-content/themes/begin/inc/go.php?url=https://americacbdoilstore.com  https://wylek.ru/forum/away.php?s=https://americacbdoilstore.com   http://bailearagon.com/cgi-bin/redirect.pl?https://americacbdoilstore.com  http://vn.alixk.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://hispmail.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://nicholscreativesolutions.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://exchangebanx.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://calidusssoftware.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.iravunk.com/go?url=https://americacbdoilstore.com   http://www.acudex.org/feed2js/feed2js.php?src=https://americacbdoilstore.com  http://urlexpand.com/?url=https://62.141.50.247/php.php?a<>=<a href=https://americacbdoilstore.com   http://southernillinoiseclipse.org/redirect.php?r=https://americacbdoilstore.com  http://b2gconsulting.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://sav.travelsticks.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://cl.angel.wwx.tw/debug/frm-s/americacbdoilstore.com/Centrifugation/bc-Centrifugation.php \nhttp://wwwwdww.filmzitate.info/index-link.php?link=https://americacbdoilstore.com  http://daviscounty.us/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://iloveyougifts.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://discozone.chemicalinformation.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://joegoldman.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://daylight-savingstime.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.fengshui55.com/wp-content/themes/begin/inc/go.php?url=https://americacbdoilstore.com  http://monitor.net.ru/forum/goto.php?url=https://americacbdoilstore.com   https://authentication.red-gate.com/identity/register?returnurl=https://americacbdoilstore.com \n \n \n \n \n \nhttp://smulti.org/forum/showthread.php?tid=78296\nhttp://www.leopoldsdorf-wien.info/phpbb/viewtopic.php?f=2&t=134964\nhttps://www.knownothing.net/community2/index.php/topic,103157.new.html#new\nhttp://kowrai.net.md-92.webhostbox.net/punbb/viewtopic.php?pid=296413#p296413\nhttp://xn--80aihgzecn.xn--p1ai/index.php?/topic/131811-male-girth-enhancement/\n", "language": "Lisp", "metadata": {"date": 1547757746, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s481357487.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s481357487", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://mapradio.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://seoanalysis.win/redirect.php?url=https://americacbdoilstore.com   http://gll6.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://dvdpornrip.com/engine/go.php?url=americacbdoilstore.com  http://www.catya.co.uk/gallery.php?path=al_pulford/&site=americacbdoilstore.com   http://feedsort.com/articleView.php?id=324626&goto=https://americacbdoilstore.com  http://xfv.audiencerewards.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://dev.2017.org.uk/ugle/modules/mod_jw_srfr/redir.php?url=https://americacbdoilstore.com   http://duidlaws.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://schumacherwestpalmchevy.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://sauvagerie.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://steshred.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://crawfordfreightsystems.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://mysun.biz/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://inletworldwideoil.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://wardshaw.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://shanghai-sigma-koki.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://greaterearth.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://www.dagestan.megaspravka.ru/go/url=https://americacbdoilstore.com  http://laborator.visoft.ro/goto.php?loc=https://americacbdoilstore.com   http://www.treehousepartners.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://surveyperday.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://rklm.atspace.eu/out.php?url=americacbdoilstore.com   http://cyuppa-love.net/m/redirect.php?url=https://americacbdoilstore.com  http://greenpenny.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://mantecaseniorcare.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.south-staffordshire.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://dlako.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://goimport8.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://sinfo.utamap.com/cgi-bin/t_search.cgi?act=jump&access=1&url=https://americacbdoilstore.com   http://graycommerce.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://hayden-fink.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://www.demeester-consultants.be/over-ons/item/39-luc-de-meester?fromurl=americacbdoilstore.com  http://www.contactm.de/cgi-bin/continentale/lib/pub/object/url_wrapper.cgi?url=https://americacbdoilstore.com  http://centraldistrictgirlssoftball.com/Goto.asp?url=https://americacbdoilstore.com   http://jh.tv58.net/index.php?c=account&a=qq&referer=https://americacbdoilstore.com \nhttp://deslab.uk/phpbb/go.php?https://americacbdoilstore.com  http://trauma.mathtexts.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://vpmartin.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://1-800-insects.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.appartement-krugzell.de/go.php?to=https://americacbdoilstore.com/   http://www.yourscan.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://vintagenewsmagazine.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.chiaroscurostudioofart.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.entercom.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://retirementnetcare.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://karume.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.52opn.com/wp-content/themes/begin/inc/go.php?url=https://americacbdoilstore.com   http://padsitesforlease.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://diamichels.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://brooklynhospice.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://quotes-on-tees.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://pop4pok.ru/redirect?url=https://americacbdoilstore.com   http://satcoinc.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://ecaperks.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.mayafb.com/redirect.php?fid=55&tid=2117828&goto=americacbdoilstore.com   http://indigotailor.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.reisenett.no/annonsebanner.tmpl?url=americacbdoilstore.com  http://aimhomeloans.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.carad-dvt.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.str-raion.ru/bitrix/rk.php?id=88&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B88%5D+%5BINORMATION%5D+%D0%91%D0%A3%D0%94%D0%AC%D0%A2%D0%95+%D0%91%D0%94%D0%98%D0%A2%D0%95%D0%9B%D0%AC%D0%9D%D0%AB&goto=https://americacbdoilstore.com  http://cleanchemicals.ca/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://vmoviewap.me/go/https://americacbdoilstore.com \nhttp://ovsresorts.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://diversityperformancefactor.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://kyokon.jp-adult.net/out.cgi?id=00372&url=https://americacbdoilstore.com   https://www.rrxfw.cn/wp-content/themes/begin/inc/go.php?url=https://americacbdoilstore.com  https://wylek.ru/forum/away.php?s=https://americacbdoilstore.com   http://bailearagon.com/cgi-bin/redirect.pl?https://americacbdoilstore.com  http://vn.alixk.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://hispmail.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://nicholscreativesolutions.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://exchangebanx.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://calidusssoftware.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.iravunk.com/go?url=https://americacbdoilstore.com   http://www.acudex.org/feed2js/feed2js.php?src=https://americacbdoilstore.com  http://urlexpand.com/?url=https://62.141.50.247/php.php?a<>=<a href=https://americacbdoilstore.com   http://southernillinoiseclipse.org/redirect.php?r=https://americacbdoilstore.com  http://b2gconsulting.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://sav.travelsticks.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://cl.angel.wwx.tw/debug/frm-s/americacbdoilstore.com/Centrifugation/bc-Centrifugation.php \nhttp://wwwwdww.filmzitate.info/index-link.php?link=https://americacbdoilstore.com  http://daviscounty.us/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://iloveyougifts.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://discozone.chemicalinformation.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://joegoldman.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://daylight-savingstime.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.fengshui55.com/wp-content/themes/begin/inc/go.php?url=https://americacbdoilstore.com  http://monitor.net.ru/forum/goto.php?url=https://americacbdoilstore.com   https://authentication.red-gate.com/identity/register?returnurl=https://americacbdoilstore.com \n \n \n \n \n \nhttp://smulti.org/forum/showthread.php?tid=78296\nhttp://www.leopoldsdorf-wien.info/phpbb/viewtopic.php?f=2&t=134964\nhttps://www.knownothing.net/community2/index.php/topic,103157.new.html#new\nhttp://kowrai.net.md-92.webhostbox.net/punbb/viewtopic.php?pid=296413#p296413\nhttp://xn--80aihgzecn.xn--p1ai/index.php?/topic/131811-male-girth-enhancement/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8042, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s046193550", "group_id": "codeNet:p03941", "input_text": "http://eldredfamily.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://1236.xg4ken.com/media/redir.php?prof=607&affcode=uc%7CSpredfast_GooglePlus%7CRetailMeNot%7C10/17/14%20Blog%20G%2B%20Worst%20Halloween%20Costumes%20Ever%7C32512479%7Cbroad&url=https://americacbdoilstore.com   http://search.wi.gov/cpp/cs.html?url=https://americacbdoilstore.com   http://ceh.whoswining.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.ecards100.com/cgi-bin/rank/out.cgi?id=humorpag&url=https://americacbdoilstore.com   https://tget.me/c?p=fFBPUFVMQVJfQ1RSfFNJREVCQVJ8fHBsYW5ldA==&r=https://americacbdoilstore.com  http://nutrition-charts.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.hotelsiesta.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://iinet2.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://caradecu.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://ngtrewards.mobi/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://www.gaytorrent.ru/redir.php?url=https://americacbdoilstore.com   http://www.tsticn.com/redirect.aspx?url=https://americacbdoilstore.com  http://www.legendscc.com/default.aspx?p=TrackHyperlink&url=https://americacbdoilstore.com   http://vaportight.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.labourworks.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://lolayoung.com/out.php?https://americacbdoilstore.com   http://sr.kafito.com/login?referer=https://americacbdoilstore.com \nhttp://www.andersonschoel.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://xporntube.xxx/go.php?track=dhtMf3tCKmtDe0cBew==&url=https://americacbdoilstore.com   https://sanisilesia.pl/redirect.php?action=url&goto=https://americacbdoilstore.com   http://www.5dcad.cn/bbs./redirect.php?tid=253389&goto=americacbdoilstore.com  http://www.microsoftproject15.ru/redir.asp?id=https://americacbdoilstore.com   http://images.google.so/url?q=https://americacbdoilstore.com  http://www.inout.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.trade-shows.eu/xternal_link.php?goto=https://americacbdoilstore.com   http://www.bjerhu.com/dialog_1.htm?arg=9005750&style=1&kf=&kflist=on&kf=296199144%40qq.com%2C583913611%40qq.com&zdkf_type=1&language=zh-cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://americacbdoilstore.com \nhttp://fc-metalist.com/go.php?go=https://americacbdoilstore.com  http://mysoltera.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://outpick.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.taiphanmemdt.com/r.php?u=https://americacbdoilstore.com  http://mylanmsadvocate.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://forums.hdtvtest.co.uk/index.php?thememode=full;redirect=https://americacbdoilstore.com  http://willtothink.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.exactshot.com/redir.php?url=https://americacbdoilstore.com   http://crumandforsterindemnity.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://images.google.com.ng/url?q=https://americacbdoilstore.com  http://www.doityourselfdui.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://649lotto.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://go.rhr.fm/?to=https://americacbdoilstore.com  http://wellnessprompts.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://poddabie.sailing88.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://deptnav.smfnew2.com/index.php?thememode=full;redirect=https://americacbdoilstore.com  http://eaglesmusic.eu/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://perm.kinderra.ru/redirect?url=https://americacbdoilstore.com \nhttp://bbs.chetxia.com/ri.aspx?url=https://americacbdoilstore.com  http://vdyyoutube.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://www.abw.by/go.php?url=americacbdoilstore.com   http://biggsb.co/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.stayonvacation.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://vmsinsight.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://visualdynamics.email/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://catdrink.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.movimentovivabrasil.com.br/redir.php?mace2_cod=60&pess2_cod=1010&lenc2_cod=&url=https://americacbdoilstore.com \nhttp://www.churnvalley.org.uk/goto-link.php?link_id=17&url=https://americacbdoilstore.com  http://ohn.urbanaddress.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://nycskyliners.assn.la/Goto.asp?url=https://americacbdoilstore.com   http://mylan-moves.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.inkalinux.com/foros/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fwww.inkalinux.com%2Fforos%2Fmember.php%3F74-redyser%26tab%3Dactivitystream%26type%3Dfriends%26page%3D1&code=d41d8cd98f00b204e9800998ecf8427e&board_url=https://americacbdoilstore.com   http://www.lipstickpanda.com/s/go/https://americacbdoilstore.com  http://dimelectrico.com/skin/frontend/default/french/images/cache/index.php?q=https://americacbdoilstore.com  http://vidrokr.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://tahomalax.com/Goto.asp?url=https://americacbdoilstore.com \nhttp://yc.xinshizaixian.com/index.php?g=Appoint&c=Changecity&a=go&city=xsbn&referer=https://americacbdoilstore.com  http://mannygarciacompanies.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://ax.0595rc.com/user/url.php?url=https://americacbdoilstore.com   http://www.stgoranandstmichael.org.uk/goto-link.php?link_id=12&url=https://americacbdoilstore.com  https://www.okzk.lv/rogaining_lv/forum/go.php?url=https://americacbdoilstore.com   http://marketbhavishya.co.in/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://medicineinfo.awardspace.com/go.php?url=https://americacbdoilstore.com  http://crosscore-uk.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://vanauken.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://websetters.acquaverde.de/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://qhp.argosytours.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://infoaccount.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://stewartprivateestates.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://voteme100.com/cgi-bin/toplist/out.cgi?id=ourwives&url=https://americacbdoilstore.com   http://myfd.ru/redirect?url=https://americacbdoilstore.com  http://www.myweedseeds.com/affiliate.php?id=267&redirect=https://americacbdoilstore.com  http://pioneermilitaryloan.us/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://wrimdocs.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://keenansafehospitals.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  https://www.lovearmy.org/r?u=https://americacbdoilstore.com   http://winneteurope.dmsbike.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://bangladesh-investment.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://onlinecampaigncenterrs.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://xw.membercenter.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  https://www.voyazteca.com/vb/redirector.php?url=https://americacbdoilstore.com  http://insidevail.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://incityoffers.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \n \n \n \n \n \nhttp://mastazone.nl/viewtopic.php?f=19&t=8879\nhttps://blackdiamond-casino.com/forum/viewtopic.php?pid=283221#p283221\nhttps://www.lcb-informatique.ch/forum/viewtopic.php?pid=98340\nhttp://forum.sonturkrpg.org/showthread.php?tid=42603&pid=54478#pid54478\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=22401\n", "language": "Lisp", "metadata": {"date": 1547738038, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s046193550.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s046193550", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://eldredfamily.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://1236.xg4ken.com/media/redir.php?prof=607&affcode=uc%7CSpredfast_GooglePlus%7CRetailMeNot%7C10/17/14%20Blog%20G%2B%20Worst%20Halloween%20Costumes%20Ever%7C32512479%7Cbroad&url=https://americacbdoilstore.com   http://search.wi.gov/cpp/cs.html?url=https://americacbdoilstore.com   http://ceh.whoswining.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.ecards100.com/cgi-bin/rank/out.cgi?id=humorpag&url=https://americacbdoilstore.com   https://tget.me/c?p=fFBPUFVMQVJfQ1RSfFNJREVCQVJ8fHBsYW5ldA==&r=https://americacbdoilstore.com  http://nutrition-charts.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.hotelsiesta.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://iinet2.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://caradecu.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://ngtrewards.mobi/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://www.gaytorrent.ru/redir.php?url=https://americacbdoilstore.com   http://www.tsticn.com/redirect.aspx?url=https://americacbdoilstore.com  http://www.legendscc.com/default.aspx?p=TrackHyperlink&url=https://americacbdoilstore.com   http://vaportight.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.labourworks.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://lolayoung.com/out.php?https://americacbdoilstore.com   http://sr.kafito.com/login?referer=https://americacbdoilstore.com \nhttp://www.andersonschoel.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://xporntube.xxx/go.php?track=dhtMf3tCKmtDe0cBew==&url=https://americacbdoilstore.com   https://sanisilesia.pl/redirect.php?action=url&goto=https://americacbdoilstore.com   http://www.5dcad.cn/bbs./redirect.php?tid=253389&goto=americacbdoilstore.com  http://www.microsoftproject15.ru/redir.asp?id=https://americacbdoilstore.com   http://images.google.so/url?q=https://americacbdoilstore.com  http://www.inout.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.trade-shows.eu/xternal_link.php?goto=https://americacbdoilstore.com   http://www.bjerhu.com/dialog_1.htm?arg=9005750&style=1&kf=&kflist=on&kf=296199144%40qq.com%2C583913611%40qq.com&zdkf_type=1&language=zh-cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://americacbdoilstore.com \nhttp://fc-metalist.com/go.php?go=https://americacbdoilstore.com  http://mysoltera.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://outpick.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.taiphanmemdt.com/r.php?u=https://americacbdoilstore.com  http://mylanmsadvocate.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://forums.hdtvtest.co.uk/index.php?thememode=full;redirect=https://americacbdoilstore.com  http://willtothink.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.exactshot.com/redir.php?url=https://americacbdoilstore.com   http://crumandforsterindemnity.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://images.google.com.ng/url?q=https://americacbdoilstore.com  http://www.doityourselfdui.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://649lotto.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://go.rhr.fm/?to=https://americacbdoilstore.com  http://wellnessprompts.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://poddabie.sailing88.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://deptnav.smfnew2.com/index.php?thememode=full;redirect=https://americacbdoilstore.com  http://eaglesmusic.eu/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://perm.kinderra.ru/redirect?url=https://americacbdoilstore.com \nhttp://bbs.chetxia.com/ri.aspx?url=https://americacbdoilstore.com  http://vdyyoutube.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://www.abw.by/go.php?url=americacbdoilstore.com   http://biggsb.co/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.stayonvacation.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://vmsinsight.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://visualdynamics.email/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://catdrink.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.movimentovivabrasil.com.br/redir.php?mace2_cod=60&pess2_cod=1010&lenc2_cod=&url=https://americacbdoilstore.com \nhttp://www.churnvalley.org.uk/goto-link.php?link_id=17&url=https://americacbdoilstore.com  http://ohn.urbanaddress.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://nycskyliners.assn.la/Goto.asp?url=https://americacbdoilstore.com   http://mylan-moves.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.inkalinux.com/foros/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fwww.inkalinux.com%2Fforos%2Fmember.php%3F74-redyser%26tab%3Dactivitystream%26type%3Dfriends%26page%3D1&code=d41d8cd98f00b204e9800998ecf8427e&board_url=https://americacbdoilstore.com   http://www.lipstickpanda.com/s/go/https://americacbdoilstore.com  http://dimelectrico.com/skin/frontend/default/french/images/cache/index.php?q=https://americacbdoilstore.com  http://vidrokr.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://tahomalax.com/Goto.asp?url=https://americacbdoilstore.com \nhttp://yc.xinshizaixian.com/index.php?g=Appoint&c=Changecity&a=go&city=xsbn&referer=https://americacbdoilstore.com  http://mannygarciacompanies.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://ax.0595rc.com/user/url.php?url=https://americacbdoilstore.com   http://www.stgoranandstmichael.org.uk/goto-link.php?link_id=12&url=https://americacbdoilstore.com  https://www.okzk.lv/rogaining_lv/forum/go.php?url=https://americacbdoilstore.com   http://marketbhavishya.co.in/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://medicineinfo.awardspace.com/go.php?url=https://americacbdoilstore.com  http://crosscore-uk.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://vanauken.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://websetters.acquaverde.de/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://qhp.argosytours.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://infoaccount.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://stewartprivateestates.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://voteme100.com/cgi-bin/toplist/out.cgi?id=ourwives&url=https://americacbdoilstore.com   http://myfd.ru/redirect?url=https://americacbdoilstore.com  http://www.myweedseeds.com/affiliate.php?id=267&redirect=https://americacbdoilstore.com  http://pioneermilitaryloan.us/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://wrimdocs.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://keenansafehospitals.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  https://www.lovearmy.org/r?u=https://americacbdoilstore.com   http://winneteurope.dmsbike.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://bangladesh-investment.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://onlinecampaigncenterrs.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://xw.membercenter.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  https://www.voyazteca.com/vb/redirector.php?url=https://americacbdoilstore.com  http://insidevail.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://incityoffers.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \n \n \n \n \n \nhttp://mastazone.nl/viewtopic.php?f=19&t=8879\nhttps://blackdiamond-casino.com/forum/viewtopic.php?pid=283221#p283221\nhttps://www.lcb-informatique.ch/forum/viewtopic.php?pid=98340\nhttp://forum.sonturkrpg.org/showthread.php?tid=42603&pid=54478#pid54478\nhttp://dailypatriot.net/phpbb/viewtopic.php?f=4&t=22401\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8210, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s543001469", "group_id": "codeNet:p03941", "input_text": "http://www.takeshikaneshiro.net/forum/redirect.php?fid=37&tid=2001&goto=americacbdoilstore.com  http://dentistinsanmateo.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://loseyourself.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://citc-92.citci.clipe.pt/cgi-bin/atc/out.cgi?id=95&u=/americacbdoilstore.com  https://deairank.mistypark.com/01/out.cgi?id=urashi10&url=https://americacbdoilstore.com   http://jewelsearchengine.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://lovebablo.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://engelsfee.ch/cms/?redirect&url=https://americacbdoilstore.com   http://portsolutions.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://www.eurocorp-international.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://avk-opt.ru/bitrix/rk.php?id=5&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B5%5D+%5BBAN1%5D+%CF%F0%E0%E2%FB%E9+%E1%E0%ED%ED%E5%F0+1&goto=https://americacbdoilstore.com   http://gi7.bk-entertainment.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://halodryie.gq/go.php?track=chABNnlFKmlCdUQGeg==&url=americacbdoilstore.com  http://xn--b1aajkzh1ewd.xn--p1ai/go.php?to=https://americacbdoilstore.com   http://ottertail-power.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.lakeplacidwaterfrontestate.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://summittrustee.us/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://reservati.zujihotel.com.tw/redirect.php?fid=4&tid=127633&goto=americacbdoilstore.com \nhttp://eggtraymachine.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  https://csharp.love/go.php?url=https://americacbdoilstore.com   http://renzervhcp.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://pennyprimer.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.aladura.org/__media__/js/trademark.php?d=americacbdoilstore.com   http://franchisedirect.tv/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://tokyobowling.info/redirect.php?tid=3905&goto=americacbdoilstore.com  http://www.magicvivaldi.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.bikini-swimwear.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://cdn2.milf-porn.sexy/dcpn/cgi/out.php?url=americacbdoilstore.com  http://asfma.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://31.172.83.162/forum/big-fat-team-announcements/253-share-our-banner?goto=americacbdoilstore.com   http://ww.coo123.net/goto.php?c=&n=ID&url=https://americacbdoilstore.com  http://www.dt.co.kr/contents.html?article_no=2018021302101231037002&ref=naver232386&q=%B0%FA%B1%E2%C1%A4%C5%EB%BA%CE&ssc=tab.news.all&f=news&w=news&s=eGpxiECBISzkAdpR0K8HCQ==&time=1518474755689&a=nws*y.outtit&r=22&i=880000AD_000000000000000002448365&g=029.0002448365&u=https://americacbdoilstore.com   http://www.mercyworld.org/e-news/redir.cfm?articleid=69AE6C14-BD5E-075C-FE1EE55B75D44079&url=https://americacbdoilstore.com  http://katewhitney.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://moneymastersdirect.biz/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://mova.org.ua/out.php?link=https://americacbdoilstore.com \nhttp://asr.pokedex.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  https://www.ghareng.com/go.php?to=americacbdoilstore.com   http://photog.hk/redirect.php?fid=20&tid=2927&goto=americacbdoilstore.com   http://dutchmans.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.stimcointernational.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://novelasportuguesas.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.gomaturesex.com/cgi-bin/a2/out.cgi?id=114&l=top10&u=https://americacbdoilstore.com  http://visionstop.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://fincalab.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://dnabiotek.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://jeu.jeffersonhealthsystem.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://cherrycreekmanagement.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.heartdrippings.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://nrj.capturemyinfo.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://eustisbenefits.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://njalternativedisputeresolution.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://club-edu.tambov.ru/main/search/club.cgi?cc=1&q=%E3&URL=http%3A//americacbdoilstore.com/&wm=wrd   http://reorentals.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://calpinewindfarms.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://zelnikrealestate.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://richardsonstudentsample.wikispaces.com/-/Dos%20Lados%20Politicos/Team%203/page/edit/American+politician?goto=https://americacbdoilstore.com   http://www.fudgeismylife.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.vasaricountryclub.com/default.aspx?p=TrackHyperlink&url=https://americacbdoilstore.com   http://overturecenterfoundation.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.allmonitors.co/goto.php?url=https://americacbdoilstore.com  http://365lenovo.com/url?q=https://americacbdoilstore.com   http://valk.kinderdijk.vakantieland.nl/klikuit.asp?id=-514216090&url=https://americacbdoilstore.com \nhttp://www.pruducts.review/go/eafengrow-zt-0999-%D1%81%D0%BA%D0%BB%D0%B0%D0%B4%D0%BD%D0%BE%D0%B9-%D0%BD%D0%BE%D0%B6%D0%B8-zt0999-d2-%D1%81%D1%82%D0%B0%D0%BB%D1%8C-%D1%83%D0%B3%D0%BB%D0%B5%D1%80%D0%BE%D0%B4%D0%BD%D0%BE%D0%B3%D0%BE-%D0%B2%D0%BE%D0%BB%D0%BE%D0%BA%D0%BD%D0%BE-%D1%87%D0%BF%D1%83-%D0%BB%D0%B5%D0%B7%D0%B2%D0%B8%D0%B5-%D0%BA-658716?type=4&sourceurl=https://americacbdoilstore.com  http://www.stagnarobros.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://match.presdo.com/redirect?conference_id=sway-minds&track=signup&url=https://americacbdoilstore.com   http://mrpolicy.trf.or.th/LinkClick.aspx?link=https://americacbdoilstore.com  http://lwm.shola.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.ethanmackjackson.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://twtc.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.acvnet.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.realestateinocmd.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://www.7bed.com/home/link.php?url=https://americacbdoilstore.com  http://nickperricone.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://vintagesonomasenior.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.ituiba.cn/wp-content/themes/begin4.2/inc/go.php?url=https://americacbdoilstore.com  http://hitechtoybox.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.chicagogop.com/r?u=https://americacbdoilstore.com  https://book-ye.com.ua/bitrix/rk.php?id=32&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B32%5D+%5BTOP%5D+Small+%D0%A1%D0%B8%D0%BB%D0%B0+%D0%B2%D0%BE%D0%BB%D1%96&goto=americacbdoilstore.com  http://www.mok007.net/wordpress/wp-content/themes/begin/inc/go.php?url=https://americacbdoilstore.com   http://armorfloorepoxy.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttps://www.bergfex.at/to/?url=https://americacbdoilstore.com  http://folar.nationbuilder.com/r?u=https://americacbdoilstore.com   http://www.jewishinternetguide.com/main/mod.php?mod=weblink&op=visit_link&lid=2124&url=https://americacbdoilstore.com   http://0directory.com/togo.php/americacbdoilstore.com  http://pchmedia.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.xa999.com/hi/link.php?url=https://americacbdoilstore.com  https://action.pipsc.ca/r?u=https://americacbdoilstore.com  http://ymk.susanreinstein.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://ashleyleasure.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \n \n \n \n \n \nhttp://km-schools.edu.sa/vb/showthread.php?444-viagra-used-by-women-Nege&p=337316&posted=1#post337316\nhttp://www.forum-hacker.com.br/showthread.php?69653-Used-berettashotguns-for-sale&p=141372#post141372\nhttp://ghanasdgs.info/2016/04/20/these-7-things-will-change-the-way-you-approach-travel/#comment-38055\nhttp://cheerdown.com/forum/showthread.php?tid=32605\nhttp://www.jjhservers.com/phpbb/viewtopic.php?f=6&t=2316&p=9115#p9115\n", "language": "Lisp", "metadata": {"date": 1547719501, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s543001469.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s543001469", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.takeshikaneshiro.net/forum/redirect.php?fid=37&tid=2001&goto=americacbdoilstore.com  http://dentistinsanmateo.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://loseyourself.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://citc-92.citci.clipe.pt/cgi-bin/atc/out.cgi?id=95&u=/americacbdoilstore.com  https://deairank.mistypark.com/01/out.cgi?id=urashi10&url=https://americacbdoilstore.com   http://jewelsearchengine.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://lovebablo.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://engelsfee.ch/cms/?redirect&url=https://americacbdoilstore.com   http://portsolutions.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://www.eurocorp-international.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://avk-opt.ru/bitrix/rk.php?id=5&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B5%5D+%5BBAN1%5D+%CF%F0%E0%E2%FB%E9+%E1%E0%ED%ED%E5%F0+1&goto=https://americacbdoilstore.com   http://gi7.bk-entertainment.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://halodryie.gq/go.php?track=chABNnlFKmlCdUQGeg==&url=americacbdoilstore.com  http://xn--b1aajkzh1ewd.xn--p1ai/go.php?to=https://americacbdoilstore.com   http://ottertail-power.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.lakeplacidwaterfrontestate.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://summittrustee.us/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://reservati.zujihotel.com.tw/redirect.php?fid=4&tid=127633&goto=americacbdoilstore.com \nhttp://eggtraymachine.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  https://csharp.love/go.php?url=https://americacbdoilstore.com   http://renzervhcp.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://pennyprimer.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.aladura.org/__media__/js/trademark.php?d=americacbdoilstore.com   http://franchisedirect.tv/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://tokyobowling.info/redirect.php?tid=3905&goto=americacbdoilstore.com  http://www.magicvivaldi.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.bikini-swimwear.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://cdn2.milf-porn.sexy/dcpn/cgi/out.php?url=americacbdoilstore.com  http://asfma.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://31.172.83.162/forum/big-fat-team-announcements/253-share-our-banner?goto=americacbdoilstore.com   http://ww.coo123.net/goto.php?c=&n=ID&url=https://americacbdoilstore.com  http://www.dt.co.kr/contents.html?article_no=2018021302101231037002&ref=naver232386&q=%B0%FA%B1%E2%C1%A4%C5%EB%BA%CE&ssc=tab.news.all&f=news&w=news&s=eGpxiECBISzkAdpR0K8HCQ==&time=1518474755689&a=nws*y.outtit&r=22&i=880000AD_000000000000000002448365&g=029.0002448365&u=https://americacbdoilstore.com   http://www.mercyworld.org/e-news/redir.cfm?articleid=69AE6C14-BD5E-075C-FE1EE55B75D44079&url=https://americacbdoilstore.com  http://katewhitney.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://moneymastersdirect.biz/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://mova.org.ua/out.php?link=https://americacbdoilstore.com \nhttp://asr.pokedex.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  https://www.ghareng.com/go.php?to=americacbdoilstore.com   http://photog.hk/redirect.php?fid=20&tid=2927&goto=americacbdoilstore.com   http://dutchmans.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.stimcointernational.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://novelasportuguesas.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.gomaturesex.com/cgi-bin/a2/out.cgi?id=114&l=top10&u=https://americacbdoilstore.com  http://visionstop.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://fincalab.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://dnabiotek.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://jeu.jeffersonhealthsystem.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://cherrycreekmanagement.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.heartdrippings.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://nrj.capturemyinfo.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://eustisbenefits.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://njalternativedisputeresolution.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://club-edu.tambov.ru/main/search/club.cgi?cc=1&q=%E3&URL=http%3A//americacbdoilstore.com/&wm=wrd   http://reorentals.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://calpinewindfarms.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://zelnikrealestate.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://richardsonstudentsample.wikispaces.com/-/Dos%20Lados%20Politicos/Team%203/page/edit/American+politician?goto=https://americacbdoilstore.com   http://www.fudgeismylife.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.vasaricountryclub.com/default.aspx?p=TrackHyperlink&url=https://americacbdoilstore.com   http://overturecenterfoundation.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.allmonitors.co/goto.php?url=https://americacbdoilstore.com  http://365lenovo.com/url?q=https://americacbdoilstore.com   http://valk.kinderdijk.vakantieland.nl/klikuit.asp?id=-514216090&url=https://americacbdoilstore.com \nhttp://www.pruducts.review/go/eafengrow-zt-0999-%D1%81%D0%BA%D0%BB%D0%B0%D0%B4%D0%BD%D0%BE%D0%B9-%D0%BD%D0%BE%D0%B6%D0%B8-zt0999-d2-%D1%81%D1%82%D0%B0%D0%BB%D1%8C-%D1%83%D0%B3%D0%BB%D0%B5%D1%80%D0%BE%D0%B4%D0%BD%D0%BE%D0%B3%D0%BE-%D0%B2%D0%BE%D0%BB%D0%BE%D0%BA%D0%BD%D0%BE-%D1%87%D0%BF%D1%83-%D0%BB%D0%B5%D0%B7%D0%B2%D0%B8%D0%B5-%D0%BA-658716?type=4&sourceurl=https://americacbdoilstore.com  http://www.stagnarobros.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   https://match.presdo.com/redirect?conference_id=sway-minds&track=signup&url=https://americacbdoilstore.com   http://mrpolicy.trf.or.th/LinkClick.aspx?link=https://americacbdoilstore.com  http://lwm.shola.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.ethanmackjackson.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://twtc.info/__media__/js/netsoltrademark.php?d=americacbdoilstore.com  http://www.acvnet.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.realestateinocmd.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttp://www.7bed.com/home/link.php?url=https://americacbdoilstore.com  http://nickperricone.net/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://vintagesonomasenior.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.ituiba.cn/wp-content/themes/begin4.2/inc/go.php?url=https://americacbdoilstore.com  http://hitechtoybox.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.chicagogop.com/r?u=https://americacbdoilstore.com  https://book-ye.com.ua/bitrix/rk.php?id=32&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B32%5D+%5BTOP%5D+Small+%D0%A1%D0%B8%D0%BB%D0%B0+%D0%B2%D0%BE%D0%BB%D1%96&goto=americacbdoilstore.com  http://www.mok007.net/wordpress/wp-content/themes/begin/inc/go.php?url=https://americacbdoilstore.com   http://armorfloorepoxy.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \nhttps://www.bergfex.at/to/?url=https://americacbdoilstore.com  http://folar.nationbuilder.com/r?u=https://americacbdoilstore.com   http://www.jewishinternetguide.com/main/mod.php?mod=weblink&op=visit_link&lid=2124&url=https://americacbdoilstore.com   http://0directory.com/togo.php/americacbdoilstore.com  http://pchmedia.org/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://www.xa999.com/hi/link.php?url=https://americacbdoilstore.com  https://action.pipsc.ca/r?u=https://americacbdoilstore.com  http://ymk.susanreinstein.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com   http://ashleyleasure.com/__media__/js/netsoltrademark.php?d=americacbdoilstore.com \n \n \n \n \n \nhttp://km-schools.edu.sa/vb/showthread.php?444-viagra-used-by-women-Nege&p=337316&posted=1#post337316\nhttp://www.forum-hacker.com.br/showthread.php?69653-Used-berettashotguns-for-sale&p=141372#post141372\nhttp://ghanasdgs.info/2016/04/20/these-7-things-will-change-the-way-you-approach-travel/#comment-38055\nhttp://cheerdown.com/forum/showthread.php?tid=32605\nhttp://www.jjhservers.com/phpbb/viewtopic.php?f=6&t=2316&p=9115#p9115\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8873, "cpu_time_ms": 46, "memory_kb": 5860}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s027959347", "group_id": "codeNet:p03941", "input_text": "http://wambco.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.cell-design.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://apnetv.tv/redirector.php?r=https://onlinecasino2018.us.org/   http://osteopathie-fr.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://powergenics.info/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://templeofbelief.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://universalportal.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://taxnegotiationnetwork.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.dnafingerprint.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://realestatefinancialplanningsystems.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.carmaxautofinance.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.tmi-s.com/bitrix/rk.php?id=97&site_id=ke&event1=banner&event2=click&event3=2+%2F+%5B97%5D+%5BBOTTOM%5D+APS-73xxL+Best+in+Test+Winner+468x60+en&goto=onlinecasino2018.us.org   http://cifajr.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://iebroadband.com/LinkClick.aspx?link=https://onlinecasino2018.us.org   http://www.sftkzs.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino2018.us.org  http://kineticmatrix.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  https://www.abcwpa.org/LinkClick.aspx?link=https://onlinecasino2018.us.org   http://9-11consulting.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.adiland.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://crystalresults.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://dynamicmap.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://morganariel.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://mobile.yellowpages.com.eg/icon-hit?serviceCode=ITM&language=en&companyId=82534&companyName=QmFuayBBQkM=&url=https://onlinecasino2018.us.org   http://www.gechter.com/jump.php?url=https://onlinecasino2018.us.org  http://likeaprosports.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://yofait.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://oklahomaautoauction.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.billplante.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.animalrating.com/cgi-bin/out.cgi?id=zoo13y&url=https://onlinecasino2018.us.org   http://peugeot-103.de/forum/redir.php?url=https://onlinecasino2018.us.org   http://iamapainter.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.yeshairremoval.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://gavel.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://understandstroke.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://mmjames.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://sarah-kennedy.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.entergynuclearinc.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://w.cullenthomas.com/guestbook/go.php?url=https://onlinecasino2018.us.org   http://toursandcamps.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://m.ishoes.com.au/scripts/redir.asp?link=https://onlinecasino2018.us.org  http://behindthepalm.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.santacruzcountyplanning.com/LinkClick.aspx?link=https://onlinecasino2018.us.org  http://kavitz.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://salvationarmycarib.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.farwestoil.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://massmutualbrokerage.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://abinternotrab.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://tgt.immediateflood.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://hotelworks.vn/dang-nhap?goto=https://onlinecasino2018.us.org  http://networksolutionsux.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.marazulcharters.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://sportsmansinnovations.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://leafshockeydevelopment.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://aprostine.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://onenetwork.vg/__media__/js/trademark.php?d=onlinecasino2018.us.org  http://plasticexpress.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://lukasjanku.cz/redirect.php?https://onlinecasino2018.us.org   http://usstrategygroup.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.afada.org/index.php?modulo=6&q=https://onlinecasino2018.us.org   http://partnerreinsurance.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://medstarambulance.us/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://thebangaloretimes.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://wanderlustingexpat.com/process/RedirectN?url=https://onlinecasino2018.us.org \nhttp://zpw.kdrowe.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.grupdes.com/enlaces/glinklnk.asp?url=onlinecasino2018.us.org   http://courseofactionpodcast.libsyn.com/website?referer=https://onlinecasino2018.us.org   http://zanaflexmpc.info/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://gulag.notbad.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.coronadoyc.org/default.aspx?p=TrackHyperlink&url=https://onlinecasino2018.us.org  http://ashtangayogamontana.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://tarotreadingsinformation.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://machineryjobs.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://zijn.samenresultaat.nl/click.asp?ref=654612&site=9040&type=text&tnb=31&diurl=https://onlinecasino2018.us.org  http://www.galaorganizationfoundation.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://idfirebox.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.seawave.jp/cgi/adult/rank.cgi?mode=link&id=3965&url=https://onlinecasino2018.us.org  http://www.cow-head.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.chec.com.co/LinkClick.aspx?link=https://onlinecasino2018.us.org  http://www.rakusui.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.qponcoupon.com/view/onlinecasino2018.us.org   http://www.backgroundaustralia.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://debtsumo.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.medlive.cn/redirect.php?resource=guide_keyword_search&index=0&url=https://onlinecasino2018.us.org   http://stuartkoenig.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://forums.epicgames.com/unreal-tournament-2003-2004/ut2004-level-editing-modeling-skinning/102155-pose?goto=onlinecasino2018.us.org  http://razdelguard.biz-market.ru/jump.php?url=https://onlinecasino2018.us.org   http://resourcelists.falmouth.ac.uk/link?url=https://onlinecasino2018.us.org  https://www.pbcorporate.com.sg/redir.php?url=https://onlinecasino2018.us.org  http://catalogy.com/bin/clickhit.php?url=https://onlinecasino2018.us.org/   http://simplytexas.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \n \n \n \n \n \nhttp://www.whisky-academy.com/forum/showthread.php?tid=6096\nhttp://vestiro.ro/forum/index.php/topic,10841.new.html#new\nhttp://missouridom.org/forum/index.php?topic=8378.new#new\nhttp://projectliferp.com/forum/viewtopic.php?f=18&t=23837&p=65877#p65877\nhttp://support-link.info/blog/2019/01/11/essay-on-software-piracy_p5/#comment-373\n", "language": "Lisp", "metadata": {"date": 1547676871, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s027959347.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s027959347", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://wambco.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.cell-design.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://apnetv.tv/redirector.php?r=https://onlinecasino2018.us.org/   http://osteopathie-fr.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://powergenics.info/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://templeofbelief.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://universalportal.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://taxnegotiationnetwork.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.dnafingerprint.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://realestatefinancialplanningsystems.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.carmaxautofinance.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.tmi-s.com/bitrix/rk.php?id=97&site_id=ke&event1=banner&event2=click&event3=2+%2F+%5B97%5D+%5BBOTTOM%5D+APS-73xxL+Best+in+Test+Winner+468x60+en&goto=onlinecasino2018.us.org   http://cifajr.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://iebroadband.com/LinkClick.aspx?link=https://onlinecasino2018.us.org   http://www.sftkzs.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino2018.us.org  http://kineticmatrix.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  https://www.abcwpa.org/LinkClick.aspx?link=https://onlinecasino2018.us.org   http://9-11consulting.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.adiland.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://crystalresults.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://dynamicmap.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://morganariel.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://mobile.yellowpages.com.eg/icon-hit?serviceCode=ITM&language=en&companyId=82534&companyName=QmFuayBBQkM=&url=https://onlinecasino2018.us.org   http://www.gechter.com/jump.php?url=https://onlinecasino2018.us.org  http://likeaprosports.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://yofait.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://oklahomaautoauction.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.billplante.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.animalrating.com/cgi-bin/out.cgi?id=zoo13y&url=https://onlinecasino2018.us.org   http://peugeot-103.de/forum/redir.php?url=https://onlinecasino2018.us.org   http://iamapainter.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.yeshairremoval.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://gavel.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://understandstroke.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://mmjames.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://sarah-kennedy.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.entergynuclearinc.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://w.cullenthomas.com/guestbook/go.php?url=https://onlinecasino2018.us.org   http://toursandcamps.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://m.ishoes.com.au/scripts/redir.asp?link=https://onlinecasino2018.us.org  http://behindthepalm.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.santacruzcountyplanning.com/LinkClick.aspx?link=https://onlinecasino2018.us.org  http://kavitz.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://salvationarmycarib.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.farwestoil.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://massmutualbrokerage.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://abinternotrab.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://tgt.immediateflood.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://hotelworks.vn/dang-nhap?goto=https://onlinecasino2018.us.org  http://networksolutionsux.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.marazulcharters.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://sportsmansinnovations.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://leafshockeydevelopment.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://aprostine.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://onenetwork.vg/__media__/js/trademark.php?d=onlinecasino2018.us.org  http://plasticexpress.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://lukasjanku.cz/redirect.php?https://onlinecasino2018.us.org   http://usstrategygroup.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.afada.org/index.php?modulo=6&q=https://onlinecasino2018.us.org   http://partnerreinsurance.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://medstarambulance.us/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://thebangaloretimes.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://wanderlustingexpat.com/process/RedirectN?url=https://onlinecasino2018.us.org \nhttp://zpw.kdrowe.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.grupdes.com/enlaces/glinklnk.asp?url=onlinecasino2018.us.org   http://courseofactionpodcast.libsyn.com/website?referer=https://onlinecasino2018.us.org   http://zanaflexmpc.info/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://gulag.notbad.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.coronadoyc.org/default.aspx?p=TrackHyperlink&url=https://onlinecasino2018.us.org  http://ashtangayogamontana.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://tarotreadingsinformation.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://machineryjobs.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://zijn.samenresultaat.nl/click.asp?ref=654612&site=9040&type=text&tnb=31&diurl=https://onlinecasino2018.us.org  http://www.galaorganizationfoundation.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://idfirebox.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.seawave.jp/cgi/adult/rank.cgi?mode=link&id=3965&url=https://onlinecasino2018.us.org  http://www.cow-head.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.chec.com.co/LinkClick.aspx?link=https://onlinecasino2018.us.org  http://www.rakusui.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.qponcoupon.com/view/onlinecasino2018.us.org   http://www.backgroundaustralia.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://debtsumo.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.medlive.cn/redirect.php?resource=guide_keyword_search&index=0&url=https://onlinecasino2018.us.org   http://stuartkoenig.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://forums.epicgames.com/unreal-tournament-2003-2004/ut2004-level-editing-modeling-skinning/102155-pose?goto=onlinecasino2018.us.org  http://razdelguard.biz-market.ru/jump.php?url=https://onlinecasino2018.us.org   http://resourcelists.falmouth.ac.uk/link?url=https://onlinecasino2018.us.org  https://www.pbcorporate.com.sg/redir.php?url=https://onlinecasino2018.us.org  http://catalogy.com/bin/clickhit.php?url=https://onlinecasino2018.us.org/   http://simplytexas.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \n \n \n \n \n \nhttp://www.whisky-academy.com/forum/showthread.php?tid=6096\nhttp://vestiro.ro/forum/index.php/topic,10841.new.html#new\nhttp://missouridom.org/forum/index.php?topic=8378.new#new\nhttp://projectliferp.com/forum/viewtopic.php?f=18&t=23837&p=65877#p65877\nhttp://support-link.info/blog/2019/01/11/essay-on-software-piracy_p5/#comment-373\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8247, "cpu_time_ms": 35, "memory_kb": 4456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s952751318", "group_id": "codeNet:p03941", "input_text": "http://successfully.efolks.am/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://dreamercenter.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://knowmylanpd.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://gooddivorcelawyers.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  https://olshy-tech.pl/modules/mod_jw_srfr/redir.php?url=https://onlinecasino2018.us.org   http://fanpier.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://accesssanmiguel.com/go.php?item=1132&target=https://onlinecasino2018.us.org  http://logc279.xiti.com/go.url?xts=525132&xtor=AD-1-<DE>-<>-<logo>&url=https://onlinecasino2018.us.org   http://www.mayi580.com/ids.mayi580.com/amserver/UI/Login?goto=https://onlinecasino2018.us.org \nhttp://theofficialsites.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://tokyo-f.net/s/click.php?tcode=00010657&url=https://onlinecasino2018.us.org   http://www.netzpro.in/retailless/discounts/onlinecasino2018.us.org   http://vintagenewsmagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  https://www.ugnsecurity.com/link.php?system=redirect&url=https://onlinecasino2018.us.org   http://thebilliondollarsmile.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.legapro.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.reefs.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://panes.securehostingcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://bhhyostandlittle.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.bartonandloguidice.com/LinkClick.aspx?link=https://onlinecasino2018.us.org   http://www.genevaaz.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://progrentis.com.br/inicio/tabid/109/ctl/sendpassword/default.aspx?returnurl=https://onlinecasino2018.us.org  http://maximummaximiles.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://secure.winspark.com/index.html?has_js=1&brandId=3&loa=load&referer=https://onlinecasino2018.us.org  http://g4a.wire-vac.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://easy-fitgreasetraps.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://m.shopinminneapolis.com/redirect.aspx?url=onlinecasino2018.us.org \nhttps://www.medier24.no/auth/?module=TekAuth&service=logout&referer=https://onlinecasino2018.us.org  http://www.mac4us.nl/redirect.php?action=url&goto=onlinecasino2018.us.org   http://www.facialacne.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://tousatsudou.select-chann.com/link.php?url=https://onlinecasino2018.us.org  http://joshdev.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://ucd.uz/upload/rk/27e/ICTExpoj200x300_RUx.swf?flash_link=onlinecasino2018.us.org  http://mavenrazor.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://westcoastmusicians.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://searchinthecity.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.americolife.tc/__media__/js/trademark.php?d=onlinecasino2018.us.org  http://oxy-health.info/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://eliopoulos.us/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.website-guide.com/redirect.php?url=https://onlinecasino2018.us.org  https://ctweb.ru/redirect.php?goto=https://onlinecasino2018.us.org   http://yl.gmlxin.com/scenic.php?g=Scenic&c=Recognition&a=see_login_qrcode&referer=https://onlinecasino2018.us.org  http://fuckuandurfeelings.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://canineaction.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.aura.kz/bitrix/rk.php?id=27&goto=https://onlinecasino2018.us.org \nhttp://donayresphotography.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://elderly-carejobs.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://mybesttop10.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://haanshop.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://images.google.co.uz/url?q=https://onlinecasino2018.us.org   http://infostart.by/redirect.php?url=onlinecasino2018.us.org  http://www.riuqp.com/bbs_0731go_cn/connect.php?mod=login&op=init&referer=https://onlinecasino2018.us.org  http://doneck-news.com/engine/go.php?url=onlinecasino2018.us.org   http://ecorporaterealestate.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://platina4.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://bootikeman.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.stevensoncancercenter.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://imgmedia.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.hussonu.com/redirect?SessionGuid=55b0635b-a77d-495a-a915-4dde13f05dbe&url=https://onlinecasino2018.us.org   http://www.reg3.ru/url.php??s=https://onlinecasino2018.us.org  http://winemakingfun.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.oliveoilshop.it/redirect?action=url&goto=https://onlinecasino2018.us.org   http://bauer.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://club.mansinton.com/redirect.php?tid=91&goto=onlinecasino2018.us.org  http://dadsflix.com/cgi-bin/a2/out.cgi?id=815&u=https://onlinecasino2018.us.org   http://nprsongoftheday.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://search.clarionledger.com/sp?cId=2947408&wId=121610&rNum=24&url=https://onlinecasino2018.us.org  http://www.osservamedia.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://storage.athlinks.com/logout.aspx?returnurl=https://onlinecasino2018.us.org/  http://kenwood-telecom.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://sns.1dugo.com/link.php?url=https://onlinecasino2018.us.org   https://www.firstchoicecu.org/redirect.php?link=onlinecasino2018.us.org \nhttp://teenporn-pictures.com/crtr/cgi/out.cgi?id=55&l=top_top&u=https://onlinecasino2018.us.org  http://hotelsmyconos.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://limefreshfranchise.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.chanon.ro/l.php?r=https://onlinecasino2018.us.org  http://glgoo.jsylhs.com/url?q=https://onlinecasino2018.us.org   http://buynuheat.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://aiworkbench.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://izimap.ru/?company=3687onlinecasino2018.us.org   http://da-mao-miami.xoxohth.com/go.php?url=https://onlinecasino2018.us.org \nhttp://besso.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://uapress.info/uk/go?url=https://onlinecasino2018.us.org   http://bbs.pingtan.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://vgx.cadquality.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://spp.wmpolicyissued.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://africanative.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://activeebonygirls.com/?go=click&c=10&n=31&e=0&g=2&r=11875&u=https://onlinecasino2018.us.org  http://kamarelldesign.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://oclibraries.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \n \n \n \n \n \nhttp://zohra.ch/forum/viewtopic.php?p=118474#118474\nhttp://www.theshiftseries.com/vandnika-sookrit-of-the-leaders-forum/#comment-374\nhttp://worldcup062018.com/worldcup/viewtopic.php?pid=36172#p36172\nhttp://ticket.edu.vn/showthread.php?67698-the-trip-stephen-hawking&p=75651#post75651\nhttps://celsohl.com/?contact-form-id=50235&contact-form-sent=96052&contact-form-hash=61b7306e80c71013c4456a98c4fbb64f390ec1fb&_wpnonce=2923da2649\n", "language": "Lisp", "metadata": {"date": 1547631784, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s952751318.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s952751318", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://successfully.efolks.am/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://dreamercenter.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://knowmylanpd.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://gooddivorcelawyers.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  https://olshy-tech.pl/modules/mod_jw_srfr/redir.php?url=https://onlinecasino2018.us.org   http://fanpier.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://accesssanmiguel.com/go.php?item=1132&target=https://onlinecasino2018.us.org  http://logc279.xiti.com/go.url?xts=525132&xtor=AD-1-<DE>-<>-<logo>&url=https://onlinecasino2018.us.org   http://www.mayi580.com/ids.mayi580.com/amserver/UI/Login?goto=https://onlinecasino2018.us.org \nhttp://theofficialsites.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://tokyo-f.net/s/click.php?tcode=00010657&url=https://onlinecasino2018.us.org   http://www.netzpro.in/retailless/discounts/onlinecasino2018.us.org   http://vintagenewsmagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  https://www.ugnsecurity.com/link.php?system=redirect&url=https://onlinecasino2018.us.org   http://thebilliondollarsmile.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.legapro.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.reefs.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://panes.securehostingcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://bhhyostandlittle.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.bartonandloguidice.com/LinkClick.aspx?link=https://onlinecasino2018.us.org   http://www.genevaaz.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://progrentis.com.br/inicio/tabid/109/ctl/sendpassword/default.aspx?returnurl=https://onlinecasino2018.us.org  http://maximummaximiles.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://secure.winspark.com/index.html?has_js=1&brandId=3&loa=load&referer=https://onlinecasino2018.us.org  http://g4a.wire-vac.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://easy-fitgreasetraps.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://m.shopinminneapolis.com/redirect.aspx?url=onlinecasino2018.us.org \nhttps://www.medier24.no/auth/?module=TekAuth&service=logout&referer=https://onlinecasino2018.us.org  http://www.mac4us.nl/redirect.php?action=url&goto=onlinecasino2018.us.org   http://www.facialacne.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://tousatsudou.select-chann.com/link.php?url=https://onlinecasino2018.us.org  http://joshdev.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://ucd.uz/upload/rk/27e/ICTExpoj200x300_RUx.swf?flash_link=onlinecasino2018.us.org  http://mavenrazor.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://westcoastmusicians.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://searchinthecity.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.americolife.tc/__media__/js/trademark.php?d=onlinecasino2018.us.org  http://oxy-health.info/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://eliopoulos.us/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.website-guide.com/redirect.php?url=https://onlinecasino2018.us.org  https://ctweb.ru/redirect.php?goto=https://onlinecasino2018.us.org   http://yl.gmlxin.com/scenic.php?g=Scenic&c=Recognition&a=see_login_qrcode&referer=https://onlinecasino2018.us.org  http://fuckuandurfeelings.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://canineaction.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.aura.kz/bitrix/rk.php?id=27&goto=https://onlinecasino2018.us.org \nhttp://donayresphotography.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://elderly-carejobs.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://mybesttop10.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://haanshop.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://images.google.co.uz/url?q=https://onlinecasino2018.us.org   http://infostart.by/redirect.php?url=onlinecasino2018.us.org  http://www.riuqp.com/bbs_0731go_cn/connect.php?mod=login&op=init&referer=https://onlinecasino2018.us.org  http://doneck-news.com/engine/go.php?url=onlinecasino2018.us.org   http://ecorporaterealestate.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://platina4.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://bootikeman.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.stevensoncancercenter.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://imgmedia.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.hussonu.com/redirect?SessionGuid=55b0635b-a77d-495a-a915-4dde13f05dbe&url=https://onlinecasino2018.us.org   http://www.reg3.ru/url.php??s=https://onlinecasino2018.us.org  http://winemakingfun.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.oliveoilshop.it/redirect?action=url&goto=https://onlinecasino2018.us.org   http://bauer.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://club.mansinton.com/redirect.php?tid=91&goto=onlinecasino2018.us.org  http://dadsflix.com/cgi-bin/a2/out.cgi?id=815&u=https://onlinecasino2018.us.org   http://nprsongoftheday.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://search.clarionledger.com/sp?cId=2947408&wId=121610&rNum=24&url=https://onlinecasino2018.us.org  http://www.osservamedia.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://storage.athlinks.com/logout.aspx?returnurl=https://onlinecasino2018.us.org/  http://kenwood-telecom.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://sns.1dugo.com/link.php?url=https://onlinecasino2018.us.org   https://www.firstchoicecu.org/redirect.php?link=onlinecasino2018.us.org \nhttp://teenporn-pictures.com/crtr/cgi/out.cgi?id=55&l=top_top&u=https://onlinecasino2018.us.org  http://hotelsmyconos.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://limefreshfranchise.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.chanon.ro/l.php?r=https://onlinecasino2018.us.org  http://glgoo.jsylhs.com/url?q=https://onlinecasino2018.us.org   http://buynuheat.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://aiworkbench.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://izimap.ru/?company=3687onlinecasino2018.us.org   http://da-mao-miami.xoxohth.com/go.php?url=https://onlinecasino2018.us.org \nhttp://besso.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://uapress.info/uk/go?url=https://onlinecasino2018.us.org   http://bbs.pingtan.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://vgx.cadquality.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://spp.wmpolicyissued.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://africanative.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://activeebonygirls.com/?go=click&c=10&n=31&e=0&g=2&r=11875&u=https://onlinecasino2018.us.org  http://kamarelldesign.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://oclibraries.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \n \n \n \n \n \nhttp://zohra.ch/forum/viewtopic.php?p=118474#118474\nhttp://www.theshiftseries.com/vandnika-sookrit-of-the-leaders-forum/#comment-374\nhttp://worldcup062018.com/worldcup/viewtopic.php?pid=36172#p36172\nhttp://ticket.edu.vn/showthread.php?67698-the-trip-stephen-hawking&p=75651#post75651\nhttps://celsohl.com/?contact-form-id=50235&contact-form-sent=96052&contact-form-hash=61b7306e80c71013c4456a98c4fbb64f390ec1fb&_wpnonce=2923da2649\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8090, "cpu_time_ms": 21, "memory_kb": 4068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s962300652", "group_id": "codeNet:p03941", "input_text": "http://www.zt.zj.com/site/redirect.cgi?n=2753&url=https://onlinecasino2018.us.org  http://ktxdmpd.globalreport.org/r?fa=7022&url=https://onlinecasino2018.us.org   http://lexima.gr/lxm/links.php?touch=120&url=https://onlinecasino2018.us.org   http://xn----9sbdmarcavvgizpa7kqd.xn--p1ai/redirect/?go=https://onlinecasino2018.us.org  http://americasnutritian.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.modir.ir/redirect.aspx?url=https://onlinecasino2018.us.org  http://factorytoolz.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://mediatheque.ville-fontenilles.fr/?id=1982219693599062833%20?%3E%20%20%20%20%20%20%20%20%20%20%20%20&referer=https://onlinecasino2018.us.org   http://mykerala.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://halfandless.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://nation-stars-newport.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://sdb.obeikan.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.vansky.com/skyforum/topic.jsp;jsessionid=971136751E6A20B4A7F95FBA1B233902?tid=286709&fid=35&cid=0&goto=onlinecasino2018.us.org  http://glenbrookfire.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://ggl.moonfacts.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://tyentfilters.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://franchises.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://whyeat.net/forum/blog.php?b=89335&goto=onlinecasino2018.us.org \nhttps://profmedia.by/bitrix/rk.php?id=117&site_id=ru&event1=banner&event2=click&event3=1+%2F+%5B117%5D+%5BLEFT_prof%5D+%D0%9D%D0%B0%D0%BB%D0%BE%D0%B3%D0%B8+2018+-++%D1%8D%D1%82%D0%BE&goto=https://onlinecasino2018.us.org  http://www.officialgreenday.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://colletontoday.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.tt-play.com/login/gamebase_new/?referer=https://onlinecasino2018.us.org  http://jacinto.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://citystar74.ru/go?to=https://onlinecasino2018.us.org  http://www.131458.com.cn/p.php?go=https://onlinecasino2018.us.org  http://callique.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://mdcas.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.3dtvcode.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  https://apac01.safelinks.protection.outlook.com/?url=https://onlinecasino2018.us.org   http://188.166.160.241/index.php?thememode=full;redirect=https://onlinecasino2018.us.org   http://hackmare.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://blog.thaiza.com/go.php?http://blog.thaiza.com/goto.php?u=https://onlinecasino2018.us.org   http://shippedat56.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://iowapacific.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://humanescell.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://maps.google.al/url?q=https://onlinecasino2018.us.org \nhttp://1959thunderbird.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://bridgehouseevents.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://casino1988.club/go.php?url=https://onlinecasino2018.us.org   http://hogsneck.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://schickrazorcartridges.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.twinlakesdirectory.coop/sys/pageserver.dll?b=38330&f=l16&s=2201513&go=https://onlinecasino2018.us.org  http://fivestepanimalwelfare.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://ritter-sport.tc/__media__/js/trademark.php?d=onlinecasino2018.us.org   http://jrl.emssafetyservices.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.profsouz.tv/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fwww.solidarnost.org%2Fnews%2FProtest_protiv_mer_ekonomii_ot_Evrotsentrobanka_ohvatil_Frankfurt.html&event3=%D0%9F%D1%80%D0%BE%D1%82%D0%B5%D1%81%D1%82+%D0%BF%D1%80%D0%BE%D1%82%D0%B8%D0%B2+%D0%BC%D0%B5%D1%80+%D1%8D%D0%BA%D0%BE%D0%BD%D0%BE%D0%BC%D0%B8%D0%B8+%D0%BE%D1%82+%D0%95%D0%B2%D1%80%D0%BE%D1%86%D0%B5%D0%BD%D1%82%D1%80%D0%BE%D0%B1%D0%B0%D0%BD%D0%BA%D0%B0+%D0%BE%D1%85%D0%B2%D0%B0%D1%82%D0%B8%D0%BB+%D0%A4%D1%80%D0%B0%D0%BD%D0%BA%D1%84%D1%83%D1%80%D1%82&goto=https://onlinecasino2018.us.org  http://vsw.bbqwars.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://review.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://pacificwidefinance.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://bridgeblue.edu.vn/advertising.redirect.aspx?AdvId=35&url=https://onlinecasino2018.us.org   http://fcczp.huwaige.com/url?q=https://onlinecasino2018.us.org  http://m.so.com/index.php?a=newTranscode&u=https://onlinecasino2018.us.org  http://busvalgroup.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://lanapengar.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://rio.happyplus.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://killerbug.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://news.tech-labs.ru/click.php?url=https://onlinecasino2018.us.org   http://www.musicasalivingthing.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.sugarbearfoundation.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://finipesca.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.weddingmall.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://sturgilllaw.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://www.todocontenedores.com/index.php?url=https://onlinecasino2018.us.org \nhttp://tefl-courses.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.aidjhu.org/r?u=https://onlinecasino2018.us.org   http://bruce-energy.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.heroesworld.ru/out.php?link=https://onlinecasino2018.us.org  http://boundari.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://gotosouthafrica.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://walterabrasives.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://canvasrus.iinet2.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://kevinkobasic.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://scotiamcleodonline.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://kansastrong.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://pyramidcreditunion.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://jk-yamemashita.com/m/redirect.php?url=https://onlinecasino2018.us.org  http://www.theworldgolfchampionships.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://athenausa.org/__media__/js/trademark.php?d=onlinecasino2018.us.org  http://w2.weather.gov/climate/nwsexit.php?wfo=abq&url=https://onlinecasino2018.us.org/  http://www.lamarconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://myarbitr.com/go/url=https://onlinecasino2018.us.org \nhttp://childrenwithepilepsy.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://wjbainbridge.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://bgk-integrated.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.directory.manandmollusc.net/go.pl?go=www..itis..gov/&referer=https://onlinecasino2018.us.org  http://www.hosting-comparison.com/redir.php?link=https://onlinecasino2018.us.org   http://achieversscorecard.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://swiss-coffee.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.websiteprices.org/es/cost/onlinecasino2018.us.org   http://healthwealthkit.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \n \n \n \n \n \nhttp://www.pyraneese.com/forum/index.php?topic=210357.new#new\nhttps://qc-print.tech/index.php/topic,2313.new.html#new\nhttps://keobongda.co/forum/viewtopic.php?pid=264800#p264800\nhttps://tg.vl-mp.com/index.php?topic=79665.new#new\nhttp://zohra.ch/forum/viewtopic.php?p=117501#117501\n", "language": "Lisp", "metadata": {"date": 1547625037, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s962300652.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s962300652", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.zt.zj.com/site/redirect.cgi?n=2753&url=https://onlinecasino2018.us.org  http://ktxdmpd.globalreport.org/r?fa=7022&url=https://onlinecasino2018.us.org   http://lexima.gr/lxm/links.php?touch=120&url=https://onlinecasino2018.us.org   http://xn----9sbdmarcavvgizpa7kqd.xn--p1ai/redirect/?go=https://onlinecasino2018.us.org  http://americasnutritian.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.modir.ir/redirect.aspx?url=https://onlinecasino2018.us.org  http://factorytoolz.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://mediatheque.ville-fontenilles.fr/?id=1982219693599062833%20?%3E%20%20%20%20%20%20%20%20%20%20%20%20&referer=https://onlinecasino2018.us.org   http://mykerala.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://halfandless.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://nation-stars-newport.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://sdb.obeikan.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.vansky.com/skyforum/topic.jsp;jsessionid=971136751E6A20B4A7F95FBA1B233902?tid=286709&fid=35&cid=0&goto=onlinecasino2018.us.org  http://glenbrookfire.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://ggl.moonfacts.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://tyentfilters.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://franchises.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://whyeat.net/forum/blog.php?b=89335&goto=onlinecasino2018.us.org \nhttps://profmedia.by/bitrix/rk.php?id=117&site_id=ru&event1=banner&event2=click&event3=1+%2F+%5B117%5D+%5BLEFT_prof%5D+%D0%9D%D0%B0%D0%BB%D0%BE%D0%B3%D0%B8+2018+-++%D1%8D%D1%82%D0%BE&goto=https://onlinecasino2018.us.org  http://www.officialgreenday.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://colletontoday.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.tt-play.com/login/gamebase_new/?referer=https://onlinecasino2018.us.org  http://jacinto.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://citystar74.ru/go?to=https://onlinecasino2018.us.org  http://www.131458.com.cn/p.php?go=https://onlinecasino2018.us.org  http://callique.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://mdcas.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.3dtvcode.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  https://apac01.safelinks.protection.outlook.com/?url=https://onlinecasino2018.us.org   http://188.166.160.241/index.php?thememode=full;redirect=https://onlinecasino2018.us.org   http://hackmare.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://blog.thaiza.com/go.php?http://blog.thaiza.com/goto.php?u=https://onlinecasino2018.us.org   http://shippedat56.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://iowapacific.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://humanescell.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://maps.google.al/url?q=https://onlinecasino2018.us.org \nhttp://1959thunderbird.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://bridgehouseevents.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://casino1988.club/go.php?url=https://onlinecasino2018.us.org   http://hogsneck.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://schickrazorcartridges.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.twinlakesdirectory.coop/sys/pageserver.dll?b=38330&f=l16&s=2201513&go=https://onlinecasino2018.us.org  http://fivestepanimalwelfare.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://ritter-sport.tc/__media__/js/trademark.php?d=onlinecasino2018.us.org   http://jrl.emssafetyservices.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.profsouz.tv/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fwww.solidarnost.org%2Fnews%2FProtest_protiv_mer_ekonomii_ot_Evrotsentrobanka_ohvatil_Frankfurt.html&event3=%D0%9F%D1%80%D0%BE%D1%82%D0%B5%D1%81%D1%82+%D0%BF%D1%80%D0%BE%D1%82%D0%B8%D0%B2+%D0%BC%D0%B5%D1%80+%D1%8D%D0%BA%D0%BE%D0%BD%D0%BE%D0%BC%D0%B8%D0%B8+%D0%BE%D1%82+%D0%95%D0%B2%D1%80%D0%BE%D1%86%D0%B5%D0%BD%D1%82%D1%80%D0%BE%D0%B1%D0%B0%D0%BD%D0%BA%D0%B0+%D0%BE%D1%85%D0%B2%D0%B0%D1%82%D0%B8%D0%BB+%D0%A4%D1%80%D0%B0%D0%BD%D0%BA%D1%84%D1%83%D1%80%D1%82&goto=https://onlinecasino2018.us.org  http://vsw.bbqwars.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://review.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://pacificwidefinance.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://bridgeblue.edu.vn/advertising.redirect.aspx?AdvId=35&url=https://onlinecasino2018.us.org   http://fcczp.huwaige.com/url?q=https://onlinecasino2018.us.org  http://m.so.com/index.php?a=newTranscode&u=https://onlinecasino2018.us.org  http://busvalgroup.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://lanapengar.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://rio.happyplus.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://killerbug.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://news.tech-labs.ru/click.php?url=https://onlinecasino2018.us.org   http://www.musicasalivingthing.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.sugarbearfoundation.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://finipesca.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.weddingmall.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://sturgilllaw.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://www.todocontenedores.com/index.php?url=https://onlinecasino2018.us.org \nhttp://tefl-courses.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.aidjhu.org/r?u=https://onlinecasino2018.us.org   http://bruce-energy.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.heroesworld.ru/out.php?link=https://onlinecasino2018.us.org  http://boundari.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://gotosouthafrica.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://walterabrasives.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://canvasrus.iinet2.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://kevinkobasic.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://scotiamcleodonline.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://kansastrong.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://pyramidcreditunion.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://jk-yamemashita.com/m/redirect.php?url=https://onlinecasino2018.us.org  http://www.theworldgolfchampionships.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://athenausa.org/__media__/js/trademark.php?d=onlinecasino2018.us.org  http://w2.weather.gov/climate/nwsexit.php?wfo=abq&url=https://onlinecasino2018.us.org/  http://www.lamarconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://myarbitr.com/go/url=https://onlinecasino2018.us.org \nhttp://childrenwithepilepsy.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://wjbainbridge.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://bgk-integrated.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.directory.manandmollusc.net/go.pl?go=www..itis..gov/&referer=https://onlinecasino2018.us.org  http://www.hosting-comparison.com/redir.php?link=https://onlinecasino2018.us.org   http://achieversscorecard.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://swiss-coffee.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.websiteprices.org/es/cost/onlinecasino2018.us.org   http://healthwealthkit.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \n \n \n \n \n \nhttp://www.pyraneese.com/forum/index.php?topic=210357.new#new\nhttps://qc-print.tech/index.php/topic,2313.new.html#new\nhttps://keobongda.co/forum/viewtopic.php?pid=264800#p264800\nhttps://tg.vl-mp.com/index.php?topic=79665.new#new\nhttp://zohra.ch/forum/viewtopic.php?p=117501#117501\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8564, "cpu_time_ms": 38, "memory_kb": 5220}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s402014999", "group_id": "codeNet:p03941", "input_text": "http://jenniferwarnes.info/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://rotarysails.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://gerrysberrys.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.significantnews.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://patriotrageusa.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.terraforza.nl/volleybalbal/guestbook/go.php?url=https://onlinecasino2018.us.org  http://kiwanis.laporteindustries.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.banconacionaldemarcas.com.br/redir.php?id=3036&url=https://onlinecasino2018.us.org   http://wap4u.ru/novosti/news.php?fon=000000&txt=ff0000&stxt=ff0000&url=onlinecasino2018.us.org \nhttp://thehealingangel.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://i-hate-david-weekly-homes.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://inlove.org.ua/redirect?url=https://onlinecasino2018.us.org   http://lowehospitalitygroup.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.emcmos.ru/upload/rk/ed4/ed4bef012fcbda71169f73ea60f0a618.swf?flash_link=onlinecasino2018.us.org   http://www.ifsi04.com/liens/do/redirect/?url=https://onlinecasino2018.us.org  http://lindengrun.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://theself-healingworkstation.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://loveofmusicstl.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://invisageco.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://usr.sierrausa.de/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://fentonlittleleague.org/Goto.asp?url=https://onlinecasino2018.us.org   http://conservativesoffaith.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://svsp.ru/go.php?url=https://onlinecasino2018.us.org   http://calcigummies.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://lutsk.magazini.com.ua/detskielutsk/link.php?id=1498&url=https://onlinecasino2018.us.org  http://catfishcomedy.libsyn.com/website?referer=https://onlinecasino2018.us.org   http://www.vista-mar.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.my-retail-store.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://klingensmiths.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://brandintelx.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://340stinger.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://longfences.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.real97.com/catalog/redirect.php?action=url&goto=onlinecasino2018.us.org  http://drivethroughfantasy.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.menshirts.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://dogumkontrolu.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://2947.1go.co.kr/link.php?url=https://onlinecasino2018.us.org  http://salesforceselect.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://farmtoconsumer.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://lotsofsoft.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://jbtaxcpa.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.taiwanaudio.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://littlegovernorscamp.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.mdplasticsurgery.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.rockfordfosgate.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.laportechamber.org/LinkClick.aspx?link=https://onlinecasino2018.us.org  http://steverempe.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://dokodemodoor.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://currentgiftcheck.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.h-peters.com/gastenboek/go.php?url=https://onlinecasino2018.us.org   http://tnw.lewiscellars.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.electricalcontractorshawaii.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://conceptline.pro/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino2018.us.org   http://www.gembuddha.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://videodw.comes.videodw.com/url?q=https://onlinecasino2018.us.org  http://lex-score.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://erzgebirgswetter.de/cgi-bin/link.pl?url=https://onlinecasino2018.us.org   http://www.globemanufacturing.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://xn--80aaaha9as1a9aq.xn--p1ai/index.php/gostevaya-kniga?goto=onlinecasino2018.us.org   http://houex.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://hauteticket.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://uxf.dollarbank.de/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.hfmmagazine.com/user/logout?referer=https://onlinecasino2018.us.org \nhttp://makingmarketguru.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://graceriversideinn.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://cyemblem.com/redirect.php?tid=12647&goto=onlinecasino2018.us.org   http://filialtouch.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.alt.familieopel.de/modules/mod_jw_srfr/redir.php?url=https://onlinecasino2018.us.org   http://n42.broadwayplaza.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://tech-hippie.com/go.php?https://onlinecasino2018.us.org  http://pantanalbags.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://breakthrough-design.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://napervilleschools.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.lowcountries.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://sru.winwithgold.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://my.gz-dxc.com/link.php?url=https://onlinecasino2018.us.org  http://webradio.fm/webtop.cfm?site=https://onlinecasino2018.us.org   http://elmhurstdancecenter.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  https://www.ticketea.de/echo_view/?referer=https://onlinecasino2018.us.org  http://sr22rates.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://soemom.co.nz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://dotcalmpromotions.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.jalight.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://columbuslocalnews.tv/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://search.gopensacola.com/sp?cId=0&wId=103513&rNum=1&url=https://onlinecasino2018.us.org  http://youngerfoundation.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://schatsbakkery.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://pgstockoptions.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://stmservice.crm.gabriels.net/tracking?action=redirect&verificationcode=805434FC-F268-434F-BF0A-5723F9EB7A93&redirect=https://onlinecasino2018.us.org   http://www.triada-mebel.ru/ext_link?url=https://onlinecasino2018.us.org \n \n \n \n \n \nhttp://www.tunturisusi.com/aforismitfoorumi/phpBB3/viewtopic.php?f=14&t=9&p=1296#p1296\nhttp://www.jjhservers.com/phpbb/viewtopic.php?f=6&t=2316&p=8075#p8075\nhttp://alexlema.com/forum/index.php?topic=15192.new#new\nhttps://www.forum.ma-network.de/showthread.php?tid=11&pid=3763#pid3763\nhttps://ls.cdn.augustus.host/forumtest/index.php?topic=8496.new#new\n", "language": "Lisp", "metadata": {"date": 1547605214, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s402014999.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s402014999", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://jenniferwarnes.info/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://rotarysails.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://gerrysberrys.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.significantnews.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://patriotrageusa.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.terraforza.nl/volleybalbal/guestbook/go.php?url=https://onlinecasino2018.us.org  http://kiwanis.laporteindustries.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.banconacionaldemarcas.com.br/redir.php?id=3036&url=https://onlinecasino2018.us.org   http://wap4u.ru/novosti/news.php?fon=000000&txt=ff0000&stxt=ff0000&url=onlinecasino2018.us.org \nhttp://thehealingangel.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://i-hate-david-weekly-homes.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   https://inlove.org.ua/redirect?url=https://onlinecasino2018.us.org   http://lowehospitalitygroup.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.emcmos.ru/upload/rk/ed4/ed4bef012fcbda71169f73ea60f0a618.swf?flash_link=onlinecasino2018.us.org   http://www.ifsi04.com/liens/do/redirect/?url=https://onlinecasino2018.us.org  http://lindengrun.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://theself-healingworkstation.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://loveofmusicstl.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://invisageco.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://usr.sierrausa.de/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://fentonlittleleague.org/Goto.asp?url=https://onlinecasino2018.us.org   http://conservativesoffaith.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://svsp.ru/go.php?url=https://onlinecasino2018.us.org   http://calcigummies.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://lutsk.magazini.com.ua/detskielutsk/link.php?id=1498&url=https://onlinecasino2018.us.org  http://catfishcomedy.libsyn.com/website?referer=https://onlinecasino2018.us.org   http://www.vista-mar.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.my-retail-store.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://klingensmiths.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://brandintelx.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://340stinger.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://longfences.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.real97.com/catalog/redirect.php?action=url&goto=onlinecasino2018.us.org  http://drivethroughfantasy.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.menshirts.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://dogumkontrolu.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://2947.1go.co.kr/link.php?url=https://onlinecasino2018.us.org  http://salesforceselect.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://farmtoconsumer.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://lotsofsoft.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://jbtaxcpa.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.taiwanaudio.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://littlegovernorscamp.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.mdplasticsurgery.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.rockfordfosgate.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://www.laportechamber.org/LinkClick.aspx?link=https://onlinecasino2018.us.org  http://steverempe.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://dokodemodoor.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://currentgiftcheck.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.h-peters.com/gastenboek/go.php?url=https://onlinecasino2018.us.org   http://tnw.lewiscellars.biz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.electricalcontractorshawaii.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://conceptline.pro/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino2018.us.org   http://www.gembuddha.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://videodw.comes.videodw.com/url?q=https://onlinecasino2018.us.org  http://lex-score.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://erzgebirgswetter.de/cgi-bin/link.pl?url=https://onlinecasino2018.us.org   http://www.globemanufacturing.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://xn--80aaaha9as1a9aq.xn--p1ai/index.php/gostevaya-kniga?goto=onlinecasino2018.us.org   http://houex.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://hauteticket.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://uxf.dollarbank.de/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://www.hfmmagazine.com/user/logout?referer=https://onlinecasino2018.us.org \nhttp://makingmarketguru.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://graceriversideinn.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://cyemblem.com/redirect.php?tid=12647&goto=onlinecasino2018.us.org   http://filialtouch.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.alt.familieopel.de/modules/mod_jw_srfr/redir.php?url=https://onlinecasino2018.us.org   http://n42.broadwayplaza.net/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://tech-hippie.com/go.php?https://onlinecasino2018.us.org  http://pantanalbags.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://breakthrough-design.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://napervilleschools.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.lowcountries.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://sru.winwithgold.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://my.gz-dxc.com/link.php?url=https://onlinecasino2018.us.org  http://webradio.fm/webtop.cfm?site=https://onlinecasino2018.us.org   http://elmhurstdancecenter.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  https://www.ticketea.de/echo_view/?referer=https://onlinecasino2018.us.org  http://sr22rates.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://soemom.co.nz/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org \nhttp://dotcalmpromotions.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://www.jalight.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://columbuslocalnews.tv/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://search.gopensacola.com/sp?cId=0&wId=103513&rNum=1&url=https://onlinecasino2018.us.org  http://youngerfoundation.org/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org   http://schatsbakkery.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://pgstockoptions.com/__media__/js/netsoltrademark.php?d=onlinecasino2018.us.org  http://stmservice.crm.gabriels.net/tracking?action=redirect&verificationcode=805434FC-F268-434F-BF0A-5723F9EB7A93&redirect=https://onlinecasino2018.us.org   http://www.triada-mebel.ru/ext_link?url=https://onlinecasino2018.us.org \n \n \n \n \n \nhttp://www.tunturisusi.com/aforismitfoorumi/phpBB3/viewtopic.php?f=14&t=9&p=1296#p1296\nhttp://www.jjhservers.com/phpbb/viewtopic.php?f=6&t=2316&p=8075#p8075\nhttp://alexlema.com/forum/index.php?topic=15192.new#new\nhttps://www.forum.ma-network.de/showthread.php?tid=11&pid=3763#pid3763\nhttps://ls.cdn.augustus.host/forumtest/index.php?topic=8496.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8151, "cpu_time_ms": 102, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s164533781", "group_id": "codeNet:p03941", "input_text": "https://davielacrosse.com/Goto.asp?url=https://onlinecasino888.us.org  https://www.android30t.com/go.php?url=https://onlinecasino888.us.org   http://www.gxhzxw.com/index.php/46-jump?id=14&bid=11&postfix=&url=https://onlinecasino888.us.org   http://coinpublishers.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://telefm.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.mirvokrug.com/go.php?url=https://onlinecasino888.us.org  http://northamptonlacrosse.org/Goto.asp?url=https://onlinecasino888.us.org  http://californiarelocationservices.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.mchc.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.azerbaijanamericaalliance.org/__media__/js/trademark.php?d=onlinecasino888.us.org  http://www.facebook.cockytalk.com/showthread.php?goto=onlinecasino888.us.org   http://www.wrightwradio.com/modules/mod_jw_srfr/redir.php?url=https://onlinecasino888.us.org   http://www.mudrikon.ru/go?https://onlinecasino888.us.org  http://www.dongfangshoucang.com/dialog_1.htm?arg=10080724&style=1&kf=&kflist=off&kf=53fc487489323b9af40ecd54&zdkf_type=2&language=zh-cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://onlinecasino888.us.org   http://www.tuscanyrentdirect.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.allstar8.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nissannews-global.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://board.medprof.ru/redirect/?go=https://onlinecasino888.us.org \nhttp://nr09253.vhost-enzo.sil.at/phpinfo.php?a<>=<a+href=https://onlinecasino888.us.org  http://kallar.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bbs.yys5.com/redirect.php?fid=2&tid=12045&goto=onlinecasino888.us.org   http://images.google.dk/url?q=https://onlinecasino888.us.org  http://kkk.m.cntvboxnow.com/redirect.php?tid=3946304&goto=onlinecasino888.us.org   http://www.discoverteesvalley.co.uk/redirect.aspx?destination=https://onlinecasino888.us.org  http://www.kluegel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.imenik-spletnih-strani.net/spletna-stran/prehransko-dopolnilo-koencim-q10/886?url=https://onlinecasino888.us.org   http://www.dvorec.ru/cinema/referer.php?referer=https://onlinecasino888.us.org \nhttp://www.021mw.cn/url.php?url=https://onlinecasino888.us.org  http://spicybunny.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://blondbreakfast.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://timmyhaxton.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://axafinancialservices.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://missindonesia.net/forum/index.php?thememode=full;redirect=https://onlinecasino888.us.org  http://nantbot.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://forum.zone-game.info/showthread.php?goto=onlinecasino888.us.org   http://www.bmwclubcr.com/foro/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fwww.bmwclubcr.com%2Fforo%2Findex.php%3F%2Ftopic%2F2888-nuevo-en-el-foro%2F&code=424410a6d2b287e4353425273df32299&board_url=https://onlinecasino888.us.org \nhttp://www.amiseo.ru/drupal/hint-and-tips/skryvaem-fakt-chto-nash-sajt-rabotaet-na-drupal?goto=https://onlinecasino888.us.org  http://www.shodoschool-site.info/rank.php?mode=link&id=2646&url=https://onlinecasino888.us.org   http://pelismega.net/wp-content/plugins/AND-AntiBounce/redirector.php?url=https://onlinecasino888.us.org   https://www.oldtimer.ru/?hide=true&flash_link=onlinecasino888.us.org  http://www.xhblog.com/go.asp?url=https://onlinecasino888.us.org   https://www.vauem.de/page/?redirect&url=https://onlinecasino888.us.org  http://www.annamariespizza.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://handballold.nif.no/linkout.asp?url=https://onlinecasino888.us.org   http://baixades.mozilla.cat/?url=http://id=firefox&versio=32.0&so=windowsonlinecasino888.us.org \nhttp://understandretirement.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tree.mn/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://aurogon.bbs.wangyuan.com/redirect.php?goto=onlinecasino888.us.org   http://www.thegoodbreast.com/r?u=https://onlinecasino888.us.org  http://ru.myruc.com/link.php?url=https://onlinecasino888.us.org   https://140161907.r.bat.bing.com/?ld=d3K0oIq_reVq-zVUrJrrN-CzVUCUyWljUw5tVGCz6T1RXHjULrXYZlUzFvFvZxqYhaxNdXhIHJ8UOrGbroAkfIRyH_gavccfmZpD3mREKBVQXewGO9gRiRv6KAWiSJl62y3-AAV7To9cYzGaJrMo5RzvbkWb0Z_JzI_qSHHAGwnIOllOy_&u=https://onlinecasino888.us.org  http://bandwidthventures.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.together.org.nz/r?u=https://onlinecasino888.us.org   http://swimbikerun.com.au/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.mb-llc.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://clothingclose.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://coachintensive.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.smacomber.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ucraina.learningexpresslibrary.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dokkeninc.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://wakeupkohls.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.spacesofsilence.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://nlyyt.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://assurance-etudiants.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://omnidisruptive.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://maps.google.lk/url?q=https://onlinecasino888.us.org   http://satancomestoedenmovie.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://cslea.memberdiscounts.co/perks/process/redirect?action=track_ad&url=https://onlinecasino888.us.org   http://forcesaldershot.2day.ws/forcesaldershot/search/?url=https://onlinecasino888.us.org  http://osif.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://stlouisonsale.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://sportsvideo.net/splash?url=https://onlinecasino888.us.org \nhttp://sitmrcs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://s15.stc.all.kpcdn.net/go/https://onlinecasino888.us.org   http://cure4treebeard.org/LinkClick.aspx?link=https://onlinecasino888.us.org   http://revalesiomedical.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://missuniversehungary.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.grenkprint.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://brookray.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://elkinnorthcarolina.com/netRedirect.asp?ID=89&url=https://onlinecasino888.us.org   https://www.seceye.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino888.us.org \nhttp://polarisdirectmail.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://completesavingsoffers.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.3rly.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino888.us.org   http://www.ahjuncheng.com/sdzdjm/company.php?arg=53kf--&style=1&referer=https://onlinecasino888.us.org  http://medicaltourismeducation.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dstart.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://2611801.r.msn.com/?ld=d35NEcdpF6Z3cPsvxAjkk8YDVUCUwDT1IIOGG2BZmdVI7L5Ex8tjtjqGCApH9X1tyFzHo5YKWuoMbfllAM-mMoGQvL1C0BmUeWxGnkRKlb3hCuZHdpkgKO2zcF1JjC0MSph4WdsSMwoP6Ak8j4N1FxAgaT6QxTAl5TCC-bMiyJa1JV7Kld&u=https://onlinecasino888.us.org  http://coachingintensives.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://emilysparrow.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://www.lesgoonies-ark.fr/forum/viewtopic.php?pid=506475#p506475\nhttp://www.online-einsaetze.de/forum/showthread.php?tid=1176420\nhttp://crotchrocketracing.com/forum/index.php/topic,36043.new.html#new\nhttp://sztolnia.org/forum/index.php?topic=10297.new#new\nhttp://oliversmagicdiet.com/forum/index.php?topic=12007.new#new\n", "language": "Lisp", "metadata": {"date": 1547537770, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s164533781.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s164533781", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://davielacrosse.com/Goto.asp?url=https://onlinecasino888.us.org  https://www.android30t.com/go.php?url=https://onlinecasino888.us.org   http://www.gxhzxw.com/index.php/46-jump?id=14&bid=11&postfix=&url=https://onlinecasino888.us.org   http://coinpublishers.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://telefm.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.mirvokrug.com/go.php?url=https://onlinecasino888.us.org  http://northamptonlacrosse.org/Goto.asp?url=https://onlinecasino888.us.org  http://californiarelocationservices.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.mchc.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.azerbaijanamericaalliance.org/__media__/js/trademark.php?d=onlinecasino888.us.org  http://www.facebook.cockytalk.com/showthread.php?goto=onlinecasino888.us.org   http://www.wrightwradio.com/modules/mod_jw_srfr/redir.php?url=https://onlinecasino888.us.org   http://www.mudrikon.ru/go?https://onlinecasino888.us.org  http://www.dongfangshoucang.com/dialog_1.htm?arg=10080724&style=1&kf=&kflist=off&kf=53fc487489323b9af40ecd54&zdkf_type=2&language=zh-cn&charset=gbk&username=&userinfo=&introurl=&lyurl=&lytype=0&copartner=&referer=https://onlinecasino888.us.org   http://www.tuscanyrentdirect.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.allstar8.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nissannews-global.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://board.medprof.ru/redirect/?go=https://onlinecasino888.us.org \nhttp://nr09253.vhost-enzo.sil.at/phpinfo.php?a<>=<a+href=https://onlinecasino888.us.org  http://kallar.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bbs.yys5.com/redirect.php?fid=2&tid=12045&goto=onlinecasino888.us.org   http://images.google.dk/url?q=https://onlinecasino888.us.org  http://kkk.m.cntvboxnow.com/redirect.php?tid=3946304&goto=onlinecasino888.us.org   http://www.discoverteesvalley.co.uk/redirect.aspx?destination=https://onlinecasino888.us.org  http://www.kluegel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.imenik-spletnih-strani.net/spletna-stran/prehransko-dopolnilo-koencim-q10/886?url=https://onlinecasino888.us.org   http://www.dvorec.ru/cinema/referer.php?referer=https://onlinecasino888.us.org \nhttp://www.021mw.cn/url.php?url=https://onlinecasino888.us.org  http://spicybunny.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://blondbreakfast.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://timmyhaxton.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://axafinancialservices.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://missindonesia.net/forum/index.php?thememode=full;redirect=https://onlinecasino888.us.org  http://nantbot.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://forum.zone-game.info/showthread.php?goto=onlinecasino888.us.org   http://www.bmwclubcr.com/foro/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fwww.bmwclubcr.com%2Fforo%2Findex.php%3F%2Ftopic%2F2888-nuevo-en-el-foro%2F&code=424410a6d2b287e4353425273df32299&board_url=https://onlinecasino888.us.org \nhttp://www.amiseo.ru/drupal/hint-and-tips/skryvaem-fakt-chto-nash-sajt-rabotaet-na-drupal?goto=https://onlinecasino888.us.org  http://www.shodoschool-site.info/rank.php?mode=link&id=2646&url=https://onlinecasino888.us.org   http://pelismega.net/wp-content/plugins/AND-AntiBounce/redirector.php?url=https://onlinecasino888.us.org   https://www.oldtimer.ru/?hide=true&flash_link=onlinecasino888.us.org  http://www.xhblog.com/go.asp?url=https://onlinecasino888.us.org   https://www.vauem.de/page/?redirect&url=https://onlinecasino888.us.org  http://www.annamariespizza.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://handballold.nif.no/linkout.asp?url=https://onlinecasino888.us.org   http://baixades.mozilla.cat/?url=http://id=firefox&versio=32.0&so=windowsonlinecasino888.us.org \nhttp://understandretirement.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tree.mn/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://aurogon.bbs.wangyuan.com/redirect.php?goto=onlinecasino888.us.org   http://www.thegoodbreast.com/r?u=https://onlinecasino888.us.org  http://ru.myruc.com/link.php?url=https://onlinecasino888.us.org   https://140161907.r.bat.bing.com/?ld=d3K0oIq_reVq-zVUrJrrN-CzVUCUyWljUw5tVGCz6T1RXHjULrXYZlUzFvFvZxqYhaxNdXhIHJ8UOrGbroAkfIRyH_gavccfmZpD3mREKBVQXewGO9gRiRv6KAWiSJl62y3-AAV7To9cYzGaJrMo5RzvbkWb0Z_JzI_qSHHAGwnIOllOy_&u=https://onlinecasino888.us.org  http://bandwidthventures.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.together.org.nz/r?u=https://onlinecasino888.us.org   http://swimbikerun.com.au/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.mb-llc.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://clothingclose.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://coachintensive.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.smacomber.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ucraina.learningexpresslibrary.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dokkeninc.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://wakeupkohls.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.spacesofsilence.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://nlyyt.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://assurance-etudiants.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://omnidisruptive.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://maps.google.lk/url?q=https://onlinecasino888.us.org   http://satancomestoedenmovie.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://cslea.memberdiscounts.co/perks/process/redirect?action=track_ad&url=https://onlinecasino888.us.org   http://forcesaldershot.2day.ws/forcesaldershot/search/?url=https://onlinecasino888.us.org  http://osif.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://stlouisonsale.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://sportsvideo.net/splash?url=https://onlinecasino888.us.org \nhttp://sitmrcs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://s15.stc.all.kpcdn.net/go/https://onlinecasino888.us.org   http://cure4treebeard.org/LinkClick.aspx?link=https://onlinecasino888.us.org   http://revalesiomedical.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://missuniversehungary.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.grenkprint.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://brookray.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://elkinnorthcarolina.com/netRedirect.asp?ID=89&url=https://onlinecasino888.us.org   https://www.seceye.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino888.us.org \nhttp://polarisdirectmail.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://completesavingsoffers.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.3rly.cn/wp-content/themes/begin/inc/go.php?url=https://onlinecasino888.us.org   http://www.ahjuncheng.com/sdzdjm/company.php?arg=53kf--&style=1&referer=https://onlinecasino888.us.org  http://medicaltourismeducation.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dstart.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://2611801.r.msn.com/?ld=d35NEcdpF6Z3cPsvxAjkk8YDVUCUwDT1IIOGG2BZmdVI7L5Ex8tjtjqGCApH9X1tyFzHo5YKWuoMbfllAM-mMoGQvL1C0BmUeWxGnkRKlb3hCuZHdpkgKO2zcF1JjC0MSph4WdsSMwoP6Ak8j4N1FxAgaT6QxTAl5TCC-bMiyJa1JV7Kld&u=https://onlinecasino888.us.org  http://coachingintensives.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://emilysparrow.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://www.lesgoonies-ark.fr/forum/viewtopic.php?pid=506475#p506475\nhttp://www.online-einsaetze.de/forum/showthread.php?tid=1176420\nhttp://crotchrocketracing.com/forum/index.php/topic,36043.new.html#new\nhttp://sztolnia.org/forum/index.php?topic=10297.new#new\nhttp://oliversmagicdiet.com/forum/index.php?topic=12007.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8521, "cpu_time_ms": 29, "memory_kb": 4580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s835318295", "group_id": "codeNet:p03941", "input_text": "http://myhubfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://phorumphilly.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://i-gnosis.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://eon.samosa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://dorisgreen.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ebhealth.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://missionaryplanet.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sportsmansinnovations.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.aag-usa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://galegals.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.365960.com/home/link.php?url=https://onlinecasino888.us.org   http://nasconf.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://altfish.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://golosislama.com/go.php?url=https://onlinecasino888.us.org   http://hillandhollowantiques.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://madmediaagency.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://rospravosudie.com/research/map_any.html?f1=https://onlinecasino888.us.org   http://fontay.ru/redirect/?go=https://onlinecasino888.us.org \nhttp://sexscandalmovie.com/cgi-bin/crtr/out.cgi?id=69&l=top_top&u=https://onlinecasino888.us.org  http://heide-iravani-gets-fired.xoxohth.com/go.php?url=https://onlinecasino888.us.org   http://ricknakajima.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.nobclub.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.homepage-dienste.com/guestbookserver/redirect.php?to=https://onlinecasino888.us.org   http://odziezowy.tanisklep.net/redirect.php?action=url&goto=https://onlinecasino888.us.org  http://havas-tribu.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.freegaytubes.net/cgi-bin/site/out.cgi?id=19&tag=top&trade=https://onlinecasino888.us.org   http://sertacustomer.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.communique.it/LinkClick.aspx?link=https://onlinecasino888.us.org  https://www.flying15.org.uk/LinkClick.aspx?link=https://onlinecasino888.us.org   http://hair-loss.goldenarticles.net/go.php?url=https://onlinecasino888.us.org   http://intellclinic.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://skiban1308.dvrdydns.com/upload/rk/911/240%D1%85200%20cooperation.swf?flash_link=onlinecasino888.us.org   http://photoseurope.free.fr/redir.php?url=https://onlinecasino888.us.org  https://facenama.com/redirect.php?url=https://onlinecasino888.us.org  http://polyestertux.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://lrl.scancomputers.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://single-sexy.com/goto.php?w=https://onlinecasino888.us.org  http://ytc.thepumppeople.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.mplex.org/LinkClick.aspx?link=https://onlinecasino888.us.org   http://www.quincepix.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://bankingbpm.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://alluaejobs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mcnp.blogsky.com/dailylink/?go=https://onlinecasino888.us.org  http://www.dinskoeposelenie.ru/bitrix/rk.php?id=32&site_id=s1&event1=banner&event2=click&goto=onlinecasino888.us.org   http://lybrarius.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.igus.eu/myigus/default.aspx?page=emailpage&url=https://onlinecasino888.us.org  http://afterglowimports.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.stvdpchurch.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.spreumatologia.pt/redirect.php?key=external&url=https://onlinecasino888.us.org  https://2ch.omorovie.com/redirect.php?url=https://onlinecasino888.us.org   http://gameventurecapital.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://glass.pass.org/LinkClick.aspx?link=https://onlinecasino888.us.org  http://log.atlas.sk/vizitka/centrum/click.php?id=30e839685dad10b4c042b3d0dffb61a7&url=https://onlinecasino888.us.org   http://fellowshipbenton.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://hrp.samosa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.turnkeysports.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://rlasalle.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mihavxc.ru/go.php?url=onlinecasino888.us.org  http://timmcquaid.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://videos.tvembed.eu/redirect.php?url=https://onlinecasino888.us.org/  http://okodukaiseikatsu.com/jump/?url=https://onlinecasino888.us.org/  http://montroseit.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.chglobalsecurity.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://babymamaexcercise.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://specifyamca.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.msgapp.com/jc.aspx?d=JWGMWTWDGAIEL73F22OTZGQARVLY2GSVLVKKQSUBXXVYZCEFMNDX4KCERB7WPWQVVN5XIXZ7UBAOZGXHNW2QDFKAGRHU2XJQJYQKU4SXGNE45N3VKU2NY4BAUAWGAA6EGANZOPCZ4X3IHFQBA7BOAUUQ3EOLSEFY2CZENVX3QCXWDDDRCZ434LCL4YUUJ6WKSSN7EN2SUPKUUGXMREH3ZIXQZ456XG4XP3GS6FF5GOKCM7EQDJU3VZ3ZI5IWUQYDT3LIC3PJN7HGE25FLGBQ5WE5LI6JFDGJNP5YS7P4Y37OCHM4JGJQ26BZLSXWKUN4OT4P56QBX57Q%3D%3D%3D%3D&u=https://onlinecasino888.us.org   http://calhouncitychamberofcommerce.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://patientsunited.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://cardiffairporthotel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://villagesofswanpoint.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rvb.gcpusa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://eastsidebodyshopcincy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://mydelissh.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.woojinact.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://owlsource.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.isheika.com/url.php?https://onlinecasino888.us.org  https://jobs.imv-medien.at/redirect.php?url=https://onlinecasino888.us.org   http://transteh.net/goto/?url=https://onlinecasino888.us.org  http://rogergmorse.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.linkeye.co.jp/mt/mt4i.cgi?id=1&mode=redirect&no=7&ref_eid=10&url=https://onlinecasino888.us.org   http://kosaircharitiescommittee.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://payattorneybill.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://yourfranchisingsolution.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ubiquitiwarehouse.com.au/redirect.php?action=url&goto=onlinecasino888.us.org   http://www.google.com.om/url?q=https://onlinecasino888.us.org  http://imw.netcomponent.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://hudren.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tradebus.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.fumcwausau.org/System/UserProfile.asp?id=34002&func=signup&referer=https://onlinecasino888.us.org   http://bv-pristavba.fifty-50.cz/iframe.php?uri=https://onlinecasino888.us.org \n \n \n \n \n \nhttp://www.piterenka.ru/forum/viewtopic.php?f=4&t=25043\nhttp://legalize.co/listings/the-vault/#comment-1419\nhttps://bazingacoin.com/forum/viewtopic.php?f=5&t=1599787\nhttp://www.intabakavubadf.org/forum/showthread.php?tid=20175\nhttp://pvmdeklaracija.lt/forum/viewtopic.php?f=2&t=168096&sid=bddb57ee008acf614d67495553b86520\n", "language": "Lisp", "metadata": {"date": 1547507545, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s835318295.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s835318295", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://myhubfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://phorumphilly.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://i-gnosis.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://eon.samosa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://dorisgreen.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ebhealth.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://missionaryplanet.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sportsmansinnovations.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.aag-usa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://galegals.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.365960.com/home/link.php?url=https://onlinecasino888.us.org   http://nasconf.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://altfish.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://golosislama.com/go.php?url=https://onlinecasino888.us.org   http://hillandhollowantiques.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://madmediaagency.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://rospravosudie.com/research/map_any.html?f1=https://onlinecasino888.us.org   http://fontay.ru/redirect/?go=https://onlinecasino888.us.org \nhttp://sexscandalmovie.com/cgi-bin/crtr/out.cgi?id=69&l=top_top&u=https://onlinecasino888.us.org  http://heide-iravani-gets-fired.xoxohth.com/go.php?url=https://onlinecasino888.us.org   http://ricknakajima.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.nobclub.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.homepage-dienste.com/guestbookserver/redirect.php?to=https://onlinecasino888.us.org   http://odziezowy.tanisklep.net/redirect.php?action=url&goto=https://onlinecasino888.us.org  http://havas-tribu.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.freegaytubes.net/cgi-bin/site/out.cgi?id=19&tag=top&trade=https://onlinecasino888.us.org   http://sertacustomer.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.communique.it/LinkClick.aspx?link=https://onlinecasino888.us.org  https://www.flying15.org.uk/LinkClick.aspx?link=https://onlinecasino888.us.org   http://hair-loss.goldenarticles.net/go.php?url=https://onlinecasino888.us.org   http://intellclinic.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://skiban1308.dvrdydns.com/upload/rk/911/240%D1%85200%20cooperation.swf?flash_link=onlinecasino888.us.org   http://photoseurope.free.fr/redir.php?url=https://onlinecasino888.us.org  https://facenama.com/redirect.php?url=https://onlinecasino888.us.org  http://polyestertux.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://lrl.scancomputers.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://single-sexy.com/goto.php?w=https://onlinecasino888.us.org  http://ytc.thepumppeople.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.mplex.org/LinkClick.aspx?link=https://onlinecasino888.us.org   http://www.quincepix.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://bankingbpm.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://alluaejobs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mcnp.blogsky.com/dailylink/?go=https://onlinecasino888.us.org  http://www.dinskoeposelenie.ru/bitrix/rk.php?id=32&site_id=s1&event1=banner&event2=click&goto=onlinecasino888.us.org   http://lybrarius.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.igus.eu/myigus/default.aspx?page=emailpage&url=https://onlinecasino888.us.org  http://afterglowimports.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.stvdpchurch.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.spreumatologia.pt/redirect.php?key=external&url=https://onlinecasino888.us.org  https://2ch.omorovie.com/redirect.php?url=https://onlinecasino888.us.org   http://gameventurecapital.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://glass.pass.org/LinkClick.aspx?link=https://onlinecasino888.us.org  http://log.atlas.sk/vizitka/centrum/click.php?id=30e839685dad10b4c042b3d0dffb61a7&url=https://onlinecasino888.us.org   http://fellowshipbenton.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://hrp.samosa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.turnkeysports.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://rlasalle.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mihavxc.ru/go.php?url=onlinecasino888.us.org  http://timmcquaid.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://videos.tvembed.eu/redirect.php?url=https://onlinecasino888.us.org/  http://okodukaiseikatsu.com/jump/?url=https://onlinecasino888.us.org/  http://montroseit.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.chglobalsecurity.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://babymamaexcercise.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://specifyamca.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.msgapp.com/jc.aspx?d=JWGMWTWDGAIEL73F22OTZGQARVLY2GSVLVKKQSUBXXVYZCEFMNDX4KCERB7WPWQVVN5XIXZ7UBAOZGXHNW2QDFKAGRHU2XJQJYQKU4SXGNE45N3VKU2NY4BAUAWGAA6EGANZOPCZ4X3IHFQBA7BOAUUQ3EOLSEFY2CZENVX3QCXWDDDRCZ434LCL4YUUJ6WKSSN7EN2SUPKUUGXMREH3ZIXQZ456XG4XP3GS6FF5GOKCM7EQDJU3VZ3ZI5IWUQYDT3LIC3PJN7HGE25FLGBQ5WE5LI6JFDGJNP5YS7P4Y37OCHM4JGJQ26BZLSXWKUN4OT4P56QBX57Q%3D%3D%3D%3D&u=https://onlinecasino888.us.org   http://calhouncitychamberofcommerce.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://patientsunited.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://cardiffairporthotel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://villagesofswanpoint.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rvb.gcpusa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://eastsidebodyshopcincy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://mydelissh.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.woojinact.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://owlsource.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.isheika.com/url.php?https://onlinecasino888.us.org  https://jobs.imv-medien.at/redirect.php?url=https://onlinecasino888.us.org   http://transteh.net/goto/?url=https://onlinecasino888.us.org  http://rogergmorse.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.linkeye.co.jp/mt/mt4i.cgi?id=1&mode=redirect&no=7&ref_eid=10&url=https://onlinecasino888.us.org   http://kosaircharitiescommittee.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://payattorneybill.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://yourfranchisingsolution.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ubiquitiwarehouse.com.au/redirect.php?action=url&goto=onlinecasino888.us.org   http://www.google.com.om/url?q=https://onlinecasino888.us.org  http://imw.netcomponent.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://hudren.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tradebus.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.fumcwausau.org/System/UserProfile.asp?id=34002&func=signup&referer=https://onlinecasino888.us.org   http://bv-pristavba.fifty-50.cz/iframe.php?uri=https://onlinecasino888.us.org \n \n \n \n \n \nhttp://www.piterenka.ru/forum/viewtopic.php?f=4&t=25043\nhttp://legalize.co/listings/the-vault/#comment-1419\nhttps://bazingacoin.com/forum/viewtopic.php?f=5&t=1599787\nhttp://www.intabakavubadf.org/forum/showthread.php?tid=20175\nhttp://pvmdeklaracija.lt/forum/viewtopic.php?f=2&t=168096&sid=bddb57ee008acf614d67495553b86520\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8211, "cpu_time_ms": 100, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s503875328", "group_id": "codeNet:p03941", "input_text": "http://review-website.net/redirect.php?url=https://onlinecasino888.us.org/  http://www.anorexicnudes.net/cgi-bin/atc/out.cgi?id=17&u=https://onlinecasino888.us.org   https://www.trustinsurance.co.uk/home/security/?url=https://onlinecasino888.us.org/   http://moviemagicvpo.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://karrenbaker.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://wayside-gold.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://japanesefuck1.com/go.php?url=https://onlinecasino888.us.org  http://comixparade.com/cgi-bin/at3/out.cgi?id=115&trade=https://onlinecasino888.us.org   http://kubbafamily.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.desyatki.ru/redirect/index.php?url=https://onlinecasino888.us.org  http://shop4library.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://videobranson.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://logrentals.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://asmii.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sharecycling.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ferghana.ru/go.php?https://onlinecasino888.us.org  http://www.superstockings.com/cgi-bin/atx/out.cgi?id=66&trade=https://onlinecasino888.us.org   http://internationalschool.eduzones.com/redirect.php?url=https://onlinecasino888.us.org \nhttp://smdtravel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://centralstationrealty.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://rembrandtbkk.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sts.kzntl.gov.za/dow_internet/LinkClick.aspx?link=https://onlinecasino888.us.org  http://onlypicsfine.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ulacrosse.org/Goto.asp?url=https://onlinecasino888.us.org  http://alephnull.net/software/go.pl?https://onlinecasino888.us.org  http://sportsmansinnovations.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.digbotz.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://27.xg4ken.com/media/redir.php?prof=2965&camp=49420&affcode=kw6070&inhurl=onlinecasino888.us.org  http://www.ship.sh/link.php?url=https://onlinecasino888.us.org   http://banner19.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://marfasvineyard.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://servingupmiseryatusf.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://oddsavisen.com.assetline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ultimatestinker.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://bql.garnierrewardstopfloor.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://brokersinterstate.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://sqz.ndtax.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.lezdomcage.com/cgi-bin/at3/out.cgi?id=21&tag=top&trade=https://onlinecasino888.us.org   http://www.tresmilranch.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://200galleries.com/go.php?url=https://onlinecasino888.us.org  http://aculoan.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://assar.kz/bitrix/redirect.php?event1=news_out&event2=http://bigwall.ru/&event3=Интернет-магазин+BigWall&goto=https://onlinecasino888.us.org  http://kaztrade.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org  http://bigbangattack.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.instantwinner.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.finestra1.de/gewinnspiel/detect.php?VORNAME=&NACHNAME=&P_ID=0&referer=https://onlinecasino888.us.org  http://www.donnaclark.net/SearchPoint/redir.asp?reg_id=pTypes&sname=/searchpoint/search.asp&lid=0&sponsor=LAN&url=onlinecasino888.us.org   http://deviceforce.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://tecolotebaseball.org/Goto.asp?url=https://onlinecasino888.us.org  http://apinanofab.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://danielgraziano.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mcmservices.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.garmin.ru/bitrix/rk.php?id=129&event1=banner&event2=click&event3=5+%2F+%5B129%5D+%5BGARMIN_AKCII%5D+Garmin+%E1%EE%ED%F3%F1+%ED%EE%E2%EE%F1%F2%FC+%E2+%E0%EA%F6%E8%E8&goto=onlinecasino888.us.org   http://rburgercpa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.providentprofessionalgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://images.google.la/url?q=https://onlinecasino888.us.org   https://medaboutme.ru/bitrix/rk.php?id=32&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B32%5D+%5Bdecode_page%5D+%D0%92%D0%B8%D0%B4%D0%B5%D0%BE%D0%BA%D0%BE%D0%BD%D1%81%D1%83%D0%BB%D1%8C%D1%82%D0%B0%D1%86%D0%B8%D1%8F&goto=https://onlinecasino888.us.org   http://johnrobertsdirect.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://encorebooks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://coolcourt.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://abogadosdeaccidentedeconstruccion.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.clubmed-group.com.sg/cm/home2014/redirect/398/AE?url=https://onlinecasino888.us.org   http://mrlikosblogspot.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://ihatefisherinvestments.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://secure.parentalrights.org/nps//servlet/DisplayLink?orgId=parentalrights&emailId=69b23840b83be4d7be9aa90da04748c36m3618124169b&&linkId=7119&targeturl=https://onlinecasino888.us.org   http://immcrimatty.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ballroomjunky.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://veteransadvocacyproject.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://gfu.sap-soft.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.discountsanddeals.com.au/go.php?url=https://onlinecasino888.us.org  http://nijeryag.tk/link?r=42920782&t=11&s=100&l=thumbs&u=https://onlinecasino888.us.org   http://torrent.janemusic.org/redir.php?url=https://onlinecasino888.us.org \nhttp://csharpcode.net/redir.asp?link=onlinecasino888.us.org  http://k2realty.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://mosremit.ru/links.php?go=https://onlinecasino888.us.org   http://wwwacademysports.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.carbootsaledirectory.co.uk/index.php?thememode=full;redirect=https://onlinecasino888.us.org   http://french4arab.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://doultonwaterpurifiers.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.nwscience.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.korfez.org/gotoURL.asp?url=https://onlinecasino888.us.org \nhttp://lujn.co/2048/goto.php?url=onlinecasino888.us.org  http://geeksoncall.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://m.eastmarietta.com/Goto.asp?url=https://onlinecasino888.us.org   http://eventsatxcel.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://flcu.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://guildfamilyfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rentodopr.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://demo.sgc-ipedito.fr/redir.php?go=https://onlinecasino888.us.org   http://crp.rebel-alliance.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://vonwolkenstein.ano-host.co.in/vb4-neu/showthread.php?416296-uriko-bloody-roar&p=570732#post570732\nhttp://123.242.157.9/webboard_ita/index.php?topic=405430.new#new\nhttps://forum.awarz.net/showthread.php?418140-deck-planter-box-plans&p=533170#post533170\nhttp://installation.mannlist.com/viewtopic.php?f=10&t=45662743\nhttp://ozelguvenlikgorevlisi.net/forum/index.php?topic=366911.new#new\n", "language": "Lisp", "metadata": {"date": 1547426025, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s503875328.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s503875328", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://review-website.net/redirect.php?url=https://onlinecasino888.us.org/  http://www.anorexicnudes.net/cgi-bin/atc/out.cgi?id=17&u=https://onlinecasino888.us.org   https://www.trustinsurance.co.uk/home/security/?url=https://onlinecasino888.us.org/   http://moviemagicvpo.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://karrenbaker.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://wayside-gold.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://japanesefuck1.com/go.php?url=https://onlinecasino888.us.org  http://comixparade.com/cgi-bin/at3/out.cgi?id=115&trade=https://onlinecasino888.us.org   http://kubbafamily.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.desyatki.ru/redirect/index.php?url=https://onlinecasino888.us.org  http://shop4library.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://videobranson.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://logrentals.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://asmii.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sharecycling.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ferghana.ru/go.php?https://onlinecasino888.us.org  http://www.superstockings.com/cgi-bin/atx/out.cgi?id=66&trade=https://onlinecasino888.us.org   http://internationalschool.eduzones.com/redirect.php?url=https://onlinecasino888.us.org \nhttp://smdtravel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://centralstationrealty.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://rembrandtbkk.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sts.kzntl.gov.za/dow_internet/LinkClick.aspx?link=https://onlinecasino888.us.org  http://onlypicsfine.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ulacrosse.org/Goto.asp?url=https://onlinecasino888.us.org  http://alephnull.net/software/go.pl?https://onlinecasino888.us.org  http://sportsmansinnovations.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.digbotz.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://27.xg4ken.com/media/redir.php?prof=2965&camp=49420&affcode=kw6070&inhurl=onlinecasino888.us.org  http://www.ship.sh/link.php?url=https://onlinecasino888.us.org   http://banner19.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://marfasvineyard.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://servingupmiseryatusf.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://oddsavisen.com.assetline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ultimatestinker.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://bql.garnierrewardstopfloor.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://brokersinterstate.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://sqz.ndtax.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.lezdomcage.com/cgi-bin/at3/out.cgi?id=21&tag=top&trade=https://onlinecasino888.us.org   http://www.tresmilranch.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://200galleries.com/go.php?url=https://onlinecasino888.us.org  http://aculoan.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://assar.kz/bitrix/redirect.php?event1=news_out&event2=http://bigwall.ru/&event3=Интернет-магазин+BigWall&goto=https://onlinecasino888.us.org  http://kaztrade.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org  http://bigbangattack.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.instantwinner.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.finestra1.de/gewinnspiel/detect.php?VORNAME=&NACHNAME=&P_ID=0&referer=https://onlinecasino888.us.org  http://www.donnaclark.net/SearchPoint/redir.asp?reg_id=pTypes&sname=/searchpoint/search.asp&lid=0&sponsor=LAN&url=onlinecasino888.us.org   http://deviceforce.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://tecolotebaseball.org/Goto.asp?url=https://onlinecasino888.us.org  http://apinanofab.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://danielgraziano.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mcmservices.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.garmin.ru/bitrix/rk.php?id=129&event1=banner&event2=click&event3=5+%2F+%5B129%5D+%5BGARMIN_AKCII%5D+Garmin+%E1%EE%ED%F3%F1+%ED%EE%E2%EE%F1%F2%FC+%E2+%E0%EA%F6%E8%E8&goto=onlinecasino888.us.org   http://rburgercpa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.providentprofessionalgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://images.google.la/url?q=https://onlinecasino888.us.org   https://medaboutme.ru/bitrix/rk.php?id=32&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B32%5D+%5Bdecode_page%5D+%D0%92%D0%B8%D0%B4%D0%B5%D0%BE%D0%BA%D0%BE%D0%BD%D1%81%D1%83%D0%BB%D1%8C%D1%82%D0%B0%D1%86%D0%B8%D1%8F&goto=https://onlinecasino888.us.org   http://johnrobertsdirect.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://encorebooks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://coolcourt.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://abogadosdeaccidentedeconstruccion.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.clubmed-group.com.sg/cm/home2014/redirect/398/AE?url=https://onlinecasino888.us.org   http://mrlikosblogspot.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://ihatefisherinvestments.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://secure.parentalrights.org/nps//servlet/DisplayLink?orgId=parentalrights&emailId=69b23840b83be4d7be9aa90da04748c36m3618124169b&&linkId=7119&targeturl=https://onlinecasino888.us.org   http://immcrimatty.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ballroomjunky.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://veteransadvocacyproject.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://gfu.sap-soft.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.discountsanddeals.com.au/go.php?url=https://onlinecasino888.us.org  http://nijeryag.tk/link?r=42920782&t=11&s=100&l=thumbs&u=https://onlinecasino888.us.org   http://torrent.janemusic.org/redir.php?url=https://onlinecasino888.us.org \nhttp://csharpcode.net/redir.asp?link=onlinecasino888.us.org  http://k2realty.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://mosremit.ru/links.php?go=https://onlinecasino888.us.org   http://wwwacademysports.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.carbootsaledirectory.co.uk/index.php?thememode=full;redirect=https://onlinecasino888.us.org   http://french4arab.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://doultonwaterpurifiers.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.nwscience.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.korfez.org/gotoURL.asp?url=https://onlinecasino888.us.org \nhttp://lujn.co/2048/goto.php?url=onlinecasino888.us.org  http://geeksoncall.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://m.eastmarietta.com/Goto.asp?url=https://onlinecasino888.us.org   http://eventsatxcel.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://flcu.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://guildfamilyfoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rentodopr.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://demo.sgc-ipedito.fr/redir.php?go=https://onlinecasino888.us.org   http://crp.rebel-alliance.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://vonwolkenstein.ano-host.co.in/vb4-neu/showthread.php?416296-uriko-bloody-roar&p=570732#post570732\nhttp://123.242.157.9/webboard_ita/index.php?topic=405430.new#new\nhttps://forum.awarz.net/showthread.php?418140-deck-planter-box-plans&p=533170#post533170\nhttp://installation.mannlist.com/viewtopic.php?f=10&t=45662743\nhttp://ozelguvenlikgorevlisi.net/forum/index.php?topic=366911.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8435, "cpu_time_ms": 90, "memory_kb": 8928}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s150335182", "group_id": "codeNet:p03941", "input_text": "onlineroulette.us.com  <a href=casinohole.us.com>online casino</a>   <a href=onlineroulette.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino games</a>  <a href=withcasino.us.com>casino play</a>   <a href=onlineroulette.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino</a>  <a href=withcasino.us.com>casino</a>   f1-online-casino.us.com \n<a href=onlineroulette.us.com>online casino</a>  f1-online-casino.us.com   <a href=onlineroulette.us.com>casino</a>   <a href=f1-online-casino.us.com>casino</a>  <a href=f1-online-casino.us.com>casino play</a>   onlineroulette.us.com  onlineroulette.us.com  <a href=onlineroulette.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino play</a> \n<a href=casinohole.us.com>online casino</a>  <a href=withcasino.us.com>online casino</a>   <a href=onlineroulette.us.com>casino games</a>   <a href=withcasino.us.com>casino play</a>  <a href=casinohole.us.com>casino</a>   <a href=f1-online-casino.us.com>casino</a>  <a href=withcasino.us.com>casino games</a>  <a href=withcasino.us.com>online casino</a>   <a href=withcasino.us.com>casino</a> \nf1-online-casino.us.com  <a href=casinohole.us.com>casino</a>   <a href=casinohole.us.com>casino</a>   <a href=withcasino.us.com>casino play</a>  casinohole.us.com   <a href=withcasino.us.com>casino</a>  <a href=f1-online-casino.us.com>online casino</a>  <a href=f1-online-casino.us.com>online casino</a>   <a href=withcasino.us.com>casino</a> \n<a href=f1-online-casino.us.com>casino</a>  <a href=withcasino.us.com>casino</a>   <a href=f1-online-casino.us.com>online casino</a>   onlineroulette.us.com  <a href=f1-online-casino.us.com>online casino</a>   <a href=casinohole.us.com>casino</a>  <a href=withcasino.us.com>casino games</a>  <a href=casinohole.us.com>online casino</a>   withcasino.us.com \n<a href=f1-online-casino.us.com>casino play</a>  <a href=onlineroulette.us.com>casino</a>   withcasino.us.com   <a href=withcasino.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=f1-online-casino.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>  casinohole.us.com   <a href=casinohole.us.com>online casino</a> \n<a href=f1-online-casino.us.com>online casino</a>  <a href=casinohole.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino play</a>   f1-online-casino.us.com  onlineroulette.us.com   <a href=casinohole.us.com>casino games</a>  <a href=casinohole.us.com>casino play</a>  f1-online-casino.us.com   <a href=f1-online-casino.us.com>casino games</a> \nwithcasino.us.com  <a href=casinohole.us.com>casino games</a>   <a href=withcasino.us.com>casino games</a>   withcasino.us.com  <a href=f1-online-casino.us.com>casino play</a>   <a href=withcasino.us.com>casino</a>  <a href=onlineroulette.us.com>online casino</a>  <a href=withcasino.us.com>casino games</a>   <a href=onlineroulette.us.com>casino games</a> \n<a href=casinohole.us.com>casino</a>  <a href=withcasino.us.com>casino</a>   <a href=onlineroulette.us.com>online casino</a>   casinohole.us.com  <a href=f1-online-casino.us.com>casino</a>   onlineroulette.us.com  f1-online-casino.us.com  <a href=casinohole.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino play</a> \n<a href=withcasino.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>   onlineroulette.us.com   <a href=withcasino.us.com>casino play</a>  <a href=withcasino.us.com>casino games</a>   <a href=casinohole.us.com>casino games</a>  <a href=onlineroulette.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino games</a>   <a href=onlineroulette.us.com>casino</a> \n \n \n \n \n \nhttp://icedepth.com/forum/viewtopic.php?pid=152456#p152456\nhttps://www.oix.legal/ico-forum/index.php?topic=1450940.new#new\nhttp://forum.andreapp.com/viewtopic.php?f=9&t=383964\nhttps://forums.terraworldz.com/index.php?topic=15789.new#new\nhttp://rcoindiana.com/forum/index.php?topic=13517.new#new\n", "language": "Lisp", "metadata": {"date": 1547381288, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s150335182.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s150335182", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "onlineroulette.us.com  <a href=casinohole.us.com>online casino</a>   <a href=onlineroulette.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino games</a>  <a href=withcasino.us.com>casino play</a>   <a href=onlineroulette.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino</a>  <a href=withcasino.us.com>casino</a>   f1-online-casino.us.com \n<a href=onlineroulette.us.com>online casino</a>  f1-online-casino.us.com   <a href=onlineroulette.us.com>casino</a>   <a href=f1-online-casino.us.com>casino</a>  <a href=f1-online-casino.us.com>casino play</a>   onlineroulette.us.com  onlineroulette.us.com  <a href=onlineroulette.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino play</a> \n<a href=casinohole.us.com>online casino</a>  <a href=withcasino.us.com>online casino</a>   <a href=onlineroulette.us.com>casino games</a>   <a href=withcasino.us.com>casino play</a>  <a href=casinohole.us.com>casino</a>   <a href=f1-online-casino.us.com>casino</a>  <a href=withcasino.us.com>casino games</a>  <a href=withcasino.us.com>online casino</a>   <a href=withcasino.us.com>casino</a> \nf1-online-casino.us.com  <a href=casinohole.us.com>casino</a>   <a href=casinohole.us.com>casino</a>   <a href=withcasino.us.com>casino play</a>  casinohole.us.com   <a href=withcasino.us.com>casino</a>  <a href=f1-online-casino.us.com>online casino</a>  <a href=f1-online-casino.us.com>online casino</a>   <a href=withcasino.us.com>casino</a> \n<a href=f1-online-casino.us.com>casino</a>  <a href=withcasino.us.com>casino</a>   <a href=f1-online-casino.us.com>online casino</a>   onlineroulette.us.com  <a href=f1-online-casino.us.com>online casino</a>   <a href=casinohole.us.com>casino</a>  <a href=withcasino.us.com>casino games</a>  <a href=casinohole.us.com>online casino</a>   withcasino.us.com \n<a href=f1-online-casino.us.com>casino play</a>  <a href=onlineroulette.us.com>casino</a>   withcasino.us.com   <a href=withcasino.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=f1-online-casino.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>  casinohole.us.com   <a href=casinohole.us.com>online casino</a> \n<a href=f1-online-casino.us.com>online casino</a>  <a href=casinohole.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino play</a>   f1-online-casino.us.com  onlineroulette.us.com   <a href=casinohole.us.com>casino games</a>  <a href=casinohole.us.com>casino play</a>  f1-online-casino.us.com   <a href=f1-online-casino.us.com>casino games</a> \nwithcasino.us.com  <a href=casinohole.us.com>casino games</a>   <a href=withcasino.us.com>casino games</a>   withcasino.us.com  <a href=f1-online-casino.us.com>casino play</a>   <a href=withcasino.us.com>casino</a>  <a href=onlineroulette.us.com>online casino</a>  <a href=withcasino.us.com>casino games</a>   <a href=onlineroulette.us.com>casino games</a> \n<a href=casinohole.us.com>casino</a>  <a href=withcasino.us.com>casino</a>   <a href=onlineroulette.us.com>online casino</a>   casinohole.us.com  <a href=f1-online-casino.us.com>casino</a>   onlineroulette.us.com  f1-online-casino.us.com  <a href=casinohole.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino play</a> \n<a href=withcasino.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>   onlineroulette.us.com   <a href=withcasino.us.com>casino play</a>  <a href=withcasino.us.com>casino games</a>   <a href=casinohole.us.com>casino games</a>  <a href=onlineroulette.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino games</a>   <a href=onlineroulette.us.com>casino</a> \n \n \n \n \n \nhttp://icedepth.com/forum/viewtopic.php?pid=152456#p152456\nhttps://www.oix.legal/ico-forum/index.php?topic=1450940.new#new\nhttp://forum.andreapp.com/viewtopic.php?f=9&t=383964\nhttps://forums.terraworldz.com/index.php?topic=15789.new#new\nhttp://rcoindiana.com/forum/index.php?topic=13517.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3926, "cpu_time_ms": 8, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s814546720", "group_id": "codeNet:p03941", "input_text": "<a href=withcasino.us.com>casino play</a>  onlineroulette.us.com   <a href=onlineroulette.us.com>casino play</a>   f1-online-casino.us.com  <a href=onlineroulette.us.com>casino games</a>   <a href=withcasino.us.com>online casino</a>  <a href=withcasino.us.com>online casino</a>  <a href=withcasino.us.com>casino play</a>   onlineroulette.us.com \n<a href=withcasino.us.com>casino</a>  <a href=withcasino.us.com>casino</a>   <a href=onlineroulette.us.com>casino play</a>   <a href=withcasino.us.com>online casino</a>  onlineroulette.us.com   <a href=withcasino.us.com>casino play</a>  <a href=onlineroulette.us.com>casino play</a>  <a href=onlineroulette.us.com>casino games</a>   <a href=onlineroulette.us.com>casino games</a> \n<a href=casinohole.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=onlineroulette.us.com>casino</a>   withcasino.us.com  <a href=onlineroulette.us.com>online casino</a>   <a href=f1-online-casino.us.com>online casino</a>  <a href=onlineroulette.us.com>online casino</a>  <a href=onlineroulette.us.com>online casino</a>   f1-online-casino.us.com \nf1-online-casino.us.com  <a href=casinohole.us.com>online casino</a>   <a href=onlineroulette.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino play</a>  <a href=onlineroulette.us.com>casino play</a>   <a href=withcasino.us.com>casino play</a>  <a href=f1-online-casino.us.com>casino</a>  <a href=withcasino.us.com>casino</a>   <a href=casinohole.us.com>casino games</a> \n<a href=withcasino.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=withcasino.us.com>online casino</a>   <a href=withcasino.us.com>casino play</a>  f1-online-casino.us.com   <a href=casinohole.us.com>online casino</a>  <a href=withcasino.us.com>online casino</a>  <a href=casinohole.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino games</a> \n<a href=withcasino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino games</a>   <a href=onlineroulette.us.com>casino games</a>   <a href=withcasino.us.com>casino</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=withcasino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino games</a>  <a href=casinohole.us.com>casino games</a>   <a href=onlineroulette.us.com>casino games</a> \n<a href=casinohole.us.com>casino play</a>  <a href=casinohole.us.com>online casino</a>   onlineroulette.us.com   <a href=casinohole.us.com>online casino</a>  <a href=casinohole.us.com>casino</a>   casinohole.us.com  onlineroulette.us.com  <a href=onlineroulette.us.com>casino play</a>   <a href=casinohole.us.com>online casino</a> \n<a href=onlineroulette.us.com>casino</a>  <a href=withcasino.us.com>casino play</a>   <a href=casinohole.us.com>online casino</a>   <a href=casinohole.us.com>casino play</a>  f1-online-casino.us.com   <a href=onlineroulette.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>  <a href=onlineroulette.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino games</a> \n<a href=onlineroulette.us.com>casino play</a>  <a href=casinohole.us.com>online casino</a>   <a href=onlineroulette.us.com>casino play</a>   f1-online-casino.us.com  <a href=onlineroulette.us.com>casino play</a>   <a href=casinohole.us.com>casino play</a>  <a href=casinohole.us.com>casino games</a>  <a href=onlineroulette.us.com>online casino</a>   <a href=withcasino.us.com>casino play</a> \n<a href=withcasino.us.com>casino</a>  <a href=casinohole.us.com>online casino</a>   <a href=onlineroulette.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino games</a>  <a href=casinohole.us.com>online casino</a>   f1-online-casino.us.com  withcasino.us.com  <a href=withcasino.us.com>casino</a>   <a href=f1-online-casino.us.com>casino games</a> \n \n \n \n \n \nhttp://femdomdesire.com/forums/showthread.php?p=284996#post284996\nhttp://test.sos-dan.ru/index.php?topic=372324.new#new\nhttp://www.vintagematchmaking.com/blog/new-years-resolutions-pointless/#comment-16544\nhttp://www.kingsaccord.com/viewtopic.php?f=11&t=1977&p=3685#p3685\nhttp://forum.lib42.ru/viewtopic.php?pid=23265#p23265\n", "language": "Lisp", "metadata": {"date": 1547372441, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s814546720.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s814546720", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "<a href=withcasino.us.com>casino play</a>  onlineroulette.us.com   <a href=onlineroulette.us.com>casino play</a>   f1-online-casino.us.com  <a href=onlineroulette.us.com>casino games</a>   <a href=withcasino.us.com>online casino</a>  <a href=withcasino.us.com>online casino</a>  <a href=withcasino.us.com>casino play</a>   onlineroulette.us.com \n<a href=withcasino.us.com>casino</a>  <a href=withcasino.us.com>casino</a>   <a href=onlineroulette.us.com>casino play</a>   <a href=withcasino.us.com>online casino</a>  onlineroulette.us.com   <a href=withcasino.us.com>casino play</a>  <a href=onlineroulette.us.com>casino play</a>  <a href=onlineroulette.us.com>casino games</a>   <a href=onlineroulette.us.com>casino games</a> \n<a href=casinohole.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=onlineroulette.us.com>casino</a>   withcasino.us.com  <a href=onlineroulette.us.com>online casino</a>   <a href=f1-online-casino.us.com>online casino</a>  <a href=onlineroulette.us.com>online casino</a>  <a href=onlineroulette.us.com>online casino</a>   f1-online-casino.us.com \nf1-online-casino.us.com  <a href=casinohole.us.com>online casino</a>   <a href=onlineroulette.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino play</a>  <a href=onlineroulette.us.com>casino play</a>   <a href=withcasino.us.com>casino play</a>  <a href=f1-online-casino.us.com>casino</a>  <a href=withcasino.us.com>casino</a>   <a href=casinohole.us.com>casino games</a> \n<a href=withcasino.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=withcasino.us.com>online casino</a>   <a href=withcasino.us.com>casino play</a>  f1-online-casino.us.com   <a href=casinohole.us.com>online casino</a>  <a href=withcasino.us.com>online casino</a>  <a href=casinohole.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino games</a> \n<a href=withcasino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino games</a>   <a href=onlineroulette.us.com>casino games</a>   <a href=withcasino.us.com>casino</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=withcasino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino games</a>  <a href=casinohole.us.com>casino games</a>   <a href=onlineroulette.us.com>casino games</a> \n<a href=casinohole.us.com>casino play</a>  <a href=casinohole.us.com>online casino</a>   onlineroulette.us.com   <a href=casinohole.us.com>online casino</a>  <a href=casinohole.us.com>casino</a>   casinohole.us.com  onlineroulette.us.com  <a href=onlineroulette.us.com>casino play</a>   <a href=casinohole.us.com>online casino</a> \n<a href=onlineroulette.us.com>casino</a>  <a href=withcasino.us.com>casino play</a>   <a href=casinohole.us.com>online casino</a>   <a href=casinohole.us.com>casino play</a>  f1-online-casino.us.com   <a href=onlineroulette.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>  <a href=onlineroulette.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino games</a> \n<a href=onlineroulette.us.com>casino play</a>  <a href=casinohole.us.com>online casino</a>   <a href=onlineroulette.us.com>casino play</a>   f1-online-casino.us.com  <a href=onlineroulette.us.com>casino play</a>   <a href=casinohole.us.com>casino play</a>  <a href=casinohole.us.com>casino games</a>  <a href=onlineroulette.us.com>online casino</a>   <a href=withcasino.us.com>casino play</a> \n<a href=withcasino.us.com>casino</a>  <a href=casinohole.us.com>online casino</a>   <a href=onlineroulette.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino games</a>  <a href=casinohole.us.com>online casino</a>   f1-online-casino.us.com  withcasino.us.com  <a href=withcasino.us.com>casino</a>   <a href=f1-online-casino.us.com>casino games</a> \n \n \n \n \n \nhttp://femdomdesire.com/forums/showthread.php?p=284996#post284996\nhttp://test.sos-dan.ru/index.php?topic=372324.new#new\nhttp://www.vintagematchmaking.com/blog/new-years-resolutions-pointless/#comment-16544\nhttp://www.kingsaccord.com/viewtopic.php?f=11&t=1977&p=3685#p3685\nhttp://forum.lib42.ru/viewtopic.php?pid=23265#p23265\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4115, "cpu_time_ms": 81, "memory_kb": 8036}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s491421980", "group_id": "codeNet:p03941", "input_text": "withcasino.us.com  withcasino.us.com   <a href=withcasino.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino games</a>  <a href=withcasino.us.com>casino play</a>   <a href=withcasino.us.com>casino games</a>  <a href=withcasino.us.com>online casino</a>  <a href=withcasino.us.com>casino</a>   <a href=casinohole.us.com>casino</a> \n<a href=casinohole.us.com>casino games</a>  <a href=casinohole.us.com>casino</a>   <a href=f1-online-casino.us.com>casino play</a>   <a href=casinohole.us.com>online casino</a>  <a href=withcasino.us.com>online casino</a>   <a href=onlineroulette.us.com>online casino</a>  <a href=casinohole.us.com>casino games</a>  withcasino.us.com   <a href=casinohole.us.com>online casino</a> \n<a href=casinohole.us.com>casino games</a>  <a href=withcasino.us.com>casino</a>   <a href=onlineroulette.us.com>casino games</a>   <a href=withcasino.us.com>casino play</a>  casinohole.us.com   <a href=casinohole.us.com>casino</a>  casinohole.us.com  <a href=casinohole.us.com>casino play</a>   <a href=withcasino.us.com>casino</a> \n<a href=withcasino.us.com>casino play</a>  <a href=withcasino.us.com>casino</a>   onlineroulette.us.com   f1-online-casino.us.com  <a href=withcasino.us.com>casino</a>   <a href=f1-online-casino.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino play</a>  <a href=casinohole.us.com>casino</a>   <a href=f1-online-casino.us.com>casino</a> \n<a href=onlineroulette.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=f1-online-casino.us.com>online casino</a>   <a href=onlineroulette.us.com>casino</a>  casinohole.us.com   <a href=onlineroulette.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino games</a>  <a href=onlineroulette.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino play</a> \n<a href=casinohole.us.com>online casino</a>  <a href=onlineroulette.us.com>casino games</a>   <a href=onlineroulette.us.com>online casino</a>   <a href=withcasino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino games</a>   <a href=casinohole.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=withcasino.us.com>casino games</a> \n<a href=withcasino.us.com>online casino</a>  <a href=casinohole.us.com>casino</a>   <a href=withcasino.us.com>casino games</a>   <a href=casinohole.us.com>casino play</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=f1-online-casino.us.com>casino</a>  <a href=f1-online-casino.us.com>casino games</a>  <a href=casinohole.us.com>casino play</a>   <a href=withcasino.us.com>casino</a> \nwithcasino.us.com  <a href=f1-online-casino.us.com>casino</a>   casinohole.us.com   <a href=casinohole.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=f1-online-casino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino games</a> \n<a href=withcasino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino</a>   <a href=onlineroulette.us.com>casino</a>   casinohole.us.com  casinohole.us.com   <a href=f1-online-casino.us.com>casino games</a>  <a href=casinohole.us.com>casino</a>  f1-online-casino.us.com   <a href=casinohole.us.com>online casino</a> \ncasinohole.us.com  <a href=onlineroulette.us.com>online casino</a>   <a href=withcasino.us.com>casino</a>   <a href=f1-online-casino.us.com>casino games</a>  <a href=withcasino.us.com>casino games</a>   <a href=casinohole.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>  <a href=casinohole.us.com>casino play</a>   <a href=f1-online-casino.us.com>online casino</a> \n \n \n \n \n \nhttp://www.criptiknetworks.com/forums/showthread.php?tid=19132\nhttp://tigershop.se/forum/showthread.php?tid=49975\nhttp://timothyburkhart.com/blog/2018/08/01/ask-pdf-indir_59/#comment-9912\nhttp://mariamarts.com/forum/showthread.php?p=371305#post371305\nhttps://www.dawoods.com/forum/index.php?topic=58932.new#new\n", "language": "Lisp", "metadata": {"date": 1547323510, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s491421980.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s491421980", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "withcasino.us.com  withcasino.us.com   <a href=withcasino.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino games</a>  <a href=withcasino.us.com>casino play</a>   <a href=withcasino.us.com>casino games</a>  <a href=withcasino.us.com>online casino</a>  <a href=withcasino.us.com>casino</a>   <a href=casinohole.us.com>casino</a> \n<a href=casinohole.us.com>casino games</a>  <a href=casinohole.us.com>casino</a>   <a href=f1-online-casino.us.com>casino play</a>   <a href=casinohole.us.com>online casino</a>  <a href=withcasino.us.com>online casino</a>   <a href=onlineroulette.us.com>online casino</a>  <a href=casinohole.us.com>casino games</a>  withcasino.us.com   <a href=casinohole.us.com>online casino</a> \n<a href=casinohole.us.com>casino games</a>  <a href=withcasino.us.com>casino</a>   <a href=onlineroulette.us.com>casino games</a>   <a href=withcasino.us.com>casino play</a>  casinohole.us.com   <a href=casinohole.us.com>casino</a>  casinohole.us.com  <a href=casinohole.us.com>casino play</a>   <a href=withcasino.us.com>casino</a> \n<a href=withcasino.us.com>casino play</a>  <a href=withcasino.us.com>casino</a>   onlineroulette.us.com   f1-online-casino.us.com  <a href=withcasino.us.com>casino</a>   <a href=f1-online-casino.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino play</a>  <a href=casinohole.us.com>casino</a>   <a href=f1-online-casino.us.com>casino</a> \n<a href=onlineroulette.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=f1-online-casino.us.com>online casino</a>   <a href=onlineroulette.us.com>casino</a>  casinohole.us.com   <a href=onlineroulette.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino games</a>  <a href=onlineroulette.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino play</a> \n<a href=casinohole.us.com>online casino</a>  <a href=onlineroulette.us.com>casino games</a>   <a href=onlineroulette.us.com>online casino</a>   <a href=withcasino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino games</a>   <a href=casinohole.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=withcasino.us.com>casino games</a> \n<a href=withcasino.us.com>online casino</a>  <a href=casinohole.us.com>casino</a>   <a href=withcasino.us.com>casino games</a>   <a href=casinohole.us.com>casino play</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=f1-online-casino.us.com>casino</a>  <a href=f1-online-casino.us.com>casino games</a>  <a href=casinohole.us.com>casino play</a>   <a href=withcasino.us.com>casino</a> \nwithcasino.us.com  <a href=f1-online-casino.us.com>casino</a>   casinohole.us.com   <a href=casinohole.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=f1-online-casino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino games</a> \n<a href=withcasino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino</a>   <a href=onlineroulette.us.com>casino</a>   casinohole.us.com  casinohole.us.com   <a href=f1-online-casino.us.com>casino games</a>  <a href=casinohole.us.com>casino</a>  f1-online-casino.us.com   <a href=casinohole.us.com>online casino</a> \ncasinohole.us.com  <a href=onlineroulette.us.com>online casino</a>   <a href=withcasino.us.com>casino</a>   <a href=f1-online-casino.us.com>casino games</a>  <a href=withcasino.us.com>casino games</a>   <a href=casinohole.us.com>online casino</a>  <a href=f1-online-casino.us.com>casino</a>  <a href=casinohole.us.com>casino play</a>   <a href=f1-online-casino.us.com>online casino</a> \n \n \n \n \n \nhttp://www.criptiknetworks.com/forums/showthread.php?tid=19132\nhttp://tigershop.se/forum/showthread.php?tid=49975\nhttp://timothyburkhart.com/blog/2018/08/01/ask-pdf-indir_59/#comment-9912\nhttp://mariamarts.com/forum/showthread.php?p=371305#post371305\nhttps://www.dawoods.com/forum/index.php?topic=58932.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4051, "cpu_time_ms": 79, "memory_kb": 8036}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s690204717", "group_id": "codeNet:p03941", "input_text": "<a href=withcasino.us.com>online casino</a>  <a href=casinohole.us.com>casino play</a>   <a href=withcasino.us.com>casino play</a>   <a href=withcasino.us.com>casino games</a>  <a href=casinohole.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino</a>  <a href=casinohole.us.com>casino</a>  <a href=onlineroulette.us.com>casino</a>   <a href=casinohole.us.com>casino</a> \n<a href=withcasino.us.com>casino games</a>  <a href=casinohole.us.com>online casino</a>   <a href=onlineroulette.us.com>online casino</a>   <a href=casinohole.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino games</a>   <a href=onlineroulette.us.com>casino</a>  <a href=f1-online-casino.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=onlineroulette.us.com>casino</a> \n<a href=f1-online-casino.us.com>casino</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=withcasino.us.com>casino games</a>   <a href=onlineroulette.us.com>casino</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=f1-online-casino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino</a>  <a href=f1-online-casino.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino play</a> \n<a href=onlineroulette.us.com>online casino</a>  <a href=withcasino.us.com>casino play</a>   <a href=casinohole.us.com>casino play</a>   <a href=casinohole.us.com>casino games</a>  <a href=withcasino.us.com>casino play</a>   <a href=onlineroulette.us.com>casino play</a>  <a href=onlineroulette.us.com>online casino</a>  <a href=withcasino.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino</a> \n<a href=withcasino.us.com>casino</a>  f1-online-casino.us.com   <a href=casinohole.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino play</a>  <a href=withcasino.us.com>casino games</a>   <a href=casinohole.us.com>online casino</a>  <a href=f1-online-casino.us.com>online casino</a>  <a href=withcasino.us.com>casino</a>   casinohole.us.com \ncasinohole.us.com  <a href=f1-online-casino.us.com>casino play</a>   withcasino.us.com   <a href=withcasino.us.com>online casino</a>  f1-online-casino.us.com   casinohole.us.com  <a href=withcasino.us.com>casino play</a>  casinohole.us.com   casinohole.us.com \n<a href=onlineroulette.us.com>casino games</a>  <a href=onlineroulette.us.com>casino play</a>   <a href=withcasino.us.com>casino</a>   <a href=f1-online-casino.us.com>casino play</a>  <a href=withcasino.us.com>online casino</a>   <a href=withcasino.us.com>casino</a>  <a href=onlineroulette.us.com>casino play</a>  <a href=f1-online-casino.us.com>casino games</a>   <a href=withcasino.us.com>casino games</a> \n<a href=withcasino.us.com>casino play</a>  <a href=f1-online-casino.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino play</a>   <a href=withcasino.us.com>casino</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=onlineroulette.us.com>casino</a>  withcasino.us.com  <a href=onlineroulette.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino</a> \n<a href=withcasino.us.com>casino games</a>  <a href=f1-online-casino.us.com>online casino</a>   f1-online-casino.us.com   <a href=casinohole.us.com>casino games</a>  <a href=onlineroulette.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino play</a>  <a href=withcasino.us.com>casino play</a>  <a href=casinohole.us.com>online casino</a>   onlineroulette.us.com \n<a href=f1-online-casino.us.com>casino</a>  <a href=withcasino.us.com>casino play</a>   casinohole.us.com   <a href=f1-online-casino.us.com>online casino</a>  <a href=casinohole.us.com>casino</a>   onlineroulette.us.com  <a href=f1-online-casino.us.com>casino games</a>  <a href=f1-online-casino.us.com>online casino</a>   <a href=f1-online-casino.us.com>online casino</a> \n \n \n \n \n \nhttps://yancearizona.net/2010/04/17/pendaftaran-wilayah-adat-belum-jelas/\nhttp://forum.rodeal.ru/viewtopic.php?f=7&t=90793\nhttp://chs.my/forum/viewtopic.php?f=4&t=18703&p=57644#p57644\nhttp://300house.com/forum/viewtopic.php?f=14&t=1688\nhttp://www.loscristianos.eu/forum/index.php?topic=2724.new#new\n", "language": "Lisp", "metadata": {"date": 1547288100, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s690204717.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s690204717", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "<a href=withcasino.us.com>online casino</a>  <a href=casinohole.us.com>casino play</a>   <a href=withcasino.us.com>casino play</a>   <a href=withcasino.us.com>casino games</a>  <a href=casinohole.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino</a>  <a href=casinohole.us.com>casino</a>  <a href=onlineroulette.us.com>casino</a>   <a href=casinohole.us.com>casino</a> \n<a href=withcasino.us.com>casino games</a>  <a href=casinohole.us.com>online casino</a>   <a href=onlineroulette.us.com>online casino</a>   <a href=casinohole.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino games</a>   <a href=onlineroulette.us.com>casino</a>  <a href=f1-online-casino.us.com>casino games</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=onlineroulette.us.com>casino</a> \n<a href=f1-online-casino.us.com>casino</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=withcasino.us.com>casino games</a>   <a href=onlineroulette.us.com>casino</a>  <a href=f1-online-casino.us.com>casino</a>   <a href=f1-online-casino.us.com>online casino</a>  <a href=onlineroulette.us.com>casino</a>  <a href=f1-online-casino.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino play</a> \n<a href=onlineroulette.us.com>online casino</a>  <a href=withcasino.us.com>casino play</a>   <a href=casinohole.us.com>casino play</a>   <a href=casinohole.us.com>casino games</a>  <a href=withcasino.us.com>casino play</a>   <a href=onlineroulette.us.com>casino play</a>  <a href=onlineroulette.us.com>online casino</a>  <a href=withcasino.us.com>online casino</a>   <a href=f1-online-casino.us.com>casino</a> \n<a href=withcasino.us.com>casino</a>  f1-online-casino.us.com   <a href=casinohole.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino play</a>  <a href=withcasino.us.com>casino games</a>   <a href=casinohole.us.com>online casino</a>  <a href=f1-online-casino.us.com>online casino</a>  <a href=withcasino.us.com>casino</a>   casinohole.us.com \ncasinohole.us.com  <a href=f1-online-casino.us.com>casino play</a>   withcasino.us.com   <a href=withcasino.us.com>online casino</a>  f1-online-casino.us.com   casinohole.us.com  <a href=withcasino.us.com>casino play</a>  casinohole.us.com   casinohole.us.com \n<a href=onlineroulette.us.com>casino games</a>  <a href=onlineroulette.us.com>casino play</a>   <a href=withcasino.us.com>casino</a>   <a href=f1-online-casino.us.com>casino play</a>  <a href=withcasino.us.com>online casino</a>   <a href=withcasino.us.com>casino</a>  <a href=onlineroulette.us.com>casino play</a>  <a href=f1-online-casino.us.com>casino games</a>   <a href=withcasino.us.com>casino games</a> \n<a href=withcasino.us.com>casino play</a>  <a href=f1-online-casino.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino play</a>   <a href=withcasino.us.com>casino</a>  <a href=f1-online-casino.us.com>casino play</a>   <a href=onlineroulette.us.com>casino</a>  withcasino.us.com  <a href=onlineroulette.us.com>casino play</a>   <a href=f1-online-casino.us.com>casino</a> \n<a href=withcasino.us.com>casino games</a>  <a href=f1-online-casino.us.com>online casino</a>   f1-online-casino.us.com   <a href=casinohole.us.com>casino games</a>  <a href=onlineroulette.us.com>casino games</a>   <a href=f1-online-casino.us.com>casino play</a>  <a href=withcasino.us.com>casino play</a>  <a href=casinohole.us.com>online casino</a>   onlineroulette.us.com \n<a href=f1-online-casino.us.com>casino</a>  <a href=withcasino.us.com>casino play</a>   casinohole.us.com   <a href=f1-online-casino.us.com>online casino</a>  <a href=casinohole.us.com>casino</a>   onlineroulette.us.com  <a href=f1-online-casino.us.com>casino games</a>  <a href=f1-online-casino.us.com>online casino</a>   <a href=f1-online-casino.us.com>online casino</a> \n \n \n \n \n \nhttps://yancearizona.net/2010/04/17/pendaftaran-wilayah-adat-belum-jelas/\nhttp://forum.rodeal.ru/viewtopic.php?f=7&t=90793\nhttp://chs.my/forum/viewtopic.php?f=4&t=18703&p=57644#p57644\nhttp://300house.com/forum/viewtopic.php?f=14&t=1688\nhttp://www.loscristianos.eu/forum/index.php?topic=2724.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4101, "cpu_time_ms": 77, "memory_kb": 8032}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s037066609", "group_id": "codeNet:p03941", "input_text": "Seek urgent medical care. low glycemic diet plans <a href=http://mitzranutmonc.ml/post/reduce-stomach-fat-by-yoga-asanas >reduce stomach fat by yoga asanas</a> and best way to burn fat at night <a href=http://master-catalog.ru/forum/member.php?u=7293 >post pregnancy slimming garments</a> \n<a href=http://lianggerenwandepukepai.qipaizhuce.com/thread-453685-1-1.html >one week fat burning diet plan</a> kaiser permanente weight loss diet <a href=http://mitzranutmonc.ml/post/weight-loss-doctors-perth-wa >weight loss doctors perth wa</a> and weight loss diets for diabetics type 2  <a href=http://bbs.jinchidai.com/home.php?mod=space&uid=1102947 >dirty keto diet meal plan</a> \nbelly fat lose crunches <a href=http://www.eztx.cn/home.php?mod=space&uid=292818 >lose weight in 2 weeks free</a> how to reduce belly fat with green tea", "language": "Lisp", "metadata": {"date": 1546987382, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s037066609.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s037066609", "user_id": "u794886383"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Seek urgent medical care. low glycemic diet plans <a href=http://mitzranutmonc.ml/post/reduce-stomach-fat-by-yoga-asanas >reduce stomach fat by yoga asanas</a> and best way to burn fat at night <a href=http://master-catalog.ru/forum/member.php?u=7293 >post pregnancy slimming garments</a> \n<a href=http://lianggerenwandepukepai.qipaizhuce.com/thread-453685-1-1.html >one week fat burning diet plan</a> kaiser permanente weight loss diet <a href=http://mitzranutmonc.ml/post/weight-loss-doctors-perth-wa >weight loss doctors perth wa</a> and weight loss diets for diabetics type 2  <a href=http://bbs.jinchidai.com/home.php?mod=space&uid=1102947 >dirty keto diet meal plan</a> \nbelly fat lose crunches <a href=http://www.eztx.cn/home.php?mod=space&uid=292818 >lose weight in 2 weeks free</a> how to reduce belly fat with green tea", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 829, "cpu_time_ms": 76, "memory_kb": 8040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s685410046", "group_id": "codeNet:p03941", "input_text": "http://www.visitfaidellapaganella.it/sito/external_url.php?url=https://onlinecasino888.us.org  http://freelessonplanshub.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://readyhosting.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://costumecase.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://portlandcareersonline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.americaninn.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://orijikan.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://patrickstgermain.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://blog.labtoday.net/link.php?url=https://onlinecasino888.us.org \nhttp://boekingsassistent.be/out.php?id=r36_langsdekust_nl&appl=31&link=https://onlinecasino888.us.org  http://miahamilton.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://downholenergy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://silkroad.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ventred.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.illiante.com/ct.ashx?id=f4c9abdf-2d0b-4c61-b422-1c56790f23b2&url=https://onlinecasino888.us.org  http://www.tubepornx.com/cgi-bin/atx/out.cgi?id=1112&trade=https://onlinecasino888.us.org  http://gardentutoronline.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bestvideorentals.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://pcmag.ru/bitrix/rk.php?id=2168&event1=banner&event2=click&event3=25+%2F+%5B2168%5D+%5B1000_60%5D+Treolan+Ultrabook&goto=https://onlinecasino888.us.org  http://ydv.lifeflourgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://seo-akademie.com/website-check/redirect.php?url=https://onlinecasino888.us.org   http://ch1.artemisweb.jp/linkout.cgi?url=https://onlinecasino888.us.org  http://elias.ztonline.ch/?a<>=<a+href=https://onlinecasino888.us.org   http://www.patprikkel.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://computerintegratedsolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sevendaughterswine.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.domodedovo-city.ru/plug.php?e=go&url=https://onlinecasino888.us.org \nhttp://krpole.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org  https://webmail.unige.it/horde/util/go.php?url=https://onlinecasino888.us.org   http://www.zulic.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.rmrpehsu.org/LinkClick.aspx?link=https://onlinecasino888.us.org  http://robertshulevitz.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.youngswirls.com/cgi-bin/crtr/out.cgi?id=519&l=top_top&u=https://onlinecasino888.us.org  http://allthisiskc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.ktd.ro/ktd_exit.php?goto=https://onlinecasino888.us.org   http://medingenuity.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://jga.parshav.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://boatsbootsandbullets.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://akashicfieldclearing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://soldertip.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nvtt.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ourmidland.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tradeext.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://takeonthenews.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sevaenergy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://m-grup.derevo.ua/redirect?goto=https://onlinecasino888.us.org  https://dlhsoft.com/GoTo.aspx?url=https://onlinecasino888.us.org   http://hairypussyparty.com/cgi-bin/at/out.cgi?s=60&c=1&u=https://onlinecasino888.us.org   http://calpinewindfarms.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://02babc5.netsolhost.com/guestbooks/GChiswell/guestbook.html   http://nextgenusersmeeting.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.stonefilms.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.financeseek.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://fixdot.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://zagnc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.gzs.si/LinkClick.aspx?link=https://onlinecasino888.us.org   http://familybusinessoftheyearaward.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.xpresstrack.eu/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.globaldenturepartners.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://insulationhq.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://recoverythroughsupport.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://allstonhotel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bankdirectories.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://lbj.drive-thrukaraoke.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.brucegreene.com/SearchPoint/redir.asp?reg_id=pTypes&sname=/searchpoint/search.asp&lid=0&sponsor=LEA&url=onlinecasino888.us.org   http://www.jacobigroup.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://10.xg4ken.com/media/redir.php?prof=362&camp=9110&affcode=cr16088&k_inner_url_encoded=1&cid=3280371390|699906|try big city adventure&mType=b&queryStr=~play flash games&kdv=c&url<>=https://onlinecasino888.us.org  http://renaissancelasvegas.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://northernmagnolia.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://one1099.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://koshcheev.ru/redir.php?url=https://onlinecasino888.us.org   http://newdirectionconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://wlex18.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://cawalters.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://174.127.195.205/bbs/redirect.php?tid=7663079&goto=onlinecasino888.us.org   http://www.thejournal.ie/utils/login/facebook/?url=https://onlinecasino888.us.org  http://sauna-bath.instant-sales.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://vegeties.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://policerecords.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nwtexaschildrenshospital.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.mononacatering.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.ongbetting.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://1hourtshirts-kc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://gunlawfirm.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bluethunderparts.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://onlinecasino888.us.org.acs.hcn.com.au/   http://www.unitedscreening.tw/__media__/js/trademark.php?d=onlinecasino888.us.org  http://cel.ncu.edu.jm/LinkClick.aspx?link=https://onlinecasino888.us.org  http://matalda.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://solidaritycenters.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://graphfolio.com/forum/index.php?topic=12995.new#new\nhttps://forums.dpi.nsw.gov.au/viewtopic.php?f=2&t=1252\nhttp://andhrabay.com/forum/index.php?topic=13399.new#new\nhttp://khalifatullahmehdi.info/forum/index.php?topic=10539.new#new\nhttp://forum.oranis.net/viewtopic.php?f=3&t=4370\n", "language": "Lisp", "metadata": {"date": 1546967185, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s685410046.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s685410046", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.visitfaidellapaganella.it/sito/external_url.php?url=https://onlinecasino888.us.org  http://freelessonplanshub.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://readyhosting.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://costumecase.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://portlandcareersonline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.americaninn.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://orijikan.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://patrickstgermain.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://blog.labtoday.net/link.php?url=https://onlinecasino888.us.org \nhttp://boekingsassistent.be/out.php?id=r36_langsdekust_nl&appl=31&link=https://onlinecasino888.us.org  http://miahamilton.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://downholenergy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://silkroad.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ventred.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.illiante.com/ct.ashx?id=f4c9abdf-2d0b-4c61-b422-1c56790f23b2&url=https://onlinecasino888.us.org  http://www.tubepornx.com/cgi-bin/atx/out.cgi?id=1112&trade=https://onlinecasino888.us.org  http://gardentutoronline.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bestvideorentals.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://pcmag.ru/bitrix/rk.php?id=2168&event1=banner&event2=click&event3=25+%2F+%5B2168%5D+%5B1000_60%5D+Treolan+Ultrabook&goto=https://onlinecasino888.us.org  http://ydv.lifeflourgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://seo-akademie.com/website-check/redirect.php?url=https://onlinecasino888.us.org   http://ch1.artemisweb.jp/linkout.cgi?url=https://onlinecasino888.us.org  http://elias.ztonline.ch/?a<>=<a+href=https://onlinecasino888.us.org   http://www.patprikkel.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://computerintegratedsolutions.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sevendaughterswine.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.domodedovo-city.ru/plug.php?e=go&url=https://onlinecasino888.us.org \nhttp://krpole.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org  https://webmail.unige.it/horde/util/go.php?url=https://onlinecasino888.us.org   http://www.zulic.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.rmrpehsu.org/LinkClick.aspx?link=https://onlinecasino888.us.org  http://robertshulevitz.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.youngswirls.com/cgi-bin/crtr/out.cgi?id=519&l=top_top&u=https://onlinecasino888.us.org  http://allthisiskc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.ktd.ro/ktd_exit.php?goto=https://onlinecasino888.us.org   http://medingenuity.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://jga.parshav.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://boatsbootsandbullets.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://akashicfieldclearing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://soldertip.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nvtt.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ourmidland.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tradeext.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://takeonthenews.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sevaenergy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://m-grup.derevo.ua/redirect?goto=https://onlinecasino888.us.org  https://dlhsoft.com/GoTo.aspx?url=https://onlinecasino888.us.org   http://hairypussyparty.com/cgi-bin/at/out.cgi?s=60&c=1&u=https://onlinecasino888.us.org   http://calpinewindfarms.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://02babc5.netsolhost.com/guestbooks/GChiswell/guestbook.html   http://nextgenusersmeeting.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.stonefilms.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.financeseek.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://fixdot.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://zagnc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.gzs.si/LinkClick.aspx?link=https://onlinecasino888.us.org   http://familybusinessoftheyearaward.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.xpresstrack.eu/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.globaldenturepartners.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://insulationhq.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://recoverythroughsupport.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://allstonhotel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bankdirectories.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://lbj.drive-thrukaraoke.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.brucegreene.com/SearchPoint/redir.asp?reg_id=pTypes&sname=/searchpoint/search.asp&lid=0&sponsor=LEA&url=onlinecasino888.us.org   http://www.jacobigroup.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://10.xg4ken.com/media/redir.php?prof=362&camp=9110&affcode=cr16088&k_inner_url_encoded=1&cid=3280371390|699906|try big city adventure&mType=b&queryStr=~play flash games&kdv=c&url<>=https://onlinecasino888.us.org  http://renaissancelasvegas.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://northernmagnolia.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://one1099.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://koshcheev.ru/redir.php?url=https://onlinecasino888.us.org   http://newdirectionconsulting.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://wlex18.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://cawalters.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://174.127.195.205/bbs/redirect.php?tid=7663079&goto=onlinecasino888.us.org   http://www.thejournal.ie/utils/login/facebook/?url=https://onlinecasino888.us.org  http://sauna-bath.instant-sales.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://vegeties.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://policerecords.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nwtexaschildrenshospital.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.mononacatering.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.ongbetting.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://1hourtshirts-kc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://gunlawfirm.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bluethunderparts.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://onlinecasino888.us.org.acs.hcn.com.au/   http://www.unitedscreening.tw/__media__/js/trademark.php?d=onlinecasino888.us.org  http://cel.ncu.edu.jm/LinkClick.aspx?link=https://onlinecasino888.us.org  http://matalda.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://solidaritycenters.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://graphfolio.com/forum/index.php?topic=12995.new#new\nhttps://forums.dpi.nsw.gov.au/viewtopic.php?f=2&t=1252\nhttp://andhrabay.com/forum/index.php?topic=13399.new#new\nhttp://khalifatullahmehdi.info/forum/index.php?topic=10539.new#new\nhttp://forum.oranis.net/viewtopic.php?f=3&t=4370\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8105, "cpu_time_ms": 16, "memory_kb": 3560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s704259775", "group_id": "codeNet:p03941", "input_text": "Mestinon is well suited for use . how to burn fat inside stomach <a href=http://wildbattmastu.ga/post/can-type-1-diabetes-cause-weight-loss >can type 1 diabetes cause weight loss</a> and lose belly fat with ginger <a href=http://huangfuda.s181.288idc.com/home.php?mod=space&uid=273455 >can you lose weight drinking coconut oil</a> \n<a href=http://hulinaria.com/user/Liadayjainc/ >do detox baths help you lose weight</a> naturopathy treatment for weight loss in hyderabad <a href=http://wildbattmastu.ga/post/best-healthy-natural-weight-loss-supplements >best healthy natural weight loss supplements</a> and how to lose belly overhang fat  <a href=http://www.yasuge.net/home.php?mod=space&uid=479 >7 day vegan diet plan</a> \neating sweets in the morning helps lose weight <a href=http://myherobkk.com/webboard/memberlist.php?mode=viewprofile&u=146&sid=cdd02095e2122fae9d5ce508c141edf1 >vegavero garcinia cambogia</a> weight loss earrings groupon", "language": "Lisp", "metadata": {"date": 1546958423, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s704259775.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s704259775", "user_id": "u794886383"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Mestinon is well suited for use . how to burn fat inside stomach <a href=http://wildbattmastu.ga/post/can-type-1-diabetes-cause-weight-loss >can type 1 diabetes cause weight loss</a> and lose belly fat with ginger <a href=http://huangfuda.s181.288idc.com/home.php?mod=space&uid=273455 >can you lose weight drinking coconut oil</a> \n<a href=http://hulinaria.com/user/Liadayjainc/ >do detox baths help you lose weight</a> naturopathy treatment for weight loss in hyderabad <a href=http://wildbattmastu.ga/post/best-healthy-natural-weight-loss-supplements >best healthy natural weight loss supplements</a> and how to lose belly overhang fat  <a href=http://www.yasuge.net/home.php?mod=space&uid=479 >7 day vegan diet plan</a> \neating sweets in the morning helps lose weight <a href=http://myherobkk.com/webboard/memberlist.php?mode=viewprofile&u=146&sid=cdd02095e2122fae9d5ce508c141edf1 >vegavero garcinia cambogia</a> weight loss earrings groupon", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 944, "cpu_time_ms": 8, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s366327560", "group_id": "codeNet:p03941", "input_text": "http://www.elkseo.com/website-reviewer/onlinecasino888.us.org  http://sitebar.makii.de/go.php?id=699&amp;url=https://onlinecasino888.us.org   http://faedel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://vd.51cto.com/adclick.php?bannerid=11627&zoneid=0&source=&dest=https://onlinecasino888.us.org/  http://collecticity.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.visitinternational.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://volunteerware.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://chicagohomevalue.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://01.look2.jp/webto.php?url=https://onlinecasino888.us.org \nhttp://canteenservices.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.openwindows.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://forum.chatsibiri.ru/go.php?url=https://onlinecasino888.us.org   http://sexcontentsales.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://bluemediappc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://highrivercapital.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mightywind.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.955jazz.com/index.php/component/k2/item/1-good-charlotte-behind-the-scenes?fromurl=onlinecasino888.us.org   http://codebreakers-elite.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://fishtankdvd.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://studentflights.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://decisionpointads.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://modelhousingsociety.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://stevenscreekautogroup.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sydneysiena.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://book-marketing.goldenarticles.net/go.php?url=https://onlinecasino888.us.org  http://www.maduras-calientes.com.ar/out.php?url=https://onlinecasino888.us.org   http://www.hamptontownship.org/LinkClick.aspx?link=https://onlinecasino888.us.org \nhttp://victozamedlink.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://asip.ru/go.php?go=https://onlinecasino888.us.org   http://rokicho.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.gym1.at/sponsoren/index.php?url=https://onlinecasino888.us.org  http://gvz.lieselmatthews.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://zakaz.rio48.ru/quote/VB35-US91/item/2?goto=https://onlinecasino888.us.org  http://naturestastebrand.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.univadis.ie/external/exit/?r=https://onlinecasino888.us.org   http://elegantweddingphoto.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://fde.drhoney.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://xprizealberta.ca/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://iprepregents.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.oxfordpublishing.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.e-apotek.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://quincetube.com/?go=click&c=142&n=33&e=0&g=3&r=31271761&u=https://onlinecasino888.us.org  http://costapacificaproperties.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://valerobeniciarefinery.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.willmbah.com/r?u=https://onlinecasino888.us.org \nhttp://www.politicallyincorrectbooks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://shouldbemadeinamerica.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.protlumacz.pl/index.php?url=https://onlinecasino888.us.org   http://travelandservice.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ultimatebbqchampionship.tera-byte.com/cgi-bin/atx/out.cgi?id=52&tag=toplist&trade=/onlinecasino888.us.org   http://avsp2p.com/uchome/link.php?url=https://onlinecasino888.us.org/  http://www.homoeopathicbazar.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rakeshpopat.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://preventingcancer.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://bintlbrief.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://heattomorrow.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://kup.aeronautics.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sss.anlfrjotqy.lnhtr.2.gsr.anonimizing.com/home287/createSession?referer=https://onlinecasino888.us.org  http://360plotters.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://abcflags.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ramhira.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://helmutkrone.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mycoldview.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://cranelimaging.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://lexiscanimaging.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://aidan.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.retailmag.ru/counter.php?url=https://onlinecasino888.us.org  http://interiorenterprizes.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://theamericanclub.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.everythingtimeline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://yex.juiceplusonline.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://0x3.globalindustrial.de/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://bingotube.com/?go=click&c=349&n=86&e=0&g=3&r=40576310&u=https://onlinecasino888.us.org  http://eeberglund.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://colfaxcorpreallysucks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://powersystemsdepot.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://volvotire.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://cold-ezze.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://lwgroupusa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://rubestinfo.ru/mobile/go.php?https://twitter.com/share?url=https://onlinecasino888.us.org   http://infodna.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://envisionscientificgroup.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://taiyouyou.com/redirect.php?bid=1988&url=https://onlinecasino888.us.org   http://pixelsi.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://itaiwan.moe.gov.tw/redir.php?url=https://onlinecasino888.us.org  http://masters-resale-right.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://thenextthing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.secularism.org.uk/go.php?id=42745&url=https://onlinecasino888.us.org  http://www.coolcars.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.huntington-law.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://greenplanet.ie/index.php?topic=36779.new#new\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=58054\nhttp://www.foro.desterium.com/viewtopic.php?f=9&t=87136\nhttp://taiyi.one/viewtopic.php?pid=206197#p206197\nhttp://360photography.co.uk/forum/viewtopic.php?f=4&t=35081\n", "language": "Lisp", "metadata": {"date": 1546953148, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s366327560.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s366327560", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.elkseo.com/website-reviewer/onlinecasino888.us.org  http://sitebar.makii.de/go.php?id=699&amp;url=https://onlinecasino888.us.org   http://faedel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://vd.51cto.com/adclick.php?bannerid=11627&zoneid=0&source=&dest=https://onlinecasino888.us.org/  http://collecticity.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.visitinternational.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://volunteerware.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://chicagohomevalue.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://01.look2.jp/webto.php?url=https://onlinecasino888.us.org \nhttp://canteenservices.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.openwindows.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://forum.chatsibiri.ru/go.php?url=https://onlinecasino888.us.org   http://sexcontentsales.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://bluemediappc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://highrivercapital.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mightywind.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.955jazz.com/index.php/component/k2/item/1-good-charlotte-behind-the-scenes?fromurl=onlinecasino888.us.org   http://codebreakers-elite.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://fishtankdvd.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://studentflights.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://decisionpointads.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://modelhousingsociety.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://stevenscreekautogroup.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sydneysiena.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://book-marketing.goldenarticles.net/go.php?url=https://onlinecasino888.us.org  http://www.maduras-calientes.com.ar/out.php?url=https://onlinecasino888.us.org   http://www.hamptontownship.org/LinkClick.aspx?link=https://onlinecasino888.us.org \nhttp://victozamedlink.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://asip.ru/go.php?go=https://onlinecasino888.us.org   http://rokicho.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.gym1.at/sponsoren/index.php?url=https://onlinecasino888.us.org  http://gvz.lieselmatthews.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://zakaz.rio48.ru/quote/VB35-US91/item/2?goto=https://onlinecasino888.us.org  http://naturestastebrand.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.univadis.ie/external/exit/?r=https://onlinecasino888.us.org   http://elegantweddingphoto.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://fde.drhoney.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://xprizealberta.ca/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://iprepregents.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.oxfordpublishing.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.e-apotek.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://quincetube.com/?go=click&c=142&n=33&e=0&g=3&r=31271761&u=https://onlinecasino888.us.org  http://costapacificaproperties.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://valerobeniciarefinery.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.willmbah.com/r?u=https://onlinecasino888.us.org \nhttp://www.politicallyincorrectbooks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://shouldbemadeinamerica.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.protlumacz.pl/index.php?url=https://onlinecasino888.us.org   http://travelandservice.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ultimatebbqchampionship.tera-byte.com/cgi-bin/atx/out.cgi?id=52&tag=toplist&trade=/onlinecasino888.us.org   http://avsp2p.com/uchome/link.php?url=https://onlinecasino888.us.org/  http://www.homoeopathicbazar.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rakeshpopat.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://preventingcancer.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://bintlbrief.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://heattomorrow.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://kup.aeronautics.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sss.anlfrjotqy.lnhtr.2.gsr.anonimizing.com/home287/createSession?referer=https://onlinecasino888.us.org  http://360plotters.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://abcflags.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ramhira.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://helmutkrone.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mycoldview.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://cranelimaging.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://lexiscanimaging.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://aidan.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.retailmag.ru/counter.php?url=https://onlinecasino888.us.org  http://interiorenterprizes.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://theamericanclub.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.everythingtimeline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://yex.juiceplusonline.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://0x3.globalindustrial.de/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://bingotube.com/?go=click&c=349&n=86&e=0&g=3&r=40576310&u=https://onlinecasino888.us.org  http://eeberglund.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://colfaxcorpreallysucks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://powersystemsdepot.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://volvotire.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://cold-ezze.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://lwgroupusa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://rubestinfo.ru/mobile/go.php?https://twitter.com/share?url=https://onlinecasino888.us.org   http://infodna.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://envisionscientificgroup.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://taiyouyou.com/redirect.php?bid=1988&url=https://onlinecasino888.us.org   http://pixelsi.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://itaiwan.moe.gov.tw/redir.php?url=https://onlinecasino888.us.org  http://masters-resale-right.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://thenextthing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.secularism.org.uk/go.php?id=42745&url=https://onlinecasino888.us.org  http://www.coolcars.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.huntington-law.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://greenplanet.ie/index.php?topic=36779.new#new\nhttp://advancingmindset.com/forum/viewtopic.php?f=8&t=58054\nhttp://www.foro.desterium.com/viewtopic.php?f=9&t=87136\nhttp://taiyi.one/viewtopic.php?pid=206197#p206197\nhttp://360photography.co.uk/forum/viewtopic.php?f=4&t=35081\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7944, "cpu_time_ms": 21, "memory_kb": 4068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s180246748", "group_id": "codeNet:p03941", "input_text": "Arcoxia does not have any impact on platelet function and gastro intestinal mucosa. list of healthy foods for weight loss <a href=http://evpretkunstin.tk/post/top-ten-best-fruits-for-weight-loss >top ten best fruits for weight loss</a> and reduce weight loss pills <a href=http://www.lyxdks.com/home.php?mod=space&uid=1013 >fat burners build muscle</a> \n<a href=http://www.liuxuemeng.cn/home.php?mod=space&uid=22442 >can you still lose weight while your pregnant</a> does green coffee beans help you lose weight <a href=http://evpretkunstin.tk/post/finding-it-hard-to-lose-belly-fat >finding it hard to lose belly fat</a> and does hypnotherapy work for weight loss reviews  <a href=http://www.scnukaoyan.com/space-uid-5388.html >forskolin kidney</a> \nbest reviewed garcinia cambogia extract <a href=http://traderpips.com/forum/forum.php?mod=viewthread&tid=17664622&extra= >eating habits to lose weight fast</a> law of thermodynamics fat loss", "language": "Lisp", "metadata": {"date": 1546945422, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s180246748.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s180246748", "user_id": "u794886383"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Arcoxia does not have any impact on platelet function and gastro intestinal mucosa. list of healthy foods for weight loss <a href=http://evpretkunstin.tk/post/top-ten-best-fruits-for-weight-loss >top ten best fruits for weight loss</a> and reduce weight loss pills <a href=http://www.lyxdks.com/home.php?mod=space&uid=1013 >fat burners build muscle</a> \n<a href=http://www.liuxuemeng.cn/home.php?mod=space&uid=22442 >can you still lose weight while your pregnant</a> does green coffee beans help you lose weight <a href=http://evpretkunstin.tk/post/finding-it-hard-to-lose-belly-fat >finding it hard to lose belly fat</a> and does hypnotherapy work for weight loss reviews  <a href=http://www.scnukaoyan.com/space-uid-5388.html >forskolin kidney</a> \nbest reviewed garcinia cambogia extract <a href=http://traderpips.com/forum/forum.php?mod=viewthread&tid=17664622&extra= >eating habits to lose weight fast</a> law of thermodynamics fat loss", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 941, "cpu_time_ms": 96, "memory_kb": 8040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s365558028", "group_id": "codeNet:p03941", "input_text": "https://www.negritella.it/sito/external_url.php?url=https://onlinecasino888.us.org  http://veteranssearch.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://convergesecurity.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mountainsprings.church/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.businessloanpune.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://384.myeducationworld.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://1122124.r.bat.bing.com/?ld=d3ftOcgEQZQ7NKp04DfW64CDVUCUxYlS4YkUe42heMTr0lb-IYFK1dr4bR4DMi3CENr-vaO8jNXdtDrTJj-fVNF265SnHuqr3CtDpjeE10UxMYjP6Ueoatg0uGdaVGbNMRBhRw1CaDMKeJ6h-P6Q2j99yjZOI&u=https://onlinecasino888.us.org  http://www.systematicatrading.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://wetsand.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://hillbillycentral.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://kenmink.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://farsitopz.ir/redirect?url=https://onlinecasino888.us.org   https://www.performia-cis.ru/bitrix/redirect.php?event1=Banner-Test&event2=&event3=&goto=https://onlinecasino888.us.org  http://vkw.geminisystemsllc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://kennethwyattgalleries.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://gwdang.com/union/go/?site_id=228&target_url=https://onlinecasino888.us.org  http://pestquip.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://meetinghouses.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://nfpcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://dishfootball.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://pfchangs-coupons.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ipodcatalogs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.becomeascot.org/redirect?SessionGuid=0035ccb7-52a0-4f77-a043-f52c7c891a59&url=https://onlinecasino888.us.org   http://royaldompedro.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://forum.lightray.ru/link.php?url=https://onlinecasino888.us.org  http://www.clublamorada.com/default.aspx?p=TrackHyperlink&url=https://onlinecasino888.us.org   http://ganjagourmet.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://2013.mudconnect.com/cgi-bin/redirect.cgi?mud=Endless+City&url=https://onlinecasino888.us.org  http://www.rpklublin.pl/skins/rpk/redirect.php?url=https://onlinecasino888.us.org   http://sbphototours.com/includes/companyLogo.php?url=https://onlinecasino888.us.org/   http://partnerrelife.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.madagent.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://wapsows.com/go/https://onlinecasino888.us.org  http://jlc2.qxjy.com/redirect.aspx?url=https://onlinecasino888.us.org  http://www.jbjenkinsfuneralhome.com/cfi/addthis_email.cfm?url=https://onlinecasino888.us.org   http://urbanbowl.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://hadsy.net/ct.ashx?id=c4305098-4327-4301-a952-52858bf016cd&url=https://onlinecasino888.us.org  http://talmudstudy101.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://anchordock.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://veter-vbo.ru/go?https://onlinecasino888.us.org  https://www.360sportsinc.com/modules/mod_jw_srfr/redir.php?url=https://onlinecasino888.us.org   http://start.earthlink.net/track?linkid=1015976&add=1&url=https://onlinecasino888.us.org  http://gangstacaraudio.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ginpa.net/link/rank.php?url=https://onlinecasino888.us.org   http://keysfood.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://geovirtual.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://eccl.es/index.php?url=https://onlinecasino888.us.org   http://www.jmfuneralhome.com/cfi/addthis_email.cfm?url=https://onlinecasino888.us.org   http://theamericanlegacyguitar.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://brutalcycles.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://rocklance.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://resilientnetworks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://novationmanufacturing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.zenkokuren.org/zcgi/zmt/mt4i.cgi?id=2&cat=24&mode=redirect&no=9&ref_eid=375&url=https://onlinecasino888.us.org \nhttp://goglle.coo123.net/goto.php?c=&n=standard&url=https://onlinecasino888.us.org  http://cervicalstim.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://stthomasfcu.com/redirect.php?link=https://onlinecasino888.us.org/   http://sunsoakersshingles.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.amateurwebcamz.com/cgi-bin/autorank/out.cgi?id=naughtyc&url=https://onlinecasino888.us.org   http://likegettingmoneyinyourmailbox.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://brassconstruction.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.gonadz.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://61000018.r.bat.bing.com/?ld=d3bXRXy9qdESa4I0ijJWIUsTVUCUySAv9FxyiDEc48y7OQpwIwTDikCercs0drgPutcwqHkvfszRqNSt_pnQk5ant1c2L5gKZnJbb8iBBLsm_SKdLKxn9HQ26CZBt32NejsNdUV549K-0rXHitAvMEvwvoxkDg134Z2sgFiQHi8Bu6VVau&u=https://onlinecasino888.us.org \nhttp://parentsofla.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://lasvegasnonstop.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ていじん.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://xiuang.tw/debug/frm-s/onlinecasino888.us.org/  http://pizzicommunicationscompany.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://lifestrawsales.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://citystar74.ru/go?to=https://onlinecasino888.us.org  http://cafekala.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://gonzito.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://fracbullet.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.paintsprayerguru.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.pegasuscycling.nz/LinkClick.aspx?link=https://onlinecasino888.us.org   http://www.2ndnewhawscouts.com/gallery/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasino888.us.org  http://www.iiidesign.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://vivianahand.com/m/redirect.php?url=https://onlinecasino888.us.org  http://djarumsuper.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://univarchinaltd.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://comoadelgazarlaspiernas.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.jugon.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.xknull.com/ept/out.php?f=1&pct=50&url=https://onlinecasino888.us.org   http://av-list.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mverdu.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://preplearning.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://collectorsystem.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.tenpojimusyo.jp/schedule/cgi-bin/info.php?a<>=<a+href=https://onlinecasino888.us.org  http://nerozone.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.basketbolist.org.ua/go.php?url=https://onlinecasino888.us.org \n \n \n \n \n \nhttp://www.technodom-blog.com/forums/viewtopic.php?pid=93562#p93562\nhttps://giikah.com/forum/index.php?topic=7875.new#new\nhttps://hebreu.net/question/life-quest-free-trial/\nhttp://test.rm-reklama.ru/showthread.php?p=183353#post183353\nhttp://vonwolkenstein.ano-host.co.in/vb4-neu/showthread.php?400503-famous-mage-names&p=545867#post545867\n", "language": "Lisp", "metadata": {"date": 1546903974, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s365558028.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s365558028", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://www.negritella.it/sito/external_url.php?url=https://onlinecasino888.us.org  http://veteranssearch.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://convergesecurity.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mountainsprings.church/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.businessloanpune.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://384.myeducationworld.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://1122124.r.bat.bing.com/?ld=d3ftOcgEQZQ7NKp04DfW64CDVUCUxYlS4YkUe42heMTr0lb-IYFK1dr4bR4DMi3CENr-vaO8jNXdtDrTJj-fVNF265SnHuqr3CtDpjeE10UxMYjP6Ueoatg0uGdaVGbNMRBhRw1CaDMKeJ6h-P6Q2j99yjZOI&u=https://onlinecasino888.us.org  http://www.systematicatrading.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://wetsand.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://hillbillycentral.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://kenmink.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://farsitopz.ir/redirect?url=https://onlinecasino888.us.org   https://www.performia-cis.ru/bitrix/redirect.php?event1=Banner-Test&event2=&event3=&goto=https://onlinecasino888.us.org  http://vkw.geminisystemsllc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://kennethwyattgalleries.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://gwdang.com/union/go/?site_id=228&target_url=https://onlinecasino888.us.org  http://pestquip.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://meetinghouses.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://nfpcanada.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://dishfootball.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://pfchangs-coupons.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ipodcatalogs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.becomeascot.org/redirect?SessionGuid=0035ccb7-52a0-4f77-a043-f52c7c891a59&url=https://onlinecasino888.us.org   http://royaldompedro.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://forum.lightray.ru/link.php?url=https://onlinecasino888.us.org  http://www.clublamorada.com/default.aspx?p=TrackHyperlink&url=https://onlinecasino888.us.org   http://ganjagourmet.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://2013.mudconnect.com/cgi-bin/redirect.cgi?mud=Endless+City&url=https://onlinecasino888.us.org  http://www.rpklublin.pl/skins/rpk/redirect.php?url=https://onlinecasino888.us.org   http://sbphototours.com/includes/companyLogo.php?url=https://onlinecasino888.us.org/   http://partnerrelife.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.madagent.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://wapsows.com/go/https://onlinecasino888.us.org  http://jlc2.qxjy.com/redirect.aspx?url=https://onlinecasino888.us.org  http://www.jbjenkinsfuneralhome.com/cfi/addthis_email.cfm?url=https://onlinecasino888.us.org   http://urbanbowl.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://hadsy.net/ct.ashx?id=c4305098-4327-4301-a952-52858bf016cd&url=https://onlinecasino888.us.org  http://talmudstudy101.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://anchordock.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://veter-vbo.ru/go?https://onlinecasino888.us.org  https://www.360sportsinc.com/modules/mod_jw_srfr/redir.php?url=https://onlinecasino888.us.org   http://start.earthlink.net/track?linkid=1015976&add=1&url=https://onlinecasino888.us.org  http://gangstacaraudio.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ginpa.net/link/rank.php?url=https://onlinecasino888.us.org   http://keysfood.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://geovirtual.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://eccl.es/index.php?url=https://onlinecasino888.us.org   http://www.jmfuneralhome.com/cfi/addthis_email.cfm?url=https://onlinecasino888.us.org   http://theamericanlegacyguitar.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://brutalcycles.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://rocklance.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://resilientnetworks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://novationmanufacturing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.zenkokuren.org/zcgi/zmt/mt4i.cgi?id=2&cat=24&mode=redirect&no=9&ref_eid=375&url=https://onlinecasino888.us.org \nhttp://goglle.coo123.net/goto.php?c=&n=standard&url=https://onlinecasino888.us.org  http://cervicalstim.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://stthomasfcu.com/redirect.php?link=https://onlinecasino888.us.org/   http://sunsoakersshingles.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.amateurwebcamz.com/cgi-bin/autorank/out.cgi?id=naughtyc&url=https://onlinecasino888.us.org   http://likegettingmoneyinyourmailbox.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://brassconstruction.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.gonadz.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://61000018.r.bat.bing.com/?ld=d3bXRXy9qdESa4I0ijJWIUsTVUCUySAv9FxyiDEc48y7OQpwIwTDikCercs0drgPutcwqHkvfszRqNSt_pnQk5ant1c2L5gKZnJbb8iBBLsm_SKdLKxn9HQ26CZBt32NejsNdUV549K-0rXHitAvMEvwvoxkDg134Z2sgFiQHi8Bu6VVau&u=https://onlinecasino888.us.org \nhttp://parentsofla.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://lasvegasnonstop.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ていじん.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://xiuang.tw/debug/frm-s/onlinecasino888.us.org/  http://pizzicommunicationscompany.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://lifestrawsales.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://citystar74.ru/go?to=https://onlinecasino888.us.org  http://cafekala.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://gonzito.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://fracbullet.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.paintsprayerguru.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.pegasuscycling.nz/LinkClick.aspx?link=https://onlinecasino888.us.org   http://www.2ndnewhawscouts.com/gallery/main.php?g2_view=core.UserAdmin&g2_subView=core.UserLogin&g2_return=https://onlinecasino888.us.org  http://www.iiidesign.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://vivianahand.com/m/redirect.php?url=https://onlinecasino888.us.org  http://djarumsuper.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://univarchinaltd.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://comoadelgazarlaspiernas.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.jugon.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.xknull.com/ept/out.php?f=1&pct=50&url=https://onlinecasino888.us.org   http://av-list.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mverdu.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://preplearning.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://collectorsystem.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.tenpojimusyo.jp/schedule/cgi-bin/info.php?a<>=<a+href=https://onlinecasino888.us.org  http://nerozone.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.basketbolist.org.ua/go.php?url=https://onlinecasino888.us.org \n \n \n \n \n \nhttp://www.technodom-blog.com/forums/viewtopic.php?pid=93562#p93562\nhttps://giikah.com/forum/index.php?topic=7875.new#new\nhttps://hebreu.net/question/life-quest-free-trial/\nhttp://test.rm-reklama.ru/showthread.php?p=183353#post183353\nhttp://vonwolkenstein.ano-host.co.in/vb4-neu/showthread.php?400503-famous-mage-names&p=545867#post545867\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8358, "cpu_time_ms": 99, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s261287152", "group_id": "codeNet:p03941", "input_text": "http://virtualmortgagefunding.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.godspoketome.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.worldwidehelpers.org/index.php?url=https://onlinecasino888.us.org   http://www.annasfunhouse.com/cgi-bin/autorank/out.cgi?id=janetexp&url=https://onlinecasino888.us.org  http://hbn.lamritewest.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://flippenteenleadership.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://go-nsg.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://safety.tbzmed.ac.ir/?pageid=1&MID=22&url=https://onlinecasino888.us.org   http://intra.kmiasset.com/index.php?mid=www_banner&document_srl=25640&fon=FFFFFF&txt=76625B&stxt=76625B&page=6&fromurl=onlinecasino888.us.org \nhttp://picsndquotes.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://embracetheinternet.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://iqrsystems.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://borescope-inspection.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://saferwarninglabels.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dogbreedsbysize.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://oresama.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.dpgberlin.de/de/service/links/?go=https://onlinecasino888.us.org   http://internaldisplacement.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://rolored.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.usacademics-it.com/redirect.php?school=StudyWisconsin&schoolid=na&language=it&adsize=200x100&adtype=gif&userip=66.249.66.223&redirect=https://onlinecasino888.us.org   http://www.iberosur.be/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.breastgirls.com/cgi-bin/autorank/out.cgi?id=iloveboo&url=https://onlinecasino888.us.org  http://www.wzdq.cc/go.php?url=https://onlinecasino888.us.org   http://www.usg.ru/redir.php?url=https://onlinecasino888.us.org  http://gadyach.pl.ua/go/url=onlinecasino888.us.org  http://pens-america.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://itland.ru/bitrix/rk.php?id=60&event1=banner&event2=click&event3=1+%2F+%5B60%5D+%5BRIGHT1%5D+%D2%E5%F5%ED%EE%EC%E8%F0&goto=onlinecasino888.us.org \nhttp://oiltanktest.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rh.consorzioiris.net/?a<>=Coach emagrecimento sp (<a href=https://onlinecasino888.us.org   http://speedrewards.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://optimalquest.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://companystat.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://cobaltinternationalenergy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://amazon.de.xx3.kz/go.php?url=https://onlinecasino888.us.org  http://ts-sex.com/cgi-bin/crtr/out.cgi?url=https://onlinecasino888.us.org   http://3danimeworld.com/cgi-bin/atx/out.cgi?id=329&trade=https://onlinecasino888.us.org \nhttp://qrk.elecpro.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://idahodoctorshospital.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://chemistry.xtu.xk.hnlat.com/index.php?m=currency&c=free&a=show&catid=2513&id=102&url=https://onlinecasino888.us.org   http://www.orizonti.com/LinkClick.aspx?link=https://onlinecasino888.us.org  http://ptn.longevityrich.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://svt.disasterreliefcamps.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://zhongyanfeng.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino888.us.org  http://baoos.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://608doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://myhealtheview.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://samaritanspursetv.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://oaksuperstore.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.ebrands.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.itwasonline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dxlive.lead-channel.com/link.php?url=https://onlinecasino888.us.org  http://fdca71.e-monsite.com/liens/do/redirect/?url=https://onlinecasino888.us.org  http://www.anetowines.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.hotelicom.com/start/goto.php?cid=0&url=https://onlinecasino888.us.org \nhttp://plannedparenthoodvotesrhodeislandpac.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mobile.systems/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://thomasvarsavsky.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://xju.4hopefoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://whitandalexbedding.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.al-bis.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino888.us.org  http://www.careerskillsfoundation.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.hillcountry247.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.italiansonline.net/clic.php?url=https://onlinecasino888.us.org/ \nhttp://overturecenterfoundation.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tilghmanmichaels.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://traveldemand.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.s-r-s.jp/hinoki/cgi/mt_keitai/mt4i.cgi?id=3&mode=redirect&no=5&ref_eid=47&url=https://onlinecasino888.us.org  http://select-controls.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sellyourhuntsvillehome.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.dvdjazz.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.loveshack.org/a/delivery/lg.php?bannerid=80&amp;campaignid=45&amp;zoneid=67&amp;source=ls&amp;loc=1&amp;referer=https://onlinecasino888.us.org   http://birkie.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.bunyanmeeting.co.uk/goto-link.php?link_id=19&url=https://onlinecasino888.us.org  http://oraung02.iamgold.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://29wheels.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://solidaritycenters.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://807bbs.com/uchome/link.php?url=https://onlinecasino888.us.org   http://kanariansaaret.net/go.php?go=onlinecasino888.us.org  http://just-what-you-need.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nutrimlife.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bbbb444.net/2048/goto.php?url=onlinecasino888.us.org \nhttp://gracetinos.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.podwiazka.eu/goto.php?url=onlinecasino888.us.org   http://www.arba-makmur.com/redirect.php?link=https://onlinecasino888.us.org   http://hinmanhowardandkattell.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mahal.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://joyforster.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://qys.daocapital.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://oif.ortax.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.vision.lt/bitrix/rk.php?id=2655&event1=banner&event2=click&event3=9+%2F+%5B2655%5D+%5BBOTTOM3%5D+VV2018&goto=https://onlinecasino888.us.org \n \n \n \n \n \nhttp://www.borsaekrani.net/index.php?topic=2634.new#new\nhttp://forum.2dar2.de/index.php?topic=127484.new#new\nhttp://jesuslove.asia/forum1/viewtopic.php?pid=891234#p891234\nhttp://consumerstandardng.com/forum/index.php?topic=8828.new#new\nhttp://www.technodom-blog.com/forums/viewtopic.php?pid=91032#p91032\n", "language": "Lisp", "metadata": {"date": 1546873221, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s261287152.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s261287152", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://virtualmortgagefunding.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.godspoketome.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.worldwidehelpers.org/index.php?url=https://onlinecasino888.us.org   http://www.annasfunhouse.com/cgi-bin/autorank/out.cgi?id=janetexp&url=https://onlinecasino888.us.org  http://hbn.lamritewest.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://flippenteenleadership.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://go-nsg.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://safety.tbzmed.ac.ir/?pageid=1&MID=22&url=https://onlinecasino888.us.org   http://intra.kmiasset.com/index.php?mid=www_banner&document_srl=25640&fon=FFFFFF&txt=76625B&stxt=76625B&page=6&fromurl=onlinecasino888.us.org \nhttp://picsndquotes.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://embracetheinternet.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://iqrsystems.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://borescope-inspection.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://saferwarninglabels.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dogbreedsbysize.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://oresama.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.dpgberlin.de/de/service/links/?go=https://onlinecasino888.us.org   http://internaldisplacement.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://rolored.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.usacademics-it.com/redirect.php?school=StudyWisconsin&schoolid=na&language=it&adsize=200x100&adtype=gif&userip=66.249.66.223&redirect=https://onlinecasino888.us.org   http://www.iberosur.be/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.breastgirls.com/cgi-bin/autorank/out.cgi?id=iloveboo&url=https://onlinecasino888.us.org  http://www.wzdq.cc/go.php?url=https://onlinecasino888.us.org   http://www.usg.ru/redir.php?url=https://onlinecasino888.us.org  http://gadyach.pl.ua/go/url=onlinecasino888.us.org  http://pens-america.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://itland.ru/bitrix/rk.php?id=60&event1=banner&event2=click&event3=1+%2F+%5B60%5D+%5BRIGHT1%5D+%D2%E5%F5%ED%EE%EC%E8%F0&goto=onlinecasino888.us.org \nhttp://oiltanktest.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rh.consorzioiris.net/?a<>=Coach emagrecimento sp (<a href=https://onlinecasino888.us.org   http://speedrewards.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://optimalquest.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://companystat.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://cobaltinternationalenergy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://amazon.de.xx3.kz/go.php?url=https://onlinecasino888.us.org  http://ts-sex.com/cgi-bin/crtr/out.cgi?url=https://onlinecasino888.us.org   http://3danimeworld.com/cgi-bin/atx/out.cgi?id=329&trade=https://onlinecasino888.us.org \nhttp://qrk.elecpro.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://idahodoctorshospital.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://chemistry.xtu.xk.hnlat.com/index.php?m=currency&c=free&a=show&catid=2513&id=102&url=https://onlinecasino888.us.org   http://www.orizonti.com/LinkClick.aspx?link=https://onlinecasino888.us.org  http://ptn.longevityrich.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://svt.disasterreliefcamps.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://zhongyanfeng.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino888.us.org  http://baoos.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://608doctors.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://myhealtheview.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://samaritanspursetv.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://oaksuperstore.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.ebrands.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.itwasonline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dxlive.lead-channel.com/link.php?url=https://onlinecasino888.us.org  http://fdca71.e-monsite.com/liens/do/redirect/?url=https://onlinecasino888.us.org  http://www.anetowines.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.hotelicom.com/start/goto.php?cid=0&url=https://onlinecasino888.us.org \nhttp://plannedparenthoodvotesrhodeislandpac.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mobile.systems/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://thomasvarsavsky.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://xju.4hopefoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://whitandalexbedding.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.al-bis.ru/bitrix/redirect.php?event1=&event2=&event3=&goto=https://onlinecasino888.us.org  http://www.careerskillsfoundation.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.hillcountry247.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.italiansonline.net/clic.php?url=https://onlinecasino888.us.org/ \nhttp://overturecenterfoundation.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tilghmanmichaels.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://traveldemand.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.s-r-s.jp/hinoki/cgi/mt_keitai/mt4i.cgi?id=3&mode=redirect&no=5&ref_eid=47&url=https://onlinecasino888.us.org  http://select-controls.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sellyourhuntsvillehome.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.dvdjazz.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.loveshack.org/a/delivery/lg.php?bannerid=80&amp;campaignid=45&amp;zoneid=67&amp;source=ls&amp;loc=1&amp;referer=https://onlinecasino888.us.org   http://birkie.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.bunyanmeeting.co.uk/goto-link.php?link_id=19&url=https://onlinecasino888.us.org  http://oraung02.iamgold.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://29wheels.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://solidaritycenters.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://807bbs.com/uchome/link.php?url=https://onlinecasino888.us.org   http://kanariansaaret.net/go.php?go=onlinecasino888.us.org  http://just-what-you-need.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nutrimlife.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bbbb444.net/2048/goto.php?url=onlinecasino888.us.org \nhttp://gracetinos.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.podwiazka.eu/goto.php?url=onlinecasino888.us.org   http://www.arba-makmur.com/redirect.php?link=https://onlinecasino888.us.org   http://hinmanhowardandkattell.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mahal.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://joyforster.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://qys.daocapital.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://oif.ortax.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.vision.lt/bitrix/rk.php?id=2655&event1=banner&event2=click&event3=9+%2F+%5B2655%5D+%5BBOTTOM3%5D+VV2018&goto=https://onlinecasino888.us.org \n \n \n \n \n \nhttp://www.borsaekrani.net/index.php?topic=2634.new#new\nhttp://forum.2dar2.de/index.php?topic=127484.new#new\nhttp://jesuslove.asia/forum1/viewtopic.php?pid=891234#p891234\nhttp://consumerstandardng.com/forum/index.php?topic=8828.new#new\nhttp://www.technodom-blog.com/forums/viewtopic.php?pid=91032#p91032\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8310, "cpu_time_ms": 101, "memory_kb": 9444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s160583069", "group_id": "codeNet:p03941", "input_text": "https://www.plumbers.co.nz/redirect.php?listing-id=8&url=https://onlinecasino888.us.org  http://toptenbestgames.com/goto/https://onlinecasino888.us.org   http://www.brandnewengineparts.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://fleetcor.lesgh.com/www.eshoppinguk.co.uk/go.php?url=onlinecasino888.us.org  http://all-free-wallpapers.us/redir.php?url=https://onlinecasino888.us.org   http://hullabaloocostumes.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sodexofoodsafety.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.westcoastmetals.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://atlasvanlines.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://clearlyabettervalue.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.navicore.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://kezako.brasnow.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.nobleboatschina.tyigh.com/bitrix/rk.php?id=21&site_id=s2&event1=banner&event2=click&event3=1+%2F+%5B21%5D+%5BMAIN_BOTTOM_4_EN%5D+Investor+Tools&goto=onlinecasino888.us.org  http://walterjlewis.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.cameostock.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://hisnewsnetwork.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://maps.google.com.ar/url?q=https://onlinecasino888.us.org   http://jenniferstaniloff.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.hotspotimage.com/bbs/redirect.php?tid=17266&goto=onlinecasino888.us.org  http://wastewatertechnology.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.ratethetechie.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ilovemymattress.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://longacre-theater.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://century21tamayoyasociados.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://un-canape.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.capuanoforsenate.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://deltapackaging.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.co.columbia.wi.us/columbiacounty/LinkClick.aspx?link=https://onlinecasino888.us.org  http://wheeling.eztouse.com/redirect.asp?weburl=onlinecasino888.us.org   http://www.rockymountainingredients.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.unrealshemales.com/cgi-bin/atx/out.cgi?id=55&trade=https://onlinecasino888.us.org  http://www.oaci.org/cgi-bin/anonymous/redirect.cgi?url=https://onlinecasino888.us.org   http://www.rvdealerinventory.com/outlink/track.php?url=onlinecasino888.us.org  http://leadershipdevelopmentcorps.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://bankloanservices.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bff.orangehairedboy.com/flang.php?url=https://onlinecasino888.us.org \nhttp://asktheozarks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.tinysolo.com/crtr/cgi/out.cgi?c=1&s=85&l=galleries&u=https://onlinecasino888.us.org   http://tourathtripoli.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bestalarmoffer.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://monstercrate.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://healthyagingnewsletter.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://temptationresortmexico.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://xkl.pmpc-pvc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://online-biznes.biz/go.php?url=onlinecasino888.us.org \nhttp://jackchurch.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://galegals.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://pdcodr.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ojf.metrofhn.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.explainittome.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://houstondentaloncology.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://heartsonfirestinks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mattadler.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.nationalpostdoc.org/link.asp?e=katec@rice.edu&job=2452589&ymlink=14724471&finalurl=https://onlinecasino888.us.org \nhttp://www.mova.com.ua/go/https://onlinecasino888.us.org  http://г‚ёгѓЈгѓ гѓЌгѓѓгѓ€.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://onlinejobform.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://blog.mypcz.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino888.us.org  http://bestwebsiteportal.com/redirect.php?url=https://onlinecasino888.us.org   http://kaptur.club/proxy.php?link=https://onlinecasino888.us.org  http://nerium.in/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.vnukovo.ru/bitrix/rk.php?id=49&event1=banner&event2=click&event3=1+%2F+%5B49%5D+%5Bmain_banner_left_2%5D+FCC-2017&goto=https://onlinecasino888.us.org   http://youngharvill.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://audi-a6.com.ua/go.php?https://onlinecasino888.us.org  http://mattbeatty.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://elzamanalmasry.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.modot.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.whiteoaksrent-all.com/LinkClick.aspx?link=https://onlinecasino888.us.org   http://mes.ifmo.ru/go.php?url=https://onlinecasino888.us.org  http://www.flyblind.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://whatisnow.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://pr-group.ru/links.php?go=https://onlinecasino888.us.org \nhttps://www.zerohedge.com/?cb=33222996629&charset=UTF-8&loc=http://www.zerohedge.com/&page=2938&referer=https://onlinecasino888.us.org  http://www.emprender.org.ec/index.php/semana-global-del-emprendimiento-emprender/aliados/item/20-impaqto-quito/20-impaqto-quito?fromurl=onlinecasino888.us.org   http://www.www.ads1.in/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bgz.gameroomnotebook.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://hesdifferentiation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.golfintahoe.com/default.aspx?p=TrackHyperlink&url=https://onlinecasino888.us.org  http://chickabiddy.com.tw/redirect.asp?pId=PdtBuy_186&url=https://onlinecasino888.us.org  http://tracker.xlnow.net/r.asp?m=156&p=1&url=https://onlinecasino888.us.org   http://yourtop10.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://t3lounge.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.aapg.org/LinkClick.aspx?link=https://onlinecasino888.us.org   http://kailash.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://qd.huojimaidan.com/index.php?g=Index&c=Recognition&a=see_login_qrcode&referer=https://onlinecasino888.us.org  http://elas.tv/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dramatica.org.ua/l.php?=https://onlinecasino888.us.org/  http://www.melissamassey.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://avibo.com.ua/redirect/?go=https://onlinecasino888.us.org   http://avtoritet.su/upload/rk/bf1/bf150517bfabb14c48c41e2e50f97421.swf?flash_link=onlinecasino888.us.org \n \n \n \n \n \nhttp://0.0.0.ehhkzg.mannlist.com/viewtopic.php?f=10&t=45605524\nhttps://digitalconnection.com/forum/index.php?topic=10731.new#new\nhttp://www.theshiftseries.com/vandnika-sookrit-of-the-leaders-forum/#comment-290\nhttp://www.pdh-forum.co.uk/viewtopic.php?pid=67072#p67072\nhttp://savingthismonth.com/gifts-and-flowers/hanging-cupboard-door-storage-trash-rack-gearxs-com/?commentstab=1\n", "language": "Lisp", "metadata": {"date": 1546835586, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s160583069.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s160583069", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://www.plumbers.co.nz/redirect.php?listing-id=8&url=https://onlinecasino888.us.org  http://toptenbestgames.com/goto/https://onlinecasino888.us.org   http://www.brandnewengineparts.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://fleetcor.lesgh.com/www.eshoppinguk.co.uk/go.php?url=onlinecasino888.us.org  http://all-free-wallpapers.us/redir.php?url=https://onlinecasino888.us.org   http://hullabaloocostumes.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sodexofoodsafety.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.westcoastmetals.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://atlasvanlines.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://clearlyabettervalue.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.navicore.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://kezako.brasnow.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.nobleboatschina.tyigh.com/bitrix/rk.php?id=21&site_id=s2&event1=banner&event2=click&event3=1+%2F+%5B21%5D+%5BMAIN_BOTTOM_4_EN%5D+Investor+Tools&goto=onlinecasino888.us.org  http://walterjlewis.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.cameostock.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://hisnewsnetwork.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://maps.google.com.ar/url?q=https://onlinecasino888.us.org   http://jenniferstaniloff.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.hotspotimage.com/bbs/redirect.php?tid=17266&goto=onlinecasino888.us.org  http://wastewatertechnology.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.ratethetechie.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ilovemymattress.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://longacre-theater.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://century21tamayoyasociados.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://un-canape.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.capuanoforsenate.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://deltapackaging.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.co.columbia.wi.us/columbiacounty/LinkClick.aspx?link=https://onlinecasino888.us.org  http://wheeling.eztouse.com/redirect.asp?weburl=onlinecasino888.us.org   http://www.rockymountainingredients.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.unrealshemales.com/cgi-bin/atx/out.cgi?id=55&trade=https://onlinecasino888.us.org  http://www.oaci.org/cgi-bin/anonymous/redirect.cgi?url=https://onlinecasino888.us.org   http://www.rvdealerinventory.com/outlink/track.php?url=onlinecasino888.us.org  http://leadershipdevelopmentcorps.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://bankloanservices.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bff.orangehairedboy.com/flang.php?url=https://onlinecasino888.us.org \nhttp://asktheozarks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.tinysolo.com/crtr/cgi/out.cgi?c=1&s=85&l=galleries&u=https://onlinecasino888.us.org   http://tourathtripoli.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bestalarmoffer.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://monstercrate.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://healthyagingnewsletter.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://temptationresortmexico.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://xkl.pmpc-pvc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://online-biznes.biz/go.php?url=onlinecasino888.us.org \nhttp://jackchurch.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://galegals.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://pdcodr.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ojf.metrofhn.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.explainittome.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://houstondentaloncology.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://heartsonfirestinks.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mattadler.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.nationalpostdoc.org/link.asp?e=katec@rice.edu&job=2452589&ymlink=14724471&finalurl=https://onlinecasino888.us.org \nhttp://www.mova.com.ua/go/https://onlinecasino888.us.org  http://г‚ёгѓЈгѓ гѓЌгѓѓгѓ€.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://onlinejobform.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://blog.mypcz.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino888.us.org  http://bestwebsiteportal.com/redirect.php?url=https://onlinecasino888.us.org   http://kaptur.club/proxy.php?link=https://onlinecasino888.us.org  http://nerium.in/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.vnukovo.ru/bitrix/rk.php?id=49&event1=banner&event2=click&event3=1+%2F+%5B49%5D+%5Bmain_banner_left_2%5D+FCC-2017&goto=https://onlinecasino888.us.org   http://youngharvill.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://audi-a6.com.ua/go.php?https://onlinecasino888.us.org  http://mattbeatty.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://elzamanalmasry.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.modot.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.whiteoaksrent-all.com/LinkClick.aspx?link=https://onlinecasino888.us.org   http://mes.ifmo.ru/go.php?url=https://onlinecasino888.us.org  http://www.flyblind.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://whatisnow.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://pr-group.ru/links.php?go=https://onlinecasino888.us.org \nhttps://www.zerohedge.com/?cb=33222996629&charset=UTF-8&loc=http://www.zerohedge.com/&page=2938&referer=https://onlinecasino888.us.org  http://www.emprender.org.ec/index.php/semana-global-del-emprendimiento-emprender/aliados/item/20-impaqto-quito/20-impaqto-quito?fromurl=onlinecasino888.us.org   http://www.www.ads1.in/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bgz.gameroomnotebook.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://hesdifferentiation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.golfintahoe.com/default.aspx?p=TrackHyperlink&url=https://onlinecasino888.us.org  http://chickabiddy.com.tw/redirect.asp?pId=PdtBuy_186&url=https://onlinecasino888.us.org  http://tracker.xlnow.net/r.asp?m=156&p=1&url=https://onlinecasino888.us.org   http://yourtop10.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://t3lounge.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.aapg.org/LinkClick.aspx?link=https://onlinecasino888.us.org   http://kailash.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://qd.huojimaidan.com/index.php?g=Index&c=Recognition&a=see_login_qrcode&referer=https://onlinecasino888.us.org  http://elas.tv/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dramatica.org.ua/l.php?=https://onlinecasino888.us.org/  http://www.melissamassey.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://avibo.com.ua/redirect/?go=https://onlinecasino888.us.org   http://avtoritet.su/upload/rk/bf1/bf150517bfabb14c48c41e2e50f97421.swf?flash_link=onlinecasino888.us.org \n \n \n \n \n \nhttp://0.0.0.ehhkzg.mannlist.com/viewtopic.php?f=10&t=45605524\nhttps://digitalconnection.com/forum/index.php?topic=10731.new#new\nhttp://www.theshiftseries.com/vandnika-sookrit-of-the-leaders-forum/#comment-290\nhttp://www.pdh-forum.co.uk/viewtopic.php?pid=67072#p67072\nhttp://savingthismonth.com/gifts-and-flowers/hanging-cupboard-door-storage-trash-rack-gearxs-com/?commentstab=1\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8297, "cpu_time_ms": 91, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s228040620", "group_id": "codeNet:p03941", "input_text": "http://www.drisag.ch/php/mhs.printme/index.php?url=https://onlinecasino888.us.org  http://pcpcsingles.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://swepub.kb.se/setattribute;jsessionid=25CD38870521E84BD240573253DFEA75?language=en&redirect=https://onlinecasino888.us.org   http://simpleplan.su/go?https://onlinecasino888.us.org  https://partner.stiebel-eltron.cz/skoleni/qc_extlink.php?go=https://onlinecasino888.us.org   http://www.donerewards.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.stadt-gladbeck.de/ExternerLink.asp?ziel=https://onlinecasino888.us.org  http://www.nikki4oakland.com/r?u=https://onlinecasino888.us.org   http://mylanpharms.in/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://anguillapages.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.hivviralload.com/process/RedirectN?url=https://onlinecasino888.us.org   http://taxcare.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://intercity.by/bitrix/rk.php?id=664&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B664%5D+%5Bmain_tours%5D+%D0%9A%D0%98%D0%9F%D0%A0&goto=onlinecasino888.us.org  http://business-international.eu/url?q=https://onlinecasino888.us.org   http://www.paineproperties.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.ladyboysurprises.com/cgi-bin/at3/out.cgi?id=160&tag=top&trade=https://onlinecasino888.us.org  http://biotracer.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.javaroad.jp/news/redirect.jsp?link=https://onlinecasino888.us.org \nhttp://kaesernblair.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://aveacalisiyor.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://napieralski.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://jx.yuhuzm.top/index.php?url=https://onlinecasino888.us.org  http://inpoweryourpets.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://wellnessprompts.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://counterrevolutionstudio.com/LinkClick.aspx?link=https://onlinecasino888.us.org  http://app.semi.org.cn/ads/adsclick.action?aid=4d7a6379&redirect=https://onlinecasino888.us.org   http://punkmailer.de/egroupware/redirect.php?go=https://onlinecasino888.us.org \nhttps://www.zoopet.com/forum/blogs/maria-sj%C3%B6jungfru/2308950-?goto=onlinecasino888.us.org  http://goldmate.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://thankyoufordying.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://hairyflicks.com/cgi-bin/atc/out.cgi?id=34&u=https://onlinecasino888.us.org  http://lancerlacrosse.org/Goto.asp?url=https://onlinecasino888.us.org   http://info.lawkorea.com/asp/_frame/index.asp?url=https://onlinecasino888.us.org  http://pilotyourpower.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.lieqiwang.com/link.php?action=previous&fid=521&tid=222013&fpage=0&goto=onlinecasino888.us.org   http://www.the-spades-guide.com/go.php?passing=onlinecasino888.us.org \nhttps://www.graubuendner.ch/goto.php?url=https://onlinecasino888.us.org  http://intellirater.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.trophies.de/forum/index.php?app=core&module=system&controller=redirect&url=https://onlinecasino888.us.org   http://www.myonlinestats.com/traffic/go/go.php?url=https://onlinecasino888.us.org  http://www.thomashleefunds.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://baldi.ge/bitrix/rk.php?id=74&event1=banner&event2=click&event3=5+%2F+%5B74%5D+%5BMAIN_SHOE_FINDER%5D+Finder+geo&goto=onlinecasino888.us.org  http://bq--3b63fdppm34fyqa.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://metallord.org.ua/go.php?url=onlinecasino888.us.org   http://www.xn--122-5cda6bgxq.xn--p1ai/bitrix/rk.php?id=10&event1=banner&event2=click&event3=1+%2F+%5B10%5D+%5Bd_nav%5D+%CA%E0%EB+%ED%E0+%F1%EA%F0%FB%F2%F3%FE+%EA%F0%EE%E2%FC+%28Hb%2FHp+%F2%E5%F1%F2%29&goto=onlinecasino888.us.org \nhttp://hotelcrowdfund.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://shemale-3d.com/crtr/cgi/out.cgi?id=89&l=top_top&u=https://onlinecasino888.us.org   https://xn--90athc1g.xn--p1ai/?name=camera1&ip=185.58.252.84&type=jpeg&request_type=new_session&duration=0&stream_clients=0&total_clients=0&session_id=9fca65450912bab2f973a7f22c391af960eb6b61&country=RU&user_name=camera1&port=80&qs=&host=185.197.33.237&user_agent=Mozilla%252F5.0+%2528Windows+NT+6.1%253B+Win64%253B+x64%2529+AppleWebKit%252F537.36+%2528KHTML%252C+like+Gecko%2529+Chrome%252F61.0.3163.100+Safari%252F537.36&referer=https://onlinecasino888.us.org   http://jump.spawn.jp/?url=https://onlinecasino888.us.org  http://managingwithinformation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.bnaibrith.ca/r?u=https://onlinecasino888.us.org  http://winstonli.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://maestro.technolutions.net/partner/remote?u=https://onlinecasino888.us.org   http://bbs2.dl.net.cn/uchome/link.php?url=https://onlinecasino888.us.org \nhttp://redcoproperties.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://toddcory.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://jikosha.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.tsticn.com/redirect.aspx?url=https://onlinecasino888.us.org  http://images.google.mn/url?q=https://onlinecasino888.us.org   http://streamlinedaccounting.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://menopauseformale.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://the-outnet.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.fullboost.com.au/forum/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fwww.fullboost.com.au%2Fforum%2Fshowthread.php%3F8840-FS-SA-Garrett-TO4-S-1050-delivered&code=383c7f0a1d2d0bb10f9695b658ba1800&board_url=https://onlinecasino888.us.org \nhttp://eatingdisordersadolescent.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rpokhotsk.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino888.us.org   http://fusebus.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dealofthedayindia.com/go.php?https://onlinecasino888.us.org  http://www.educateourstate.org/r?u=https://onlinecasino888.us.org   https://matbrod.ifokus.se/links/track?type=featured&url=https://onlinecasino888.us.org  http://www.chickenhead.com/includes/redirect.asp?url=https://onlinecasino888.us.org  http://fructositis.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://revisaodosite.com/redirect.php?url=https://onlinecasino888.us.org \nhttp://gzg.academyofartfacultysucks.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.economads.com/link.php?https://onlinecasino888.us.org   http://ultimatehondaexperience.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://romhacking.net.ru/go?https://onlinecasino888.us.org  http://www.biochemistry.org/LinkClick.aspx?link=https://onlinecasino888.us.org   http://efolks.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://gloryonhighfireworksllc.com/__media__/js/trademark.php?d=onlinecasino888.us.org  http://taitzfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://unityofeffort.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.transpacificdistributors.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mrbanner.3dn.ru/go?https://onlinecasino888.us.org   http://hotgayflicks.com/go.php?s=60&u=https://onlinecasino888.us.org   http://www.newfashionmod.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.golfclubambrosiano.it/gotoURL.asp?url=https://onlinecasino888.us.org   https://www.bitrix24.kz/bitrix/rk.php?id=85&site_id=kz&event1=banner&event2=click&event3=1+%2F+%5B85%5D+%5BMAIN_PAGE_VIDEO%5D+%D0%91%D0%B0%D0%BD%D0%BD%D0%B5%D1%80+%D0%BD%D0%B0+%D0%B3%D0%BB%D0%B0%D0%B2%D0%BD%D0%BE%D0%B9+%28%D0%BD%D0%BE%D0%B2%D0%BE%D0%B5+%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE+KZ%29&goto=https://onlinecasino888.us.org  http://finalls.ru/forum/away.php?s=https://onlinecasino888.us.org  http://costaricasocceracademy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.fsas.org/LinkClick.aspx?link=https://onlinecasino888.us.org \n \n \n \n \n \nhttps://bolasepakmy.com/mybb/showthread.php?tid=18864\nhttp://detayweb.com/showthread.php?4408-cute-volleyball-team-names&p=4421#post4421\nhttp://forumgeos.tk/viewtopic.php?f=4&t=48341\nhttp://dnpel.ru/for/index.php?topic=15560.new#new\nhttp://biko-pc.pl/forum/showthread.php?tid=23034\n", "language": "Lisp", "metadata": {"date": 1546827275, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s228040620.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s228040620", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.drisag.ch/php/mhs.printme/index.php?url=https://onlinecasino888.us.org  http://pcpcsingles.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://swepub.kb.se/setattribute;jsessionid=25CD38870521E84BD240573253DFEA75?language=en&redirect=https://onlinecasino888.us.org   http://simpleplan.su/go?https://onlinecasino888.us.org  https://partner.stiebel-eltron.cz/skoleni/qc_extlink.php?go=https://onlinecasino888.us.org   http://www.donerewards.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.stadt-gladbeck.de/ExternerLink.asp?ziel=https://onlinecasino888.us.org  http://www.nikki4oakland.com/r?u=https://onlinecasino888.us.org   http://mylanpharms.in/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://anguillapages.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.hivviralload.com/process/RedirectN?url=https://onlinecasino888.us.org   http://taxcare.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://intercity.by/bitrix/rk.php?id=664&site_id=s1&event1=banner&event2=click&event3=1+%2F+%5B664%5D+%5Bmain_tours%5D+%D0%9A%D0%98%D0%9F%D0%A0&goto=onlinecasino888.us.org  http://business-international.eu/url?q=https://onlinecasino888.us.org   http://www.paineproperties.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.ladyboysurprises.com/cgi-bin/at3/out.cgi?id=160&tag=top&trade=https://onlinecasino888.us.org  http://biotracer.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.javaroad.jp/news/redirect.jsp?link=https://onlinecasino888.us.org \nhttp://kaesernblair.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://aveacalisiyor.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://napieralski.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://jx.yuhuzm.top/index.php?url=https://onlinecasino888.us.org  http://inpoweryourpets.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://wellnessprompts.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://counterrevolutionstudio.com/LinkClick.aspx?link=https://onlinecasino888.us.org  http://app.semi.org.cn/ads/adsclick.action?aid=4d7a6379&redirect=https://onlinecasino888.us.org   http://punkmailer.de/egroupware/redirect.php?go=https://onlinecasino888.us.org \nhttps://www.zoopet.com/forum/blogs/maria-sj%C3%B6jungfru/2308950-?goto=onlinecasino888.us.org  http://goldmate.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://thankyoufordying.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://hairyflicks.com/cgi-bin/atc/out.cgi?id=34&u=https://onlinecasino888.us.org  http://lancerlacrosse.org/Goto.asp?url=https://onlinecasino888.us.org   http://info.lawkorea.com/asp/_frame/index.asp?url=https://onlinecasino888.us.org  http://pilotyourpower.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.lieqiwang.com/link.php?action=previous&fid=521&tid=222013&fpage=0&goto=onlinecasino888.us.org   http://www.the-spades-guide.com/go.php?passing=onlinecasino888.us.org \nhttps://www.graubuendner.ch/goto.php?url=https://onlinecasino888.us.org  http://intellirater.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.trophies.de/forum/index.php?app=core&module=system&controller=redirect&url=https://onlinecasino888.us.org   http://www.myonlinestats.com/traffic/go/go.php?url=https://onlinecasino888.us.org  http://www.thomashleefunds.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://baldi.ge/bitrix/rk.php?id=74&event1=banner&event2=click&event3=5+%2F+%5B74%5D+%5BMAIN_SHOE_FINDER%5D+Finder+geo&goto=onlinecasino888.us.org  http://bq--3b63fdppm34fyqa.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://metallord.org.ua/go.php?url=onlinecasino888.us.org   http://www.xn--122-5cda6bgxq.xn--p1ai/bitrix/rk.php?id=10&event1=banner&event2=click&event3=1+%2F+%5B10%5D+%5Bd_nav%5D+%CA%E0%EB+%ED%E0+%F1%EA%F0%FB%F2%F3%FE+%EA%F0%EE%E2%FC+%28Hb%2FHp+%F2%E5%F1%F2%29&goto=onlinecasino888.us.org \nhttp://hotelcrowdfund.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://shemale-3d.com/crtr/cgi/out.cgi?id=89&l=top_top&u=https://onlinecasino888.us.org   https://xn--90athc1g.xn--p1ai/?name=camera1&ip=185.58.252.84&type=jpeg&request_type=new_session&duration=0&stream_clients=0&total_clients=0&session_id=9fca65450912bab2f973a7f22c391af960eb6b61&country=RU&user_name=camera1&port=80&qs=&host=185.197.33.237&user_agent=Mozilla%252F5.0+%2528Windows+NT+6.1%253B+Win64%253B+x64%2529+AppleWebKit%252F537.36+%2528KHTML%252C+like+Gecko%2529+Chrome%252F61.0.3163.100+Safari%252F537.36&referer=https://onlinecasino888.us.org   http://jump.spawn.jp/?url=https://onlinecasino888.us.org  http://managingwithinformation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.bnaibrith.ca/r?u=https://onlinecasino888.us.org  http://winstonli.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://maestro.technolutions.net/partner/remote?u=https://onlinecasino888.us.org   http://bbs2.dl.net.cn/uchome/link.php?url=https://onlinecasino888.us.org \nhttp://redcoproperties.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://toddcory.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://jikosha.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.tsticn.com/redirect.aspx?url=https://onlinecasino888.us.org  http://images.google.mn/url?q=https://onlinecasino888.us.org   http://streamlinedaccounting.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://menopauseformale.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://the-outnet.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.fullboost.com.au/forum/mobiquo/smartbanner/ads.php?referer=http%3A%2F%2Fwww.fullboost.com.au%2Fforum%2Fshowthread.php%3F8840-FS-SA-Garrett-TO4-S-1050-delivered&code=383c7f0a1d2d0bb10f9695b658ba1800&board_url=https://onlinecasino888.us.org \nhttp://eatingdisordersadolescent.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rpokhotsk.ru/bitrix/rk.php?event1=file&event2=download&goto=onlinecasino888.us.org   http://fusebus.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://dealofthedayindia.com/go.php?https://onlinecasino888.us.org  http://www.educateourstate.org/r?u=https://onlinecasino888.us.org   https://matbrod.ifokus.se/links/track?type=featured&url=https://onlinecasino888.us.org  http://www.chickenhead.com/includes/redirect.asp?url=https://onlinecasino888.us.org  http://fructositis.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://revisaodosite.com/redirect.php?url=https://onlinecasino888.us.org \nhttp://gzg.academyofartfacultysucks.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.economads.com/link.php?https://onlinecasino888.us.org   http://ultimatehondaexperience.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://romhacking.net.ru/go?https://onlinecasino888.us.org  http://www.biochemistry.org/LinkClick.aspx?link=https://onlinecasino888.us.org   http://efolks.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://gloryonhighfireworksllc.com/__media__/js/trademark.php?d=onlinecasino888.us.org  http://taitzfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://unityofeffort.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.transpacificdistributors.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mrbanner.3dn.ru/go?https://onlinecasino888.us.org   http://hotgayflicks.com/go.php?s=60&u=https://onlinecasino888.us.org   http://www.newfashionmod.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.golfclubambrosiano.it/gotoURL.asp?url=https://onlinecasino888.us.org   https://www.bitrix24.kz/bitrix/rk.php?id=85&site_id=kz&event1=banner&event2=click&event3=1+%2F+%5B85%5D+%5BMAIN_PAGE_VIDEO%5D+%D0%91%D0%B0%D0%BD%D0%BD%D0%B5%D1%80+%D0%BD%D0%B0+%D0%B3%D0%BB%D0%B0%D0%B2%D0%BD%D0%BE%D0%B9+%28%D0%BD%D0%BE%D0%B2%D0%BE%D0%B5+%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE+KZ%29&goto=https://onlinecasino888.us.org  http://finalls.ru/forum/away.php?s=https://onlinecasino888.us.org  http://costaricasocceracademy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.fsas.org/LinkClick.aspx?link=https://onlinecasino888.us.org \n \n \n \n \n \nhttps://bolasepakmy.com/mybb/showthread.php?tid=18864\nhttp://detayweb.com/showthread.php?4408-cute-volleyball-team-names&p=4421#post4421\nhttp://forumgeos.tk/viewtopic.php?f=4&t=48341\nhttp://dnpel.ru/for/index.php?topic=15560.new#new\nhttp://biko-pc.pl/forum/showthread.php?tid=23034\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8806, "cpu_time_ms": 149, "memory_kb": 9316}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s845829225", "group_id": "codeNet:p03941", "input_text": "A very serious allergic attack infrequently does occur. cucumber at night for weight loss <a href=http://reoselfhootsound.tk/post/new-nordic-fat-burner-erfaring >new nordic fat burner erfaring</a> and how to get perky breasts after weight loss <a href=http://airsoftoradeasaf.youpc.ro/memberlist.php?mode=viewprofile&u=687 >weight loss pills slim expert</a> \n<a href=http://bbs.luzihao.com/home.php?mod=space&uid=169 >green coffee farmacia cruz verde</a> best foods for keto diet weight loss <a href=http://reoselfhootsound.tk/post/how-can-smoothies-help-you-lose-weight >how can smoothies help you lose weight</a> and quickest way for a child to lose weight  <a href=http://meiguo1168.com/home.php?mod=space&uid=7567 >african mango cena apteka</a> \nbest liquid diet plan that works <a href=http://bbs.celueyingjia.com/forum.php?mod=viewthread&tid=12534&extra= >how to lose weight bike riding</a> sammy robinson weight loss", "language": "Lisp", "metadata": {"date": 1546753091, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s845829225.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s845829225", "user_id": "u794886383"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "A very serious allergic attack infrequently does occur. cucumber at night for weight loss <a href=http://reoselfhootsound.tk/post/new-nordic-fat-burner-erfaring >new nordic fat burner erfaring</a> and how to get perky breasts after weight loss <a href=http://airsoftoradeasaf.youpc.ro/memberlist.php?mode=viewprofile&u=687 >weight loss pills slim expert</a> \n<a href=http://bbs.luzihao.com/home.php?mod=space&uid=169 >green coffee farmacia cruz verde</a> best foods for keto diet weight loss <a href=http://reoselfhootsound.tk/post/how-can-smoothies-help-you-lose-weight >how can smoothies help you lose weight</a> and quickest way for a child to lose weight  <a href=http://meiguo1168.com/home.php?mod=space&uid=7567 >african mango cena apteka</a> \nbest liquid diet plan that works <a href=http://bbs.celueyingjia.com/forum.php?mod=viewthread&tid=12534&extra= >how to lose weight bike riding</a> sammy robinson weight loss", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 923, "cpu_time_ms": 75, "memory_kb": 8032}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s337417111", "group_id": "codeNet:p03941", "input_text": "We researched reliability of these details and mistakes it might comprise. garcinia cambogia in coimbatore <a href=http://coarewile.tk/post/ultrasonic-fat-loss >ultrasonic fat loss</a> and eating diet plan to lose weight <a href=http://ntnqp.com/forum.php?mod=viewthread&tid=8552&extra= >katie ledecky diet plan</a> \n<a href=http://www.letstalkguild.com/ltg/member.php?34606-todaPaliaro >how to lose fat off body</a> over 40 hard to lose weight <a href=http://coarewile.tk/post/protein-for-weight-loss-bodybuilding >protein for weight loss bodybuilding</a> and juices diet plan  <a href=http://gzsn333.com/home.php?mod=space&uid=141551 >garcinia cambogia fa andare in bagno</a> \n30 minute yoga routine weight loss <a href=https://bbs32.test.tyzoid.com/post.php?fid=7 >causes of weight loss stress</a> does natural progesterone cream help with weight loss", "language": "Lisp", "metadata": {"date": 1546739436, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s337417111.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s337417111", "user_id": "u794886383"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "We researched reliability of these details and mistakes it might comprise. garcinia cambogia in coimbatore <a href=http://coarewile.tk/post/ultrasonic-fat-loss >ultrasonic fat loss</a> and eating diet plan to lose weight <a href=http://ntnqp.com/forum.php?mod=viewthread&tid=8552&extra= >katie ledecky diet plan</a> \n<a href=http://www.letstalkguild.com/ltg/member.php?34606-todaPaliaro >how to lose fat off body</a> over 40 hard to lose weight <a href=http://coarewile.tk/post/protein-for-weight-loss-bodybuilding >protein for weight loss bodybuilding</a> and juices diet plan  <a href=http://gzsn333.com/home.php?mod=space&uid=141551 >garcinia cambogia fa andare in bagno</a> \n30 minute yoga routine weight loss <a href=https://bbs32.test.tyzoid.com/post.php?fid=7 >causes of weight loss stress</a> does natural progesterone cream help with weight loss", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 854, "cpu_time_ms": 77, "memory_kb": 8160}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s088142642", "group_id": "codeNet:p03941", "input_text": "http://www.x3m-master.ru/forum1/member.php?action=profile&uid=50894  http://188login.com/data/profile.php?id=154190   http://www.musclecoalition.org/member.php?11430-Wizzabqcet   http://favcrav.com/users/dimmjupaund  http://satillimite.com/profile.php?id=29890   http://forum.forexmon.ru/member.php/1325-DimmswAmeda  https://testoriginal.com/forum/member.php?action=profile&uid=49  http://www.association-manoirducrime.fr/forum/profile.php?id=145875   http://forum.fantasylibrary.ir/member.php?554-WizzrkCak \nhttp://nedeli.org/mama/user/52078/  http://sbo-bet.online/member.php?action=profile&uid=18019   http://supramannen.com/member.php?u=889830   http://surja.waw.pl/forum/member.php?action=profile&uid=5146  https://beta.i4g.tech/member.php?action=profile&uid=1072   http://g-ghoneim.com/vb/member.php?u=201133  https://ravedmc.com/forum/member.php?action=profile&uid=32  http://www.astronomyforum.net/members/wizzdnerorp.html   http://taaleb.ir/member.php?259-WizzaytVon \nhttps://www.mydeepfakes.com/community/member.php?action=profile&uid=3212  http://forum.kobietazklasa.pl/index.php?action=profile;u=62552   http://www.forumprint.ru/user/Diimmioralk/   http://www.astronomyhubble.com/member.php?action=profile&uid=3000  https://flat8.life/member.php?action=profile&uid=279   http://www.salammasjid.com/forum/member.php?action=profile&uid=292  https://forum.awarz.net/member.php?157594-WizzaryTusly  http://simabar.golestanmporg.ir/user/DimmyqGes/   http://forum.azescience.org/member.php?action=profile&uid=136 \nhttp://www.dipkursak.ru/user/Dimmhhskymn/  http://waslala.net/user/13705   http://www.iigenius.cn/memberlist.php?mode=viewprofile&u=59552   http://www.fawnisland.com/forum/index.php?action=profile;u=25248  http://forums.zenbership.com/profile.php?id=25968   https://www.crypto-oc.com/vb/member.php?u=207  http://community.thcfinder.com/member.php/134125-Dizzajinicy  http://planetasofta.org/member.php?u=24420   http://hexsurvival.ga/member.php?action=profile&uid=5274 \nhttp://bhcsaint.org/forum/member.php?action=profile&uid=407  http://fabiwan.kenobi.free.fr/forum/profile.php?id=3233   http://gilservis.maglan.ru/user/Wizzaxnpat/   http://lordmike.eu/forum/member.php?u=48470  https://alumni.akademitelkom.ac.id/member.php?action=profile&uid=62552   https://goddl.net/forum/member.php?u=46  http://pinjraa.com/forum/member.php?action=profile&uid=160  http://www.animschoolforums.com/memberlist.php?mode=viewprofile&u=49701   http://supramannen.com/member.php?u=889784 \nhttps://beta.i4g.tech/member.php?action=profile&uid=1074  http://forum.onlinefootballmanager.ru/members/947-Dizztdlom   http://sch112.ru/user/Dimmjjglymn/   http://www.cactuscultivation.com/forum/memberlist.php?mode=viewprofile&u=2350  http://forum.granit-micro.ru/memberlist.php?mode=viewprofile&u=25831   http://olga-bud.com.ua/user/Dizzverow/  http://www.musclecoalition.org/member.php?11433-Aiddsmcet  http://s-uohb.com/member.php?101545-AiidsyvaR   http://sr.radixedu.org.ve/member.php?action=profile&uid=2515 \nhttp://coarte.com.ec/index.php?option=com_k2&view=itemlist&task=user&id=35538  http://www.elitesquadgaming.com/forum/member.php?action=profile&uid=429   http://www.vfxtalk.org/member.php?63063-WizzaxaRerne   http://unlimitedgamingonline.com/member.php?action=profile&uid=339  http://w88w88top.com/w88top/profile.php?id=57728   http://www.802poker.com/member.php?action=profile&uid=63660  http://devops-india.com/profile.php?id=117670  https://anunciogratis.com.br/author/aiidfzstoff/   https://testoriginal.com/forum/member.php?action=profile&uid=51 \nhttp://in-technologies.ru/forum/index.php?action=profile;u=218844  http://freelancer.site.ge/user/DizzxhObelo/   http://himeuta.org/member.php?224855-SoogkaUnobe   http://pioneeri.ru/forum/memberlist.php?mode=viewprofile&u=84471  http://olga-bud.com.ua/user/Wizzajtrow/   http://beau-tec.com/forum/member.php?action=profile&uid=1117  http://smulti.org/forum/member.php?action=profile&uid=496  http://perekhid.te.ua/user/WizzbiPaw/   http://jpacschoolclubs.co.uk/component/users/?option=com_k2&view=itemlist&task=user&id=2214343 \nhttps://forum.antoniuscraft.nl/member.php?action=profile&uid=377  https://elizarovo.org/memberlist.php?mode=viewprofile&u=5297   https://testoriginal.com/forum/member.php?action=profile&uid=40   https://libriusatiunipv.altervista.org/member.php?action=profile&uid=122  https://ghostsclan.zapto.org/punbb/profile.php?id=13612   http://bbs.long-d.cn/users/62694/  https://forum.esforces.com/members/44991-Wizzapqric  http://adslife.ru/member.php?u=2214   http://computernetworktutor.com/fluxbb/profile.php?id=374298 \nhttp://atm1forum.com/forum/member.php?u=4566  http://www.elitesquadgaming.com/forum/member.php?action=profile&uid=435   http://forum.onlinefootballmanager.fr/member.php?1960366-DizzjfTaw   https://www.adahor.com/author/diggnvpelia/  http://sr.radixedu.org.ve/member.php?action=profile&uid=2514   http://www.italicar.ru/forum/profile.php?id=887234  https://forum.msk24city.ru/memberlist.php?mode=viewprofile&u=15879  http://harwooj.co.uk/Epsommm/member.php?action=profile&uid=4480   http://kuohsar-salmas.ir/index.php?subaction=userinfo&user=DiggtiWhody \n \n \n \n \n \nhttps://digitallifegaming.com/forums/showthread.php?13610-Examples-of-appeals-letters-financial-aid&p=19589#post19589\nhttps://www.lecoindealex.fr/Forum/viewtopic.php?f=4&t=32303\nhttps://uosymphony.com/resources/intonation-solutions-for-orchestral-players/\nhttp://dankonoy.com/forum/index.php/topic,59325.new.html#new\nhttp://foro.salaolimpo.com/viewtopic.php?f=9&t=6273\n", "language": "Lisp", "metadata": {"date": 1546734794, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s088142642.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s088142642", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.x3m-master.ru/forum1/member.php?action=profile&uid=50894  http://188login.com/data/profile.php?id=154190   http://www.musclecoalition.org/member.php?11430-Wizzabqcet   http://favcrav.com/users/dimmjupaund  http://satillimite.com/profile.php?id=29890   http://forum.forexmon.ru/member.php/1325-DimmswAmeda  https://testoriginal.com/forum/member.php?action=profile&uid=49  http://www.association-manoirducrime.fr/forum/profile.php?id=145875   http://forum.fantasylibrary.ir/member.php?554-WizzrkCak \nhttp://nedeli.org/mama/user/52078/  http://sbo-bet.online/member.php?action=profile&uid=18019   http://supramannen.com/member.php?u=889830   http://surja.waw.pl/forum/member.php?action=profile&uid=5146  https://beta.i4g.tech/member.php?action=profile&uid=1072   http://g-ghoneim.com/vb/member.php?u=201133  https://ravedmc.com/forum/member.php?action=profile&uid=32  http://www.astronomyforum.net/members/wizzdnerorp.html   http://taaleb.ir/member.php?259-WizzaytVon \nhttps://www.mydeepfakes.com/community/member.php?action=profile&uid=3212  http://forum.kobietazklasa.pl/index.php?action=profile;u=62552   http://www.forumprint.ru/user/Diimmioralk/   http://www.astronomyhubble.com/member.php?action=profile&uid=3000  https://flat8.life/member.php?action=profile&uid=279   http://www.salammasjid.com/forum/member.php?action=profile&uid=292  https://forum.awarz.net/member.php?157594-WizzaryTusly  http://simabar.golestanmporg.ir/user/DimmyqGes/   http://forum.azescience.org/member.php?action=profile&uid=136 \nhttp://www.dipkursak.ru/user/Dimmhhskymn/  http://waslala.net/user/13705   http://www.iigenius.cn/memberlist.php?mode=viewprofile&u=59552   http://www.fawnisland.com/forum/index.php?action=profile;u=25248  http://forums.zenbership.com/profile.php?id=25968   https://www.crypto-oc.com/vb/member.php?u=207  http://community.thcfinder.com/member.php/134125-Dizzajinicy  http://planetasofta.org/member.php?u=24420   http://hexsurvival.ga/member.php?action=profile&uid=5274 \nhttp://bhcsaint.org/forum/member.php?action=profile&uid=407  http://fabiwan.kenobi.free.fr/forum/profile.php?id=3233   http://gilservis.maglan.ru/user/Wizzaxnpat/   http://lordmike.eu/forum/member.php?u=48470  https://alumni.akademitelkom.ac.id/member.php?action=profile&uid=62552   https://goddl.net/forum/member.php?u=46  http://pinjraa.com/forum/member.php?action=profile&uid=160  http://www.animschoolforums.com/memberlist.php?mode=viewprofile&u=49701   http://supramannen.com/member.php?u=889784 \nhttps://beta.i4g.tech/member.php?action=profile&uid=1074  http://forum.onlinefootballmanager.ru/members/947-Dizztdlom   http://sch112.ru/user/Dimmjjglymn/   http://www.cactuscultivation.com/forum/memberlist.php?mode=viewprofile&u=2350  http://forum.granit-micro.ru/memberlist.php?mode=viewprofile&u=25831   http://olga-bud.com.ua/user/Dizzverow/  http://www.musclecoalition.org/member.php?11433-Aiddsmcet  http://s-uohb.com/member.php?101545-AiidsyvaR   http://sr.radixedu.org.ve/member.php?action=profile&uid=2515 \nhttp://coarte.com.ec/index.php?option=com_k2&view=itemlist&task=user&id=35538  http://www.elitesquadgaming.com/forum/member.php?action=profile&uid=429   http://www.vfxtalk.org/member.php?63063-WizzaxaRerne   http://unlimitedgamingonline.com/member.php?action=profile&uid=339  http://w88w88top.com/w88top/profile.php?id=57728   http://www.802poker.com/member.php?action=profile&uid=63660  http://devops-india.com/profile.php?id=117670  https://anunciogratis.com.br/author/aiidfzstoff/   https://testoriginal.com/forum/member.php?action=profile&uid=51 \nhttp://in-technologies.ru/forum/index.php?action=profile;u=218844  http://freelancer.site.ge/user/DizzxhObelo/   http://himeuta.org/member.php?224855-SoogkaUnobe   http://pioneeri.ru/forum/memberlist.php?mode=viewprofile&u=84471  http://olga-bud.com.ua/user/Wizzajtrow/   http://beau-tec.com/forum/member.php?action=profile&uid=1117  http://smulti.org/forum/member.php?action=profile&uid=496  http://perekhid.te.ua/user/WizzbiPaw/   http://jpacschoolclubs.co.uk/component/users/?option=com_k2&view=itemlist&task=user&id=2214343 \nhttps://forum.antoniuscraft.nl/member.php?action=profile&uid=377  https://elizarovo.org/memberlist.php?mode=viewprofile&u=5297   https://testoriginal.com/forum/member.php?action=profile&uid=40   https://libriusatiunipv.altervista.org/member.php?action=profile&uid=122  https://ghostsclan.zapto.org/punbb/profile.php?id=13612   http://bbs.long-d.cn/users/62694/  https://forum.esforces.com/members/44991-Wizzapqric  http://adslife.ru/member.php?u=2214   http://computernetworktutor.com/fluxbb/profile.php?id=374298 \nhttp://atm1forum.com/forum/member.php?u=4566  http://www.elitesquadgaming.com/forum/member.php?action=profile&uid=435   http://forum.onlinefootballmanager.fr/member.php?1960366-DizzjfTaw   https://www.adahor.com/author/diggnvpelia/  http://sr.radixedu.org.ve/member.php?action=profile&uid=2514   http://www.italicar.ru/forum/profile.php?id=887234  https://forum.msk24city.ru/memberlist.php?mode=viewprofile&u=15879  http://harwooj.co.uk/Epsommm/member.php?action=profile&uid=4480   http://kuohsar-salmas.ir/index.php?subaction=userinfo&user=DiggtiWhody \n \n \n \n \n \nhttps://digitallifegaming.com/forums/showthread.php?13610-Examples-of-appeals-letters-financial-aid&p=19589#post19589\nhttps://www.lecoindealex.fr/Forum/viewtopic.php?f=4&t=32303\nhttps://uosymphony.com/resources/intonation-solutions-for-orchestral-players/\nhttp://dankonoy.com/forum/index.php/topic,59325.new.html#new\nhttp://foro.salaolimpo.com/viewtopic.php?f=9&t=6273\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5536, "cpu_time_ms": 96, "memory_kb": 9312}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s479299172", "group_id": "codeNet:p03941", "input_text": "https://p2pfrank.com/member.php?action=profile&uid=509  http://www.itlstexas.com/mybb/member.php?action=profile&uid=1712   http://www.uristconsult.com/forum/profile.php?id=7599   http://beautifultattoo.info/profile.php?uid=3194  http://pakcarclub.com/member.php?9090-WizzgtPal   https://www.projectw.org/member.php?320-AidddzLeasp  http://yourm88.com/m88bet/profile.php?id=27608  https://sat-sharing-info.tk/member.php?u=909   http://forum.papeterra.pl/member.php?action=profile&uid=765 \nhttp://congnghexe.net/auto/profile.php?id=62791  http://www.eng.azrip.net/user/WizzaeeGlavy/   http://www.tnu.in.ua/forum/member.php?u=25938   http://dantespit.com/memberlist.php?mode=viewprofile&u=77  http://centralniy.org/memberlist.php?mode=viewprofile&u=5542   http://supramannen.com/member.php?u=889795  https://coachandbusmarket.com/author/wizzyuvam/  http://www.miniaturecattle.net/forum/member.php?action=profile&uid=117   http://animesay.ru/users/DizzviacEnd \nhttp://sxt.ch/forum/profile.php?id=25381  https://thailandelite.org/forum/User-DiggllAlami   http://gyandaata.com/profile/wizzrwkib   http://vinochok-dnz17.in.ua/user/Dizztitrone/  http://prochat.alpha-electronics.net/member.php/422613-DiimsvIrome   https://www.dangeroussports.com/forum/profile.php?id=27487  http://www.vegporn.com/board/member.php?u=351679  http://legalize.co/author/wizzanicen/   http://oolgaming.com/forum/member.php?action=profile&uid=5713 \nhttp://oshobr.grodno.by/user/WizzasyNib/  http://simabar.golestanmporg.ir/user/DizzokGes/   https://forum.zenstudios.com/member.php?2508374-Garrrygwtaw   http://dmvyouth.soccer/memberlist.php?mode=viewprofile&u=171  http://gamesvuinhon.com/vuinhon/profile.php?id=52280   http://kuohsar-salmas.ir/index.php?subaction=userinfo&user=DiggxmWhody  http://htlsr.de/forum/member.php?action=profile&uid=55080  http://conceptsnclarity.com/forum/index.php?action=profile;u=9226   http://forum.knightsofcamelot.info/member.php?action=profile&uid=2208 \nhttp://bio.mdu.edu.ua/index.php?subaction=userinfo&user=DizzzjOpina  http://www.v-tadawul.net/forum/member.php?1179447-Dizzikjed   http://www.opencart.com.tr/member.php?action=profile&uid=16350   http://bongdapluz.com/bongdaso/profile.php?id=29179  https://kuliah.trisnowlaharwetan.net/user-4885.html   https://xossipp.com/member.php?action=profile&uid=41  http://theposhmedia.com/forum/member.php?action=profile&uid=114  http://newdigital-world.com/members/dizzynurgen.html   https://excellence.org.il/space/forum/profile.php?id=87240 \nhttp://victorscu.com.es/mybb/member.php?action=profile&uid=10  http://byw.su/member.php?action=profile&uid=6888   http://girlmachine.com/forum/profile.php?id=6466   http://probeersel.com/forum/profile.php?id=63484  http://favcrav.com/users/dimmufpaund   http://byw.su/member.php?action=profile&uid=6860  http://arabforums.net/member.php?action=profile&uid=82  http://www.dzzzr.org.ua/forum/member.php?u=142411   http://www.capitolasset.net/forum/member.php?action=profile&uid=948 \nhttps://vw88vn.com/forum/profile.php?id=191977  http://forum.fantasylibrary.ir/member.php?553-WizzpcCak   http://forum.azescience.org/member.php?action=profile&uid=331   http://www.civfanatics.ru/members/77660-GarrrywlRazic  http://marjorieaperry.com/index.php/component/users/?option=com_k2&view=itemlist&task=user&id=372522   http://meyxana.net/forum/member.php?32541-AiddowCow  http://kqxs88.com/xoso/profile.php?id=8457  http://www.eng.azrip.net/user/DiggfsGlavy/   http://www.dangelodesigncenter.com/forum/index.php?action=profile;u=37136 \nhttps://forum.zenstudios.com/member.php?2527428-Diggkokep  http://finansy.su/user/WizzhzStils/   http://www.fawnisland.com/forum/index.php?action=profile;u=25404   https://ant53.ru/user/49468/  https://sahiplenelim.com/forum/member.php?action=profile&uid=52   http://visiology.com/forum/user/550/  http://myfileshost.org/Forum/member.php?action=profile&uid=521  http://tnortho.org/forum/forums/users/wizzalhbunny/   http://filehot.net/user/WizzatlDrupt/ \nhttp://www.homemadetools.net/forum/members/digguxquise/  http://www.giveupalready.com/member.php?83079-Garrrynajet   https://www.advogadoonline.net/profile/wizzajkemoda   https://www.iroids.com/forums/member.php?29306-Wizzalwgloth  http://www.espresso-freunde.de/index.php?option=com_k2&view=itemlist&task=user&id=49434&Itemid=2653   http://www.forumsepakbola.com/member.php?29275-DizzrfLig  https://mavenhacks.net/member.php?action=profile&uid=51  http://school1925-rzn.ru/osnovnye-svedeniya/user/5814/   http://forumbalada.com/member.php?action=profile&uid=20275 \nhttp://incatalogues.ru/bbs/tools.php?event=profile&pname=DizzpbdernE  http://bong88i.com/forum/profile.php?id=106553   http://www.espresso-freunde.de/index.php?option=com_k2&view=itemlist&task=user&id=49399&Itemid=2653   https://forum.esforces.com/members/45022-Dizzoxric  http://newdigital-world.com/members/aiidtxurgen.html   http://vincityleseine.com/vin/profile.php?id=80619  http://idina-here.com/gallery/profile.php?uid=34617  http://bhcsaint.org/forum/member.php?action=profile&uid=416   http://gallery.needforspeed.sk/profile.php?uid=510888 \n \n \n \n \n \nhttp://w88vn.today/nap-tien-vao-nha-cai-w88-choi-ca-cuoc-bong-da/#comment-251\nhttp://fabiwan.kenobi.free.fr/forum/viewtopic.php?pid=27654#p27654\nhttp://htlsr.de/forum/showthread.php?tid=10213\nhttp://ghanasdgs.info/2016/04/20/these-7-things-will-change-the-way-you-approach-travel/#comment-30938\nhttp://www.vectorrepair.com/forum/index.php/topic,11778.new.html#new\n", "language": "Lisp", "metadata": {"date": 1546727874, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s479299172.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s479299172", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://p2pfrank.com/member.php?action=profile&uid=509  http://www.itlstexas.com/mybb/member.php?action=profile&uid=1712   http://www.uristconsult.com/forum/profile.php?id=7599   http://beautifultattoo.info/profile.php?uid=3194  http://pakcarclub.com/member.php?9090-WizzgtPal   https://www.projectw.org/member.php?320-AidddzLeasp  http://yourm88.com/m88bet/profile.php?id=27608  https://sat-sharing-info.tk/member.php?u=909   http://forum.papeterra.pl/member.php?action=profile&uid=765 \nhttp://congnghexe.net/auto/profile.php?id=62791  http://www.eng.azrip.net/user/WizzaeeGlavy/   http://www.tnu.in.ua/forum/member.php?u=25938   http://dantespit.com/memberlist.php?mode=viewprofile&u=77  http://centralniy.org/memberlist.php?mode=viewprofile&u=5542   http://supramannen.com/member.php?u=889795  https://coachandbusmarket.com/author/wizzyuvam/  http://www.miniaturecattle.net/forum/member.php?action=profile&uid=117   http://animesay.ru/users/DizzviacEnd \nhttp://sxt.ch/forum/profile.php?id=25381  https://thailandelite.org/forum/User-DiggllAlami   http://gyandaata.com/profile/wizzrwkib   http://vinochok-dnz17.in.ua/user/Dizztitrone/  http://prochat.alpha-electronics.net/member.php/422613-DiimsvIrome   https://www.dangeroussports.com/forum/profile.php?id=27487  http://www.vegporn.com/board/member.php?u=351679  http://legalize.co/author/wizzanicen/   http://oolgaming.com/forum/member.php?action=profile&uid=5713 \nhttp://oshobr.grodno.by/user/WizzasyNib/  http://simabar.golestanmporg.ir/user/DizzokGes/   https://forum.zenstudios.com/member.php?2508374-Garrrygwtaw   http://dmvyouth.soccer/memberlist.php?mode=viewprofile&u=171  http://gamesvuinhon.com/vuinhon/profile.php?id=52280   http://kuohsar-salmas.ir/index.php?subaction=userinfo&user=DiggxmWhody  http://htlsr.de/forum/member.php?action=profile&uid=55080  http://conceptsnclarity.com/forum/index.php?action=profile;u=9226   http://forum.knightsofcamelot.info/member.php?action=profile&uid=2208 \nhttp://bio.mdu.edu.ua/index.php?subaction=userinfo&user=DizzzjOpina  http://www.v-tadawul.net/forum/member.php?1179447-Dizzikjed   http://www.opencart.com.tr/member.php?action=profile&uid=16350   http://bongdapluz.com/bongdaso/profile.php?id=29179  https://kuliah.trisnowlaharwetan.net/user-4885.html   https://xossipp.com/member.php?action=profile&uid=41  http://theposhmedia.com/forum/member.php?action=profile&uid=114  http://newdigital-world.com/members/dizzynurgen.html   https://excellence.org.il/space/forum/profile.php?id=87240 \nhttp://victorscu.com.es/mybb/member.php?action=profile&uid=10  http://byw.su/member.php?action=profile&uid=6888   http://girlmachine.com/forum/profile.php?id=6466   http://probeersel.com/forum/profile.php?id=63484  http://favcrav.com/users/dimmufpaund   http://byw.su/member.php?action=profile&uid=6860  http://arabforums.net/member.php?action=profile&uid=82  http://www.dzzzr.org.ua/forum/member.php?u=142411   http://www.capitolasset.net/forum/member.php?action=profile&uid=948 \nhttps://vw88vn.com/forum/profile.php?id=191977  http://forum.fantasylibrary.ir/member.php?553-WizzpcCak   http://forum.azescience.org/member.php?action=profile&uid=331   http://www.civfanatics.ru/members/77660-GarrrywlRazic  http://marjorieaperry.com/index.php/component/users/?option=com_k2&view=itemlist&task=user&id=372522   http://meyxana.net/forum/member.php?32541-AiddowCow  http://kqxs88.com/xoso/profile.php?id=8457  http://www.eng.azrip.net/user/DiggfsGlavy/   http://www.dangelodesigncenter.com/forum/index.php?action=profile;u=37136 \nhttps://forum.zenstudios.com/member.php?2527428-Diggkokep  http://finansy.su/user/WizzhzStils/   http://www.fawnisland.com/forum/index.php?action=profile;u=25404   https://ant53.ru/user/49468/  https://sahiplenelim.com/forum/member.php?action=profile&uid=52   http://visiology.com/forum/user/550/  http://myfileshost.org/Forum/member.php?action=profile&uid=521  http://tnortho.org/forum/forums/users/wizzalhbunny/   http://filehot.net/user/WizzatlDrupt/ \nhttp://www.homemadetools.net/forum/members/digguxquise/  http://www.giveupalready.com/member.php?83079-Garrrynajet   https://www.advogadoonline.net/profile/wizzajkemoda   https://www.iroids.com/forums/member.php?29306-Wizzalwgloth  http://www.espresso-freunde.de/index.php?option=com_k2&view=itemlist&task=user&id=49434&Itemid=2653   http://www.forumsepakbola.com/member.php?29275-DizzrfLig  https://mavenhacks.net/member.php?action=profile&uid=51  http://school1925-rzn.ru/osnovnye-svedeniya/user/5814/   http://forumbalada.com/member.php?action=profile&uid=20275 \nhttp://incatalogues.ru/bbs/tools.php?event=profile&pname=DizzpbdernE  http://bong88i.com/forum/profile.php?id=106553   http://www.espresso-freunde.de/index.php?option=com_k2&view=itemlist&task=user&id=49399&Itemid=2653   https://forum.esforces.com/members/45022-Dizzoxric  http://newdigital-world.com/members/aiidtxurgen.html   http://vincityleseine.com/vin/profile.php?id=80619  http://idina-here.com/gallery/profile.php?uid=34617  http://bhcsaint.org/forum/member.php?action=profile&uid=416   http://gallery.needforspeed.sk/profile.php?uid=510888 \n \n \n \n \n \nhttp://w88vn.today/nap-tien-vao-nha-cai-w88-choi-ca-cuoc-bong-da/#comment-251\nhttp://fabiwan.kenobi.free.fr/forum/viewtopic.php?pid=27654#p27654\nhttp://htlsr.de/forum/showthread.php?tid=10213\nhttp://ghanasdgs.info/2016/04/20/these-7-things-will-change-the-way-you-approach-travel/#comment-30938\nhttp://www.vectorrepair.com/forum/index.php/topic,11778.new.html#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5469, "cpu_time_ms": 218, "memory_kb": 16996}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s512638036", "group_id": "codeNet:p03941", "input_text": "http://www.palace3xxx.com/memberlist.php?mode=viewprofile&u=365  http://forum.caothumu.com/member.php?2561-Aiiddmsnamn   http://web.mdu.edu.ua/index.php?subaction=userinfo&user=AiidmzPep   http://forum.transqazvinajo.ir/member.php?8990-Dizznedus  http://huunhan.name.vn/member.php?4074-DizztdHax   http://vinochok-dnz17.in.ua/user/Dimmhptrone/  http://forum.mpc-scolaire.fr/profile.php?id=28053  http://www.specserv.us/forums/member.php?action=profile&uid=699   https://nattyornotforum.com/member.php?action=profile&uid=293 \nhttp://teykovo-online.ru/users/Wizzgdatrow  http://katanasword.ru/user/Soogcvpet/   http://s-uohb.com/member.php?101385-WizzarqvaR   https://f.nedelia.lt/user/Aiidqgnon/  http://muboss.net/forum/member.php?action=profile&uid=48691   https://woahoverflow.org/forums/index.php?action=profile;u=32  http://pozyskajdotacje.pl/dizzhnorike-u23297.html  http://www.femdommedia.com/forum/member.php?action=profile&uid=471   http://zoovetservis.com/board/tools.php?event=profile&pname=WizzazbRen \nhttp://www.laboutiquedelautomovil.com/forum.laboutiquedelautomovil.com/member.php?action=profile&uid=93  http://smulti.org/forum/member.php?action=profile&uid=99   http://mundo.adjaranet.com/user/Garrryxesot/   https://artsolo.pl/forum/profile.php?id=9251  http://az-serwer1859764.online.pro/member.php?action=profile&uid=16537   http://www.shaleisland.com/member.php?90-DigylBak  https://crochettalk.com/members/dizztqrah/  http://archeslocal.org.uk/forum/member.php?action=profile&uid=126552   https://megnevezhetetlen.000webhostapp.com/member.php?action=profile&uid=8750 \nhttp://tournamentsinpoker.com/member.php?action=profile&uid=56355  http://foreveralways.com.au/Gallery/profile.php?uid=580   http://tnortho.org/forum/forums/users/wizzauzbunny/   http://www.dostindian.com/author/dimmdxjak/  http://forums.sanityrp.us/member.php?action=profile&uid=47   http://k88pro.com/k8/profile.php?id=14967  http://www.castlecreator.com/forums/user/aiidgjlarce/  http://gamesvuinhon.com/vuinhon/profile.php?id=51685   http://forumjudi.co/profile.php?id=123803 \nhttp://www.lbryk.pl/forum/member.php?action=profile&uid=6977  http://futsal5cotland.com/profile.php?id=9051   http://uselessrecords.com/forum/index.php?action=profile;u=221   https://diendanmuaban.xyz/member.php?211-dimmqbwib-html  http://www.forum.hertz-audio.com.ua/memberlist.php?mode=viewprofile&u=2727669   http://france-publication.com/author/dizzngament/  https://titanetch.com/forum/profile.php?id=7729  http://www.802poker.com/member.php?action=profile&uid=63653   http://chalk.education/users/details/d21f7e3c-7e83-4141-80f9-c0c284db4bd3 \nhttp://forum.cntt2a2.com/user-20835.html  http://mt2shr8.com/vb/member.php?u=13802   http://81.222.238.42/member.php?10537-WizzantHeall   http://www.govblacklist.com/memberlist.php?mode=viewprofile&u=126  https://tminer.hbws.uk/member.php?action=profile&uid=40   http://www.technodom-blog.com/forums/profile.php?id=80345  http://karpich.com.ua/user/DizzlaPax/  http://g-drugz.fr/forum/member.php?action=profile&uid=543   http://www.akadeemiake.ee/foorum/profile.php?id=22924 \nhttp://www.tvoyopravo.ru/users/WizzihCashy  http://www.heroturko.net/user/DizzrxBense/   http://www.atheist-poetry.com/forums/member.php?action=profile&uid=380   https://www.adahor.com/author/wizzgvpelia/  http://favcrav.com/users/wizzkdpaund   https://ogomago.ml/user-7236.html  http://macanqq.gq/member.php?action=profile&uid=12  http://nazaninmousavi.com/index.php?subaction=userinfo&user=DiggemTok   http://www.angelworker.com/forum/member.php?action=profile&uid=575 \nhttp://forum.vikingstown.at/profile.php?id=15973  http://ant0n.net/forums/member.php?action=profile&uid=25   https://darkwarez.tv/member.php?3-Garrryohtap   http://tournamentsinpoker.com/member.php?action=profile&uid=56355  https://www.7sportnews.ru/user/WizzrdHek/   http://prorabforum.com/member.php?u=6369  http://skinion.net/member.php?66685-Wizzaeekem  https://www.dangeroussports.com/forum/profile.php?id=28456   https://elizarovo.org/memberlist.php?mode=viewprofile&u=5290 \nhttp://www.strengthandflexibility.com/forum/profile.php?id=51763  http://karpich.com.ua/user/WizzatbPax/   http://satillimite.com/profile.php?id=29862   https://www.7autonews.ru/user/Dimmivkam/  http://xxxextreme.org/user/WizzaobEmesy/   http://www.itlstexas.com/mybb/member.php?action=profile&uid=1696  http://www.informaticos.pt/forum/member.php?action=profile&uid=242542  http://www.vfxtalk.org/member.php?63062-WizzagcRerne   http://motorsportracingcommunity.com/member.php?action=profile&uid=152 \nhttps://ghostsclan.zapto.org/punbb/profile.php?id=14872  http://bong88i.com/forum/profile.php?id=128773   https://forum.bulletstormgaming.com/member.php?action=profile&uid=18   http://www.apnanri.com/forum/profile.php?id=20954  https://nyt.cloud/member.php?action=profile&uid=531   https://darkwarez.tv/member.php?22-Diggapbip  http://autoniha.com/member.php?action=profile&uid=134  http://blackhatstudent.com/member.php?action=profile&uid=860   http://player.ru/member.php?u=161997 \n \n \n \n \n \nhttp://zhgtk.kz/forum/viewtopic.php?pid=470688#p470688\nhttp://www.vektor.hr/forum/viewtopic.php?pid=31574#p31574\nhttp://forum.2dar2.de/index.php?topic=126180.new#new\nhttps://www.kadmium.nl/forum/viewtopic.php?f=3&t=10159\nhttps://forum.extreme-server.com/index.php?topic=221856.new#new\n", "language": "Lisp", "metadata": {"date": 1546721096, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s512638036.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s512638036", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://www.palace3xxx.com/memberlist.php?mode=viewprofile&u=365  http://forum.caothumu.com/member.php?2561-Aiiddmsnamn   http://web.mdu.edu.ua/index.php?subaction=userinfo&user=AiidmzPep   http://forum.transqazvinajo.ir/member.php?8990-Dizznedus  http://huunhan.name.vn/member.php?4074-DizztdHax   http://vinochok-dnz17.in.ua/user/Dimmhptrone/  http://forum.mpc-scolaire.fr/profile.php?id=28053  http://www.specserv.us/forums/member.php?action=profile&uid=699   https://nattyornotforum.com/member.php?action=profile&uid=293 \nhttp://teykovo-online.ru/users/Wizzgdatrow  http://katanasword.ru/user/Soogcvpet/   http://s-uohb.com/member.php?101385-WizzarqvaR   https://f.nedelia.lt/user/Aiidqgnon/  http://muboss.net/forum/member.php?action=profile&uid=48691   https://woahoverflow.org/forums/index.php?action=profile;u=32  http://pozyskajdotacje.pl/dizzhnorike-u23297.html  http://www.femdommedia.com/forum/member.php?action=profile&uid=471   http://zoovetservis.com/board/tools.php?event=profile&pname=WizzazbRen \nhttp://www.laboutiquedelautomovil.com/forum.laboutiquedelautomovil.com/member.php?action=profile&uid=93  http://smulti.org/forum/member.php?action=profile&uid=99   http://mundo.adjaranet.com/user/Garrryxesot/   https://artsolo.pl/forum/profile.php?id=9251  http://az-serwer1859764.online.pro/member.php?action=profile&uid=16537   http://www.shaleisland.com/member.php?90-DigylBak  https://crochettalk.com/members/dizztqrah/  http://archeslocal.org.uk/forum/member.php?action=profile&uid=126552   https://megnevezhetetlen.000webhostapp.com/member.php?action=profile&uid=8750 \nhttp://tournamentsinpoker.com/member.php?action=profile&uid=56355  http://foreveralways.com.au/Gallery/profile.php?uid=580   http://tnortho.org/forum/forums/users/wizzauzbunny/   http://www.dostindian.com/author/dimmdxjak/  http://forums.sanityrp.us/member.php?action=profile&uid=47   http://k88pro.com/k8/profile.php?id=14967  http://www.castlecreator.com/forums/user/aiidgjlarce/  http://gamesvuinhon.com/vuinhon/profile.php?id=51685   http://forumjudi.co/profile.php?id=123803 \nhttp://www.lbryk.pl/forum/member.php?action=profile&uid=6977  http://futsal5cotland.com/profile.php?id=9051   http://uselessrecords.com/forum/index.php?action=profile;u=221   https://diendanmuaban.xyz/member.php?211-dimmqbwib-html  http://www.forum.hertz-audio.com.ua/memberlist.php?mode=viewprofile&u=2727669   http://france-publication.com/author/dizzngament/  https://titanetch.com/forum/profile.php?id=7729  http://www.802poker.com/member.php?action=profile&uid=63653   http://chalk.education/users/details/d21f7e3c-7e83-4141-80f9-c0c284db4bd3 \nhttp://forum.cntt2a2.com/user-20835.html  http://mt2shr8.com/vb/member.php?u=13802   http://81.222.238.42/member.php?10537-WizzantHeall   http://www.govblacklist.com/memberlist.php?mode=viewprofile&u=126  https://tminer.hbws.uk/member.php?action=profile&uid=40   http://www.technodom-blog.com/forums/profile.php?id=80345  http://karpich.com.ua/user/DizzlaPax/  http://g-drugz.fr/forum/member.php?action=profile&uid=543   http://www.akadeemiake.ee/foorum/profile.php?id=22924 \nhttp://www.tvoyopravo.ru/users/WizzihCashy  http://www.heroturko.net/user/DizzrxBense/   http://www.atheist-poetry.com/forums/member.php?action=profile&uid=380   https://www.adahor.com/author/wizzgvpelia/  http://favcrav.com/users/wizzkdpaund   https://ogomago.ml/user-7236.html  http://macanqq.gq/member.php?action=profile&uid=12  http://nazaninmousavi.com/index.php?subaction=userinfo&user=DiggemTok   http://www.angelworker.com/forum/member.php?action=profile&uid=575 \nhttp://forum.vikingstown.at/profile.php?id=15973  http://ant0n.net/forums/member.php?action=profile&uid=25   https://darkwarez.tv/member.php?3-Garrryohtap   http://tournamentsinpoker.com/member.php?action=profile&uid=56355  https://www.7sportnews.ru/user/WizzrdHek/   http://prorabforum.com/member.php?u=6369  http://skinion.net/member.php?66685-Wizzaeekem  https://www.dangeroussports.com/forum/profile.php?id=28456   https://elizarovo.org/memberlist.php?mode=viewprofile&u=5290 \nhttp://www.strengthandflexibility.com/forum/profile.php?id=51763  http://karpich.com.ua/user/WizzatbPax/   http://satillimite.com/profile.php?id=29862   https://www.7autonews.ru/user/Dimmivkam/  http://xxxextreme.org/user/WizzaobEmesy/   http://www.itlstexas.com/mybb/member.php?action=profile&uid=1696  http://www.informaticos.pt/forum/member.php?action=profile&uid=242542  http://www.vfxtalk.org/member.php?63062-WizzagcRerne   http://motorsportracingcommunity.com/member.php?action=profile&uid=152 \nhttps://ghostsclan.zapto.org/punbb/profile.php?id=14872  http://bong88i.com/forum/profile.php?id=128773   https://forum.bulletstormgaming.com/member.php?action=profile&uid=18   http://www.apnanri.com/forum/profile.php?id=20954  https://nyt.cloud/member.php?action=profile&uid=531   https://darkwarez.tv/member.php?22-Diggapbip  http://autoniha.com/member.php?action=profile&uid=134  http://blackhatstudent.com/member.php?action=profile&uid=860   http://player.ru/member.php?u=161997 \n \n \n \n \n \nhttp://zhgtk.kz/forum/viewtopic.php?pid=470688#p470688\nhttp://www.vektor.hr/forum/viewtopic.php?pid=31574#p31574\nhttp://forum.2dar2.de/index.php?topic=126180.new#new\nhttps://www.kadmium.nl/forum/viewtopic.php?f=3&t=10159\nhttps://forum.extreme-server.com/index.php?topic=221856.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5328, "cpu_time_ms": 11, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s072307296", "group_id": "codeNet:p03941", "input_text": "https://www.vpn-zum-ikva-beweisforum.de/memberlist.php?mode=viewprofile&u=306489  https://forum.zenstudios.com/member.php?2527695-Dimmqlkep   http://l2emi.eu/Forum/member.php?action=profile&uid=1295   http://forumbalada.com/member.php?action=profile&uid=22005  http://staysafe-vimmerby.no-ip.org/forum/phpBB3/memberlist.php?mode=viewprofile&u=153469   https://zeropointvoid.com/forum/member.php?action=profile&uid=1448  http://goldwing.ws/member.php/14-WizzaotLax  http://devops-india.com/profile.php?id=117288   https://forum.esforces.com/members/44999-Digdmric \nhttp://www.fawnisland.com/forum/index.php?action=profile;u=22757  http://www.ifoundyou.org/member/280-wizzayabit   https://forum.awarz.net/member.php?158986-DizzedTusly   http://rift.kyme32.ro/forum/profile.php?id=119859  http://mindmaster.fi/forum/member.php?action=profile&uid=149   https://riiga.net/users/view/dizzuwinore  https://hashtopolis.org/user-111.html  https://mavenhacks.net/member.php?action=profile&uid=58   http://gallery.needforspeed.sk/profile.php?uid=510887 \nhttp://nazaninmousavi.com/index.php?subaction=userinfo&user=WizzdqTok  https://forum.esforces.com/members/44992-Wizzasnric   http://forum.viewbiquity.com/member.php?action=profile&uid=281436   http://fakti.ks.ua/user/Dimmfdbes/  http://dantespit.com/memberlist.php?mode=viewprofile&u=68   https://www.iroids.com/forums/member.php?29405-Dizzhzgloth  http://forum.lexiklopedia.de/member.php?action=profile&uid=166  http://trmconsulting.ca/index.php?option=com_k2&view=itemlist&task=user&id=984784   http://coarte.com.ec/index.php?option=com_k2&view=itemlist&task=user&id=35546 \nhttp://freerollspokerroom.com/member.php?action=profile&uid=15319  http://rahdaran.org/user/WizzzvRence/   https://fxfan.ru/user/Wizzadyneige/   http://www.grandplangaming.com/forum/memberlist.php?mode=viewprofile&u=2888  https://www.affilorama.com/member/wizzvuwef   http://incatalogues.ru/bbs/tools.php?event=profile&pname=DimmaxdernE  http://www.dzzzr.org.ua/forum/member.php?u=142337  https://www.redpah.com/profile/32444/dizzhxdaf   https://www.favor.com.ua/user/WizzasuShouh \nhttp://mikrotik-tr.com/index.php?action=profile;u=57011  http://www.grandplangaming.com/forum/memberlist.php?mode=viewprofile&u=2996   http://technologydevelopers.co.nf/forum/member.php?80-DigghrWam   http://rkr.in.ua/user/AiidxmSom/  http://pioneeri.ru/forum/memberlist.php?mode=viewprofile&u=84486   http://icedepth.com/forum/profile.php?id=56672  http://7e-it.net/vb/member.php?u=95270  http://www.kran-club.ru/users/Aiidorjam   http://km-schools.edu.sa/vb/member.php?13978-WizzvwFoedo \nhttp://harwooj.co.uk/Epsommm/member.php?action=profile&uid=4476  http://realtimecheats.com/forum/member.php?action=profile&uid=491   http://www.phoenixtruxx.us/index.php/component/users/?option=com_k2&view=itemlist&task=user&id=862   http://btc-f.org/forum/profile.php?id=104183  http://old.uralgufk.ru/user/Dimmakgendy/   http://pioneeri.ru/forum/memberlist.php?mode=viewprofile&u=84751  http://f1casino79.com/forum/profile.php?id=60416  http://ru.pravoteka24.com/user/DimmdzSmugs/   https://forum.bloodkings.eu/user-614.html \nhttp://ant0n.net/forums/member.php?action=profile&uid=9  http://konarbabaei.ir/user/WizzarpBoock/   https://vw88yes.com/forum/profile.php?id=215278   https://cinedsofa.li/member.php?action=profile&uid=75  http://forum.outils-conviviaux.fr/member.php?action=profile&uid=50707   http://comic-lair.com/forum/member.php?action=profile&uid=212  http://blackhatcoins.com/member.php/186724-DimmijSaito  https://forum.bulletstormgaming.com/member.php?action=profile&uid=33   http://forum.fibroteam.info/member.php?u=12533 \nhttps://consignmentshoponline.com/author/wizzevsmuch  http://marjorieaperry.com/index.php/component/users/?option=com_k2&view=itemlist&task=user&id=372606   http://sch112.ru/user/Wizzaniglymn/   http://www.speedwayforum.pl/User-digsrdaype  http://chatflh.com/vb/member.php?u=370   http://forum.voetbalzone.nl/member.php?u=16248  http://www.clasifik2gratis.com/author/dizzqustipt/  http://www.tunturisusi.com/aforismitfoorumi/phpBB3/memberlist.php?mode=viewprofile&u=61   http://forum.kolektabot.com/member.php?action=profile&uid=177 \nhttp://angle-des.com/vb/member.php?u=74148  http://knoxxedoutgaming.com.au/forum/member.php?action=profile&uid=425   http://vonwolkenstein.ano-host.co.in/vb4-neu/member.php?78724-Soogezweelm   https://istinastroitelstva.ru/user/WizzyiZoF/  http://www.letechs.com/forum/member.php?action=profile&uid=30690   http://www.askaluminium.com/User-WizzaawBuist  http://hristiqni.site/member.php?6-WizzwdEmumn  http://poster.berdyansk.net/user/WizzacyTauri/   http://forum.englishmountainoutdoors.com/member.php?action=profile&uid=49 \nhttps://forums.laviaccounts.com/member.php?action=profile&uid=950  http://honeykhansar.com/user/DizzaxVaw/   http://xxxvipporno.com/user/Dizzlutrure/   http://wafironline.com/author/wizzafgemomb/  https://www.affilorama.com/member/wizzjgwef   http://mlkj.be/forum/profile.php?id=15136  http://kryllyn.net/forum/profile.php?id=13538  http://www.tunturisusi.com/aforismitfoorumi/phpBB3/memberlist.php?mode=viewprofile&u=53   http://cbsprk.ru/forum/memberlist.php?mode=viewprofile&u=310441 \n \n \n \n \n \nhttp://pd.just-roleplay.com/viewtopic.php?f=4&t=1841\nhttp://htlsr.de/forum/showthread.php?tid=9879\nhttp://hazygame.com/forum/showthread.php/4-testetetetete?p=29#post29\nhttp://missouridom.org/forum/index.php?topic=4691.new#new\nhttp://supportlove.org/forums/topic/local-police-scanner-online/\n", "language": "Lisp", "metadata": {"date": 1546674225, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s072307296.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s072307296", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://www.vpn-zum-ikva-beweisforum.de/memberlist.php?mode=viewprofile&u=306489  https://forum.zenstudios.com/member.php?2527695-Dimmqlkep   http://l2emi.eu/Forum/member.php?action=profile&uid=1295   http://forumbalada.com/member.php?action=profile&uid=22005  http://staysafe-vimmerby.no-ip.org/forum/phpBB3/memberlist.php?mode=viewprofile&u=153469   https://zeropointvoid.com/forum/member.php?action=profile&uid=1448  http://goldwing.ws/member.php/14-WizzaotLax  http://devops-india.com/profile.php?id=117288   https://forum.esforces.com/members/44999-Digdmric \nhttp://www.fawnisland.com/forum/index.php?action=profile;u=22757  http://www.ifoundyou.org/member/280-wizzayabit   https://forum.awarz.net/member.php?158986-DizzedTusly   http://rift.kyme32.ro/forum/profile.php?id=119859  http://mindmaster.fi/forum/member.php?action=profile&uid=149   https://riiga.net/users/view/dizzuwinore  https://hashtopolis.org/user-111.html  https://mavenhacks.net/member.php?action=profile&uid=58   http://gallery.needforspeed.sk/profile.php?uid=510887 \nhttp://nazaninmousavi.com/index.php?subaction=userinfo&user=WizzdqTok  https://forum.esforces.com/members/44992-Wizzasnric   http://forum.viewbiquity.com/member.php?action=profile&uid=281436   http://fakti.ks.ua/user/Dimmfdbes/  http://dantespit.com/memberlist.php?mode=viewprofile&u=68   https://www.iroids.com/forums/member.php?29405-Dizzhzgloth  http://forum.lexiklopedia.de/member.php?action=profile&uid=166  http://trmconsulting.ca/index.php?option=com_k2&view=itemlist&task=user&id=984784   http://coarte.com.ec/index.php?option=com_k2&view=itemlist&task=user&id=35546 \nhttp://freerollspokerroom.com/member.php?action=profile&uid=15319  http://rahdaran.org/user/WizzzvRence/   https://fxfan.ru/user/Wizzadyneige/   http://www.grandplangaming.com/forum/memberlist.php?mode=viewprofile&u=2888  https://www.affilorama.com/member/wizzvuwef   http://incatalogues.ru/bbs/tools.php?event=profile&pname=DimmaxdernE  http://www.dzzzr.org.ua/forum/member.php?u=142337  https://www.redpah.com/profile/32444/dizzhxdaf   https://www.favor.com.ua/user/WizzasuShouh \nhttp://mikrotik-tr.com/index.php?action=profile;u=57011  http://www.grandplangaming.com/forum/memberlist.php?mode=viewprofile&u=2996   http://technologydevelopers.co.nf/forum/member.php?80-DigghrWam   http://rkr.in.ua/user/AiidxmSom/  http://pioneeri.ru/forum/memberlist.php?mode=viewprofile&u=84486   http://icedepth.com/forum/profile.php?id=56672  http://7e-it.net/vb/member.php?u=95270  http://www.kran-club.ru/users/Aiidorjam   http://km-schools.edu.sa/vb/member.php?13978-WizzvwFoedo \nhttp://harwooj.co.uk/Epsommm/member.php?action=profile&uid=4476  http://realtimecheats.com/forum/member.php?action=profile&uid=491   http://www.phoenixtruxx.us/index.php/component/users/?option=com_k2&view=itemlist&task=user&id=862   http://btc-f.org/forum/profile.php?id=104183  http://old.uralgufk.ru/user/Dimmakgendy/   http://pioneeri.ru/forum/memberlist.php?mode=viewprofile&u=84751  http://f1casino79.com/forum/profile.php?id=60416  http://ru.pravoteka24.com/user/DimmdzSmugs/   https://forum.bloodkings.eu/user-614.html \nhttp://ant0n.net/forums/member.php?action=profile&uid=9  http://konarbabaei.ir/user/WizzarpBoock/   https://vw88yes.com/forum/profile.php?id=215278   https://cinedsofa.li/member.php?action=profile&uid=75  http://forum.outils-conviviaux.fr/member.php?action=profile&uid=50707   http://comic-lair.com/forum/member.php?action=profile&uid=212  http://blackhatcoins.com/member.php/186724-DimmijSaito  https://forum.bulletstormgaming.com/member.php?action=profile&uid=33   http://forum.fibroteam.info/member.php?u=12533 \nhttps://consignmentshoponline.com/author/wizzevsmuch  http://marjorieaperry.com/index.php/component/users/?option=com_k2&view=itemlist&task=user&id=372606   http://sch112.ru/user/Wizzaniglymn/   http://www.speedwayforum.pl/User-digsrdaype  http://chatflh.com/vb/member.php?u=370   http://forum.voetbalzone.nl/member.php?u=16248  http://www.clasifik2gratis.com/author/dizzqustipt/  http://www.tunturisusi.com/aforismitfoorumi/phpBB3/memberlist.php?mode=viewprofile&u=61   http://forum.kolektabot.com/member.php?action=profile&uid=177 \nhttp://angle-des.com/vb/member.php?u=74148  http://knoxxedoutgaming.com.au/forum/member.php?action=profile&uid=425   http://vonwolkenstein.ano-host.co.in/vb4-neu/member.php?78724-Soogezweelm   https://istinastroitelstva.ru/user/WizzyiZoF/  http://www.letechs.com/forum/member.php?action=profile&uid=30690   http://www.askaluminium.com/User-WizzaawBuist  http://hristiqni.site/member.php?6-WizzwdEmumn  http://poster.berdyansk.net/user/WizzacyTauri/   http://forum.englishmountainoutdoors.com/member.php?action=profile&uid=49 \nhttps://forums.laviaccounts.com/member.php?action=profile&uid=950  http://honeykhansar.com/user/DizzaxVaw/   http://xxxvipporno.com/user/Dizzlutrure/   http://wafironline.com/author/wizzafgemomb/  https://www.affilorama.com/member/wizzjgwef   http://mlkj.be/forum/profile.php?id=15136  http://kryllyn.net/forum/profile.php?id=13538  http://www.tunturisusi.com/aforismitfoorumi/phpBB3/memberlist.php?mode=viewprofile&u=53   http://cbsprk.ru/forum/memberlist.php?mode=viewprofile&u=310441 \n \n \n \n \n \nhttp://pd.just-roleplay.com/viewtopic.php?f=4&t=1841\nhttp://htlsr.de/forum/showthread.php?tid=9879\nhttp://hazygame.com/forum/showthread.php/4-testetetetete?p=29#post29\nhttp://missouridom.org/forum/index.php?topic=4691.new#new\nhttp://supportlove.org/forums/topic/local-police-scanner-online/\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5483, "cpu_time_ms": 15, "memory_kb": 3552}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s890536092", "group_id": "codeNet:p03941", "input_text": "http://thehealingstudio.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://coronapointe.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://harkinsmoviemonkey.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://greenrobot-apps.net/go/?https://onlinecasino888.us.org  http://www.gunstoreusa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://petzetakisafrica.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.strahlentherapie-online.com/thread.php?goto=onlinecasino888.us.org  http://www.probiogenic.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://innocentvagina.com/cgi-bin/out.cgi?id=63&l=top&t=100t&u=https://onlinecasino888.us.org \nhttp://www.hornyteenstube.com/cgi-bin/a2/out.cgi?id=100&l=toplist&u=https://onlinecasino888.us.org  http://tetron.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://stopcyberbullying.org.uk/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.gsfserver.smffy.com/index.php?thememode=full;redirect=https://onlinecasino888.us.org  http://protectthecreation.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://wilderinalaska.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.solutionsrealtynow.com/searchpoint/redir.asp?reg_id=ptypes&sname=/searchpoint/search.asp&lid=1&sponsor=lea&url=https://onlinecasino888.us.org  http://crystaldynamix.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mashintop.ru/redirect.php?url=https://onlinecasino888.us.org \nhttp://panerabreadco.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.stannswarrington.org.uk/goto-link.php?link_id=11&url=https://onlinecasino888.us.org   http://www.manzano-associates.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://thaidetectives.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://cashsouthern.com/go.php?url=https://onlinecasino888.us.org   http://cindyscleaningtx.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://lunarglobal.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mediastride.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://7dsearch.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://insider.ru/info.php?a<>=<a href=https://onlinecasino888.us.org panels and battery storage<%  http://mothersexypornvideo.com/cgi-bin/crtr/out.cgi?id=1879&l=topmain&u=https://onlinecasino888.us.org   http://asadjafari.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://cuties4kids.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.surfcity.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.herbcn.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino888.us.org  http://getthefactsokc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://pascetta.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://rotobrush.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://oysterstreetstudio.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rushko.ru/out.php?url=https://onlinecasino888.us.org/   http://seniormiles.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://retothek.checkit.ch/Reto/ct.ashx?id=80155b15-4559-4fa8-ac57-839b08fba421&url=https://onlinecasino888.us.org/  http://www.studyireland.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://jowz.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://linkchain.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mjpetersonmarketing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.myregister.gr/el/redirect/?url=https://onlinecasino888.us.org \nhttp://fins.actwin.com/g.php?t=Algone&u=https://onlinecasino888.us.org  http://www.avls.pt/admin/Portal/LinkClick.aspx?tabid=478&table=Links&field=ItemID&id=991&link=https://onlinecasino888.us.org   http://switchyardproductions.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://youpug.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://roseislandrental.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://farahfamilyonline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.wichita.edu/thisis/mobilecheck/breakmobile.asp?https://onlinecasino888.us.org  http://www.itftennis.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://newmutualistmap.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://xocal.com/__media__/js/netsoltrademark.php?d=&http://animation3d.in/pythontraining.net/component/k2/item/4-enim-ac-eleifend-ultricesonlinecasino888.us.org  http://trc.taboolasyndication.com/washpost/log/2/click?pi=http://www.washingtonpost.com/lifestyle/style/art-and-politics-meet-in-collection-of-labor-images/2011/09/07/giqasxgqdk_story.html&sd=v1_a6c0075003c63af6915df98f2bc41e7e_3b2b9b2c-7a4e-498b-9562-cf23fee82879_1315857588_1315857588&ui=3b2b9b2c-7a4e-498b-9562-cf23fee82879&it=video&ii=7094938879832470976&pt=text&li=rbox-t2v&url=https://onlinecasino888.us.org   https://qmobi.agency/blog/go.php?url=https://onlinecasino888.us.org   http://hdporn1.com/cgi-bin/hdp.cgi?c=1&s=70&hdp=1&u=https://onlinecasino888.us.org  https://animations-enfants-hardelot.fr/Statistiques/CountStat.php?url=https://onlinecasino888.us.org   http://granitebayassets.com/New/granitebayassets/vlink.asp?url=https://onlinecasino888.us.org/  http://www.studying.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.kultboy.com/go.php?https://onlinecasino888.us.org   http://e-buildmaterials.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://alticeamerica.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://carerecruituk.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.catpoweredtrucks.com/forms/specsheet/emailfriend.aspx?subject=2005%20BLUE%20BIRD%20BB&url=https://onlinecasino888.us.org   https://www.landcruiserclub.net/custom/redir.php?pid=22&url=https://onlinecasino888.us.org  http://www.shakokac.com.hk/__media__/js/trademark.php?d=onlinecasino888.us.org   https://www.shop9val.ru/bitrix/rk.php?id=1&site_id=s1&event1=banner&event2=click&goto=onlinecasino888.us.org  https://centralpanasonic.com.mx/bitrix/rk.php?id=24&event1=banner&event2=click&event3=1+%2F+%5B24%5D+%5B670x120%5D+App+Blu-ray&goto=https://onlinecasino888.us.org  http://www.onlinecity.cn/tools/alexa/Index.asp?url=onlinecasino888.us.org   http://www.nh.lovenet.cn/ienumber.php?action=assign&h=www.nh.lovenet.cn&r=http%3A%2F%2Fwww.nh.lovenet.cn%2Flovenet.php%3FPHPSESSID%3Dv59tt4m2t95pemqhfgpa4823t7%26did%3Dhow_to_receive_more_love_letters&u=https://onlinecasino888.us.org \nhttp://pimpremium.com/lang.aspx?id_lang=2&url=https://onlinecasino888.us.org  http://www.farleighcandoverandwield.org.uk/goto-link.php?link_id=15&url=https://onlinecasino888.us.org   https://vkne.ru/away.php?to=https://onlinecasino888.us.org   http://www.croatiaguidebook.info/modules/babel/redirect.php?newlang=en_US&newurl=https://onlinecasino888.us.org  http://spinebraces.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.ptsecurity.com/bitrix/rk.php?id=35&site_id=p9&event1=banner&event2=click&event3=6+%2F+%5B35%5D+%5BSQ_SLIDER%5D+USP_AI_EN_4&goto=onlinecasino888.us.org  https://zhytomyr.bestrest.com.ua/go.php?url=https://onlinecasino888.us.org  http://academysportsandoutdoorsclearance.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://americanhotelhomestore.de/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://noodlesexpress.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.highfrequency.co.nz/ra.asp?url=https://onlinecasino888.us.org   http://hoshodaiko.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://system724.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://win.coolclub.it/redirect.asp?id=167&url=https://onlinecasino888.us.org   http://www.portaldajosepaulino.com.br/redirect.asp?cod_cliente=2384&link=https://onlinecasino888.us.org  http://pornshoppingnetwork.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://bkk.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://artslaw.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttps://jerry-coleby-williams.net/2018/04/26/market-gardening-vietnam/\nhttp://w.videogame-reviews.net/viewtopic.php?f=10&t=45571708\nhttp://royalmotorscrew.com/viewtopic.php?f=2&t=748\nhttp://www.jjhservers.com/phpbb/viewtopic.php?f=6&t=2316&p=4377#p4377\nhttp://humbit.com/forums/viewtopic.php?f=1&t=789566\n", "language": "Lisp", "metadata": {"date": 1546444944, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s890536092.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s890536092", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://thehealingstudio.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://coronapointe.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://harkinsmoviemonkey.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://greenrobot-apps.net/go/?https://onlinecasino888.us.org  http://www.gunstoreusa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://petzetakisafrica.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.strahlentherapie-online.com/thread.php?goto=onlinecasino888.us.org  http://www.probiogenic.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://innocentvagina.com/cgi-bin/out.cgi?id=63&l=top&t=100t&u=https://onlinecasino888.us.org \nhttp://www.hornyteenstube.com/cgi-bin/a2/out.cgi?id=100&l=toplist&u=https://onlinecasino888.us.org  http://tetron.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://stopcyberbullying.org.uk/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.gsfserver.smffy.com/index.php?thememode=full;redirect=https://onlinecasino888.us.org  http://protectthecreation.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://wilderinalaska.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.solutionsrealtynow.com/searchpoint/redir.asp?reg_id=ptypes&sname=/searchpoint/search.asp&lid=1&sponsor=lea&url=https://onlinecasino888.us.org  http://crystaldynamix.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mashintop.ru/redirect.php?url=https://onlinecasino888.us.org \nhttp://panerabreadco.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.stannswarrington.org.uk/goto-link.php?link_id=11&url=https://onlinecasino888.us.org   http://www.manzano-associates.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://thaidetectives.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://cashsouthern.com/go.php?url=https://onlinecasino888.us.org   http://cindyscleaningtx.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://lunarglobal.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mediastride.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://7dsearch.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://insider.ru/info.php?a<>=<a href=https://onlinecasino888.us.org panels and battery storage<%  http://mothersexypornvideo.com/cgi-bin/crtr/out.cgi?id=1879&l=topmain&u=https://onlinecasino888.us.org   http://asadjafari.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://cuties4kids.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.surfcity.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.herbcn.com/wp-content/themes/begin/inc/go.php?url=https://onlinecasino888.us.org  http://getthefactsokc.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://pascetta.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://rotobrush.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://oysterstreetstudio.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://rushko.ru/out.php?url=https://onlinecasino888.us.org/   http://seniormiles.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://retothek.checkit.ch/Reto/ct.ashx?id=80155b15-4559-4fa8-ac57-839b08fba421&url=https://onlinecasino888.us.org/  http://www.studyireland.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://jowz.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://linkchain.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mjpetersonmarketing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.myregister.gr/el/redirect/?url=https://onlinecasino888.us.org \nhttp://fins.actwin.com/g.php?t=Algone&u=https://onlinecasino888.us.org  http://www.avls.pt/admin/Portal/LinkClick.aspx?tabid=478&table=Links&field=ItemID&id=991&link=https://onlinecasino888.us.org   http://switchyardproductions.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://youpug.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://roseislandrental.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://farahfamilyonline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.wichita.edu/thisis/mobilecheck/breakmobile.asp?https://onlinecasino888.us.org  http://www.itftennis.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://newmutualistmap.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://xocal.com/__media__/js/netsoltrademark.php?d=&http://animation3d.in/pythontraining.net/component/k2/item/4-enim-ac-eleifend-ultricesonlinecasino888.us.org  http://trc.taboolasyndication.com/washpost/log/2/click?pi=http://www.washingtonpost.com/lifestyle/style/art-and-politics-meet-in-collection-of-labor-images/2011/09/07/giqasxgqdk_story.html&sd=v1_a6c0075003c63af6915df98f2bc41e7e_3b2b9b2c-7a4e-498b-9562-cf23fee82879_1315857588_1315857588&ui=3b2b9b2c-7a4e-498b-9562-cf23fee82879&it=video&ii=7094938879832470976&pt=text&li=rbox-t2v&url=https://onlinecasino888.us.org   https://qmobi.agency/blog/go.php?url=https://onlinecasino888.us.org   http://hdporn1.com/cgi-bin/hdp.cgi?c=1&s=70&hdp=1&u=https://onlinecasino888.us.org  https://animations-enfants-hardelot.fr/Statistiques/CountStat.php?url=https://onlinecasino888.us.org   http://granitebayassets.com/New/granitebayassets/vlink.asp?url=https://onlinecasino888.us.org/  http://www.studying.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.kultboy.com/go.php?https://onlinecasino888.us.org   http://e-buildmaterials.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://alticeamerica.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://carerecruituk.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.catpoweredtrucks.com/forms/specsheet/emailfriend.aspx?subject=2005%20BLUE%20BIRD%20BB&url=https://onlinecasino888.us.org   https://www.landcruiserclub.net/custom/redir.php?pid=22&url=https://onlinecasino888.us.org  http://www.shakokac.com.hk/__media__/js/trademark.php?d=onlinecasino888.us.org   https://www.shop9val.ru/bitrix/rk.php?id=1&site_id=s1&event1=banner&event2=click&goto=onlinecasino888.us.org  https://centralpanasonic.com.mx/bitrix/rk.php?id=24&event1=banner&event2=click&event3=1+%2F+%5B24%5D+%5B670x120%5D+App+Blu-ray&goto=https://onlinecasino888.us.org  http://www.onlinecity.cn/tools/alexa/Index.asp?url=onlinecasino888.us.org   http://www.nh.lovenet.cn/ienumber.php?action=assign&h=www.nh.lovenet.cn&r=http%3A%2F%2Fwww.nh.lovenet.cn%2Flovenet.php%3FPHPSESSID%3Dv59tt4m2t95pemqhfgpa4823t7%26did%3Dhow_to_receive_more_love_letters&u=https://onlinecasino888.us.org \nhttp://pimpremium.com/lang.aspx?id_lang=2&url=https://onlinecasino888.us.org  http://www.farleighcandoverandwield.org.uk/goto-link.php?link_id=15&url=https://onlinecasino888.us.org   https://vkne.ru/away.php?to=https://onlinecasino888.us.org   http://www.croatiaguidebook.info/modules/babel/redirect.php?newlang=en_US&newurl=https://onlinecasino888.us.org  http://spinebraces.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.ptsecurity.com/bitrix/rk.php?id=35&site_id=p9&event1=banner&event2=click&event3=6+%2F+%5B35%5D+%5BSQ_SLIDER%5D+USP_AI_EN_4&goto=onlinecasino888.us.org  https://zhytomyr.bestrest.com.ua/go.php?url=https://onlinecasino888.us.org  http://academysportsandoutdoorsclearance.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://americanhotelhomestore.de/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://noodlesexpress.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.highfrequency.co.nz/ra.asp?url=https://onlinecasino888.us.org   http://hoshodaiko.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://system724.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://win.coolclub.it/redirect.asp?id=167&url=https://onlinecasino888.us.org   http://www.portaldajosepaulino.com.br/redirect.asp?cod_cliente=2384&link=https://onlinecasino888.us.org  http://pornshoppingnetwork.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://bkk.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://artslaw.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttps://jerry-coleby-williams.net/2018/04/26/market-gardening-vietnam/\nhttp://w.videogame-reviews.net/viewtopic.php?f=10&t=45571708\nhttp://royalmotorscrew.com/viewtopic.php?f=2&t=748\nhttp://www.jjhservers.com/phpbb/viewtopic.php?f=6&t=2316&p=4377#p4377\nhttp://humbit.com/forums/viewtopic.php?f=1&t=789566\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8894, "cpu_time_ms": 99, "memory_kb": 9572}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s350805815", "group_id": "codeNet:p03941", "input_text": "http://weareamericans.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://southkoreanlaw.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sebafoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://hotmaturemoms.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.bridgesmhce.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://clarerose.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://uch.zncai.com/link.php?url=https://onlinecasino888.us.org  http://sunshineservices.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bahaullah.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://oktirestoresinc.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://askent.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org   http://kostroma-is.ru/go.php?url=https://onlinecasino888.us.org   http://silicone-tubing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://lajollahalfmarathon.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://maureen-duffy.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.0351lv.com/uchome/link.php?url=https://onlinecasino888.us.org  http://www.warnerdisplays.co.nz/ra.asp?url=https://onlinecasino888.us.org   http://v2cigs.filmateleven.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.jwarm.net/bin/jcounter/urlupd.php?cid=1274&nengo=201050&ingo=inpc&url=https://onlinecasino888.us.org  http://www.eas-racing.se/gbook/go.php?url=https://onlinecasino888.us.org   https://tracker2.ad5track.com/tracker/click?i=58bec957eec3dfb1f81e3d8b&o=58bdd34beec3dfb1f8d4f31d&redirect_url=https://onlinecasino888.us.org   http://bromancexxx.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.thefathershouselondon.org/goto-link.php?link_id=12&url=https://onlinecasino888.us.org   http://fs5.m3construction.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.ekbouwadvies.nl/links/redir.asp?link=onlinecasino888.us.org  http://ecards.sharedbook.com/redirectBanner.php?bannerID=7&url=https://onlinecasino888.us.org/   https://www.osczone.com/go.php?url=https://onlinecasino888.us.org \nhttp://www.autolider.info/go.php?block=15&n=1&url=https://onlinecasino888.us.org  http://deseretcontent.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.sadhouse.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sheiladonohue.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://magiccream1.net/index.php?option=com_easybookreloaded&view=easybookreloaded&Itemid=21&fromurl=onlinecasino888.us.org   http://www.loonyart.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://thecouponwarehouse.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://magellanbiosciences.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.spb-expo.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org/ \nhttp://www.f-matic.jp/feed/feed2js.php?src=https://onlinecasino888.us.org  http://www.competitive-exam.in/Go/?url=https://onlinecasino888.us.org   http://www.epweike.com/index.php?do=redirect&epi=980&goto=https://onlinecasino888.us.org   http://www.guttertunnel.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://danratheronline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.melonbooks.com/index.php?main_page=affi_go&affi_url=https://onlinecasino888.us.org/&affi_id=kou_kou  https://www.aamft.org/imis15/aamft/login/?url=https://onlinecasino888.us.org  http://www.northsuburbanflowers.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://animesubthai.com/link.php?url=https://onlinecasino888.us.org \nhttp://luo.atumedico.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://you-pw.3dn.ru/go?https://onlinecasino888.us.org   http://r857.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://hamyaronline.ir/dailylink/?go=https://onlinecasino888.us.org  http://windhambaseball.org/Goto.asp?url=https://onlinecasino888.us.org   http://unfcu.mobi/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://contangofund.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.ward6education.com/r?u=https://onlinecasino888.us.org   http://mail.baptist.sk/horde/util/go.php?url=https://onlinecasino888.us.org \nhttp://pmu.nodarksuits.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.resultmanagement.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://forums.stickpage.com/showthread.php?10065-My-first-flash-(-go-easy-on-this-)&goto=onlinecasino888.us.org   http://cobytaiwan.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.nhotel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.forum.feng-shui.ru/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fvk.com%2Fid21252705&event3=%D0%93%D0%B0%D0%BB%D0%B8%D0%BD%D0%B0+%D0%9E%D1%81%D0%B5%D1%86%D0%BA%D0%B0%D1%8F&goto=https://onlinecasino888.us.org  http://pbremedy.com/__media__/js/trademark.php?d=onlinecasino888.us.org  http://doski-club.ru/redirect/?go=https://onlinecasino888.us.org   http://www.wazzzup.nl/out.php?q=fraude+huurtoeslag+bulgaren&pos=4&location=https://onlinecasino888.us.org \nhttp://www.santamonicanext.org/wp-content/themes/planer/go.php?https://onlinecasino888.us.org  http://themunoz-group.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.demeester-consultants.be/over-ons/item/39-luc-de-meester?fromurl=onlinecasino888.us.org   http://nritrophy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://estrotech.thefeel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://armorfloorepoxy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://liveforak.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://educationijuan.createaforum.com/index.php?thememode=full;redirect=https://onlinecasino888.us.org   http://blogs.rrs.co.uk/revella/ct.ashx?url=https://onlinecasino888.us.org \nhttp://www.tourgear.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tzq.backinthesaddle.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://academickarma.org/oauth?goto=onlinecasino888.us.org   http://www.tahoejoesteakhouses.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://warszawa.pasazbiznesu.pl/public/redir.php?url=https://onlinecasino888.us.org   http://bj.nekahome.com/index.php?g=Appoint&c=Changecity&a=go&city=sh&referer=https://onlinecasino888.us.org  http://www.tightclothesboard.com/cgi-bin/atc/out.cgi?id=32&l=top20&u=https://onlinecasino888.us.org  https://www.freearenas.com/sponsors/link.php?ad_id=1574235&advertiser_id=1592635&ad_type_id=7&ad_name=&activity_ids=156&img_filename=paid-arena.jpg&url=https://onlinecasino888.us.org   http://fastobjects.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://cuprobrazealliance.cn/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.videolan.org/vlc/download-skins2-go.php?url=onlinecasino888.us.org   http://connecticutcolocation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://omgplzstfu.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://matelas.nonore.com/go.php?url=https://onlinecasino888.us.org   http://link.coolpage.biz/go.php?url=https://onlinecasino888.us.org  http://easkthree.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://supremecourtohio.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://northborobaseball.org/Goto.asp?url=https://onlinecasino888.us.org \n \n \n \n \n \nhttp://forum.tompool.org/viewtopic.php?f=2&t=47009\nhttps://gogcel-ro.net/forum/index.php?topic=207.new#new\nhttp://anasozu.com/2019-cu-yillan-kutleeriz/#comment-779\nhttps://www.lecoindealex.fr/Forum/viewtopic.php?f=4&t=19211\nhttp://avico.pl/forum/showthread.php?tid=12509\n", "language": "Lisp", "metadata": {"date": 1546434772, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s350805815.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s350805815", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://weareamericans.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://southkoreanlaw.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sebafoundation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://hotmaturemoms.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.bridgesmhce.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://clarerose.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://uch.zncai.com/link.php?url=https://onlinecasino888.us.org  http://sunshineservices.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bahaullah.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://oktirestoresinc.co/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://askent.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org   http://kostroma-is.ru/go.php?url=https://onlinecasino888.us.org   http://silicone-tubing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://lajollahalfmarathon.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://maureen-duffy.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.0351lv.com/uchome/link.php?url=https://onlinecasino888.us.org  http://www.warnerdisplays.co.nz/ra.asp?url=https://onlinecasino888.us.org   http://v2cigs.filmateleven.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.jwarm.net/bin/jcounter/urlupd.php?cid=1274&nengo=201050&ingo=inpc&url=https://onlinecasino888.us.org  http://www.eas-racing.se/gbook/go.php?url=https://onlinecasino888.us.org   https://tracker2.ad5track.com/tracker/click?i=58bec957eec3dfb1f81e3d8b&o=58bdd34beec3dfb1f8d4f31d&redirect_url=https://onlinecasino888.us.org   http://bromancexxx.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.thefathershouselondon.org/goto-link.php?link_id=12&url=https://onlinecasino888.us.org   http://fs5.m3construction.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.ekbouwadvies.nl/links/redir.asp?link=onlinecasino888.us.org  http://ecards.sharedbook.com/redirectBanner.php?bannerID=7&url=https://onlinecasino888.us.org/   https://www.osczone.com/go.php?url=https://onlinecasino888.us.org \nhttp://www.autolider.info/go.php?block=15&n=1&url=https://onlinecasino888.us.org  http://deseretcontent.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.sadhouse.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sheiladonohue.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://magiccream1.net/index.php?option=com_easybookreloaded&view=easybookreloaded&Itemid=21&fromurl=onlinecasino888.us.org   http://www.loonyart.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://thecouponwarehouse.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://magellanbiosciences.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.spb-expo.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org/ \nhttp://www.f-matic.jp/feed/feed2js.php?src=https://onlinecasino888.us.org  http://www.competitive-exam.in/Go/?url=https://onlinecasino888.us.org   http://www.epweike.com/index.php?do=redirect&epi=980&goto=https://onlinecasino888.us.org   http://www.guttertunnel.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://danratheronline.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.melonbooks.com/index.php?main_page=affi_go&affi_url=https://onlinecasino888.us.org/&affi_id=kou_kou  https://www.aamft.org/imis15/aamft/login/?url=https://onlinecasino888.us.org  http://www.northsuburbanflowers.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://animesubthai.com/link.php?url=https://onlinecasino888.us.org \nhttp://luo.atumedico.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://you-pw.3dn.ru/go?https://onlinecasino888.us.org   http://r857.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://hamyaronline.ir/dailylink/?go=https://onlinecasino888.us.org  http://windhambaseball.org/Goto.asp?url=https://onlinecasino888.us.org   http://unfcu.mobi/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://contangofund.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.ward6education.com/r?u=https://onlinecasino888.us.org   http://mail.baptist.sk/horde/util/go.php?url=https://onlinecasino888.us.org \nhttp://pmu.nodarksuits.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.resultmanagement.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://forums.stickpage.com/showthread.php?10065-My-first-flash-(-go-easy-on-this-)&goto=onlinecasino888.us.org   http://cobytaiwan.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.nhotel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.forum.feng-shui.ru/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fvk.com%2Fid21252705&event3=%D0%93%D0%B0%D0%BB%D0%B8%D0%BD%D0%B0+%D0%9E%D1%81%D0%B5%D1%86%D0%BA%D0%B0%D1%8F&goto=https://onlinecasino888.us.org  http://pbremedy.com/__media__/js/trademark.php?d=onlinecasino888.us.org  http://doski-club.ru/redirect/?go=https://onlinecasino888.us.org   http://www.wazzzup.nl/out.php?q=fraude+huurtoeslag+bulgaren&pos=4&location=https://onlinecasino888.us.org \nhttp://www.santamonicanext.org/wp-content/themes/planer/go.php?https://onlinecasino888.us.org  http://themunoz-group.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.demeester-consultants.be/over-ons/item/39-luc-de-meester?fromurl=onlinecasino888.us.org   http://nritrophy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://estrotech.thefeel.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://armorfloorepoxy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://liveforak.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://educationijuan.createaforum.com/index.php?thememode=full;redirect=https://onlinecasino888.us.org   http://blogs.rrs.co.uk/revella/ct.ashx?url=https://onlinecasino888.us.org \nhttp://www.tourgear.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tzq.backinthesaddle.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://academickarma.org/oauth?goto=onlinecasino888.us.org   http://www.tahoejoesteakhouses.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://warszawa.pasazbiznesu.pl/public/redir.php?url=https://onlinecasino888.us.org   http://bj.nekahome.com/index.php?g=Appoint&c=Changecity&a=go&city=sh&referer=https://onlinecasino888.us.org  http://www.tightclothesboard.com/cgi-bin/atc/out.cgi?id=32&l=top20&u=https://onlinecasino888.us.org  https://www.freearenas.com/sponsors/link.php?ad_id=1574235&advertiser_id=1592635&ad_type_id=7&ad_name=&activity_ids=156&img_filename=paid-arena.jpg&url=https://onlinecasino888.us.org   http://fastobjects.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://cuprobrazealliance.cn/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.videolan.org/vlc/download-skins2-go.php?url=onlinecasino888.us.org   http://connecticutcolocation.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://omgplzstfu.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://matelas.nonore.com/go.php?url=https://onlinecasino888.us.org   http://link.coolpage.biz/go.php?url=https://onlinecasino888.us.org  http://easkthree.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://supremecourtohio.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://northborobaseball.org/Goto.asp?url=https://onlinecasino888.us.org \n \n \n \n \n \nhttp://forum.tompool.org/viewtopic.php?f=2&t=47009\nhttps://gogcel-ro.net/forum/index.php?topic=207.new#new\nhttp://anasozu.com/2019-cu-yillan-kutleeriz/#comment-779\nhttps://www.lecoindealex.fr/Forum/viewtopic.php?f=4&t=19211\nhttp://avico.pl/forum/showthread.php?tid=12509\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8162, "cpu_time_ms": 10, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s002145895", "group_id": "codeNet:p03941", "input_text": "http://go.cmsystem.ir/index.php?url=https://onlinecasino888.us.org  http://issuesandwhatnot.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.kupirebenku.ru/bitrix/rk.php?id=119&event1=banner&event2=click&event3=1+%2F+%5B119%5D+%5Bmain_carusel%5D+%CB%E5%E4%E8+%C1%E0%E3+&goto=https://onlinecasino888.us.org   https://www.gopoyou.com/ajax/click.php?url=https://onlinecasino888.us.org  https://sbm.springbranchisd.com/LinkClick.aspx?link=https://onlinecasino888.us.org   http://www.konjf.cf/cgi-bin/a2/out.cgi?id=300&l=toplist&u=https://onlinecasino888.us.org  http://atlantisrsps.smfnew2.com/index.php?thememode=full;redirect=https://onlinecasino888.us.org  http://netgearprosafe.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sitrickandcompanyinc.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://eslgarage.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://gracepayment.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://geochemresearch.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://yodaweb.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.federcomated.it/redirect.asp?link=https://onlinecasino888.us.org   http://norcoautomotive.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://towerhealth.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://desclock.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://eceaa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://ginlime.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://amarishomes.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://circleoffaith.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mqj.shellusa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sonofdave.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://autohgregorythecarsuperstore.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nyhealth.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://banery.media.com.pl/goto-125.php?url=https://onlinecasino888.us.org   http://ushispanicfund.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.rustrahovka.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org  http://jasongriffin.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://forum.noamweb.com/viewthread.php?goto=onlinecasino888.us.org   http://proteined.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://dev.index63.ru/redirect.php?redirect=https://onlinecasino888.us.org   http://www.polywater.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://333322.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://questforvictory.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.lacasting.com/frontend/ADVERTISING/ASP/adclick.asp?key=1068&url=https://onlinecasino888.us.org/ \nhttp://brucekayebraintumorfoundation.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tulahfuchs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://missysteve.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.facultyadvisers.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.poetrysoup.com/redirect.aspx?ID=23&url=https://onlinecasino888.us.org   http://rbv.nonstop-webs.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nashvilleitjobs.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.hespress.com/opinions/index.137.html?zoneid=6&amp;cb=15981353144&amp;charset=UTF-8&amp;loc=http%3A/www.hespress.com/opinions/index.137.html&amp;referer=https://onlinecasino888.us.org   http://gaschoolshop.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://kirklandarts.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://blood-bowl.nl/postlist.php?eol_ref=https://onlinecasino888.us.org/   http://officialtravel.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://fdamustbanmenthol.tv/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://axadistributors.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://carmelvalleyinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://wow.mine.sk/chat/redir.php?url=https://onlinecasino888.us.org  http://tv-sat.at.ua/go?https://onlinecasino888.us.org   http://podnajmy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://ubaafricard.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://103.35.173.171/bbs/redirect.php?fid=143&tid=3942875&goto=onlinecasino888.us.org   http://www.tokyo-underground.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.pondofhappiness.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mypinchin.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://fejda.se/index.php?q=https://onlinecasino888.us.org  http://immerseyourself.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sfgov3.org/redirect.aspx?url=https://onlinecasinolime..com   http://nsz.urbandermatology.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://ccmpcapital.tc/__media__/js/trademark.php?d=onlinecasino888.us.org  http://www.roundstrading.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://moneypal.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.bebesymas.com/redirect?url=https://onlinecasino888.us.org  http://froggg.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ovg.7billion.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://fusne.com/go.php?link=https://onlinecasino888.us.org  http://www.irisinspection.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://crumandfosterinsurance.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://backrack.eu/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.loopme.ph/redirect/c?url=https://onlinecasino888.us.org   http://blackboardintl.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://anti-lineage2.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.otaracatholic.org.nz/LinkClick.aspx?link=https://onlinecasino888.us.org   http://100wiz.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tubeporr.org/ept/out.php?f=1&pct=40&url=https://onlinecasino888.us.org  http://montanterealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://applebeesmysteryvalue.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://veryvy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://northtexturb.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.intellika.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://jennifersultan.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://herzogmotorsports.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://stereology.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.aisouhao.com/url.php?url=https://onlinecasino888.us.org  http://uminewton.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.cbmmortgage.com/modules/mod_jw_srfr/redir.php?url=https://onlinecasino888.us.org \n \n \n \n \n \nhttps://jerry-coleby-williams.net/2018/04/26/market-gardening-vietnam/\nhttp://school9m.org.ru/node/1#comment-99344\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttp://www.dexteracademy.in/blog/dexteracademy/military-engineer-services-recruitment-2015-2658-mate-cmd-peon-other-posts/#comment-8119\nhttp://www.holandia.igns.pl/forum/showthread.php?tid=4663\n", "language": "Lisp", "metadata": {"date": 1546425297, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s002145895.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s002145895", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://go.cmsystem.ir/index.php?url=https://onlinecasino888.us.org  http://issuesandwhatnot.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.kupirebenku.ru/bitrix/rk.php?id=119&event1=banner&event2=click&event3=1+%2F+%5B119%5D+%5Bmain_carusel%5D+%CB%E5%E4%E8+%C1%E0%E3+&goto=https://onlinecasino888.us.org   https://www.gopoyou.com/ajax/click.php?url=https://onlinecasino888.us.org  https://sbm.springbranchisd.com/LinkClick.aspx?link=https://onlinecasino888.us.org   http://www.konjf.cf/cgi-bin/a2/out.cgi?id=300&l=toplist&u=https://onlinecasino888.us.org  http://atlantisrsps.smfnew2.com/index.php?thememode=full;redirect=https://onlinecasino888.us.org  http://netgearprosafe.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://sitrickandcompanyinc.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://eslgarage.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://gracepayment.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://geochemresearch.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://yodaweb.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.federcomated.it/redirect.asp?link=https://onlinecasino888.us.org   http://norcoautomotive.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://towerhealth.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://desclock.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://eceaa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://ginlime.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://amarishomes.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://circleoffaith.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://mqj.shellusa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sonofdave.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://autohgregorythecarsuperstore.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nyhealth.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://banery.media.com.pl/goto-125.php?url=https://onlinecasino888.us.org   http://ushispanicfund.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.rustrahovka.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org  http://jasongriffin.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://forum.noamweb.com/viewthread.php?goto=onlinecasino888.us.org   http://proteined.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://dev.index63.ru/redirect.php?redirect=https://onlinecasino888.us.org   http://www.polywater.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://333322.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://questforvictory.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.lacasting.com/frontend/ADVERTISING/ASP/adclick.asp?key=1068&url=https://onlinecasino888.us.org/ \nhttp://brucekayebraintumorfoundation.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tulahfuchs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://missysteve.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.facultyadvisers.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.poetrysoup.com/redirect.aspx?ID=23&url=https://onlinecasino888.us.org   http://rbv.nonstop-webs.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://nashvilleitjobs.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.hespress.com/opinions/index.137.html?zoneid=6&amp;cb=15981353144&amp;charset=UTF-8&amp;loc=http%3A/www.hespress.com/opinions/index.137.html&amp;referer=https://onlinecasino888.us.org   http://gaschoolshop.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://kirklandarts.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://blood-bowl.nl/postlist.php?eol_ref=https://onlinecasino888.us.org/   http://officialtravel.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://fdamustbanmenthol.tv/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://axadistributors.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://carmelvalleyinfo.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://wow.mine.sk/chat/redir.php?url=https://onlinecasino888.us.org  http://tv-sat.at.ua/go?https://onlinecasino888.us.org   http://podnajmy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://ubaafricard.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://103.35.173.171/bbs/redirect.php?fid=143&tid=3942875&goto=onlinecasino888.us.org   http://www.tokyo-underground.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.pondofhappiness.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mypinchin.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://fejda.se/index.php?q=https://onlinecasino888.us.org  http://immerseyourself.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sfgov3.org/redirect.aspx?url=https://onlinecasinolime..com   http://nsz.urbandermatology.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://ccmpcapital.tc/__media__/js/trademark.php?d=onlinecasino888.us.org  http://www.roundstrading.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://moneypal.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.bebesymas.com/redirect?url=https://onlinecasino888.us.org  http://froggg.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ovg.7billion.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://fusne.com/go.php?link=https://onlinecasino888.us.org  http://www.irisinspection.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://crumandfosterinsurance.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://backrack.eu/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.loopme.ph/redirect/c?url=https://onlinecasino888.us.org   http://blackboardintl.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://anti-lineage2.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.otaracatholic.org.nz/LinkClick.aspx?link=https://onlinecasino888.us.org   http://100wiz.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tubeporr.org/ept/out.php?f=1&pct=40&url=https://onlinecasino888.us.org  http://montanterealestate.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://applebeesmysteryvalue.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://veryvy.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://northtexturb.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.intellika.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://jennifersultan.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://herzogmotorsports.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://stereology.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.aisouhao.com/url.php?url=https://onlinecasino888.us.org  http://uminewton.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.cbmmortgage.com/modules/mod_jw_srfr/redir.php?url=https://onlinecasino888.us.org \n \n \n \n \n \nhttps://jerry-coleby-williams.net/2018/04/26/market-gardening-vietnam/\nhttp://school9m.org.ru/node/1#comment-99344\nhttps://ovaismehboob.com/2011/09/12/linkedin-authentication-in-asp-net/\nhttp://www.dexteracademy.in/blog/dexteracademy/military-engineer-services-recruitment-2015-2658-mate-cmd-peon-other-posts/#comment-8119\nhttp://www.holandia.igns.pl/forum/showthread.php?tid=4663\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8023, "cpu_time_ms": 23, "memory_kb": 4196}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s258425272", "group_id": "codeNet:p03941", "input_text": "http://wbkocw.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://onestopgold.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://local3agent.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://aluminumbronze.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://gaytravel.tw/redirect?type=store&url=https://onlinecasino888.us.org   http://dtrotator.com/demo/link.php?link=pictures&id=616c2c&gr=1&url=https://onlinecasino888.us.org  http://parelavih.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.annasfunhouse.jacate.com/cgi-bin/autorank/out.cgi?id=mandymon&url=https://onlinecasino888.us.org   http://allaboutsharing.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.smallbizsaturday.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://nehabisht.unet.com/go?https://onlinecasino888.us.org   http://portablepowerpacks.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.scitation.org/action/redirect?doi=10.1118%2F1.4766437&url=https://onlinecasino888.us.org  http://aozora.us/go.php?https://onlinecasino888.us.org   http://www.glastonburylacrosse.org/__media__/js/trademark.php?d=onlinecasino888.us.org  http://kruti.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://axapremier.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://gpf.pittsburghpenguins.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.hivaids.gr/goto.php?loc=https://onlinecasino888.us.org  https://www.gensqueeze.ca/r?u=https://onlinecasino888.us.org   http://hp8.financetemp.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://oshcity.kg.xx3.kz/go.php?url=https://onlinecasino888.us.org  http://conquerorcards.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://csdecatur.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://714dip.com/goto.asp?url=https://onlinecasino888.us.org  https://www.binnenlandsbestuur.nl/cookies-accepteren.9508784.lynkx?redirect=https://onlinecasino888.us.org   http://mynhats.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.russian-luxus.de/counter/go.php?https://onlinecasino888.us.org  http://www.semipv.com/ads/adsclick.action?aid=4f44493d&redirect=https://onlinecasino888.us.org   http://fitterusa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://thewildcenter.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://dearestfutureself.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://hotelstop.ru/counter.php?url=https://onlinecasino888.us.org  http://sdaigraphics.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://captrustadvicedesk.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ebw-e.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://rockfordmutual.com/farmmutual/outhead.asp?url=onlinecasino888.us.org  http://escueladelaconstruccion.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://twcruisesearch.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.expertweb.equinefoundation.ca/include/links.php?go=https://onlinecasino888.us.org  http://clickgazzaquote.gazzetta.it/BoxRedirect.shtml?IDGQEVENTO=94540&TIPOCLICK=0&url=https://onlinecasino888.us.org   http://classicx.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://b-bcatalogs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.epr.gr/ads/adclick.php?bannerid=1&zoneid=0&source=&dest=https://onlinecasino888.us.org   http://hbconline.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://artvillians.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://pnh.scanbrasil.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://marksfridayfunnies.com/link.asp?LINK=https://onlinecasino888.us.org   http://thedonoreggexperts.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://cuteteenie.com/cgi-bin/out.cgi?id=133&l=top_top&req=1&t=100t&u=https://onlinecasino888.us.org   http://sci.ci123.com/site/link.php?url=https://onlinecasino888.us.org  http://jonbrady.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.birstall.org/goto-link.php?link_id=16&url=https://onlinecasino888.us.org   http://upfall.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.raftkorn.net/url.php?url=https://onlinecasino888.us.org  http://alsm.kuaimaonline.com/index.php?g=Appoint&c=Changecity&a=go&city=yb&referer=https://onlinecasino888.us.org   http://kelseygere.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.opengeorgia.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://click.alamode.com/?adcode=CPEMAQM0913_1&url=https://onlinecasino888.us.org   http://bq--3btbgw3yp7ja.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://qtz.in/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.dy317.com/glp?r=http%3A%2F%2Fwww.dy317.com%2F%3Fm%3Dvod-play-id-3623-src-1-num-1.html&u=https://onlinecasino888.us.org   https://www.ummah.com/forum/forum/family-lifestyle-community-culture/islamic-lifestyle-social-issues/414841-martial-arts-and-mma-thread?goto=onlinecasino888.us.org \nhttp://spinecenters.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://theartofactivenetworking.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://tubebd24.com/goto.php?url=https://onlinecasino888.us.org   http://flapship.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://apmoma.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://tsasw.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://thehealthtime.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ads.flashreport.org/blog/go.php?url=https://onlinecasino888.us.org   http://www.mixmag.ro/goto.php?url=https://onlinecasino888.us.org \nhttps://jerseyporkroll.com/gbook/gbook/go.php?url=https://onlinecasino888.us.org  http://refrigeratedcontainer.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.greekcoinsforum.com/index.php?thememode=full;redirect=https://onlinecasino888.us.org   http://dambreak.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.akcomputing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.infarms.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://frederickwildman.com/login/required?goto=https://onlinecasino888.us.org  http://accordrostov.ru/go/url=https://onlinecasino888.us.org   http://fleetmaticsreveal.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttps://bbbsirving.ejoinme.org/LinkClick.aspx?link=https://onlinecasino888.us.org  http://drc.mims.com/LinkClick.aspx?link=https://onlinecasino888.us.org   http://southpanthers.com/Goto.asp?url=https://onlinecasino888.us.org   http://www.gharjaisaloan.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://kayabellelaw.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://strosalieschool.org/__media__/js/trademark.php?d=onlinecasino888.us.org  http://unbridledholdings.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://profsouz-tv.ru/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fwww.profsvyazy.ru%2Findex.php%2Fpress-room%2F%25D0%25BA%25D0%25BE%25D0%25BD%25D0%25BA%25D1%2583%25D1%2580%25D1%2581%25D1%258B%2F57-press-room%2F%25D0%25BA%25D0%25BE%25D0%25BD%25D0%25BA%25D1%2583%25D1%2580%25D1%2581%25D1%258B%2F480-%25D0%25BF%25D1%2580%25D0%25BE%25D1%2584%25D1%2581%25D0%25BE%25D1%258E%25D0%25B7-%25D0%25B2-%25D0%25B4%25D0%25B5%25D0%25B9%25D1%2581%25D1%2582%25D0%25B2%25D0%25B8%25D0%25B8&event3=%D0%98%D1%82%D0%BE%D0%B3%D0%B8+%D1%84%D0%BE%D1%82%D0%BE%D0%BA%D0%BE%D0%BD%D0%BA%D1%83%D1%80%D1%81%D0%B0+%C2%AB%D0%9F%D1%80%D0%BE%D1%84%D1%81%D0%BE%D1%8E%D0%B7+%D0%B2+%D0%B4%D0%B5%D0%B9%D1%81%D1%82%D0%B2%D0%B8%D0%B8%C2%BB&goto=https://onlinecasino888.us.org   http://www.streamrat.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://internetechmedia.com/forum/index.php?topic=14901.new#new\nhttp://diamondrpg.tk/forum/viewtopic.php?f=68&t=945&p=3325#p3325\nhttps://artsolo.pl/forum/viewtopic.php?pid=18433#p18433\nhttp://sgi-ci.net/forum3/index.php?topic=43.new#new\nhttp://chs.my/forum/viewtopic.php?f=4&t=8843&p=9719#p9719\n", "language": "Lisp", "metadata": {"date": 1546401675, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s258425272.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s258425272", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://wbkocw.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://onestopgold.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://local3agent.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://aluminumbronze.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://gaytravel.tw/redirect?type=store&url=https://onlinecasino888.us.org   http://dtrotator.com/demo/link.php?link=pictures&id=616c2c&gr=1&url=https://onlinecasino888.us.org  http://parelavih.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.annasfunhouse.jacate.com/cgi-bin/autorank/out.cgi?id=mandymon&url=https://onlinecasino888.us.org   http://allaboutsharing.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.smallbizsaturday.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://nehabisht.unet.com/go?https://onlinecasino888.us.org   http://portablepowerpacks.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.scitation.org/action/redirect?doi=10.1118%2F1.4766437&url=https://onlinecasino888.us.org  http://aozora.us/go.php?https://onlinecasino888.us.org   http://www.glastonburylacrosse.org/__media__/js/trademark.php?d=onlinecasino888.us.org  http://kruti.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://axapremier.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://gpf.pittsburghpenguins.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.hivaids.gr/goto.php?loc=https://onlinecasino888.us.org  https://www.gensqueeze.ca/r?u=https://onlinecasino888.us.org   http://hp8.financetemp.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://oshcity.kg.xx3.kz/go.php?url=https://onlinecasino888.us.org  http://conquerorcards.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://csdecatur.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://714dip.com/goto.asp?url=https://onlinecasino888.us.org  https://www.binnenlandsbestuur.nl/cookies-accepteren.9508784.lynkx?redirect=https://onlinecasino888.us.org   http://mynhats.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.russian-luxus.de/counter/go.php?https://onlinecasino888.us.org  http://www.semipv.com/ads/adsclick.action?aid=4f44493d&redirect=https://onlinecasino888.us.org   http://fitterusa.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://thewildcenter.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://dearestfutureself.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://hotelstop.ru/counter.php?url=https://onlinecasino888.us.org  http://sdaigraphics.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://captrustadvicedesk.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://ebw-e.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://rockfordmutual.com/farmmutual/outhead.asp?url=onlinecasino888.us.org  http://escueladelaconstruccion.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://twcruisesearch.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.expertweb.equinefoundation.ca/include/links.php?go=https://onlinecasino888.us.org  http://clickgazzaquote.gazzetta.it/BoxRedirect.shtml?IDGQEVENTO=94540&TIPOCLICK=0&url=https://onlinecasino888.us.org   http://classicx.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://b-bcatalogs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.epr.gr/ads/adclick.php?bannerid=1&zoneid=0&source=&dest=https://onlinecasino888.us.org   http://hbconline.us/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://artvillians.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://pnh.scanbrasil.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://marksfridayfunnies.com/link.asp?LINK=https://onlinecasino888.us.org   http://thedonoreggexperts.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://cuteteenie.com/cgi-bin/out.cgi?id=133&l=top_top&req=1&t=100t&u=https://onlinecasino888.us.org   http://sci.ci123.com/site/link.php?url=https://onlinecasino888.us.org  http://jonbrady.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.birstall.org/goto-link.php?link_id=16&url=https://onlinecasino888.us.org   http://upfall.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.raftkorn.net/url.php?url=https://onlinecasino888.us.org  http://alsm.kuaimaonline.com/index.php?g=Appoint&c=Changecity&a=go&city=yb&referer=https://onlinecasino888.us.org   http://kelseygere.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.opengeorgia.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://click.alamode.com/?adcode=CPEMAQM0913_1&url=https://onlinecasino888.us.org   http://bq--3btbgw3yp7ja.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://qtz.in/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.dy317.com/glp?r=http%3A%2F%2Fwww.dy317.com%2F%3Fm%3Dvod-play-id-3623-src-1-num-1.html&u=https://onlinecasino888.us.org   https://www.ummah.com/forum/forum/family-lifestyle-community-culture/islamic-lifestyle-social-issues/414841-martial-arts-and-mma-thread?goto=onlinecasino888.us.org \nhttp://spinecenters.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://theartofactivenetworking.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://tubebd24.com/goto.php?url=https://onlinecasino888.us.org   http://flapship.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://apmoma.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://tsasw.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://thehealthtime.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ads.flashreport.org/blog/go.php?url=https://onlinecasino888.us.org   http://www.mixmag.ro/goto.php?url=https://onlinecasino888.us.org \nhttps://jerseyporkroll.com/gbook/gbook/go.php?url=https://onlinecasino888.us.org  http://refrigeratedcontainer.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.greekcoinsforum.com/index.php?thememode=full;redirect=https://onlinecasino888.us.org   http://dambreak.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.akcomputing.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.infarms.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://frederickwildman.com/login/required?goto=https://onlinecasino888.us.org  http://accordrostov.ru/go/url=https://onlinecasino888.us.org   http://fleetmaticsreveal.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttps://bbbsirving.ejoinme.org/LinkClick.aspx?link=https://onlinecasino888.us.org  http://drc.mims.com/LinkClick.aspx?link=https://onlinecasino888.us.org   http://southpanthers.com/Goto.asp?url=https://onlinecasino888.us.org   http://www.gharjaisaloan.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://kayabellelaw.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://strosalieschool.org/__media__/js/trademark.php?d=onlinecasino888.us.org  http://unbridledholdings.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://profsouz-tv.ru/bitrix/redirect.php?event1=news_out&event2=http%3A%2F%2Fwww.profsvyazy.ru%2Findex.php%2Fpress-room%2F%25D0%25BA%25D0%25BE%25D0%25BD%25D0%25BA%25D1%2583%25D1%2580%25D1%2581%25D1%258B%2F57-press-room%2F%25D0%25BA%25D0%25BE%25D0%25BD%25D0%25BA%25D1%2583%25D1%2580%25D1%2581%25D1%258B%2F480-%25D0%25BF%25D1%2580%25D0%25BE%25D1%2584%25D1%2581%25D0%25BE%25D1%258E%25D0%25B7-%25D0%25B2-%25D0%25B4%25D0%25B5%25D0%25B9%25D1%2581%25D1%2582%25D0%25B2%25D0%25B8%25D0%25B8&event3=%D0%98%D1%82%D0%BE%D0%B3%D0%B8+%D1%84%D0%BE%D1%82%D0%BE%D0%BA%D0%BE%D0%BD%D0%BA%D1%83%D1%80%D1%81%D0%B0+%C2%AB%D0%9F%D1%80%D0%BE%D1%84%D1%81%D0%BE%D1%8E%D0%B7+%D0%B2+%D0%B4%D0%B5%D0%B9%D1%81%D1%82%D0%B2%D0%B8%D0%B8%C2%BB&goto=https://onlinecasino888.us.org   http://www.streamrat.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://internetechmedia.com/forum/index.php?topic=14901.new#new\nhttp://diamondrpg.tk/forum/viewtopic.php?f=68&t=945&p=3325#p3325\nhttps://artsolo.pl/forum/viewtopic.php?pid=18433#p18433\nhttp://sgi-ci.net/forum3/index.php?topic=43.new#new\nhttp://chs.my/forum/viewtopic.php?f=4&t=8843&p=9719#p9719\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8582, "cpu_time_ms": 99, "memory_kb": 9448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s496799658", "group_id": "codeNet:p03941", "input_text": "http://hallmark-racing-marine.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sitkeven.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://katvin.com/?https://onlinecasino888.us.org   http://academyoutdoors.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ina.waptop.info/go.php?t=139586&link=onlinecasino888.us.org   http://d2-tech.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://umcpreaching.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://oab-rn.jusbrasil.com.br/noticias/1190334/artigo-o-quimerismo-genetico-e-suas-implicacoes-para-o-mundo-do-direito?referer=https://onlinecasino888.us.org   http://392966.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://silverado-lease.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.simpleadsales.com/serve/click.htm?z=23462&a=23377&url=https://onlinecasino888.us.org   http://wzw.planeandpilotmagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://d3642229.hosted409.agensxadmin.net/redir.php?url=https://onlinecasino888.us.org  http://hugrid.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.barhlettas.cf/redir.php?act=verkkokauppa_redir&id=6333&url=https://onlinecasino888.us.org  http://acepop.iloveweb.net/php_test.php?a<>=<a href=https://onlinecasino888.us.org memlihara ayam sabung</a>  http://www.thefamiliesweb.com/memorial/VW/Lists/Posts/ViewPost.aspx?ID=8&Source=https://onlinecasino888.us.org   http://onedominion.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://bonaventurecondos.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://montsutton.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://easyhypnobirthing.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://trans-resurs.ru/go/url=https://onlinecasino888.us.org  http://yacht-skipper.ru/go.php?https://onlinecasino888.us.org/   https://www.multipower.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org  http://roomandboardbusinessinteriors.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://michael-peterson.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.seekerific.com/tools/url-emailer.asp?url=https://onlinecasino888.us.org \nhttp://www.chooseaprodomme.com/cgi-bin/out.cgi?id=garden&url=https://onlinecasino888.us.org  https://members.satinsheetdreams.com/sessions/new.mobile?goto=https://onlinecasino888.us.org   http://www.sina.com.cn/midpage/mobile/index.d.html?docID=fyarrcc7326798&url=onlinecasino888.us.org   http://www.fachwissen-daten.de/berichte/goto/https://onlinecasino888.us.org  http://thatslivingthebrand.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.halarkin.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mwtuxonline.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://divorcelog.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://smartusa.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://emiratesfood.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.floridakeys.net/frame.cfm?linkurl=https://onlinecasino888.us.org/   http://rheemal.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://live.vvsbuyer.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.libdememails.co.uk/r?u=https://onlinecasino888.us.org   http://www.pnne.org/LinkClick.aspx?link=https://onlinecasino888.us.org  http://cattleconnection.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://cartographersguild.com/showthread.php?t=37427&goto=onlinecasino888.us.org   http://ozreport.com/redirect.php?https://onlinecasino888.us.org \nhttp://eduspend.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.polymers-ppi.com/lib/sys_check.php?referer=https://onlinecasino888.us.org   http://elobstertail.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://propanepros.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.halasz-garazs.wlap.hu/click.php?url=https://onlinecasino888.us.org   http://razpel.transformyourselfnow.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://steverothstein.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.mineimatorforums.com/index.php?app=core&module=system&controller=redirect&url=https://onlinecasino888.us.org   http://088065.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://millsautomotive.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.sullivanschools.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.snap21.com/redirectAdCounter.php?adId=4022&orgId=18446&url=https://onlinecasino888.us.org   http://www.pyddd.com/go.html?url=https://onlinecasino888.us.org  http://deepfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.newspad.gr/news/link.php?item=7f607887d8e9ee5de070d6e43ccc0be2&link=https://onlinecasino888.us.org  http://adirawoman.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.homestandbygenerator.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://m.mctalks.com/index.php?c=login&&referer=https://onlinecasino888.us.org \nhttp://stpeteer.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://facemeyerlaw.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.grainfield.tyigh.com/bitrix/rk.php?id=788&event1=banner&event2=click&event3=1+%2F+%5B788%5D+%5Bexpo_bottom_13_1%5D+http%3A+%2F%2Fwww.spravka003.ru&goto=https://onlinecasino888.us.org   http://wnh.andrewskurth.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.slatefordlongstone.org.uk/goto-link.php?link_id=17&url=https://onlinecasino888.us.org   http://mosaicos.diariomadrid.eu/includes/redirect.php?url=https://onlinecasino888.us.org/  http://myhealthyexchange.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://darmoweszablony.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://spherocult.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.yogalum.hk/d7u8/redirect.php?tid=5113&goto=onlinecasino888.us.org  http://www.quadrifoglionews.it/sponsor.asp?spoid=209&url=https://onlinecasino888.us.org   http://www.radfordpl.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://tr.trackitonline.ru/away.php?to=https://onlinecasino888.us.org  http://elkoconcerts.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://morganstanleyrealty.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tacticalscience.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://marathonkidsinternational.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bard.inecs.ru/cgi-bin/redirect.cgi?https://onlinecasino888.us.org \nhttp://stltaxdocs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://samplestop.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://freetrafficschoolcourses.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.mealslikemoms.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://gkv.moneysworthrentals.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://eqvilibria.ru/bitrix/redirect.php?event1=catalog_out&event2=http://www.ewstudio.ru&event3=East+West+Fitness+&+Pilates+Studio-Москва-ул.+Усачева,+3&goto=https://onlinecasino888.us.org  http://revolutioncleaners.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mercuryfloodinsurance.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.hookedinthemountains.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://ligarobotyki.pl/forum/showthread.php?tid=1325&pid=1718#pid1718\nhttp://www.morrisonmall.com/forum/viewtopic.php?pid=44767#p44767\nhttp://thereptileroom.org/index.php?topic=4157.new#new\nhttp://joelmoye.com/forum/showthread.php?p=17637#post17637\nhttp://compareaquatics.com/forum/viewtopic.php?f=12&t=14225\n", "language": "Lisp", "metadata": {"date": 1546387483, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s496799658.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s496799658", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://hallmark-racing-marine.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://sitkeven.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://katvin.com/?https://onlinecasino888.us.org   http://academyoutdoors.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://ina.waptop.info/go.php?t=139586&link=onlinecasino888.us.org   http://d2-tech.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://umcpreaching.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://oab-rn.jusbrasil.com.br/noticias/1190334/artigo-o-quimerismo-genetico-e-suas-implicacoes-para-o-mundo-do-direito?referer=https://onlinecasino888.us.org   http://392966.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://silverado-lease.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.simpleadsales.com/serve/click.htm?z=23462&a=23377&url=https://onlinecasino888.us.org   http://wzw.planeandpilotmagazine.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://d3642229.hosted409.agensxadmin.net/redir.php?url=https://onlinecasino888.us.org  http://hugrid.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.barhlettas.cf/redir.php?act=verkkokauppa_redir&id=6333&url=https://onlinecasino888.us.org  http://acepop.iloveweb.net/php_test.php?a<>=<a href=https://onlinecasino888.us.org memlihara ayam sabung</a>  http://www.thefamiliesweb.com/memorial/VW/Lists/Posts/ViewPost.aspx?ID=8&Source=https://onlinecasino888.us.org   http://onedominion.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://bonaventurecondos.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://montsutton.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://easyhypnobirthing.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://trans-resurs.ru/go/url=https://onlinecasino888.us.org  http://yacht-skipper.ru/go.php?https://onlinecasino888.us.org/   https://www.multipower.ru/bitrix/rk.php?goto=https://onlinecasino888.us.org  http://roomandboardbusinessinteriors.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://michael-peterson.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.seekerific.com/tools/url-emailer.asp?url=https://onlinecasino888.us.org \nhttp://www.chooseaprodomme.com/cgi-bin/out.cgi?id=garden&url=https://onlinecasino888.us.org  https://members.satinsheetdreams.com/sessions/new.mobile?goto=https://onlinecasino888.us.org   http://www.sina.com.cn/midpage/mobile/index.d.html?docID=fyarrcc7326798&url=onlinecasino888.us.org   http://www.fachwissen-daten.de/berichte/goto/https://onlinecasino888.us.org  http://thatslivingthebrand.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.halarkin.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mwtuxonline.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://divorcelog.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://smartusa.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://emiratesfood.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.floridakeys.net/frame.cfm?linkurl=https://onlinecasino888.us.org/   http://rheemal.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://live.vvsbuyer.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.libdememails.co.uk/r?u=https://onlinecasino888.us.org   http://www.pnne.org/LinkClick.aspx?link=https://onlinecasino888.us.org  http://cattleconnection.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://cartographersguild.com/showthread.php?t=37427&goto=onlinecasino888.us.org   http://ozreport.com/redirect.php?https://onlinecasino888.us.org \nhttp://eduspend.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.polymers-ppi.com/lib/sys_check.php?referer=https://onlinecasino888.us.org   http://elobstertail.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://propanepros.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.halasz-garazs.wlap.hu/click.php?url=https://onlinecasino888.us.org   http://razpel.transformyourselfnow.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://steverothstein.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  https://www.mineimatorforums.com/index.php?app=core&module=system&controller=redirect&url=https://onlinecasino888.us.org   http://088065.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://millsautomotive.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.sullivanschools.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://www.snap21.com/redirectAdCounter.php?adId=4022&orgId=18446&url=https://onlinecasino888.us.org   http://www.pyddd.com/go.html?url=https://onlinecasino888.us.org  http://deepfamily.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.newspad.gr/news/link.php?item=7f607887d8e9ee5de070d6e43ccc0be2&link=https://onlinecasino888.us.org  http://adirawoman.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.homestandbygenerator.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   https://m.mctalks.com/index.php?c=login&&referer=https://onlinecasino888.us.org \nhttp://stpeteer.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://facemeyerlaw.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.grainfield.tyigh.com/bitrix/rk.php?id=788&event1=banner&event2=click&event3=1+%2F+%5B788%5D+%5Bexpo_bottom_13_1%5D+http%3A+%2F%2Fwww.spravka003.ru&goto=https://onlinecasino888.us.org   http://wnh.andrewskurth.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://www.slatefordlongstone.org.uk/goto-link.php?link_id=17&url=https://onlinecasino888.us.org   http://mosaicos.diariomadrid.eu/includes/redirect.php?url=https://onlinecasino888.us.org/  http://myhealthyexchange.info/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://darmoweszablony.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://spherocult.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \nhttp://www.yogalum.hk/d7u8/redirect.php?tid=5113&goto=onlinecasino888.us.org  http://www.quadrifoglionews.it/sponsor.asp?spoid=209&url=https://onlinecasino888.us.org   http://www.radfordpl.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://tr.trackitonline.ru/away.php?to=https://onlinecasino888.us.org  http://elkoconcerts.net/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://morganstanleyrealty.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://tacticalscience.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://marathonkidsinternational.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://bard.inecs.ru/cgi-bin/redirect.cgi?https://onlinecasino888.us.org \nhttp://stltaxdocs.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://samplestop.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://freetrafficschoolcourses.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.mealslikemoms.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://gkv.moneysworthrentals.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://eqvilibria.ru/bitrix/redirect.php?event1=catalog_out&event2=http://www.ewstudio.ru&event3=East+West+Fitness+&+Pilates+Studio-Москва-ул.+Усачева,+3&goto=https://onlinecasino888.us.org  http://revolutioncleaners.biz/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org  http://mercuryfloodinsurance.org/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org   http://www.hookedinthemountains.com/__media__/js/netsoltrademark.php?d=onlinecasino888.us.org \n \n \n \n \n \nhttp://ligarobotyki.pl/forum/showthread.php?tid=1325&pid=1718#pid1718\nhttp://www.morrisonmall.com/forum/viewtopic.php?pid=44767#p44767\nhttp://thereptileroom.org/index.php?topic=4157.new#new\nhttp://joelmoye.com/forum/showthread.php?p=17637#post17637\nhttp://compareaquatics.com/forum/viewtopic.php?f=12&t=14225\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8342, "cpu_time_ms": 18, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s919038271", "group_id": "codeNet:p03941", "input_text": "Ponstel   Ponstel is a anti inflammatory medication used as a treatment for primary dysmenorrhea and alleviate light to moderate pain due to phases in women. happy weight loss images <a href=http://limptedreko.tk/post/hairstyles-for-weight-loss >hairstyles for weight loss</a> and home fat burning drinks <a href=http://wlfbsa.org/home.php?mod=space&uid=45367 >not eating enough lose weight</a> \n<a href=http://hgjbz.com/home.php?mod=space&uid=53924 >raisin bran helps lose weight</a> heart damage from diet pills <a href=http://limptedreko.tk/post/hairstyles-after-weight-loss >hairstyles after weight loss</a> and home fat loss diet  <a href=http://www.joeyfans.com/forum/home.php?mod=space&uid=185495 >reduce fat from thighs and hips</a> \ngarcinia cambogia dove comprare il frutto <a href=http://sanziedu.com/home.php?mod=space&uid=1063 >food help u lose weight fast</a> vcu weight loss wolver", "language": "Lisp", "metadata": {"date": 1546375757, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s919038271.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s919038271", "user_id": "u794886383"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Ponstel   Ponstel is a anti inflammatory medication used as a treatment for primary dysmenorrhea and alleviate light to moderate pain due to phases in women. happy weight loss images <a href=http://limptedreko.tk/post/hairstyles-for-weight-loss >hairstyles for weight loss</a> and home fat burning drinks <a href=http://wlfbsa.org/home.php?mod=space&uid=45367 >not eating enough lose weight</a> \n<a href=http://hgjbz.com/home.php?mod=space&uid=53924 >raisin bran helps lose weight</a> heart damage from diet pills <a href=http://limptedreko.tk/post/hairstyles-after-weight-loss >hairstyles after weight loss</a> and home fat loss diet  <a href=http://www.joeyfans.com/forum/home.php?mod=space&uid=185495 >reduce fat from thighs and hips</a> \ngarcinia cambogia dove comprare il frutto <a href=http://sanziedu.com/home.php?mod=space&uid=1063 >food help u lose weight fast</a> vcu weight loss wolver", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 896, "cpu_time_ms": 132, "memory_kb": 10472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s111528519", "group_id": "codeNet:p03941", "input_text": "Potential side-effect They could incorporate an allergic attack: Illness; difficulty breathing; swelling of your own face, tongue, lips, or throat. lose 1 body fat in a day <a href=http://saulighmoocont.tk/post/fda-approved-prescription-weight-loss-medications >fda approved prescription weight loss medications</a> and weight loss pills belly fat <a href=http://www.chinanpn.com/home.php?mod=space&uid=3116432 >is it harder to lose weight after pregnancy</a> \n<a href=http://x-photos.com/user/spearmNuamp/ >detox tea lose weight india</a> weight loss muscle gain workout routine <a href=http://saulighmoocont.tk/post/fda-approved-prescription-weight-loss-medications >fda approved prescription weight loss medications</a> and muscle gain and fat loss meal plan  <a href=http://njhyws.net/bbs/forum.php?mod=viewthread&tid=2474&extra= >how to burn body fa</a> \nwhat should i do when my weight loss plateaus <a href=http://congnghexe.net/auto/profile.php?id=38813 >top 10 foods to burn fat</a> fat loss on paleo diet", "language": "Lisp", "metadata": {"date": 1546363157, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s111528519.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s111528519", "user_id": "u794886383"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Potential side-effect They could incorporate an allergic attack: Illness; difficulty breathing; swelling of your own face, tongue, lips, or throat. lose 1 body fat in a day <a href=http://saulighmoocont.tk/post/fda-approved-prescription-weight-loss-medications >fda approved prescription weight loss medications</a> and weight loss pills belly fat <a href=http://www.chinanpn.com/home.php?mod=space&uid=3116432 >is it harder to lose weight after pregnancy</a> \n<a href=http://x-photos.com/user/spearmNuamp/ >detox tea lose weight india</a> weight loss muscle gain workout routine <a href=http://saulighmoocont.tk/post/fda-approved-prescription-weight-loss-medications >fda approved prescription weight loss medications</a> and muscle gain and fat loss meal plan  <a href=http://njhyws.net/bbs/forum.php?mod=viewthread&tid=2474&extra= >how to burn body fa</a> \nwhat should i do when my weight loss plateaus <a href=http://congnghexe.net/auto/profile.php?id=38813 >top 10 foods to burn fat</a> fat loss on paleo diet", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1014, "cpu_time_ms": 84, "memory_kb": 8168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s336486988", "group_id": "codeNet:p03941", "input_text": "http://wosser.getfreegoods.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://bficanada-quebec.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://videodw.comin.videodw.com/url?q=https://casinorealmoney.us   http://www.mineralplaster.co.nz/ra.asp?url=https://casinorealmoney.us  http://georgetownpartners.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://mohammadsaid.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://s5.shinystat.it/cgi-bin/redir.cgi?URL=https://casinorealmoney.us  http://www.vanpeople.com/space/link.php?url=https://casinorealmoney.us   http://bioe.com/exit.aspx?URL=https://casinorealmoney.us \nhttp://mappk.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://investinchinesecompanies.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://p-bot.com/cgi-bin/atx/out.cgi?id=16&tag=top&trade=https://casinorealmoney.us   http://gamespider.co.uk/redirect.php?retailer=0&deeplink=https://casinorealmoney.us  http://shop-europe.proceq.com/redirect.php?action=url&goto=casinorealmoney.us   http://globalgolfpro.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.madagascar.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://rpx.a8.net/svt/ejp?a8mat=1U7G6P+8S5702+2HOM+BW8O1&rakuten=y&a8ejpredirect=https://casinorealmoney.us   http://www.smutgranny.com/cgi-bin/atx/out.cgi?id=316&tag=toplist&trade=https://casinorealmoney.us \nhttp://www.haku.com.tw/redirect.php?tid=6485&goto=casinorealmoney.us  http://www.cadenashoteleras.org/log.es.html?e=39&r=3&u=https://casinorealmoney.us   http://www.kingsrestaurants.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.deepfrieddiesel.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://bodybuildingcoach.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://mhcbuyp.libsyn.com/?referer=https://casinorealmoney.us  http://www.gs-sochi.ru/bitrix/rk.php?event1=file&event2=download&goto=casinorealmoney.us  http://comic-checker.herokuapp.com/check_update/redirect?url=https://casinorealmoney.us   http://wearehcrmanorcare.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://www.freesexycontent.com/crtr/cgi/out.cgi?id=146&l=t2&u=https://casinorealmoney.us  http://www.sgsl.info/Goto.asp?url=https://casinorealmoney.us   http://www.newyorkhotelguide.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://citadelmgmt.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://remotecontrolinc.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.sport4all.be/redir.php?titel=Elise+Mertens+opent+tegen+Roemeens+reekshoofd+Niculescu&link=https://casinorealmoney.us  http://jqm.gatematic.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.target.co.il/site/linkclick.aspx?link=https://casinorealmoney.us   http://www.bvrefrigeration.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://huntingtonforschool.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://zarzadzanie.uni.lodz.pl/LinkClick.aspx?link=https://casinorealmoney.us   https://www.hosting22.com/goto/?url=casinorealmoney.us   http://www.5168.biz/home/link.php?url=https://casinorealmoney.us  http://stydentki.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://marineblastvideos.co.uk/NetServe/KL42P0U_mallSsoAction.do?goto=casinorealmoney.us  http://wallboardrecycling.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://panamaexpeditions.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://realadvice.pro/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://www.yellowpages.eindiabusiness.com/url.php?iid=https://casinorealmoney.us  http://lgpmanagement.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://nationaldancesportcorporation.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://scartreatment.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://vgu.mailprocessing.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.tecnipublicaciones.com/amdpress/redirect.asp?ID=34123&url=https://casinorealmoney.us  http://theprologuesociety.info/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.unleashedadventures.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://hisnewsnetwork.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttps://schelterofficeplus.ca/track.aspx?a=3807&r=45&c=&u=https://casinorealmoney.us  http://dfwrugcleaning.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://defectivemen.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.hits.cdd.nhs.uk/HIT/MoreDetailsv2.jsp?id=11795&dsn=hphit&referrer=https://casinorealmoney.us/  http://co.adams.wi.gov/LinkClick.aspx?link=https://casinorealmoney.us   http://westerntires.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://leebiz.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://secondsaturdaysa.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://raguweb.net/antena/html/link.php?url=https://casinorealmoney.us \nhttp://www.1800newbasement.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.wauwatosanow.com/s?action=editReg&rurl=https://casinorealmoney.us/   http://www.shadyfamily.net/blank.php?path=content/links.php&contentid=103&link=casinorealmoney.us   http://mylastrequestbox.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.smartbabysitting.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.hklawpage.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://aapg.biz/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.floridaforensics.org/__media__/js/trademark.php?d=casinorealmoney.us   http://kurdmusik.hostpost.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://imgworldwide.info/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://primorsky.ru/bitrix/rk.php?id=111&event1=banner&event2=click&event3=1+%2F+%5B111%5D+%5BRSB_BLOCK_2%5D+%D0%A1%D0%BF%D0%B8%D1%81%D0%BE%D0%BA+%D1%82%D0%B5%D0%BB%D0%B5%D1%84%D0%BE%D0%BD%D0%BE%D0%B2+%D0%B3%D0%BE%D1%80%D1%8F%D1%87%D0%B8%D1%85+%D0%BB%D0%B8%D0%BD%D0%B8%D0%B9&goto=https://casinorealmoney.us   http://www.oltreverso.it/home/wp-content/plugins/spfeeds/controllers/rs.php?f=&url=https://casinorealmoney.us   http://go.cin7.com/ra.asp?url=https://casinorealmoney.us  http://www.him3.ru/redir.php?url=https://casinorealmoney.us   http://onlycelebsfakes.com/cgi-bin/crtr/out.cgi?id=43&l=top_top&u=https://casinorealmoney.us  http://kreatif.com.ua/redirect.php?https://casinorealmoney.us  http://cheaptrafficschoolfast.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   https://parmanziani.it/modules/mod_jw_srfr/redir.php?url=https://casinorealmoney.us \nhttp://liaudiology.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://firstchoicerates.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.homeanddecor.sg/blogs/tags/LDAP_PATH/fbLogin.html%3Bjsessionid%3D4B84E3D04D5E5CA62FB53E30D305F2CC?page=4&module=facebook&svc=hnd&goto=https://casinorealmoney.us   http://www.beast-art.com/cgi-bin/out.cgi?id=animalt7&url=https://casinorealmoney.us  http://stanford.ebookhost.net/ssir/digital/22/ebook/1/scripts/redirect.php?url=https://casinorealmoney.us   http://tubularsteel.com/__media__/js/trademark.php?d=casinorealmoney.us  http://www.milamstudios.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.cocogd.com/home/link.php?url=https://casinorealmoney.us   http://repevaluator.biz/__media__/js/netsoltrademark.php?d=casinorealmoney.us \n \n \n \n \n \nhttp://www.capitolasset.net/forum/showthread.php?tid=5496\nhttps://www.hidradenitis-suppurativa-forum.org/viewtopic.php?f=6&t=312\nhttp://www.truck-thai.com/forum/index.php/topic,929.new.html#new\nhttps://ingilizceyehazirlik.com/showthread.php?tid=10606&pid=14889#pid14889\nhttp://fakefes.hopto.org/index.php?topic=1195.new#new\n", "language": "Lisp", "metadata": {"date": 1546358108, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s336486988.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s336486988", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://wosser.getfreegoods.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://bficanada-quebec.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://videodw.comin.videodw.com/url?q=https://casinorealmoney.us   http://www.mineralplaster.co.nz/ra.asp?url=https://casinorealmoney.us  http://georgetownpartners.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://mohammadsaid.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://s5.shinystat.it/cgi-bin/redir.cgi?URL=https://casinorealmoney.us  http://www.vanpeople.com/space/link.php?url=https://casinorealmoney.us   http://bioe.com/exit.aspx?URL=https://casinorealmoney.us \nhttp://mappk.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://investinchinesecompanies.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://p-bot.com/cgi-bin/atx/out.cgi?id=16&tag=top&trade=https://casinorealmoney.us   http://gamespider.co.uk/redirect.php?retailer=0&deeplink=https://casinorealmoney.us  http://shop-europe.proceq.com/redirect.php?action=url&goto=casinorealmoney.us   http://globalgolfpro.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.madagascar.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://rpx.a8.net/svt/ejp?a8mat=1U7G6P+8S5702+2HOM+BW8O1&rakuten=y&a8ejpredirect=https://casinorealmoney.us   http://www.smutgranny.com/cgi-bin/atx/out.cgi?id=316&tag=toplist&trade=https://casinorealmoney.us \nhttp://www.haku.com.tw/redirect.php?tid=6485&goto=casinorealmoney.us  http://www.cadenashoteleras.org/log.es.html?e=39&r=3&u=https://casinorealmoney.us   http://www.kingsrestaurants.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.deepfrieddiesel.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://bodybuildingcoach.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://mhcbuyp.libsyn.com/?referer=https://casinorealmoney.us  http://www.gs-sochi.ru/bitrix/rk.php?event1=file&event2=download&goto=casinorealmoney.us  http://comic-checker.herokuapp.com/check_update/redirect?url=https://casinorealmoney.us   http://wearehcrmanorcare.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://www.freesexycontent.com/crtr/cgi/out.cgi?id=146&l=t2&u=https://casinorealmoney.us  http://www.sgsl.info/Goto.asp?url=https://casinorealmoney.us   http://www.newyorkhotelguide.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://citadelmgmt.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://remotecontrolinc.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.sport4all.be/redir.php?titel=Elise+Mertens+opent+tegen+Roemeens+reekshoofd+Niculescu&link=https://casinorealmoney.us  http://jqm.gatematic.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.target.co.il/site/linkclick.aspx?link=https://casinorealmoney.us   http://www.bvrefrigeration.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://huntingtonforschool.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://zarzadzanie.uni.lodz.pl/LinkClick.aspx?link=https://casinorealmoney.us   https://www.hosting22.com/goto/?url=casinorealmoney.us   http://www.5168.biz/home/link.php?url=https://casinorealmoney.us  http://stydentki.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://marineblastvideos.co.uk/NetServe/KL42P0U_mallSsoAction.do?goto=casinorealmoney.us  http://wallboardrecycling.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://panamaexpeditions.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://realadvice.pro/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://www.yellowpages.eindiabusiness.com/url.php?iid=https://casinorealmoney.us  http://lgpmanagement.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://nationaldancesportcorporation.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://scartreatment.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://vgu.mailprocessing.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.tecnipublicaciones.com/amdpress/redirect.asp?ID=34123&url=https://casinorealmoney.us  http://theprologuesociety.info/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.unleashedadventures.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://hisnewsnetwork.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttps://schelterofficeplus.ca/track.aspx?a=3807&r=45&c=&u=https://casinorealmoney.us  http://dfwrugcleaning.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://defectivemen.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.hits.cdd.nhs.uk/HIT/MoreDetailsv2.jsp?id=11795&dsn=hphit&referrer=https://casinorealmoney.us/  http://co.adams.wi.gov/LinkClick.aspx?link=https://casinorealmoney.us   http://westerntires.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://leebiz.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://secondsaturdaysa.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://raguweb.net/antena/html/link.php?url=https://casinorealmoney.us \nhttp://www.1800newbasement.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.wauwatosanow.com/s?action=editReg&rurl=https://casinorealmoney.us/   http://www.shadyfamily.net/blank.php?path=content/links.php&contentid=103&link=casinorealmoney.us   http://mylastrequestbox.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.smartbabysitting.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.hklawpage.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://aapg.biz/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.floridaforensics.org/__media__/js/trademark.php?d=casinorealmoney.us   http://kurdmusik.hostpost.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://imgworldwide.info/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://primorsky.ru/bitrix/rk.php?id=111&event1=banner&event2=click&event3=1+%2F+%5B111%5D+%5BRSB_BLOCK_2%5D+%D0%A1%D0%BF%D0%B8%D1%81%D0%BE%D0%BA+%D1%82%D0%B5%D0%BB%D0%B5%D1%84%D0%BE%D0%BD%D0%BE%D0%B2+%D0%B3%D0%BE%D1%80%D1%8F%D1%87%D0%B8%D1%85+%D0%BB%D0%B8%D0%BD%D0%B8%D0%B9&goto=https://casinorealmoney.us   http://www.oltreverso.it/home/wp-content/plugins/spfeeds/controllers/rs.php?f=&url=https://casinorealmoney.us   http://go.cin7.com/ra.asp?url=https://casinorealmoney.us  http://www.him3.ru/redir.php?url=https://casinorealmoney.us   http://onlycelebsfakes.com/cgi-bin/crtr/out.cgi?id=43&l=top_top&u=https://casinorealmoney.us  http://kreatif.com.ua/redirect.php?https://casinorealmoney.us  http://cheaptrafficschoolfast.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   https://parmanziani.it/modules/mod_jw_srfr/redir.php?url=https://casinorealmoney.us \nhttp://liaudiology.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://firstchoicerates.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.homeanddecor.sg/blogs/tags/LDAP_PATH/fbLogin.html%3Bjsessionid%3D4B84E3D04D5E5CA62FB53E30D305F2CC?page=4&module=facebook&svc=hnd&goto=https://casinorealmoney.us   http://www.beast-art.com/cgi-bin/out.cgi?id=animalt7&url=https://casinorealmoney.us  http://stanford.ebookhost.net/ssir/digital/22/ebook/1/scripts/redirect.php?url=https://casinorealmoney.us   http://tubularsteel.com/__media__/js/trademark.php?d=casinorealmoney.us  http://www.milamstudios.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.cocogd.com/home/link.php?url=https://casinorealmoney.us   http://repevaluator.biz/__media__/js/netsoltrademark.php?d=casinorealmoney.us \n \n \n \n \n \nhttp://www.capitolasset.net/forum/showthread.php?tid=5496\nhttps://www.hidradenitis-suppurativa-forum.org/viewtopic.php?f=6&t=312\nhttp://www.truck-thai.com/forum/index.php/topic,929.new.html#new\nhttps://ingilizceyehazirlik.com/showthread.php?tid=10606&pid=14889#pid14889\nhttp://fakefes.hopto.org/index.php?topic=1195.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8073, "cpu_time_ms": 62, "memory_kb": 7012}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s610437762", "group_id": "codeNet:p03941", "input_text": "Contra-indications you shouldn't use this medication if you're allergic to cyclosporine. fast tips to lose weight <a href=http://sideprofitz.tk/post/does-ultrasound-therapy-work-for-weight-loss >does ultrasound therapy work for weight loss</a> and can you lose belly fat with only diet <a href=http://www.dehua.ren/home.php?mod=space&uid=31324 >can activia yogurt help lose weight</a> \n<a href=http://forum.play4.life/index.php?action=profile;u=12085 >dat mua green coffee o dau</a> natural herbs for fast weight loss <a href=http://sideprofitz.tk/post/clenbuterol-dosage-for-weight-loss >clenbuterol dosage for weight loss</a> and healthy food for weight loss in india  <a href=http://bbs2.blackview.hk/home.php?mod=space&uid=137 >diet plans snacks</a> \npeaches fruit for weight loss <a href=http://www.haoshouyi.wang/home.php?mod=space&uid=95121&do=profile&from=space >no sugar no dairy weight loss</a> boots slimming aids", "language": "Lisp", "metadata": {"date": 1546339206, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s610437762.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s610437762", "user_id": "u794886383"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Contra-indications you shouldn't use this medication if you're allergic to cyclosporine. fast tips to lose weight <a href=http://sideprofitz.tk/post/does-ultrasound-therapy-work-for-weight-loss >does ultrasound therapy work for weight loss</a> and can you lose belly fat with only diet <a href=http://www.dehua.ren/home.php?mod=space&uid=31324 >can activia yogurt help lose weight</a> \n<a href=http://forum.play4.life/index.php?action=profile;u=12085 >dat mua green coffee o dau</a> natural herbs for fast weight loss <a href=http://sideprofitz.tk/post/clenbuterol-dosage-for-weight-loss >clenbuterol dosage for weight loss</a> and healthy food for weight loss in india  <a href=http://bbs2.blackview.hk/home.php?mod=space&uid=137 >diet plans snacks</a> \npeaches fruit for weight loss <a href=http://www.haoshouyi.wang/home.php?mod=space&uid=95121&do=profile&from=space >no sugar no dairy weight loss</a> boots slimming aids", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 924, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s976291520", "group_id": "codeNet:p03941", "input_text": "http://hubbellusa.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://greatnortherncatskills.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://rsrma.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://granitefallsresort.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://yourbagbuddy.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://paymy21st.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.elpicaflor.com/__media__/js/trademark.php?d=casinorealmoney.us  http://gtg.anteldata.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://safepassageohio.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://intellidisplays.info/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.bjsjyys.com/bbs/redirect.php?tid=6397&goto=casinorealmoney.us   http://www.klub.senior.pl/showthread.php?svbatotmhash=77cdc780887858d3c90959cb34ff6b7b&timehash=1529514760&t=8570&goto=casinorealmoney.us   http://jibbigo.in/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://upset.newportescape.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://vip.sakuraweb.com/cgi-bin/link/tbpcount.cgi?url=https://casinorealmoney.us  http://thehealthtime.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://spherocult.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.stoka-kiel.de/redirect.php?url=casinorealmoney.us \nhttp://buttonsmashersblog.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://envisionscientificgroup.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://sexmobiel.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://threshed.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.jxqnw.com/jy/link.php?url=https://casinorealmoney.us   http://johnnie-walker.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://victozamedlink.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://virtualinfrastructureutility.info/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.irisexchange.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://www.ca.sadalaw.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://fsq.dottie-herman.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://lakeminocqua.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://stephen-wilson.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://missusacontest.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.suffolkcountyny.gov/LinkClick.aspx?link=https://casinorealmoney.us  http://quantumflyer.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://lionassociates.us/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://bancoentrerios.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://www.hsgx.net/uchome/link.php?url=https://casinorealmoney.us  http://www.streblowboatowners.com/LinkClick.aspx?link=https://casinorealmoney.us   http://385doctors.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://ofunato.net/cgi-bin/search/rank.cgi?mode=link&id=458&url=https://casinorealmoney.us  http://fresno-examiner.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://hollywoodstudiomuseum.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://buzzak.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  https://www.incesttube.eu/cgi-bin/xxx/out.cgi?url=https://casinorealmoney.us   http://www.aveclassics.net/go?https://casinorealmoney.us/ \nhttp://radtowers.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://bingwm.com/index.php?c=login&&referer=https://casinorealmoney.us   http://themakershouse.org/index.php/component/k2/item/6-maker-s-house-chapel-launches-3-books?goto=casinorealmoney.us   http://trumbulltravelbaseball.com/Goto.asp?url=https://casinorealmoney.us  http://sav.withastroke.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://unitedtimes.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://internet-marketing.goldenarticles.net/go.php?url=https://casinorealmoney.us  http://ninetyninecentonlytrafficschool.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://allenstevenson.nyc/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://arkivo.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.sayaloha.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://absex.co/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://zeroclosingcostsrealty.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://joinmuse.ru/forum/go.php?https://casinorealmoney.us/   http://shoppalmspringslife.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.cuncaoshuo.com/member/link.php?url=https://casinorealmoney.us  http://www.breitlingchallenge.com/page/21/?go=https://casinorealmoney.us   http://xnxxporntube.net/out.php?url=casinorealmoney.us \nhttp://innovatein.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://urq.pet-finder.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://kewlstuff.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://beamentor.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://artsaffron.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://healthmaintenance.us/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://missionaryplanet.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.exgranny.com/sexy/z.php?goto=https://casinorealmoney.us   http://www.xielw.cn/down.asp?url=https://casinorealmoney.us \nhttp://catalog.club.co.ua/redirect.php??s=https://casinorealmoney.us  http://startupmyidea.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.tfsports.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.spatializer.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://reidrealestate.com/index.cfm?fuseaction=link-out&t=Website for BUTCH BOAD&l=https://casinorealmoney.us   http://versteckehn.tk/link?r=2057349&t=11&s=70&l=thumbs&u=https://casinorealmoney.us  http://giftbuyingonline.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://okcomunidad.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://kingsport360.com/?go=https://casinorealmoney.us \nhttp://www.thebestimage.biz/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.dogame.com.cn/uchome/link.php?url=https://casinorealmoney.us   http://ysq.ismailicentervancouver.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.mitpferdenreisen.de/ext_ads_out.php?goto=https://casinorealmoney.us  http://www.casino-club.us/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.customsbrokerage.info/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://godrejzindagimuskuraye.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.ec-central.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://xly.depositionbank.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us \n \n \n \n \n \nhttp://googleearthcommunity.com/forums/showthread.php?tid=18813\nhttp://legalize.co/listings/beelitusa-com/#comment-1183\nhttp://www.flowbaze.com/viewtopic.php?f=11&t=598&p=10278#p10278\nhttp://www.accomplishdreams.com/forum/index.php?topic=6420.new#new\nhttp://chs.my/forum/viewtopic.php?f=4&t=7915&p=8172#p8172\n", "language": "Lisp", "metadata": {"date": 1546314457, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s976291520.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s976291520", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://hubbellusa.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://greatnortherncatskills.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://rsrma.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://granitefallsresort.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://yourbagbuddy.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://paymy21st.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.elpicaflor.com/__media__/js/trademark.php?d=casinorealmoney.us  http://gtg.anteldata.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://safepassageohio.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://intellidisplays.info/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.bjsjyys.com/bbs/redirect.php?tid=6397&goto=casinorealmoney.us   http://www.klub.senior.pl/showthread.php?svbatotmhash=77cdc780887858d3c90959cb34ff6b7b&timehash=1529514760&t=8570&goto=casinorealmoney.us   http://jibbigo.in/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://upset.newportescape.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://vip.sakuraweb.com/cgi-bin/link/tbpcount.cgi?url=https://casinorealmoney.us  http://thehealthtime.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://spherocult.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.stoka-kiel.de/redirect.php?url=casinorealmoney.us \nhttp://buttonsmashersblog.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://envisionscientificgroup.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://sexmobiel.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://threshed.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.jxqnw.com/jy/link.php?url=https://casinorealmoney.us   http://johnnie-walker.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://victozamedlink.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://virtualinfrastructureutility.info/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.irisexchange.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://www.ca.sadalaw.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://fsq.dottie-herman.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://lakeminocqua.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://stephen-wilson.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://missusacontest.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.suffolkcountyny.gov/LinkClick.aspx?link=https://casinorealmoney.us  http://quantumflyer.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://lionassociates.us/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://bancoentrerios.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://www.hsgx.net/uchome/link.php?url=https://casinorealmoney.us  http://www.streblowboatowners.com/LinkClick.aspx?link=https://casinorealmoney.us   http://385doctors.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://ofunato.net/cgi-bin/search/rank.cgi?mode=link&id=458&url=https://casinorealmoney.us  http://fresno-examiner.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://hollywoodstudiomuseum.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://buzzak.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  https://www.incesttube.eu/cgi-bin/xxx/out.cgi?url=https://casinorealmoney.us   http://www.aveclassics.net/go?https://casinorealmoney.us/ \nhttp://radtowers.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://bingwm.com/index.php?c=login&&referer=https://casinorealmoney.us   http://themakershouse.org/index.php/component/k2/item/6-maker-s-house-chapel-launches-3-books?goto=casinorealmoney.us   http://trumbulltravelbaseball.com/Goto.asp?url=https://casinorealmoney.us  http://sav.withastroke.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://unitedtimes.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://internet-marketing.goldenarticles.net/go.php?url=https://casinorealmoney.us  http://ninetyninecentonlytrafficschool.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://allenstevenson.nyc/__media__/js/netsoltrademark.php?d=casinorealmoney.us \nhttp://arkivo.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.sayaloha.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://absex.co/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://zeroclosingcostsrealty.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://joinmuse.ru/forum/go.php?https://casinorealmoney.us/   http://shoppalmspringslife.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.cuncaoshuo.com/member/link.php?url=https://casinorealmoney.us  http://www.breitlingchallenge.com/page/21/?go=https://casinorealmoney.us   http://xnxxporntube.net/out.php?url=casinorealmoney.us \nhttp://innovatein.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://urq.pet-finder.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://kewlstuff.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://beamentor.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://artsaffron.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://healthmaintenance.us/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://missionaryplanet.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.exgranny.com/sexy/z.php?goto=https://casinorealmoney.us   http://www.xielw.cn/down.asp?url=https://casinorealmoney.us \nhttp://catalog.club.co.ua/redirect.php??s=https://casinorealmoney.us  http://startupmyidea.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.tfsports.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.spatializer.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://reidrealestate.com/index.cfm?fuseaction=link-out&t=Website for BUTCH BOAD&l=https://casinorealmoney.us   http://versteckehn.tk/link?r=2057349&t=11&s=70&l=thumbs&u=https://casinorealmoney.us  http://giftbuyingonline.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://okcomunidad.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://kingsport360.com/?go=https://casinorealmoney.us \nhttp://www.thebestimage.biz/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.dogame.com.cn/uchome/link.php?url=https://casinorealmoney.us   http://ysq.ismailicentervancouver.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.mitpferdenreisen.de/ext_ads_out.php?goto=https://casinorealmoney.us  http://www.casino-club.us/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://www.customsbrokerage.info/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://godrejzindagimuskuraye.com/__media__/js/netsoltrademark.php?d=casinorealmoney.us  http://www.ec-central.org/__media__/js/netsoltrademark.php?d=casinorealmoney.us   http://xly.depositionbank.net/__media__/js/netsoltrademark.php?d=casinorealmoney.us \n \n \n \n \n \nhttp://googleearthcommunity.com/forums/showthread.php?tid=18813\nhttp://legalize.co/listings/beelitusa-com/#comment-1183\nhttp://www.flowbaze.com/viewtopic.php?f=11&t=598&p=10278#p10278\nhttp://www.accomplishdreams.com/forum/index.php?topic=6420.new#new\nhttp://chs.my/forum/viewtopic.php?f=4&t=7915&p=8172#p8172\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7576, "cpu_time_ms": 518, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s951012135", "group_id": "codeNet:p03941", "input_text": "It's not understood how this drug can have an effect on an unborn baby therefore Strattera needs to be administered to pregnant women as long as a possible take advantage of this usage surpasses potential risks. do you lose weight after a tummy tuck and lipo <a href=http://ternuicaszu.tk/post/how-to-lose-back-fat-after-pregnancy >how to lose back fat after pregnancy</a> and can coconut water aid weight loss <a href=http://xn--h1aid.xn--p1acf/memberlist.php?mode=viewprofile&u=624 >body wrap cream for weight loss</a> \n<a href=http://www.xiaoqiuxuetang.com/home.php?mod=space&uid=11142 >i want to gain muscle and lose belly fat</a> fat burn termogenico <a href=http://ternuicaszu.tk/post/green-coffee-denpasar >green coffee denpasar</a> and 21 day cleanse weight loss  <a href=http://meilishuoffff.com/home.php?mod=space&uid=6078 >ways to lose weight in 30 days</a> \nmedi weight loss week 2 menu <a href=http://porkasforum.com/showthread.php?tid=18930&pid=43078#pid43078 >how much weight will i lose on a water fast for 3 days</a> trimline weight loss cost", "language": "Lisp", "metadata": {"date": 1546305368, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s951012135.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s951012135", "user_id": "u794886383"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "It's not understood how this drug can have an effect on an unborn baby therefore Strattera needs to be administered to pregnant women as long as a possible take advantage of this usage surpasses potential risks. do you lose weight after a tummy tuck and lipo <a href=http://ternuicaszu.tk/post/how-to-lose-back-fat-after-pregnancy >how to lose back fat after pregnancy</a> and can coconut water aid weight loss <a href=http://xn--h1aid.xn--p1acf/memberlist.php?mode=viewprofile&u=624 >body wrap cream for weight loss</a> \n<a href=http://www.xiaoqiuxuetang.com/home.php?mod=space&uid=11142 >i want to gain muscle and lose belly fat</a> fat burn termogenico <a href=http://ternuicaszu.tk/post/green-coffee-denpasar >green coffee denpasar</a> and 21 day cleanse weight loss  <a href=http://meilishuoffff.com/home.php?mod=space&uid=6078 >ways to lose weight in 30 days</a> \nmedi weight loss week 2 menu <a href=http://porkasforum.com/showthread.php?tid=18930&pid=43078#pid43078 >how much weight will i lose on a water fast for 3 days</a> trimline weight loss cost", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1059, "cpu_time_ms": 80, "memory_kb": 8168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s155059774", "group_id": "codeNet:p03941", "input_text": "http://oklahomacitychamber.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.aimexpo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tridentsteel.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://whatispitch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sakana-hen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.electrobuzz.dj/goto/https://onlinecasino.us.org  http://sc.hkexnews.hk/TuniS/onlinecasino.us.org/h  http://ru.wikipedia.org.xx3.kz/go.php?url=https://onlinecasino.us.org   http://specialedteacher.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.nrailafrontlines.com/r?u=https://onlinecasino.us.org  http://theoffice.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tvro.com.tw/satellite/adredir.asp?url=https://onlinecasino.us.org   http://signsuite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://abcwxyz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ceraunavolta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://truworthsltd.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://3dtvbusiness.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.kupirebenku.ru/bitrix/rk.php?id=119&event1=banner&event2=click&event3=1+%2F+%5B119%5D+%5Bmain_carusel%5D+%CB%E5%E4%E8+%C1%E0%E3+&goto=https://onlinecasino.us.org \nhttp://ellagrieder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://northamericanpartnerprogram.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sodexoresponsibility.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://centrum.wrgb.by/go.php?url=https://onlinecasino.us.org  http://www.playitforless.co.uk/link.php?url=onlinecasino.us.org   http://cyberlk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://reindeerforest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.technoguard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.nagetierforum.de/wbb2/thread.php?goto=onlinecasino.us.org \nhttp://www.dpixmania.com/go.php?http://cureya.com/kinbaku/out.cgi?id=13854&url=https://onlinecasino.us.org  http://www.polymer.shu.edu.cn/LinkClick.aspx?link=https://onlinecasino.us.org   http://petzetakisafrica.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://drardent.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://driedcod.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://doublestrollercenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://migrant-club.ru/redirect?url=https://onlinecasino.us.org  http://coltsfanclub.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.stsimons-southsea.org.uk/goto-link.php?link_id=18&url=https://onlinecasino.us.org \nhttp://www.lovedyueer.com/wp-content/themes/begin5.2/inc/go.php?url=https://onlinecasino.us.org  http://book.ly/redirect.php?action=buysearch&schoolid=-1&sectionid=-1&isbn=9780136042594&vendor=biblio&price=39.64&url=https://onlinecasino.us.org   http://www.tot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.handbells.eu/redirect.php?url=https://onlinecasino.us.org  http://racer23.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fooddrinktravel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mobqt.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://meatheadsoftware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kidsmediafund.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://go.blog-theme.ir/index.php?url=https://onlinecasino.us.org  http://totercoach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://westpalmbeachweddingphotographer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://bbs.lihuasoft.net/redirect.php?fid=14&tid=7221&goto=onlinecasino.us.org  http://alonatube.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://athensdream.gr/index.php/component/k2/item/7-the-beables-eng?fromurl=onlinecasino.us.org  http://www.malachicomputer.com/blog/ct.ashx?id=af244b92-d365-4424-8e52-95f3b48c53dc&url=https://onlinecasino.us.org  http://agarw.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://xel.industrialstrengthad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.pridesticks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://conferencebureauthailand.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://images.google.com.kh/url?q=https://onlinecasino.us.org   http://aqreqator.az/redirect.php?src=https://onlinecasino.us.org  http://jewelryboxparty.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rk-nm.ru/bitrix/redirect.php?event1=news_out&event2=2fiblockf1%F2%E0c0%CE_ca_ee%E2e9_e4ea%F6ff_30.04.2015.rar&goto=https://onlinecasino.us.org  http://www.cancun-map.com/adredir.asp?url=https://onlinecasino.us.org  http://stageyourhome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://puerta.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://fucked-moms.com/cgi-bin/tel/out.cgi?id=17&tag=top_footer&ok=no&sed=https://onlinecasino.us.org  http://www.m-aan.org/index.php?URL=https://onlinecasino.us.org   http://lberi.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.metalbuildingsonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://associates.haituncun.com/redirect?user_id=5038&user_name=lai91&url=https://onlinecasino.us.org   http://www.eventcorea.com/link.php?cate_no=192&url=onlinecasino.us.org  http://gvv.airpowerincorporated.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://lableb.com/redirect?url=https://onlinecasino.us.org   https://www.fantasy-chronicles.com/wiki/index.php?title=https://onlinecasino.us.org/ \nhttp://precisionirgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://elastidermsite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.cv70.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://justapologize.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.99tosell.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.evobar.com/home/link.php?url=https://onlinecasino.us.org  http://knrim.etag.com.ua/redirect?url=https://onlinecasino.us.org  http://woodfloorexpress.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://sklep-galvet.pl/redirect.php?action=url&goto=https://onlinecasino.us.org \nhttp://www.ballformayor.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hollywoodhotrods.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://doralpromo.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jd00.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.kanzleo.ru/bitrix/rk.php?id=8434&goto=onlinecasino.us.org   http://dedicated2jesuschrist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://dealzone.co.za/redirect?url=onlinecasino.us.org  http://lithic.technology/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.croliday.ch/counter.php?object_id=5146&url=https://onlinecasino.us.org \n \n \n \n \n \nhttps://starbase972.com/about_e/kelley-tribute/\nhttps://forums.terraworldz.com/index.php?topic=10082.new#new\nhttp://barhoppersnepa.com/forum/index.php?topic=7966.new#new\nhttp://ps3trophies.com/forums/age-zombies/59558-baby-killer-whales-pictures.html#post698613\nhttp://www.physiologiccells.com/forum/index.php?topic=17575.new#new\n", "language": "Lisp", "metadata": {"date": 1546277825, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s155059774.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s155059774", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "http://oklahomacitychamber.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.aimexpo.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tridentsteel.us/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://whatispitch.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://sakana-hen.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://www.electrobuzz.dj/goto/https://onlinecasino.us.org  http://sc.hkexnews.hk/TuniS/onlinecasino.us.org/h  http://ru.wikipedia.org.xx3.kz/go.php?url=https://onlinecasino.us.org   http://specialedteacher.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttps://www.nrailafrontlines.com/r?u=https://onlinecasino.us.org  http://theoffice.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.tvro.com.tw/satellite/adredir.asp?url=https://onlinecasino.us.org   http://signsuite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://abcwxyz.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://ceraunavolta.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://truworthsltd.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://3dtvbusiness.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.kupirebenku.ru/bitrix/rk.php?id=119&event1=banner&event2=click&event3=1+%2F+%5B119%5D+%5Bmain_carusel%5D+%CB%E5%E4%E8+%C1%E0%E3+&goto=https://onlinecasino.us.org \nhttp://ellagrieder.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://northamericanpartnerprogram.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://sodexoresponsibility.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://centrum.wrgb.by/go.php?url=https://onlinecasino.us.org  http://www.playitforless.co.uk/link.php?url=onlinecasino.us.org   http://cyberlk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://reindeerforest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.technoguard.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.nagetierforum.de/wbb2/thread.php?goto=onlinecasino.us.org \nhttp://www.dpixmania.com/go.php?http://cureya.com/kinbaku/out.cgi?id=13854&url=https://onlinecasino.us.org  http://www.polymer.shu.edu.cn/LinkClick.aspx?link=https://onlinecasino.us.org   http://petzetakisafrica.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://drardent.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://driedcod.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://doublestrollercenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://migrant-club.ru/redirect?url=https://onlinecasino.us.org  http://coltsfanclub.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.stsimons-southsea.org.uk/goto-link.php?link_id=18&url=https://onlinecasino.us.org \nhttp://www.lovedyueer.com/wp-content/themes/begin5.2/inc/go.php?url=https://onlinecasino.us.org  http://book.ly/redirect.php?action=buysearch&schoolid=-1&sectionid=-1&isbn=9780136042594&vendor=biblio&price=39.64&url=https://onlinecasino.us.org   http://www.tot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.handbells.eu/redirect.php?url=https://onlinecasino.us.org  http://racer23.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://fooddrinktravel.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mobqt.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://meatheadsoftware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://kidsmediafund.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://go.blog-theme.ir/index.php?url=https://onlinecasino.us.org  http://totercoach.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://westpalmbeachweddingphotographer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://bbs.lihuasoft.net/redirect.php?fid=14&tid=7221&goto=onlinecasino.us.org  http://alonatube.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://athensdream.gr/index.php/component/k2/item/7-the-beables-eng?fromurl=onlinecasino.us.org  http://www.malachicomputer.com/blog/ct.ashx?id=af244b92-d365-4424-8e52-95f3b48c53dc&url=https://onlinecasino.us.org  http://agarw.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://xel.industrialstrengthad.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.pridesticks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://conferencebureauthailand.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://images.google.com.kh/url?q=https://onlinecasino.us.org   http://aqreqator.az/redirect.php?src=https://onlinecasino.us.org  http://jewelryboxparty.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rk-nm.ru/bitrix/redirect.php?event1=news_out&event2=2fiblockf1%F2%E0c0%CE_ca_ee%E2e9_e4ea%F6ff_30.04.2015.rar&goto=https://onlinecasino.us.org  http://www.cancun-map.com/adredir.asp?url=https://onlinecasino.us.org  http://stageyourhome.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://puerta.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://fucked-moms.com/cgi-bin/tel/out.cgi?id=17&tag=top_footer&ok=no&sed=https://onlinecasino.us.org  http://www.m-aan.org/index.php?URL=https://onlinecasino.us.org   http://lberi.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.metalbuildingsonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://associates.haituncun.com/redirect?user_id=5038&user_name=lai91&url=https://onlinecasino.us.org   http://www.eventcorea.com/link.php?cate_no=192&url=onlinecasino.us.org  http://gvv.airpowerincorporated.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://lableb.com/redirect?url=https://onlinecasino.us.org   https://www.fantasy-chronicles.com/wiki/index.php?title=https://onlinecasino.us.org/ \nhttp://precisionirgroup.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://elastidermsite.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.cv70.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://justapologize.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.99tosell.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.evobar.com/home/link.php?url=https://onlinecasino.us.org  http://knrim.etag.com.ua/redirect?url=https://onlinecasino.us.org  http://woodfloorexpress.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://sklep-galvet.pl/redirect.php?action=url&goto=https://onlinecasino.us.org \nhttp://www.ballformayor.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hollywoodhotrods.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://doralpromo.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://jd00.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.kanzleo.ru/bitrix/rk.php?id=8434&goto=onlinecasino.us.org   http://dedicated2jesuschrist.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://dealzone.co.za/redirect?url=onlinecasino.us.org  http://lithic.technology/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.croliday.ch/counter.php?object_id=5146&url=https://onlinecasino.us.org \n \n \n \n \n \nhttps://starbase972.com/about_e/kelley-tribute/\nhttps://forums.terraworldz.com/index.php?topic=10082.new#new\nhttp://barhoppersnepa.com/forum/index.php?topic=7966.new#new\nhttp://ps3trophies.com/forums/age-zombies/59558-baby-killer-whales-pictures.html#post698613\nhttp://www.physiologiccells.com/forum/index.php?topic=17575.new#new\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7773, "cpu_time_ms": 88, "memory_kb": 7780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s561021930", "group_id": "codeNet:p03941", "input_text": "Avoid driving, using machines, or doing some other activity which needs alertness. weight loss tips dr oz <a href=http://haupromringfilm.tk/post/weight-loss-with-green-tea-reviews >weight loss with green tea reviews</a> and how good are t5 fat burners <a href=http://makeryun.com.cn/space-uid-14929.html >slimming hairstyles 2018</a> \n<a href=http://c.junmi360.com/home.php?mod=space&uid=20979&do=profile >cellucor weight loss powder reviews</a> jillian fat burner does it work <a href=http://haupromringfilm.tk/post/workout-program-to-lose-weight-pdf >workout program to lose weight pdf</a> and walk 3 miles a day to lose weight  <a href=http://harwooj.co.uk/Epsommm/member.php?action=profile&uid=3199 >diet plan whole foods</a> \nhoney badger fat burner <a href=http://ruby5288.com/forum.php?mod=viewthread&tid=169820&extra= >diet plan boxer</a> which fruit is better for weight loss", "language": "Lisp", "metadata": {"date": 1546265231, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s561021930.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s561021930", "user_id": "u794886383"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Avoid driving, using machines, or doing some other activity which needs alertness. weight loss tips dr oz <a href=http://haupromringfilm.tk/post/weight-loss-with-green-tea-reviews >weight loss with green tea reviews</a> and how good are t5 fat burners <a href=http://makeryun.com.cn/space-uid-14929.html >slimming hairstyles 2018</a> \n<a href=http://c.junmi360.com/home.php?mod=space&uid=20979&do=profile >cellucor weight loss powder reviews</a> jillian fat burner does it work <a href=http://haupromringfilm.tk/post/workout-program-to-lose-weight-pdf >workout program to lose weight pdf</a> and walk 3 miles a day to lose weight  <a href=http://harwooj.co.uk/Epsommm/member.php?action=profile&uid=3199 >diet plan whole foods</a> \nhoney badger fat burner <a href=http://ruby5288.com/forum.php?mod=viewthread&tid=169820&extra= >diet plan boxer</a> which fruit is better for weight loss", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 884, "cpu_time_ms": 78, "memory_kb": 8040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s273067308", "group_id": "codeNet:p03941", "input_text": "In the evening we strolled in the Casino Terrace, and heard some good music by Spohr and Mackenzie, and went to bed early. \n<a href=https://shesan.info/oh-mythe.html>Oh mythe</a>  <a href=https://shesan.info/bulldog-kansas-city.html>bulldog kansas city</a>   Soup of the evening, beautiful Soup!   <a href=https://robinverse.info/wfn-pbp-wfn.html>wfn pbp wfn</a>  <a href=https://megamix2019.info/katie-mcgrath-online.html>katie mcgrath online</a>   I tell you she had nothing to do with me.  <a href=https://shesan.info/39-weeks-pregnant-back-pain-on-right-side.html>39 weeks pregnant back pain on right side</a>  <a href=https://games-memo.info/boondocks-youtube.html>boondocks youtube</a>   And, before the spell could be wrought further upon me, I had nerved myself to my wild work. \n<a href=https://art-galleries.info/men-getting-undressed.html>men getting undressed</a>  <a href=https://games-memo.info/glock-19-full-auto-conversion.html>glock 19 full auto conversion</a>   Was there any chance of shooting the lock off the door and getting both of them before they got him?   <a href=https://games-memo.info/warrant-officer-mos-list.html>warrant officer mos list</a>  I was staggered, but I knew that if he wished to delay he had a good reason for it.   A thin string of saliva crept from the open mouth and hung down from the chin.  <a href=https://megamix2019.info/tess-taylor-tattoos.html>tess taylor tattoos</a>  <a href=https://megamix2019.info/keeshond-jedi.html>keeshond jedi</a>   <a href=https://games-memo.info/convert-rar-files-to-mp3.html>Convert rar files to mp3</a> \n<a href=https://megamix2019.info/photosynthesis-worksheets-for-high-school.html>photosynthesis worksheets for high school</a>  <a href=https://megamix2019.info/eva-pigford-lance-gross.html>eva pigford lance gross</a>   Every stitch had been cut to ribbons in the search for the forty million francs.   <a href=https://games-memo.info/hiei-love-story.html>hiei love story</a>  <a href=https://megamix2019.info/working-model-of-maglev-train.html>working model of maglev train</a>   Even the long purpling bruises down Bonds left shoulder and side ceased to throb, and when the Swede had gone Bond fell into a dreamless sleep.  <a href=https://games-memo.info/binweevils-mulch-maker.html>Binweevils mulch maker</a>  <a href=https://robinverse.info/modern-chemistry-holt-chapter-13-book.html>Modern chemistry holt chapter 13 book</a>   Beyond this we know nothing whatever of him. \n<a href=https://games-memo.info/free-templates-for-recommendation-letters.html>Free templates for recommendation letters</a>  <a href=https://games-memo.info/guitar-hero-online-free.html>Guitar hero online free</a>   Yes, but some crumbs must have got in as well, the Hatter grumbled: you shouldnt have put it in with the bread-knife.   <a href=https://shesan.info/hesi-test-questions.html>hesi test questions</a>  I tried to pacify her, and at last succeeded, and she lay quiet.   He explained that he was expected back at his hotel to have lunch with friends.  <a href=https://art-galleries.info/free-europe-ontline-printout.html>Free europe ontline printout</a>  <a href=https://megamix2019.info/abyssinian-church.html>abyssinian church</a>   <a href=https://robinverse.info/harrier-bird.html>harrier bird</a> \n<a href=https://megamix2019.info/philadelphia-orphans-court-docket.html>philadelphia orphans court docket</a>  <a href=https://robinverse.info/taliban-movie.html>taliban movie</a>   Whats he spend it on besides that?   <a href=https://shesan.info/gifts-for-the-holiday.html>gifts for the holiday</a>  <a href=https://art-galleries.info/free-ripple-afghan-patterns.html>Free ripple afghan patterns</a>   Not a dead branch-not a withered leaf-not a stray pebble-not a patch of the brown earth was anywhere visible.  <a href=https://games-memo.info/beagle-1000-genomes.html>beagle 1000 genomes</a>  <a href=https://megamix2019.info/famous-toons-facial-game.html>famous toons facial game</a>   Once you had come in through either of these, whether you wanted to buy a paper or cigarettes at the news stand, have a drink or a meal in one of the two restaurants, get your hair cut or have a. \n<a href=https://megamix2019.info/what-cat-are-you-quiz.html>what cat are you quiz</a>  <a href=https://games-memo.info/virtual-spine-surgery-game.html>Virtual spine surgery game</a>   Thats about it, Bond smiled down at her.   <a href=https://shesan.info/norwegian-buhund-scotland.html>norwegian buhund scotland</a>  The revolution itself must, of course, have taken place in an easy and gradual manner, and it is by no means clear that, had I even been awake at the time of the occurrence, I should have been made aware of it by any internal evidence of an inversion-that is to say, by any inconvenience or disarrangement, either about my person or about my apparatus.   Dont give me that crap, said Mr Spang flatly.  <a href=https://games-memo.info/anderson-sc-class-a-motor-homes-for-sale.html>Anderson sc class a motor homes for sale</a>  <a href=https://megamix2019.info/lab-bench-respiration.html>lab bench respiration</a>   <a href=https://art-galleries.info/the-outsiders-book-online.html>the outsiders book online</a> \n<a href=https://megamix2019.info/solar-water-fountain-for-yards.html>solar water fountain for yards</a>  <a href=https://art-galleries.info/bluegrass-music-radio-stations.html>bluegrass music radio stations</a>   As the sun went down, the gale freshened into an absolute hurricane, and the ocean beneath was clearly visible on account of its phosphorescence.   <a href=https://shesan.info/how-to-make-a-gift-bow.html>How to make a gift bow</a>  <a href=https://robinverse.info/country-kitchen-cabinets.html>country kitchen cabinets</a>   So youre one of those old-fashioned men who like sleeping with women.  <a href=https://megamix2019.info/videos-de-sexo-de-tia-sovrino.html>Videos de sexo de tia sovrino</a>  <a href=https://art-galleries.info/od-versus-os.html>od versus os</a>   Im putting her up in my flat. \n<a href=https://megamix2019.info/lady-basketball-team-names.html>lady basketball team names</a>  <a href=https://art-galleries.info/2011-clothes-styles.html>2011 clothes styles</a>   She jerked her head towards the bathroom door.   <a href=https://robinverse.info/find-g-spot-pictures.html>find g spot pictures</a>  The Jersey Lily used to be around there a lot, your Lily Langtry.   I have made many observations lately upon the structure of the vessel.  <a href=https://megamix2019.info/ving.html>Ving</a>  <a href=https://games-memo.info/f-shekan.html>F shekan</a>   <a href=https://games-memo.info/advanced-origami-boat.html>Advanced origami boat</a> \n<a href=https://shesan.info/expansioncom-stewart-swerdlow.html>expansion.com stewart swerdlow</a>  <a href=https://megamix2019.info/swf-game-index.html>swf game index</a>   If the time ever come, shall be, leagued with your enemy against you.   <a href=https://shesan.info/external-harddrive-recover-sclient-psy-ab.html>External harddrive recover sclient psy-ab</a>  <a href=https://art-galleries.info/esurance-tv-commercial-cast.html>Esurance tv commercial cast</a>   It hangs like moss upon the vaults.  <a href=https://megamix2019.info/cavalier-king-charles-spaniel-rescue-california.html>cavalier king charles spaniel rescue california</a>  <a href=https://art-galleries.info/sample-cover-letters-for-medical-assistant-beginner.html>Sample cover letters for medical assistant beginner</a>   This hideous murder accomplished, I set myself forthwith, and with entire deliberation, to the task of concealing the body. \n<a href=https://games-memo.info/example-of-letters-of-recommendation-for-nursing-school.html>Example of letters of recommendation for nursing school</a>  <a href=https://shesan.info/homogeneous-echotexture-of-liver.html>homogeneous echotexture of liver</a>   Do you not perceive that the animal has the visage of a man?   <a href=https://games-memo.info/college-bucket-list-for-girls.html>College bucket list for girls</a>  The gardens were spruced and the fountains played again and the two main hotels, the Splendide and the Hermitage, were prinked and furbished and restaffed.   By that time he had thought of another song.  <a href=https://shesan.info/free-printable-spring-stationary.html>free printable spring stationary</a>  <a href=https://art-galleries.info/black-hair-layered-bob.html>black hair layered bob</a>   <a href=https://art-galleries.info/tarrant-central-appraisal-district.html>tarrant central appraisal district</a> \n<a href=https://megamix2019.info/miss-illinois-voy.html>miss illinois voy</a>  <a href=https://megamix2019.info/mobile-phone-wallpapers.html>mobile phone wallpapers</a>   For it is not the least of its terrors that this evil thing is rooted deep in all good, in soil barren of holy memories it cannot rest.   <a href=https://art-galleries.info/quotes-for-people-to-mind-their-own-business.html>Quotes for people to mind their own business</a>  <a href=https://robinverse.info/cheapest-real-estate-in-usa.html>cheapest real estate in usa</a>   They came to the tip of the sandspit, twenty yards from the clearing.  <a href=https://megamix2019.info/high-school-reunion-survey.html>High school reunion survey</a>  <a href=https://shesan.info/online-associate-degree-rn.html>Online associate degree rn</a>   We must get to the end of the station. \n<a href=https://megamix2019.info/falling-up-poems.html>falling up poems</a>  <a href=https://art-galleries.info/bearded-collie-size.html>bearded collie size</a>   Its a good gun, sir, Bond admitted.   <a href=https://megamix2019.info/bengal-jewelry.html>bengal jewelry</a>  And at the end of the week Christopher Robin said, Now!   Over them a thick froth of birds tossed and settled and tossed again.  <a href=https://robinverse.info/joe-butts-blue-heeler-puppies-for-sale-in-tennessee.html>Joe butts blue heeler puppies for sale in tennessee</a>  <a href=https://art-galleries.info/senior-girl-shirts-2012-slogans.html>Senior girl shirts 2012 slogans</a>   <a href=https://robinverse.info/spring-flower-bulbs.html>spring flower bulbs</a> \n<a href=https://megamix2019.info/real-chanel-logo-earrings.html>real chanel logo earrings</a>  <a href=https://shesan.info/interior-designers-directory.html>interior designers directory</a>   We were all now anxious to test the efficiency of the rudder and screw, and we put them both into requisition forthwith, for the purpose of altering our direction more to the eastward, and in a line for Paris.   <a href=https://megamix2019.info/chinese-crested-skin-rash.html>chinese crested skin rash</a>  <a href=https://art-galleries.info/the-meaning-of-third-world-debt.html>the meaning of third world debt</a>   Before we went to prepare for dinner he said to Mrs.  <a href=https://robinverse.info/example-research-proposal-criminal-justice.html>Example research proposal criminal justice</a>  <a href=https://shesan.info/senior-class-of-2010-sayings.html>Senior class of 2010 sayings</a>   In the interests of State Security, I waited three minutes before obeying the order. \n<a href=https://art-galleries.info/flobots-handlebars-beemp3.html>flobots handlebars beemp3</a>  <a href=https://shesan.info/meningitis-pictures-of-rash.html>meningitis pictures of rash</a>   Then came a gas station with an elegant drive-in restaurant.   <a href=https://shesan.info/1968-camaro-specs.html>1968 camaro specs</a>  I will not pursue these guesses-for I have no right to call them more-since the shades of reflection upon which they are based are scarcely of sufficient depth to be appreciable by my own intellect, and since I could not pretend to make them intelligible to the understanding of another.   It was fine to feel the heavy cold metal against his skin.  <a href=https://robinverse.info/stampin-up-ornament-punch.html>Stampin up ornament punch</a>  <a href=https://robinverse.info/mujra-nida.html>mujra nida</a>   <a href=https://robinverse.info/malbytes-anti-virus.html>malbytes anti virus</a> \n<a href=https://shesan.info/best-dtim-period.html>Best dtim period</a>  <a href=https://art-galleries.info/band-seating-chart.html>band seating chart</a>   Was it not Socrates who said that the statuary found his statue in the block of marble?   <a href=https://art-galleries.info/bali-60-day-visa.html>bali 60 day visa</a>  <a href=https://art-galleries.info/katy-texas-white-pages.html>katy texas white pages</a>   It seems like a profanation of the word to write it in connection with such a monster, so I asked him pointblank, Why may I not go tonight?  <a href=https://shesan.info/2-girls-1-cup-original-for-iphone-girls-1-cup-original-for-iphone.html>2 girls 1 cup original for iphone girls 1 cup original for iphone</a>  <a href=https://shesan.info/bradley-font-free.html>bradley font free</a>   We may, however, presume he would not have adopted it but for some occasion of especial state. \n<a href=https://art-galleries.info/pampered-poodle-4-u.html>pampered poodle 4 u</a>  <a href=https://robinverse.info/briard-shedding.html>briard shedding</a>   Bond saw his knee go up under the table.   <a href=https://art-galleries.info/kuvasz-health-issues.html>kuvasz health issues</a>  Upon the door being opened, Mademoiselle L.   What broad and rapid river is that which forces its way, with innumerable falls, through the mountainous wilderness, and finally through the wilderness of buildings?  <a href=https://robinverse.info/chartreux-71.html>chartreux 71</a>  <a href=https://shesan.info/wiimote-pc-software.html>wiimote pc software</a>   <a href=https://games-memo.info/observation-inference-worksheet.html>observation inference worksheet</a> \n<a href=https://art-galleries.info/michigan-online-police-scanner.html>Michigan online police scanner</a>  <a href=https://robinverse.info/william-samuel-johnson-quotes.html>william samuel johnson quotes</a>   Bond said sharply, Leave the girl alone.   <a href=https://robinverse.info/irina-ionesco.html>Irina ionesco</a>  <a href=https://art-galleries.info/ask-jolene-blog.html>ask jolene blog</a>   What did you say his name was?  <a href=https://shesan.info/i-864-sample-letter.html>i 864 sample letter</a>  <a href=https://games-memo.info/babylon-s-hanging-garden.html>Babylon s hanging garden</a>   I write this now as I am not sleepy, though I must try again. \n<a href=https://art-galleries.info/chinese-shar-pei-breed-standard.html>chinese shar-pei breed standard</a>  <a href=https://shesan.info/ragdoll-names.html>ragdoll names</a>   This time, after going to the far side or the Pass, he suddenly turned down a narrow roadway which ran sharply to the right.   <a href=https://art-galleries.info/ohio-youth-wrestling-association.html>ohio youth wrestling association</a>  He followed cautiously, but when he got to bows found no one, and the hatchways were all closed.   I slewed round a little, so as to see Lucy well without seeming to stare at her, and saw that she was in a half dreamy state, with an odd look on her face that I could not quite make out, so I said nothing, but followed her eyes.  <a href=https://games-memo.info/exhaust-manifold-tubing.html>exhaust manifold tubing</a>  <a href=https://games-memo.info/evil-leprechaun-costume.html>evil leprechaun costume</a>   <a href=https://robinverse.info/most-popular-cookbooks.html>most popular cookbooks</a> \n<a href=https://megamix2019.info/mana-spanish-rock-band.html>mana spanish rock band</a>  <a href=https://art-galleries.info/end-times-prophecy.html>End times prophecy</a>   Owl looked at the notice again.   <a href=https://shesan.info/maine-coon-illinois.html>maine coon illinois</a>  <a href=https://games-memo.info/creampie-roulette.html>Creampie roulette</a>   They were made by Miss Lucy!  <a href=https://megamix2019.info/chesapeake-bay-retriever-qubec.html>chesapeake bay retriever quv©bec</a>  <a href=https://games-memo.info/valentines-gifts-flowers.html>valentines gifts flowers</a>   How much of the tales about them were myth? \n<a href=https://art-galleries.info/bible-business-names.html>bible business names</a>  <a href=https://robinverse.info/frog-tattoo-designs.html>frog tattoo designs</a>   He went out and closed the door.   <a href=https://art-galleries.info/types-of-boxwood.html>types of boxwood</a>  So, at least I thought: but I had not counted upon the extent of the dungeon, or upon my own weakness.   Yes, his hair was standing on end.  <a href=https://art-galleries.info/making-a-pvc-train-horn.html>Making a pvc train horn</a>  <a href=https://robinverse.info/outdoor-camping-stores.html>outdoor camping stores</a>   <a href=https://shesan.info/hp-nc6020.html>Hp nc6020</a> \n<a href=https://games-memo.info/how-to-do-a-cold-water-extraction-of-op-20.html>How to do a cold water extraction of op 20</a>  <a href=https://megamix2019.info/temple-fade-haircut-pictures.html>Temple fade haircut pictures</a>   And until he have the purpose to do more, he continue to do the same again every time, just as he have done before!   <a href=https://art-galleries.info/lpn-resume-objectives.html>Lpn resume objectives</a>  <a href=https://shesan.info/wound-vac-wikipedia.html>wound vac wikipedia</a>   One part was the hem of the frock and it had been mended.  <a href=https://games-memo.info/when-do-women-ovulate-in-their-cycle.html>When do women ovulate in their cycle</a>  <a href=https://megamix2019.info/koder-til-gta-san-andreas.html>Koder til gta san andreas</a>   They both, however, kept their courage, and remained silent and quiet. \n<a href=https://shesan.info/cairn-terrier-16-weeks.html>cairn terrier 16 weeks</a>  <a href=https://shesan.info/intel-p985h-motherboard.html>Intel p985h motherboard</a>   Just before sinking within the turgid sea, its central fires suddenly went out, as if hurriedly extinguished by some unaccountable power.   <a href=https://megamix2019.info/temas-de-snoopy-para-blackberry-9800.html>Temas de snoopy para blackberry 9800</a>  An A, said Rabbit, but not a very good one.   Strips of white sodium lighting ran along the ceiling.  <a href=https://art-galleries.info/crip-alphabet.html>crip alphabet</a>  <a href=https://art-galleries.info/purchase-plants-online.html>purchase plants online</a>   <a href=https://shesan.info/skyler-loans-scam.html>skyler loans scam</a> \n<a href=https://megamix2019.info/chanel-bag-price.html>chanel bag price</a>  <a href=https://megamix2019.info/pomeranian-kennel-cough.html>pomeranian kennel cough</a>   The blue flames would be coming from some kind of an after-burner.   <a href=https://megamix2019.info/belgian-malinois-8-months.html>belgian malinois 8 months</a>  <a href=https://megamix2019.info/celiera-mini-split.html>celiera mini split</a>   Tatiana clapped a hand over her mouth as much to stifle the use of Gods name as from terror.  <a href=https://games-memo.info/persian-literature.html>persian literature</a>  <a href=https://art-galleries.info/korat-mix.html>korat mix</a>   Nobody could see on a day like this, Roo, said Rabbit.", "language": "Lisp", "metadata": {"date": 1546235694, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s273067308.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s273067308", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "In the evening we strolled in the Casino Terrace, and heard some good music by Spohr and Mackenzie, and went to bed early. \n<a href=https://shesan.info/oh-mythe.html>Oh mythe</a>  <a href=https://shesan.info/bulldog-kansas-city.html>bulldog kansas city</a>   Soup of the evening, beautiful Soup!   <a href=https://robinverse.info/wfn-pbp-wfn.html>wfn pbp wfn</a>  <a href=https://megamix2019.info/katie-mcgrath-online.html>katie mcgrath online</a>   I tell you she had nothing to do with me.  <a href=https://shesan.info/39-weeks-pregnant-back-pain-on-right-side.html>39 weeks pregnant back pain on right side</a>  <a href=https://games-memo.info/boondocks-youtube.html>boondocks youtube</a>   And, before the spell could be wrought further upon me, I had nerved myself to my wild work. \n<a href=https://art-galleries.info/men-getting-undressed.html>men getting undressed</a>  <a href=https://games-memo.info/glock-19-full-auto-conversion.html>glock 19 full auto conversion</a>   Was there any chance of shooting the lock off the door and getting both of them before they got him?   <a href=https://games-memo.info/warrant-officer-mos-list.html>warrant officer mos list</a>  I was staggered, but I knew that if he wished to delay he had a good reason for it.   A thin string of saliva crept from the open mouth and hung down from the chin.  <a href=https://megamix2019.info/tess-taylor-tattoos.html>tess taylor tattoos</a>  <a href=https://megamix2019.info/keeshond-jedi.html>keeshond jedi</a>   <a href=https://games-memo.info/convert-rar-files-to-mp3.html>Convert rar files to mp3</a> \n<a href=https://megamix2019.info/photosynthesis-worksheets-for-high-school.html>photosynthesis worksheets for high school</a>  <a href=https://megamix2019.info/eva-pigford-lance-gross.html>eva pigford lance gross</a>   Every stitch had been cut to ribbons in the search for the forty million francs.   <a href=https://games-memo.info/hiei-love-story.html>hiei love story</a>  <a href=https://megamix2019.info/working-model-of-maglev-train.html>working model of maglev train</a>   Even the long purpling bruises down Bonds left shoulder and side ceased to throb, and when the Swede had gone Bond fell into a dreamless sleep.  <a href=https://games-memo.info/binweevils-mulch-maker.html>Binweevils mulch maker</a>  <a href=https://robinverse.info/modern-chemistry-holt-chapter-13-book.html>Modern chemistry holt chapter 13 book</a>   Beyond this we know nothing whatever of him. \n<a href=https://games-memo.info/free-templates-for-recommendation-letters.html>Free templates for recommendation letters</a>  <a href=https://games-memo.info/guitar-hero-online-free.html>Guitar hero online free</a>   Yes, but some crumbs must have got in as well, the Hatter grumbled: you shouldnt have put it in with the bread-knife.   <a href=https://shesan.info/hesi-test-questions.html>hesi test questions</a>  I tried to pacify her, and at last succeeded, and she lay quiet.   He explained that he was expected back at his hotel to have lunch with friends.  <a href=https://art-galleries.info/free-europe-ontline-printout.html>Free europe ontline printout</a>  <a href=https://megamix2019.info/abyssinian-church.html>abyssinian church</a>   <a href=https://robinverse.info/harrier-bird.html>harrier bird</a> \n<a href=https://megamix2019.info/philadelphia-orphans-court-docket.html>philadelphia orphans court docket</a>  <a href=https://robinverse.info/taliban-movie.html>taliban movie</a>   Whats he spend it on besides that?   <a href=https://shesan.info/gifts-for-the-holiday.html>gifts for the holiday</a>  <a href=https://art-galleries.info/free-ripple-afghan-patterns.html>Free ripple afghan patterns</a>   Not a dead branch-not a withered leaf-not a stray pebble-not a patch of the brown earth was anywhere visible.  <a href=https://games-memo.info/beagle-1000-genomes.html>beagle 1000 genomes</a>  <a href=https://megamix2019.info/famous-toons-facial-game.html>famous toons facial game</a>   Once you had come in through either of these, whether you wanted to buy a paper or cigarettes at the news stand, have a drink or a meal in one of the two restaurants, get your hair cut or have a. \n<a href=https://megamix2019.info/what-cat-are-you-quiz.html>what cat are you quiz</a>  <a href=https://games-memo.info/virtual-spine-surgery-game.html>Virtual spine surgery game</a>   Thats about it, Bond smiled down at her.   <a href=https://shesan.info/norwegian-buhund-scotland.html>norwegian buhund scotland</a>  The revolution itself must, of course, have taken place in an easy and gradual manner, and it is by no means clear that, had I even been awake at the time of the occurrence, I should have been made aware of it by any internal evidence of an inversion-that is to say, by any inconvenience or disarrangement, either about my person or about my apparatus.   Dont give me that crap, said Mr Spang flatly.  <a href=https://games-memo.info/anderson-sc-class-a-motor-homes-for-sale.html>Anderson sc class a motor homes for sale</a>  <a href=https://megamix2019.info/lab-bench-respiration.html>lab bench respiration</a>   <a href=https://art-galleries.info/the-outsiders-book-online.html>the outsiders book online</a> \n<a href=https://megamix2019.info/solar-water-fountain-for-yards.html>solar water fountain for yards</a>  <a href=https://art-galleries.info/bluegrass-music-radio-stations.html>bluegrass music radio stations</a>   As the sun went down, the gale freshened into an absolute hurricane, and the ocean beneath was clearly visible on account of its phosphorescence.   <a href=https://shesan.info/how-to-make-a-gift-bow.html>How to make a gift bow</a>  <a href=https://robinverse.info/country-kitchen-cabinets.html>country kitchen cabinets</a>   So youre one of those old-fashioned men who like sleeping with women.  <a href=https://megamix2019.info/videos-de-sexo-de-tia-sovrino.html>Videos de sexo de tia sovrino</a>  <a href=https://art-galleries.info/od-versus-os.html>od versus os</a>   Im putting her up in my flat. \n<a href=https://megamix2019.info/lady-basketball-team-names.html>lady basketball team names</a>  <a href=https://art-galleries.info/2011-clothes-styles.html>2011 clothes styles</a>   She jerked her head towards the bathroom door.   <a href=https://robinverse.info/find-g-spot-pictures.html>find g spot pictures</a>  The Jersey Lily used to be around there a lot, your Lily Langtry.   I have made many observations lately upon the structure of the vessel.  <a href=https://megamix2019.info/ving.html>Ving</a>  <a href=https://games-memo.info/f-shekan.html>F shekan</a>   <a href=https://games-memo.info/advanced-origami-boat.html>Advanced origami boat</a> \n<a href=https://shesan.info/expansioncom-stewart-swerdlow.html>expansion.com stewart swerdlow</a>  <a href=https://megamix2019.info/swf-game-index.html>swf game index</a>   If the time ever come, shall be, leagued with your enemy against you.   <a href=https://shesan.info/external-harddrive-recover-sclient-psy-ab.html>External harddrive recover sclient psy-ab</a>  <a href=https://art-galleries.info/esurance-tv-commercial-cast.html>Esurance tv commercial cast</a>   It hangs like moss upon the vaults.  <a href=https://megamix2019.info/cavalier-king-charles-spaniel-rescue-california.html>cavalier king charles spaniel rescue california</a>  <a href=https://art-galleries.info/sample-cover-letters-for-medical-assistant-beginner.html>Sample cover letters for medical assistant beginner</a>   This hideous murder accomplished, I set myself forthwith, and with entire deliberation, to the task of concealing the body. \n<a href=https://games-memo.info/example-of-letters-of-recommendation-for-nursing-school.html>Example of letters of recommendation for nursing school</a>  <a href=https://shesan.info/homogeneous-echotexture-of-liver.html>homogeneous echotexture of liver</a>   Do you not perceive that the animal has the visage of a man?   <a href=https://games-memo.info/college-bucket-list-for-girls.html>College bucket list for girls</a>  The gardens were spruced and the fountains played again and the two main hotels, the Splendide and the Hermitage, were prinked and furbished and restaffed.   By that time he had thought of another song.  <a href=https://shesan.info/free-printable-spring-stationary.html>free printable spring stationary</a>  <a href=https://art-galleries.info/black-hair-layered-bob.html>black hair layered bob</a>   <a href=https://art-galleries.info/tarrant-central-appraisal-district.html>tarrant central appraisal district</a> \n<a href=https://megamix2019.info/miss-illinois-voy.html>miss illinois voy</a>  <a href=https://megamix2019.info/mobile-phone-wallpapers.html>mobile phone wallpapers</a>   For it is not the least of its terrors that this evil thing is rooted deep in all good, in soil barren of holy memories it cannot rest.   <a href=https://art-galleries.info/quotes-for-people-to-mind-their-own-business.html>Quotes for people to mind their own business</a>  <a href=https://robinverse.info/cheapest-real-estate-in-usa.html>cheapest real estate in usa</a>   They came to the tip of the sandspit, twenty yards from the clearing.  <a href=https://megamix2019.info/high-school-reunion-survey.html>High school reunion survey</a>  <a href=https://shesan.info/online-associate-degree-rn.html>Online associate degree rn</a>   We must get to the end of the station. \n<a href=https://megamix2019.info/falling-up-poems.html>falling up poems</a>  <a href=https://art-galleries.info/bearded-collie-size.html>bearded collie size</a>   Its a good gun, sir, Bond admitted.   <a href=https://megamix2019.info/bengal-jewelry.html>bengal jewelry</a>  And at the end of the week Christopher Robin said, Now!   Over them a thick froth of birds tossed and settled and tossed again.  <a href=https://robinverse.info/joe-butts-blue-heeler-puppies-for-sale-in-tennessee.html>Joe butts blue heeler puppies for sale in tennessee</a>  <a href=https://art-galleries.info/senior-girl-shirts-2012-slogans.html>Senior girl shirts 2012 slogans</a>   <a href=https://robinverse.info/spring-flower-bulbs.html>spring flower bulbs</a> \n<a href=https://megamix2019.info/real-chanel-logo-earrings.html>real chanel logo earrings</a>  <a href=https://shesan.info/interior-designers-directory.html>interior designers directory</a>   We were all now anxious to test the efficiency of the rudder and screw, and we put them both into requisition forthwith, for the purpose of altering our direction more to the eastward, and in a line for Paris.   <a href=https://megamix2019.info/chinese-crested-skin-rash.html>chinese crested skin rash</a>  <a href=https://art-galleries.info/the-meaning-of-third-world-debt.html>the meaning of third world debt</a>   Before we went to prepare for dinner he said to Mrs.  <a href=https://robinverse.info/example-research-proposal-criminal-justice.html>Example research proposal criminal justice</a>  <a href=https://shesan.info/senior-class-of-2010-sayings.html>Senior class of 2010 sayings</a>   In the interests of State Security, I waited three minutes before obeying the order. \n<a href=https://art-galleries.info/flobots-handlebars-beemp3.html>flobots handlebars beemp3</a>  <a href=https://shesan.info/meningitis-pictures-of-rash.html>meningitis pictures of rash</a>   Then came a gas station with an elegant drive-in restaurant.   <a href=https://shesan.info/1968-camaro-specs.html>1968 camaro specs</a>  I will not pursue these guesses-for I have no right to call them more-since the shades of reflection upon which they are based are scarcely of sufficient depth to be appreciable by my own intellect, and since I could not pretend to make them intelligible to the understanding of another.   It was fine to feel the heavy cold metal against his skin.  <a href=https://robinverse.info/stampin-up-ornament-punch.html>Stampin up ornament punch</a>  <a href=https://robinverse.info/mujra-nida.html>mujra nida</a>   <a href=https://robinverse.info/malbytes-anti-virus.html>malbytes anti virus</a> \n<a href=https://shesan.info/best-dtim-period.html>Best dtim period</a>  <a href=https://art-galleries.info/band-seating-chart.html>band seating chart</a>   Was it not Socrates who said that the statuary found his statue in the block of marble?   <a href=https://art-galleries.info/bali-60-day-visa.html>bali 60 day visa</a>  <a href=https://art-galleries.info/katy-texas-white-pages.html>katy texas white pages</a>   It seems like a profanation of the word to write it in connection with such a monster, so I asked him pointblank, Why may I not go tonight?  <a href=https://shesan.info/2-girls-1-cup-original-for-iphone-girls-1-cup-original-for-iphone.html>2 girls 1 cup original for iphone girls 1 cup original for iphone</a>  <a href=https://shesan.info/bradley-font-free.html>bradley font free</a>   We may, however, presume he would not have adopted it but for some occasion of especial state. \n<a href=https://art-galleries.info/pampered-poodle-4-u.html>pampered poodle 4 u</a>  <a href=https://robinverse.info/briard-shedding.html>briard shedding</a>   Bond saw his knee go up under the table.   <a href=https://art-galleries.info/kuvasz-health-issues.html>kuvasz health issues</a>  Upon the door being opened, Mademoiselle L.   What broad and rapid river is that which forces its way, with innumerable falls, through the mountainous wilderness, and finally through the wilderness of buildings?  <a href=https://robinverse.info/chartreux-71.html>chartreux 71</a>  <a href=https://shesan.info/wiimote-pc-software.html>wiimote pc software</a>   <a href=https://games-memo.info/observation-inference-worksheet.html>observation inference worksheet</a> \n<a href=https://art-galleries.info/michigan-online-police-scanner.html>Michigan online police scanner</a>  <a href=https://robinverse.info/william-samuel-johnson-quotes.html>william samuel johnson quotes</a>   Bond said sharply, Leave the girl alone.   <a href=https://robinverse.info/irina-ionesco.html>Irina ionesco</a>  <a href=https://art-galleries.info/ask-jolene-blog.html>ask jolene blog</a>   What did you say his name was?  <a href=https://shesan.info/i-864-sample-letter.html>i 864 sample letter</a>  <a href=https://games-memo.info/babylon-s-hanging-garden.html>Babylon s hanging garden</a>   I write this now as I am not sleepy, though I must try again. \n<a href=https://art-galleries.info/chinese-shar-pei-breed-standard.html>chinese shar-pei breed standard</a>  <a href=https://shesan.info/ragdoll-names.html>ragdoll names</a>   This time, after going to the far side or the Pass, he suddenly turned down a narrow roadway which ran sharply to the right.   <a href=https://art-galleries.info/ohio-youth-wrestling-association.html>ohio youth wrestling association</a>  He followed cautiously, but when he got to bows found no one, and the hatchways were all closed.   I slewed round a little, so as to see Lucy well without seeming to stare at her, and saw that she was in a half dreamy state, with an odd look on her face that I could not quite make out, so I said nothing, but followed her eyes.  <a href=https://games-memo.info/exhaust-manifold-tubing.html>exhaust manifold tubing</a>  <a href=https://games-memo.info/evil-leprechaun-costume.html>evil leprechaun costume</a>   <a href=https://robinverse.info/most-popular-cookbooks.html>most popular cookbooks</a> \n<a href=https://megamix2019.info/mana-spanish-rock-band.html>mana spanish rock band</a>  <a href=https://art-galleries.info/end-times-prophecy.html>End times prophecy</a>   Owl looked at the notice again.   <a href=https://shesan.info/maine-coon-illinois.html>maine coon illinois</a>  <a href=https://games-memo.info/creampie-roulette.html>Creampie roulette</a>   They were made by Miss Lucy!  <a href=https://megamix2019.info/chesapeake-bay-retriever-qubec.html>chesapeake bay retriever quv©bec</a>  <a href=https://games-memo.info/valentines-gifts-flowers.html>valentines gifts flowers</a>   How much of the tales about them were myth? \n<a href=https://art-galleries.info/bible-business-names.html>bible business names</a>  <a href=https://robinverse.info/frog-tattoo-designs.html>frog tattoo designs</a>   He went out and closed the door.   <a href=https://art-galleries.info/types-of-boxwood.html>types of boxwood</a>  So, at least I thought: but I had not counted upon the extent of the dungeon, or upon my own weakness.   Yes, his hair was standing on end.  <a href=https://art-galleries.info/making-a-pvc-train-horn.html>Making a pvc train horn</a>  <a href=https://robinverse.info/outdoor-camping-stores.html>outdoor camping stores</a>   <a href=https://shesan.info/hp-nc6020.html>Hp nc6020</a> \n<a href=https://games-memo.info/how-to-do-a-cold-water-extraction-of-op-20.html>How to do a cold water extraction of op 20</a>  <a href=https://megamix2019.info/temple-fade-haircut-pictures.html>Temple fade haircut pictures</a>   And until he have the purpose to do more, he continue to do the same again every time, just as he have done before!   <a href=https://art-galleries.info/lpn-resume-objectives.html>Lpn resume objectives</a>  <a href=https://shesan.info/wound-vac-wikipedia.html>wound vac wikipedia</a>   One part was the hem of the frock and it had been mended.  <a href=https://games-memo.info/when-do-women-ovulate-in-their-cycle.html>When do women ovulate in their cycle</a>  <a href=https://megamix2019.info/koder-til-gta-san-andreas.html>Koder til gta san andreas</a>   They both, however, kept their courage, and remained silent and quiet. \n<a href=https://shesan.info/cairn-terrier-16-weeks.html>cairn terrier 16 weeks</a>  <a href=https://shesan.info/intel-p985h-motherboard.html>Intel p985h motherboard</a>   Just before sinking within the turgid sea, its central fires suddenly went out, as if hurriedly extinguished by some unaccountable power.   <a href=https://megamix2019.info/temas-de-snoopy-para-blackberry-9800.html>Temas de snoopy para blackberry 9800</a>  An A, said Rabbit, but not a very good one.   Strips of white sodium lighting ran along the ceiling.  <a href=https://art-galleries.info/crip-alphabet.html>crip alphabet</a>  <a href=https://art-galleries.info/purchase-plants-online.html>purchase plants online</a>   <a href=https://shesan.info/skyler-loans-scam.html>skyler loans scam</a> \n<a href=https://megamix2019.info/chanel-bag-price.html>chanel bag price</a>  <a href=https://megamix2019.info/pomeranian-kennel-cough.html>pomeranian kennel cough</a>   The blue flames would be coming from some kind of an after-burner.   <a href=https://megamix2019.info/belgian-malinois-8-months.html>belgian malinois 8 months</a>  <a href=https://megamix2019.info/celiera-mini-split.html>celiera mini split</a>   Tatiana clapped a hand over her mouth as much to stifle the use of Gods name as from terror.  <a href=https://games-memo.info/persian-literature.html>persian literature</a>  <a href=https://art-galleries.info/korat-mix.html>korat mix</a>   Nobody could see on a day like this, Roo, said Rabbit.", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 18981, "cpu_time_ms": 62, "memory_kb": 6760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s348032992", "group_id": "codeNet:p03941", "input_text": "Hallo, Eeyore, they called out cheerfully. \n<a href=https://games-memo.info/chartreux-95.html>chartreux 95</a>  <a href=https://games-memo.info/2guys1horse-official-video.html>2guys1horse official video</a>   I do hope youre going to like it.   <a href=https://megamix2019.info/chihuahua-giving-birth.html>chihuahua giving birth</a>  <a href=https://megamix2019.info/naughty-birthday-cards-for-him.html>naughty birthday cards for him</a>   Bond handed his gun to Quarrel who sto.  <a href=https://robinverse.info/exotic-shorthair-gifts.html>exotic shorthair gifts</a>  <a href=https://robinverse.info/writing-styles-for-tattoos.html>Writing styles for tattoos</a>   As to the first, he evidently intended to arrive at Galatz, and sent invoice to Varna to deceive us lest we should ascertain his means of exit from England. \n<a href=https://shesan.info/cooking-classes-for-seniors.html>cooking classes for seniors</a>  <a href=https://art-galleries.info/weird-maker-symbols.html>weird maker symbols</a>   The only way of spending all that sterling, even suppose that those cheques are all good, which is doubtful, would be by smuggling it through under your suspender belt.   <a href=https://megamix2019.info/do-plumbers-charge-too-much.html>Do plumbers charge too much</a>  The journey may have had incidents.   As its blue-and-yellow tongue licked out, Bond, his blood singing with the battle, dived for the ground and for the gun at McGonigles feet.  <a href=https://art-galleries.info/pixie-bob-vancouver-wa.html>pixie bob vancouver wa</a>  <a href=https://robinverse.info/havana-brown-entrance.html>havana brown entrance</a>   <a href=https://art-galleries.info/anachid-islamia-2009.html>anachid islamia 2009</a> \n<a href=https://robinverse.info/vocabulary-workshop-level-f-pdf.html>Vocabulary workshop: level f pdf</a>  <a href=https://art-galleries.info/british-shorthair-yavrular.html>british shorthair yavrular?±</a>   We shall find these means multiplying and gathering distinctness as we proceed.   <a href=https://megamix2019.info/como-votar-nulo.html>Como votar nulo</a>  <a href=https://games-memo.info/university-louisiana.html>University louisiana</a>   There may be something I can use to my own chief the next time I want to get out of an unpleasant job.  <a href=https://robinverse.info/musica-durangese.html>musica durangese</a>  <a href=https://shesan.info/the-biggest-pitbull-in-jamaica.html>The biggest pitbull in jamaica</a>   It can blow the base of your spine off without a sound. \n<a href=https://megamix2019.info/wwwitt-techedu-student-portal.html>Www.itt-tech.edu student portal</a>  <a href=https://shesan.info/nursing-shift-report-sheet-templates.html>nursing shift report sheet templates</a>   It is as if some haunting presence were removed from me.   <a href=https://megamix2019.info/propieades-reposeidas-de-first-bank-puerto-rico.html>Propieades reposeidas de first bank puerto rico</a>  Even the madness of fright was not to them, so that they could break away.   I descended, minding carefully where I went for the stairs were dark, being only lit by loopholes in the heavy masonry.  <a href=https://shesan.info/potted-orchid-plants.html>potted orchid plants</a>  <a href=https://megamix2019.info/meaning-of-red-rose.html>meaning of red rose</a>   <a href=https://art-galleries.info/how-to-wish-happy-birthday-to-a-pregnant-woman.html>How to wish happy birthday to a pregnant woman</a> \n<a href=https://shesan.info/sunbeam-rice-cooker-instructions.html>sunbeam rice cooker instructions</a>  <a href=https://megamix2019.info/alvin-plantinga-wiki.html>alvin plantinga wiki</a>   A golden sheen of head and deep flank showed for an instant and was gone.   <a href=https://robinverse.info/christmas-right-left-game-story.html>christmas right left game story</a>  <a href=https://shesan.info/2011-gucci-handbags.html>2011 gucci handbags</a>   If he lost, nothing would matter.  <a href=https://games-memo.info/trolls-runescape-slayer.html>trolls runescape slayer</a>  <a href=https://shesan.info/rascal-flatts-az-lyrics.html>rascal flatts az lyrics</a>   He was about to take it out on the balcony when the telephone rang. \n<a href=https://games-memo.info/ares-para-black-berry.html>Ares para black berry</a>  <a href=https://shesan.info/tattoo-infection.html>tattoo infection</a>   For that very reason, said Owl, hoping that something helpful would happen soon.   <a href=https://megamix2019.info/toshiba-qosmio-recovery-disk.html>toshiba qosmio recovery disk</a>  I had turned to the right as I entered this road, and now, arising, I continued in the same direction.   The next time, said Piglet to Pooh.  <a href=https://shesan.info/caixa.html>Caixa</a>  <a href=https://games-memo.info/egyptian-mau-zchter.html>egyptian mau zv?chter</a>   <a href=https://shesan.info/buying-daffodils.html>buying daffodils</a> \n<a href=https://art-galleries.info/business-names-using-leaf.html>Business names using leaf</a>  <a href=https://megamix2019.info/grimsby-town-message-board.html>Grimsby town message board</a>   It stood poised for a second and then, with an elegant, disdainful swirl, the great swept-back tail came round and with a lightning quiver the shark had gone.   <a href=https://art-galleries.info/peaktop-ltd.html>peaktop ltd</a>  <a href=https://games-memo.info/exploding-pineapple-quilt-block.html>exploding pineapple quilt block</a>   Nor can I better define that peculiarity of spirit which seemed to place him so essentially apart from all other human beings, than by calling it a habit of intense and continual thought, pervading even his most trivial actions-intruding upon his moments of dalliance-and interweaving itself with his very flashes of merriment-like adders which writhe from out the eyes of the grinning masks in the cornices around the temples of Persepolis.  <a href=https://games-memo.info/versace-men-wallet.html>versace men wallet</a>  <a href=https://games-memo.info/cairn-terrier-florida.html>cairn terrier florida</a>   At the same time the thin man caught him a hard backhanded blow over the heart. \n<a href=https://shesan.info/dalmatian-kpop-simon.html>dalmatian kpop simon</a>  <a href=https://games-memo.info/enlarged-uvula-symptoms.html>enlarged uvula symptoms</a>   Whatever happened to dead people, there was surely one place for the warm and another for the cold.   <a href=https://megamix2019.info/cane-corso-temperament.html>cane corso temperament</a>  How to plot a graph of the will to survive, the tolerance of pain, the conquest of fear?   But do not mistake these mannerisms for bluff.  <a href=https://robinverse.info/kuvasz-rescue-texas.html>kuvasz rescue texas</a>  <a href=https://robinverse.info/respect-skits.html>Respect skits</a>   <a href=https://art-galleries.info/miami-anime-convention.html>miami anime convention</a> \n<a href=https://games-memo.info/guild-wars-factions-cd-key.html>Guild wars factions cd key</a>  <a href=https://megamix2019.info/intitle-toshiba-network-camera-user-login.html>Intitle: toshiba network camera user login</a>   Good-looker to judge from her photographs.   <a href=https://art-galleries.info/egyptian-mau-victoria-bc.html>egyptian mau victoria bc</a>  <a href=https://art-galleries.info/live-oak-resort.html>live oak resort</a>   At the door, Sister Lily rang.  <a href=https://robinverse.info/black-orchids-flowers.html>black orchids flowers</a>  <a href=https://shesan.info/credit-consommation-sans-document.html>Credit consommation sans document</a>   He shook his head sharply and focused his eyes. \n<a href=https://games-memo.info/car-auction-in-johannesburg.html>Car auction in johannesburg</a>  <a href=https://art-galleries.info/malware-antivirus-free.html>Malware antivirus free</a>   He slipped his hands down to her swelling buttocks and gripped them fiercely, pressing the centres of their bodies together.   <a href=https://art-galleries.info/house-water-system-diagram.html>House water system diagram</a>  Plays golf and will carry golf clubs.   She was only sixteen at the time.  <a href=https://shesan.info/contemporary-kitchen-remodel.html>contemporary kitchen remodel</a>  <a href=https://shesan.info/daniel-woodhead-company.html>daniel woodhead company</a>   <a href=https://shesan.info/easter-egg-hunt-rhymes.html>easter egg hunt rhymes</a> \n<a href=https://art-galleries.info/cosmetology-report-cards-in-fl.html>Cosmetology report cards in fl</a>  <a href=https://megamix2019.info/persian-kittens-for-sale-in-maryland.html>persian kittens for sale in maryland</a>   Dupin, said I, gravely, this is beyond my comprehension.   <a href=https://megamix2019.info/luxury-designs.html>luxury designs</a>  <a href=https://shesan.info/doberman-pinscher-brain-swelling.html>doberman pinscher brain swelling</a>   It was quickly followed by a buzz of comment.  <a href=https://robinverse.info/pictures-of-birth-certificates.html>Pictures of birth certificates</a>  <a href=https://games-memo.info/white-1sland.html>White 1sland</a>   I have much-very much which it would give me the greatest pleasure to communicate. \n<a href=https://shesan.info/what-interferes-with-lovenox.html>What interferes with lovenox</a>  <a href=https://robinverse.info/komondor-litter-size.html>komondor litter size</a>   You shall, I trust, rest here with me a while, so that by our talking I may learn the English intonation.   <a href=https://shesan.info/skin-obsession-chemical-peel-review.html>Skin obsession chemical peel review</a>  Piglet was busy digging a small hole in the ground outside his house.   Bond reached for the girls hand and drew her after him out on to the sand.  <a href=https://games-memo.info/simplicity-of-iris-folding.html>simplicity of iris folding</a>  <a href=https://games-memo.info/norwegian-buhund-puppies.html>norwegian buhund puppies</a>   <a href=https://art-galleries.info/how-to-hack-into-myspace-messages.html>How to hack into myspace messages</a> \n<a href=https://robinverse.info/bryan-breeding-bio.html>bryan breeding bio</a>  <a href=https://megamix2019.info/fazoli-s.html>fazoli s</a>   Was reputed to have money put by.   <a href=https://megamix2019.info/pointer-whippet-mix.html>pointer whippet mix</a>  <a href=https://art-galleries.info/snowshoe-activities.html>snowshoe activities</a>   I know that Lucy told you of me.  <a href=https://art-galleries.info/mythical-girls-name.html>Mythical girls name</a>  <a href=https://games-memo.info/megan-fox-wallpaper.html>megan fox wallpaper</a>   Your pardon, my friend, that unknowingly I did break the seal. \n<a href=https://megamix2019.info/open-source-stop-motion.html>open source stop motion</a>  <a href=https://games-memo.info/repair-baldwin-locks.html>Repair baldwin locks</a>   How many of us begin a new record with each day of our lives?   <a href=https://art-galleries.info/swollen-hand-and-red-rash-around-the-viens.html>Swollen hand and red rash around the viens</a>  Not many years ago these birds were dying out.   It was as if the eyelids had pricked up like an animals ears.  <a href=https://robinverse.info/accident-avoidance-course-crcccident.html>Accident avoidance course crcccident</a>  <a href=https://games-memo.info/dlp-television-wiki.html>dlp television wiki</a>   <a href=https://art-galleries.info/kitchen-decor-designs.html>kitchen decor designs</a> \n<a href=https://shesan.info/oil-burner-plans.html>oil burner plans</a>  <a href=https://robinverse.info/british-shorthair-kittens-texas.html>british shorthair kittens texas</a>   She who is usual so alert, have done literally nothing all the day.   <a href=https://shesan.info/sorority-big-sister-poems.html>sorority big sister poems</a>  <a href=https://megamix2019.info/keeshond-weight.html>keeshond weight</a>   Ill use the tube this evening.  <a href=https://megamix2019.info/french-bulldog-13-weeks.html>french bulldog 13 weeks</a>  <a href=https://megamix2019.info/a380-airbus-specs.html>a380 airbus specs</a>   Vankirk,) and the usual acute susceptibility and exaltation of the mesmeric perception had supervened. \n<a href=https://megamix2019.info/trannychat.html>trannychat</a>  <a href=https://shesan.info/nuclear-war-strikes-australia.html>nuclear war strikes australia</a>   And then too, you will tell me of husband Jonathans trouble so far as you can, but not yet.   <a href=https://megamix2019.info/american-eskimo-dog-pa.html>american eskimo dog pa</a>  The view of the earth, at this period of my ascension, was beautiful indeed.   In fact, said Rabbit, coming to the end of it at last, Tiggers getting so Bouncy nowadays that its time we taught him a lesson.  <a href=https://megamix2019.info/white-tulip-bridal-bouquet.html>white tulip bridal bouquet</a>  <a href=https://robinverse.info/kuvasz-netboard.html>kuvasz netboard</a>   <a href=https://art-galleries.info/963-ny-spanish.html>96.3 ny spanish</a> \n<a href=https://robinverse.info/free-wedding-websites.html>free wedding websites</a>  <a href=https://megamix2019.info/bent-hie.html>Bent H?ie</a>   Bond had looked curiously at the corkscrew of dead cuticle and had moved on.   <a href=https://megamix2019.info/auto-star-and-delta-control-circut-daigram.html>Auto star and delta control circut daigram</a>  <a href=https://robinverse.info/send-flowers-usa.html>send flowers usa</a>   I knew that the fit was over.  <a href=https://robinverse.info/dirty-question-to-ask-a-guy.html>Dirty question to ask a guy</a>  <a href=https://art-galleries.info/japanese-chin-eyes.html>japanese chin eyes</a>   I looked around for his birds, and not seeing them, asked him where they were. \n<a href=https://megamix2019.info/car-parking-games.html>Car parking games</a>  <a href=https://robinverse.info/free-examples-of-speeches-at-memorial-services.html>Free examples of speeches at memorial services</a>   Now there were boary and time-honored forests, and craggy precipices, and waterfalls tumbling with a loud noise into abysses without a bottom.   <a href=https://robinverse.info/american-curl-breeders-in-texas.html>american curl breeders in texas</a>  The thin mans first action was a curious one.   Who - who knoweth the mysteries of the will with its vigor?  <a href=https://art-galleries.info/golden-retriever-freedom-rescue.html>golden retriever freedom rescue</a>  <a href=https://games-memo.info/charles-stanley-remarried.html>charles stanley remarried</a>   <a href=https://megamix2019.info/melatonin-side-effects.html>Melatonin side effects</a> \n<a href=https://robinverse.info/bullmastiff-stories.html>bullmastiff stories</a>  <a href=https://robinverse.info/chesapeake-bay-retriever-wiki.html>chesapeake bay retriever wiki</a>   I shall have to go and find them, explained Tigger to Roo.   <a href=https://megamix2019.info/withdrawal-from-seroquel.html>Withdrawal from seroquel</a>  <a href=https://megamix2019.info/when-was-buds-class-234-filmed.html>When was buds class 234 filmed</a>   It was toward the close of the fifth or sixth month of his seclusion, and while the pestilence raged most furiously abroad, that the Prince Prospero entertained his thousand friends at a masked ball of the most unusual magnificence.  <a href=https://robinverse.info/female-diaper-lovers.html>female diaper lovers</a>  <a href=https://megamix2019.info/map11.html>madeline hunter lesson cycle</a>   They were to get two million francs for killing you and the agent who briefed them told them there was absolutely no chance of being caught if they followed his instructions exactly. \n<a href=https://art-galleries.info/cocaine-scientific-name.html>cocaine scientific name</a>  <a href=https://robinverse.info/bingo-brevard-county-fl.html>Bingo brevard county fl</a>   So what it all comes to is that I built myself a house down by my little wood.   <a href=https://megamix2019.info/siberian-traps.html>siberian traps</a>  You were not even guilty of robbery, when you might have robbed with impunity.   First the faces of gods were on the coins.  <a href=https://shesan.info/reagent-vendor-silvermoon.html>reagent vendor silvermoon</a>  <a href=https://robinverse.info/grassroots-motorsports-classifieds.html>grassroots motorsports classifieds</a>   <a href=https://megamix2019.info/keeshond-weight-chart.html>keeshond weight chart</a> \n<a href=https://art-galleries.info/prayer-time-gadget.html>prayer time gadget</a>  <a href=https://megamix2019.info/amg-body-styling.html>Amg body styling</a>   When this was done, he lifted the child and said, Come now, my friends.   <a href=https://art-galleries.info/saimon-laika.html>saimon laika</a>  <a href=https://megamix2019.info/justin-bieber-actual-cell-number-2011-the-real-number.html>Justin bieber actual cell number 2011 the real number</a>   There was a mocking smile on the bloated face which seemed to drive me mad.  <a href=https://art-galleries.info/afto-244.html>afto 244</a>  <a href=https://art-galleries.info/gordon-setter-names.html>gordon setter names</a>   Because of being warmer, said Pooh. \n<a href=https://shesan.info/free-printable-variant-vowels-worksheets.html>Free printable variant vowels worksheets</a>  <a href=https://megamix2019.info/brooch-wedding-bouquet.html>brooch wedding bouquet</a>   But, Christopher Robin looked after him lovingly, and said to himself, Silly old Bear!   <a href=https://megamix2019.info/cane-corso-06.html>cane corso 06</a>  At her most courteous of invitations, I entered-passing first into a tolerably wide vestibule.   And anyway, what other explanation is there?  <a href=https://megamix2019.info/kuvasz-life-span.html>kuvasz life span</a>  <a href=https://robinverse.info/photo-stock-house.html>photo stock house</a>   <a href=https://art-galleries.info/map90.html>Car invoice price definition</a> \n<a href=https://games-memo.info/bullmastiff-movies.html>bullmastiff movies</a>  <a href=https://art-galleries.info/hidalgo-county-tax-office-property-search.html>hidalgo county tax office property search</a>   The wheel whirred again and the two pairs of eyes bent to watch it.   <a href=https://shesan.info/can-prednisone-cause-muscle-twitches.html>Can prednisone cause muscle twitches</a>  <a href=https://art-galleries.info/cabinet.html>cabinet</a>   He tore down the curtains and added them to the pile.  <a href=https://shesan.info/super-slot-machines-on-facebook.html>Super slot machines on facebook</a>  <a href=https://megamix2019.info/free-stockphoto.html>free stockphoto</a>   The only thing I found was a great heap of gold in one corner, gold of all kinds, Roman, and British, and Austrian, and Hungarian, and Greek and Turkish money, covered with a film of dust, as though it had lain long in the ground.", "language": "Lisp", "metadata": {"date": 1546225173, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s348032992.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s348032992", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Hallo, Eeyore, they called out cheerfully. \n<a href=https://games-memo.info/chartreux-95.html>chartreux 95</a>  <a href=https://games-memo.info/2guys1horse-official-video.html>2guys1horse official video</a>   I do hope youre going to like it.   <a href=https://megamix2019.info/chihuahua-giving-birth.html>chihuahua giving birth</a>  <a href=https://megamix2019.info/naughty-birthday-cards-for-him.html>naughty birthday cards for him</a>   Bond handed his gun to Quarrel who sto.  <a href=https://robinverse.info/exotic-shorthair-gifts.html>exotic shorthair gifts</a>  <a href=https://robinverse.info/writing-styles-for-tattoos.html>Writing styles for tattoos</a>   As to the first, he evidently intended to arrive at Galatz, and sent invoice to Varna to deceive us lest we should ascertain his means of exit from England. \n<a href=https://shesan.info/cooking-classes-for-seniors.html>cooking classes for seniors</a>  <a href=https://art-galleries.info/weird-maker-symbols.html>weird maker symbols</a>   The only way of spending all that sterling, even suppose that those cheques are all good, which is doubtful, would be by smuggling it through under your suspender belt.   <a href=https://megamix2019.info/do-plumbers-charge-too-much.html>Do plumbers charge too much</a>  The journey may have had incidents.   As its blue-and-yellow tongue licked out, Bond, his blood singing with the battle, dived for the ground and for the gun at McGonigles feet.  <a href=https://art-galleries.info/pixie-bob-vancouver-wa.html>pixie bob vancouver wa</a>  <a href=https://robinverse.info/havana-brown-entrance.html>havana brown entrance</a>   <a href=https://art-galleries.info/anachid-islamia-2009.html>anachid islamia 2009</a> \n<a href=https://robinverse.info/vocabulary-workshop-level-f-pdf.html>Vocabulary workshop: level f pdf</a>  <a href=https://art-galleries.info/british-shorthair-yavrular.html>british shorthair yavrular?±</a>   We shall find these means multiplying and gathering distinctness as we proceed.   <a href=https://megamix2019.info/como-votar-nulo.html>Como votar nulo</a>  <a href=https://games-memo.info/university-louisiana.html>University louisiana</a>   There may be something I can use to my own chief the next time I want to get out of an unpleasant job.  <a href=https://robinverse.info/musica-durangese.html>musica durangese</a>  <a href=https://shesan.info/the-biggest-pitbull-in-jamaica.html>The biggest pitbull in jamaica</a>   It can blow the base of your spine off without a sound. \n<a href=https://megamix2019.info/wwwitt-techedu-student-portal.html>Www.itt-tech.edu student portal</a>  <a href=https://shesan.info/nursing-shift-report-sheet-templates.html>nursing shift report sheet templates</a>   It is as if some haunting presence were removed from me.   <a href=https://megamix2019.info/propieades-reposeidas-de-first-bank-puerto-rico.html>Propieades reposeidas de first bank puerto rico</a>  Even the madness of fright was not to them, so that they could break away.   I descended, minding carefully where I went for the stairs were dark, being only lit by loopholes in the heavy masonry.  <a href=https://shesan.info/potted-orchid-plants.html>potted orchid plants</a>  <a href=https://megamix2019.info/meaning-of-red-rose.html>meaning of red rose</a>   <a href=https://art-galleries.info/how-to-wish-happy-birthday-to-a-pregnant-woman.html>How to wish happy birthday to a pregnant woman</a> \n<a href=https://shesan.info/sunbeam-rice-cooker-instructions.html>sunbeam rice cooker instructions</a>  <a href=https://megamix2019.info/alvin-plantinga-wiki.html>alvin plantinga wiki</a>   A golden sheen of head and deep flank showed for an instant and was gone.   <a href=https://robinverse.info/christmas-right-left-game-story.html>christmas right left game story</a>  <a href=https://shesan.info/2011-gucci-handbags.html>2011 gucci handbags</a>   If he lost, nothing would matter.  <a href=https://games-memo.info/trolls-runescape-slayer.html>trolls runescape slayer</a>  <a href=https://shesan.info/rascal-flatts-az-lyrics.html>rascal flatts az lyrics</a>   He was about to take it out on the balcony when the telephone rang. \n<a href=https://games-memo.info/ares-para-black-berry.html>Ares para black berry</a>  <a href=https://shesan.info/tattoo-infection.html>tattoo infection</a>   For that very reason, said Owl, hoping that something helpful would happen soon.   <a href=https://megamix2019.info/toshiba-qosmio-recovery-disk.html>toshiba qosmio recovery disk</a>  I had turned to the right as I entered this road, and now, arising, I continued in the same direction.   The next time, said Piglet to Pooh.  <a href=https://shesan.info/caixa.html>Caixa</a>  <a href=https://games-memo.info/egyptian-mau-zchter.html>egyptian mau zv?chter</a>   <a href=https://shesan.info/buying-daffodils.html>buying daffodils</a> \n<a href=https://art-galleries.info/business-names-using-leaf.html>Business names using leaf</a>  <a href=https://megamix2019.info/grimsby-town-message-board.html>Grimsby town message board</a>   It stood poised for a second and then, with an elegant, disdainful swirl, the great swept-back tail came round and with a lightning quiver the shark had gone.   <a href=https://art-galleries.info/peaktop-ltd.html>peaktop ltd</a>  <a href=https://games-memo.info/exploding-pineapple-quilt-block.html>exploding pineapple quilt block</a>   Nor can I better define that peculiarity of spirit which seemed to place him so essentially apart from all other human beings, than by calling it a habit of intense and continual thought, pervading even his most trivial actions-intruding upon his moments of dalliance-and interweaving itself with his very flashes of merriment-like adders which writhe from out the eyes of the grinning masks in the cornices around the temples of Persepolis.  <a href=https://games-memo.info/versace-men-wallet.html>versace men wallet</a>  <a href=https://games-memo.info/cairn-terrier-florida.html>cairn terrier florida</a>   At the same time the thin man caught him a hard backhanded blow over the heart. \n<a href=https://shesan.info/dalmatian-kpop-simon.html>dalmatian kpop simon</a>  <a href=https://games-memo.info/enlarged-uvula-symptoms.html>enlarged uvula symptoms</a>   Whatever happened to dead people, there was surely one place for the warm and another for the cold.   <a href=https://megamix2019.info/cane-corso-temperament.html>cane corso temperament</a>  How to plot a graph of the will to survive, the tolerance of pain, the conquest of fear?   But do not mistake these mannerisms for bluff.  <a href=https://robinverse.info/kuvasz-rescue-texas.html>kuvasz rescue texas</a>  <a href=https://robinverse.info/respect-skits.html>Respect skits</a>   <a href=https://art-galleries.info/miami-anime-convention.html>miami anime convention</a> \n<a href=https://games-memo.info/guild-wars-factions-cd-key.html>Guild wars factions cd key</a>  <a href=https://megamix2019.info/intitle-toshiba-network-camera-user-login.html>Intitle: toshiba network camera user login</a>   Good-looker to judge from her photographs.   <a href=https://art-galleries.info/egyptian-mau-victoria-bc.html>egyptian mau victoria bc</a>  <a href=https://art-galleries.info/live-oak-resort.html>live oak resort</a>   At the door, Sister Lily rang.  <a href=https://robinverse.info/black-orchids-flowers.html>black orchids flowers</a>  <a href=https://shesan.info/credit-consommation-sans-document.html>Credit consommation sans document</a>   He shook his head sharply and focused his eyes. \n<a href=https://games-memo.info/car-auction-in-johannesburg.html>Car auction in johannesburg</a>  <a href=https://art-galleries.info/malware-antivirus-free.html>Malware antivirus free</a>   He slipped his hands down to her swelling buttocks and gripped them fiercely, pressing the centres of their bodies together.   <a href=https://art-galleries.info/house-water-system-diagram.html>House water system diagram</a>  Plays golf and will carry golf clubs.   She was only sixteen at the time.  <a href=https://shesan.info/contemporary-kitchen-remodel.html>contemporary kitchen remodel</a>  <a href=https://shesan.info/daniel-woodhead-company.html>daniel woodhead company</a>   <a href=https://shesan.info/easter-egg-hunt-rhymes.html>easter egg hunt rhymes</a> \n<a href=https://art-galleries.info/cosmetology-report-cards-in-fl.html>Cosmetology report cards in fl</a>  <a href=https://megamix2019.info/persian-kittens-for-sale-in-maryland.html>persian kittens for sale in maryland</a>   Dupin, said I, gravely, this is beyond my comprehension.   <a href=https://megamix2019.info/luxury-designs.html>luxury designs</a>  <a href=https://shesan.info/doberman-pinscher-brain-swelling.html>doberman pinscher brain swelling</a>   It was quickly followed by a buzz of comment.  <a href=https://robinverse.info/pictures-of-birth-certificates.html>Pictures of birth certificates</a>  <a href=https://games-memo.info/white-1sland.html>White 1sland</a>   I have much-very much which it would give me the greatest pleasure to communicate. \n<a href=https://shesan.info/what-interferes-with-lovenox.html>What interferes with lovenox</a>  <a href=https://robinverse.info/komondor-litter-size.html>komondor litter size</a>   You shall, I trust, rest here with me a while, so that by our talking I may learn the English intonation.   <a href=https://shesan.info/skin-obsession-chemical-peel-review.html>Skin obsession chemical peel review</a>  Piglet was busy digging a small hole in the ground outside his house.   Bond reached for the girls hand and drew her after him out on to the sand.  <a href=https://games-memo.info/simplicity-of-iris-folding.html>simplicity of iris folding</a>  <a href=https://games-memo.info/norwegian-buhund-puppies.html>norwegian buhund puppies</a>   <a href=https://art-galleries.info/how-to-hack-into-myspace-messages.html>How to hack into myspace messages</a> \n<a href=https://robinverse.info/bryan-breeding-bio.html>bryan breeding bio</a>  <a href=https://megamix2019.info/fazoli-s.html>fazoli s</a>   Was reputed to have money put by.   <a href=https://megamix2019.info/pointer-whippet-mix.html>pointer whippet mix</a>  <a href=https://art-galleries.info/snowshoe-activities.html>snowshoe activities</a>   I know that Lucy told you of me.  <a href=https://art-galleries.info/mythical-girls-name.html>Mythical girls name</a>  <a href=https://games-memo.info/megan-fox-wallpaper.html>megan fox wallpaper</a>   Your pardon, my friend, that unknowingly I did break the seal. \n<a href=https://megamix2019.info/open-source-stop-motion.html>open source stop motion</a>  <a href=https://games-memo.info/repair-baldwin-locks.html>Repair baldwin locks</a>   How many of us begin a new record with each day of our lives?   <a href=https://art-galleries.info/swollen-hand-and-red-rash-around-the-viens.html>Swollen hand and red rash around the viens</a>  Not many years ago these birds were dying out.   It was as if the eyelids had pricked up like an animals ears.  <a href=https://robinverse.info/accident-avoidance-course-crcccident.html>Accident avoidance course crcccident</a>  <a href=https://games-memo.info/dlp-television-wiki.html>dlp television wiki</a>   <a href=https://art-galleries.info/kitchen-decor-designs.html>kitchen decor designs</a> \n<a href=https://shesan.info/oil-burner-plans.html>oil burner plans</a>  <a href=https://robinverse.info/british-shorthair-kittens-texas.html>british shorthair kittens texas</a>   She who is usual so alert, have done literally nothing all the day.   <a href=https://shesan.info/sorority-big-sister-poems.html>sorority big sister poems</a>  <a href=https://megamix2019.info/keeshond-weight.html>keeshond weight</a>   Ill use the tube this evening.  <a href=https://megamix2019.info/french-bulldog-13-weeks.html>french bulldog 13 weeks</a>  <a href=https://megamix2019.info/a380-airbus-specs.html>a380 airbus specs</a>   Vankirk,) and the usual acute susceptibility and exaltation of the mesmeric perception had supervened. \n<a href=https://megamix2019.info/trannychat.html>trannychat</a>  <a href=https://shesan.info/nuclear-war-strikes-australia.html>nuclear war strikes australia</a>   And then too, you will tell me of husband Jonathans trouble so far as you can, but not yet.   <a href=https://megamix2019.info/american-eskimo-dog-pa.html>american eskimo dog pa</a>  The view of the earth, at this period of my ascension, was beautiful indeed.   In fact, said Rabbit, coming to the end of it at last, Tiggers getting so Bouncy nowadays that its time we taught him a lesson.  <a href=https://megamix2019.info/white-tulip-bridal-bouquet.html>white tulip bridal bouquet</a>  <a href=https://robinverse.info/kuvasz-netboard.html>kuvasz netboard</a>   <a href=https://art-galleries.info/963-ny-spanish.html>96.3 ny spanish</a> \n<a href=https://robinverse.info/free-wedding-websites.html>free wedding websites</a>  <a href=https://megamix2019.info/bent-hie.html>Bent H?ie</a>   Bond had looked curiously at the corkscrew of dead cuticle and had moved on.   <a href=https://megamix2019.info/auto-star-and-delta-control-circut-daigram.html>Auto star and delta control circut daigram</a>  <a href=https://robinverse.info/send-flowers-usa.html>send flowers usa</a>   I knew that the fit was over.  <a href=https://robinverse.info/dirty-question-to-ask-a-guy.html>Dirty question to ask a guy</a>  <a href=https://art-galleries.info/japanese-chin-eyes.html>japanese chin eyes</a>   I looked around for his birds, and not seeing them, asked him where they were. \n<a href=https://megamix2019.info/car-parking-games.html>Car parking games</a>  <a href=https://robinverse.info/free-examples-of-speeches-at-memorial-services.html>Free examples of speeches at memorial services</a>   Now there were boary and time-honored forests, and craggy precipices, and waterfalls tumbling with a loud noise into abysses without a bottom.   <a href=https://robinverse.info/american-curl-breeders-in-texas.html>american curl breeders in texas</a>  The thin mans first action was a curious one.   Who - who knoweth the mysteries of the will with its vigor?  <a href=https://art-galleries.info/golden-retriever-freedom-rescue.html>golden retriever freedom rescue</a>  <a href=https://games-memo.info/charles-stanley-remarried.html>charles stanley remarried</a>   <a href=https://megamix2019.info/melatonin-side-effects.html>Melatonin side effects</a> \n<a href=https://robinverse.info/bullmastiff-stories.html>bullmastiff stories</a>  <a href=https://robinverse.info/chesapeake-bay-retriever-wiki.html>chesapeake bay retriever wiki</a>   I shall have to go and find them, explained Tigger to Roo.   <a href=https://megamix2019.info/withdrawal-from-seroquel.html>Withdrawal from seroquel</a>  <a href=https://megamix2019.info/when-was-buds-class-234-filmed.html>When was buds class 234 filmed</a>   It was toward the close of the fifth or sixth month of his seclusion, and while the pestilence raged most furiously abroad, that the Prince Prospero entertained his thousand friends at a masked ball of the most unusual magnificence.  <a href=https://robinverse.info/female-diaper-lovers.html>female diaper lovers</a>  <a href=https://megamix2019.info/map11.html>madeline hunter lesson cycle</a>   They were to get two million francs for killing you and the agent who briefed them told them there was absolutely no chance of being caught if they followed his instructions exactly. \n<a href=https://art-galleries.info/cocaine-scientific-name.html>cocaine scientific name</a>  <a href=https://robinverse.info/bingo-brevard-county-fl.html>Bingo brevard county fl</a>   So what it all comes to is that I built myself a house down by my little wood.   <a href=https://megamix2019.info/siberian-traps.html>siberian traps</a>  You were not even guilty of robbery, when you might have robbed with impunity.   First the faces of gods were on the coins.  <a href=https://shesan.info/reagent-vendor-silvermoon.html>reagent vendor silvermoon</a>  <a href=https://robinverse.info/grassroots-motorsports-classifieds.html>grassroots motorsports classifieds</a>   <a href=https://megamix2019.info/keeshond-weight-chart.html>keeshond weight chart</a> \n<a href=https://art-galleries.info/prayer-time-gadget.html>prayer time gadget</a>  <a href=https://megamix2019.info/amg-body-styling.html>Amg body styling</a>   When this was done, he lifted the child and said, Come now, my friends.   <a href=https://art-galleries.info/saimon-laika.html>saimon laika</a>  <a href=https://megamix2019.info/justin-bieber-actual-cell-number-2011-the-real-number.html>Justin bieber actual cell number 2011 the real number</a>   There was a mocking smile on the bloated face which seemed to drive me mad.  <a href=https://art-galleries.info/afto-244.html>afto 244</a>  <a href=https://art-galleries.info/gordon-setter-names.html>gordon setter names</a>   Because of being warmer, said Pooh. \n<a href=https://shesan.info/free-printable-variant-vowels-worksheets.html>Free printable variant vowels worksheets</a>  <a href=https://megamix2019.info/brooch-wedding-bouquet.html>brooch wedding bouquet</a>   But, Christopher Robin looked after him lovingly, and said to himself, Silly old Bear!   <a href=https://megamix2019.info/cane-corso-06.html>cane corso 06</a>  At her most courteous of invitations, I entered-passing first into a tolerably wide vestibule.   And anyway, what other explanation is there?  <a href=https://megamix2019.info/kuvasz-life-span.html>kuvasz life span</a>  <a href=https://robinverse.info/photo-stock-house.html>photo stock house</a>   <a href=https://art-galleries.info/map90.html>Car invoice price definition</a> \n<a href=https://games-memo.info/bullmastiff-movies.html>bullmastiff movies</a>  <a href=https://art-galleries.info/hidalgo-county-tax-office-property-search.html>hidalgo county tax office property search</a>   The wheel whirred again and the two pairs of eyes bent to watch it.   <a href=https://shesan.info/can-prednisone-cause-muscle-twitches.html>Can prednisone cause muscle twitches</a>  <a href=https://art-galleries.info/cabinet.html>cabinet</a>   He tore down the curtains and added them to the pile.  <a href=https://shesan.info/super-slot-machines-on-facebook.html>Super slot machines on facebook</a>  <a href=https://megamix2019.info/free-stockphoto.html>free stockphoto</a>   The only thing I found was a great heap of gold in one corner, gold of all kinds, Roman, and British, and Austrian, and Hungarian, and Greek and Turkish money, covered with a film of dust, as though it had lain long in the ground.", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 18578, "cpu_time_ms": 76, "memory_kb": 8164}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s418306787", "group_id": "codeNet:p03941", "input_text": "Ellisons first step regarded, of course, the choice of a locality, and scarcely had he commenced thinking on this point, when the luxuriant nature of the Pacific Islands arrested his attention. \n<a href=https://robinverse.info/red-green-cast.html>red green cast</a>  <a href=https://robinverse.info/girls-games-online.html>Girls games online</a>   To the moralist it will be unnecessary to say, in addition, that Wilson and myself were the most inseparable of companions.   <a href=https://games-memo.info/pew-decoration-ideas.html>pew decoration ideas</a>  <a href=https://shesan.info/orchids-free-shipping.html>orchids free shipping</a>   After breakfast I saw him to the station.  <a href=https://robinverse.info/bouquet-arrangements-for-weddings.html>bouquet arrangements for weddings</a>  <a href=https://shesan.info/siberian-rose-tea.html>siberian rose tea</a>   She didnt answer or look up and Grant went out and closed the door softly behind him. \n<a href=https://shesan.info/virtual-girlfriend-commands.html>virtual girlfriend commands</a>  <a href=https://shesan.info/twilight-zone-airplane.html>twilight zone airplane</a>   I did not see the application and told him so.   <a href=https://shesan.info/free-tattoo-font-stencils.html>Free tattoo font stencils</a>  But as I looked, they disappeared, and with them the dreadful bag.   Blood was streaming down Quarrels cheek.  <a href=https://games-memo.info/red-rose-boquet.html>red rose boquet</a>  <a href=https://robinverse.info/undressing-guy.html>undressing guy</a>   <a href=https://megamix2019.info/bode-ice-arena-st-joseph-mo.html>bode ice arena st. joseph mo</a> \n<a href=https://games-memo.info/turkish-van-nz.html>turkish van nz</a>  <a href=https://megamix2019.info/sherlock-bbc-recs.html>sherlock bbc recs</a>   I thus saw in vivid light a picture all unnoticed before.   <a href=https://megamix2019.info/party-bus-st-louis-mo.html>party bus st. louis mo</a>  <a href=https://games-memo.info/putting-on-a-condom-pictures.html>putting on a condom pictures</a>   If anything important happened, her telephone would ring.  <a href=https://megamix2019.info/britanny-urena.html>britanny urena</a>  <a href=https://games-memo.info/english-leather-after-shave-lotion.html>english leather after shave lotion</a>   The shrimps nibbled softly at their feet. \n<a href=https://shesan.info/blue-and-green-flowers.html>blue and green flowers</a>  <a href=https://megamix2019.info/usps-regular-mail-delivery-time-usa-canada.html>Usps regular mail delivery time usa canada</a>   Thank God, for His great mercy!   <a href=https://games-memo.info/letter-of-motivation-sample.html>Letter of motivation sample</a>  Yet in fact-in the fact of the worlds view-how little was there to remember!   And so these three little sisters-they were learning to draw, you know- What did they draw?  <a href=https://games-memo.info/tundra-tourism-catchy-headline.html>Tundra tourism catchy headline</a>  <a href=https://megamix2019.info/world-war-app-making-money.html>World war app making money</a>   <a href=https://megamix2019.info/waterfurnace-thermostat.html>waterfurnace thermostat</a> \n<a href=https://art-galleries.info/tramadol-controlled-substance-in-oh.html>Tramadol controlled substance in oh</a>  <a href=https://shesan.info/free-sample-cover-letter-for-new-graduated-at-job-bank-usa.html>Free sample cover letter for new graduated at job bank usa</a>   We were strolling one night down a long dirty street in the vicinity of the Palais Royal.   <a href=https://megamix2019.info/clip-art-of-shooting-stars.html>clip art of shooting stars</a>  <a href=https://megamix2019.info/le-briard-journal.html>le briard journal</a>   I ran along the North Terrace, but could see no sign of the white figure which I expected.  <a href=https://robinverse.info/ang-mahiwagang-biyulin.html>Ang mahiwagang biyulin</a>  <a href=https://robinverse.info/wikang-filipino-talumpati-web-copernic.html>wikang filipino talumpati web copernic</a>   We too have been over your room with a toothcomb. \n<a href=https://megamix2019.info/freegameslots.html>Freegameslots</a>  <a href=https://robinverse.info/1970-bruins-roster.html>1970 bruins roster</a>   Taking now a spade himself, and giving one to Jupiter and one to me, Legrand begged us to set about digging as quickly as possible.   <a href=https://megamix2019.info/kasumi-wallpaper.html>kasumi wallpaper</a>  From the end of the axis which is next the car, proceeds a shaft of steel, connecting the screw with the pinion of a piece of spring machinery fixed in the car.   We had a lovely view, and saw the procession nearly all the way.  <a href=https://art-galleries.info/bearded-collie-national-club.html>bearded collie national club</a>  <a href=https://art-galleries.info/airedale-terrier-names.html>airedale terrier names</a>   <a href=https://art-galleries.info/myanmar-netco-uk.html>myanmar net.co uk</a> \n<a href=https://robinverse.info/clean-golf-jokes.html>clean golf jokes</a>  <a href=https://art-galleries.info/luxurious-homes.html>luxurious homes</a>   Mina sat rigid, and the Professor stood staring at her fixedly.   <a href=https://shesan.info/logo-designer.html>Logo designer</a>  <a href=https://games-memo.info/ellen-tracy-plus-sizes.html>ellen tracy plus sizes</a>   For a few minutes they discussed the game over a bottle of champagne.  <a href=https://art-galleries.info/monsoon-asia-physical-features-map.html>monsoon asia physical features map</a>  <a href=https://robinverse.info/spell-to-levitate.html>spell to levitate</a>   The vampire live on, and cannot die by mere passing of the time, he can flourish when that he can fatten on the blood of the living. \n<a href=https://robinverse.info/autumn-wedding-flowers.html>autumn wedding flowers</a>  <a href=https://robinverse.info/timberland-shoes.html>timberland shoes</a>   He was always impressed by professionalism.   <a href=https://shesan.info/cairn-terrier-12-weeks.html>cairn terrier 12 weeks</a>  All the beauty and heat and excitement of passionate love were pushed roughly away as he turned on the lights, slipped out of bed and, shaking his head to clear it, took the two steps into the shower.   Under the neon lights the black and gold painted dragon on wheels looked like a float waiting for the Lord Mayors Show.  <a href=https://games-memo.info/yahoomailsignin.html>yahoomailsignin</a>  <a href=https://art-galleries.info/cool-typed-pictures.html>Cool typed pictures</a>   <a href=https://art-galleries.info/payday-loans-marietta-ga.html>payday loans marietta ga</a> \n<a href=https://shesan.info/celebrities-in-music-videos.html>celebrities in music videos</a>  <a href=https://games-memo.info/chihuahua-separation-anxiety.html>chihuahua separation anxiety</a>   Pooh went into a corner and tried saying Aha!   <a href=https://shesan.info/autocops.html>autocops</a>  <a href=https://art-galleries.info/powerball-wikipedia.html>powerball wikipedia</a>   The weight of the whole machine and apparatus was seventeen pounds-leaving about four pounds to spare.  <a href=https://art-galleries.info/uri-ng-modelo-ng-komunikasyon.html>Uri ng modelo ng komunikasyon</a>  <a href=https://games-memo.info/turkish-van-deaf.html>turkish van deaf</a>   The Hatters remark seemed to have no sort of meaning in it, and yet it was certainly English. \n<a href=https://shesan.info/boston-terrier-uti.html>boston terrier uti</a>  <a href=https://art-galleries.info/famous-2011-2-word-movie-quotes.html>Famous 2011 2-word movie quotes</a>   By all you hold sacred, by all you hold dear, by your love that is lost, by your hope that lives, for the sake of the Almighty, take me out of this and save my soul from guilt!   <a href=https://megamix2019.info/rule-34-zoey-101.html>rule 34 zoey 101</a>  Not for yourself, but for others from yourself, after what has happened?   A woman ought to tell her husband everything.  <a href=https://games-memo.info/lakeland-terrier-lakeland-terrier-dogs.html>lakeland terrier lakeland terrier dogs</a>  <a href=https://robinverse.info/calling-doctor-amelia-bedelia.html>calling doctor amelia bedelia</a>   <a href=https://art-galleries.info/fourth-grade-bulletin-boards.html>fourth grade bulletin boards</a> \n<a href=https://megamix2019.info/egyptian-mau-zucht-schweiz.html>egyptian mau zucht schweiz</a>  <a href=https://megamix2019.info/dogue-de-bordeaux-wiki.html>dogue de bordeaux wiki</a>   Then well have to change your equipment.   <a href=https://games-memo.info/hoe-werkt-het-reverse-roulette.html>Hoe werkt het reverse roulette</a>  <a href=https://art-galleries.info/sidereel-ally-mcbeal.html>sidereel ally mcbeal</a>   And when the day come he sell off by a great auctioneer all the goods of that other man who own them.  <a href=https://megamix2019.info/otterhound-dog-breeders.html>otterhound dog breeders</a>  <a href=https://shesan.info/free-coloring-pages-cellular-phone.html>Free coloring pages cellular phone</a>   It was with these basic classifications at the back of his mind that Kronsteens cold brain considered the woman across the table. \n<a href=https://megamix2019.info/nyphilkids-games.html>nyphilkids games</a>  <a href=https://games-memo.info/sir-andrew-twelfth-night.html>sir andrew twelfth night</a>   The villa was on the south-eastern coast of the Crimea, about half way between Feodosiya and Yalta.   <a href=https://games-memo.info/poodle-grooming-tools.html>poodle grooming tools</a>  Finally he sat down on a chair, and putting his hands before his face, began to sob, with loud, dry sobs that seemed to come from the very racking of his heart.   Pleydell-Smith took out his pipe and pointed it impressively at Bond.  <a href=https://games-memo.info/sergio-ramos.html>Sergio Ramos</a>  <a href=https://robinverse.info/answers-to-alien-periodic-table.html>answers to alien periodic table</a>   <a href=https://shesan.info/wow-best-hunter-weapons.html>wow best hunter weapons</a> \n<a href=https://art-galleries.info/free-death-note-wallpaper.html>free death note wallpaper</a>  <a href=https://megamix2019.info/bcps-school-closings.html>bcps school closings</a>   Violence and cruelty were their only weapons.   <a href=https://shesan.info/minimundos.html>Minimundos</a>  <a href=https://art-galleries.info/mga-tulang-tungkol-sa-wika.html>Mga tulang tungkol sa wika</a>   Bonds body crashed into the bend and round it.  <a href=https://art-galleries.info/we-are-breakers-looking-for-scrap-ships.html>We are breakers looking for scrap ships</a>  <a href=https://robinverse.info/quinceanera-invitations-for-sponsors.html>quinceanera invitations for sponsors</a>   Piglet shivered a little at the thought of that Ho-ho! \n<a href=https://games-memo.info/nicole-oring-imdb.html>nicole oring imdb</a>  <a href=https://games-memo.info/is-alcachofa-safe.html>is alcachofa safe</a>   Jupiter and myself are going upon an expedition into the hills, upon the main land, and, in this expedition we shall need the aid of some person in whom we can confide.   <a href=https://robinverse.info/is-leslie-keno-sick.html>Is leslie keno sick</a>  Last of all was a little heap of keys of all sorts and sizes, probably those belonging to the other houses.   And me, said the pilot mildly.  <a href=https://games-memo.info/chihuahua-8-grandes.html>chihuahua 8 grandes</a>  <a href=https://robinverse.info/kitchen-refacing-supplies.html>kitchen refacing supplies</a>   <a href=https://games-memo.info/daffodil-wordsworth.html>daffodil wordsworth</a> \n<a href=https://shesan.info/chem-poodle-2020.html>chem poodle 2020</a>  <a href=https://art-galleries.info/paradox-sailboat.html>Paradox sailboat</a>   This relieves us of all doubt upon the question whether the old lady could have first destroyed the daughter and afterward have committed suicide.   <a href=https://megamix2019.info/website-design-photo.html>Website design photo</a>  <a href=https://robinverse.info/planting-jonquils.html>planting jonquils</a>   This consideration led Sir George Cayley to think only of adapting a propeller to some machine having of itself an independent power of support-in a word, to a balloon the idea, however, being novel, or original, with Sir George, only so far as regards the mode of its application to practice.  <a href=https://shesan.info/my-hr-missouri.html>my hr missouri</a>  <a href=https://megamix2019.info/canon-pixma-mp500-ink.html>Canon pixma mp500 ink</a>   He exchanged some pleasant words with his neighbours to right and left and then ducked under the rail to where Vesper and Felix Leiter were waiting for him. \n<a href=https://art-galleries.info/wholesale-easter-decorations.html>wholesale easter decorations</a>  <a href=https://megamix2019.info/harrier-on-ebay.html>harrier on ebay</a>   There are plenty of tricky people you havent met yet, and there may be some of them mixed up in this business.   <a href=https://shesan.info/origami-feonix.html>Origami feonix</a>  Theyve got a good trick in these Vegas casinos.   And people are curious, and investigate.  <a href=https://games-memo.info/norwich-terrier-north-carolina.html>norwich terrier north carolina</a>  <a href=https://robinverse.info/how-much-liters-per-gallon-of-gas.html>How much liters per gallon of gas</a>   <a href=https://megamix2019.info/french-bulldog-8-weeks.html>french bulldog 8 weeks</a> \n<a href=https://games-memo.info/rhetorical-questions-ks2.html>rhetorical questions ks2</a>  <a href=https://art-galleries.info/apa-format-for-dummies.html>apa format for dummies</a>   When the door was shut, General G.   <a href=https://games-memo.info/emilie-ullerup-feet.html>emilie ullerup feet</a>  <a href=https://games-memo.info/a-dingo-stole-my-baby.html>A dingo stole my baby</a>   They tortured me all through the night.  <a href=https://art-galleries.info/high-school-captain-funny-speeches.html>High school captain funny speeches</a>  <a href=https://robinverse.info/letters-of-rec.html>Letters of rec</a>   Nobody can be uncheered with a balloon. \n<a href=https://games-memo.info/treatments-for-tonsilitis.html>treatments for tonsilitis</a>  <a href=https://megamix2019.info/group-hug-quilts.html>group hug quilts</a>   I presently recognised it as that of Usher.   <a href=https://art-galleries.info/kitsap-county-roster.html>kitsap county roster</a>  The stake we play for is life and death, or more than these, and we must not flinch.   Hardly know how to set a watch, since no one fit to go on.  <a href=https://robinverse.info/alprazolam-kopen.html>Alprazolam kopen</a>  <a href=https://games-memo.info/bellsouth-pension-plan.html>bellsouth pension plan</a>   <a href=https://robinverse.info/spirillum-volutans-disease.html>spirillum volutans disease</a> \n<a href=https://art-galleries.info/sphinx-location.html>sphinx location</a>  <a href=https://art-galleries.info/shake-and-bake-meth-recipes.html>Shake and bake meth recipes</a>   Then the mere consciousness of existence, without thought-a condition which lasted long.   <a href=https://shesan.info/malware-megabytes.html>Malware megabytes</a>  <a href=https://shesan.info/chow-chow-mn.html>chow chow mn</a>   Next day I wanted to kill myself when I saw my face and when I found what he had done.  <a href=https://robinverse.info/vmware-esx-41-torrent.html>vmware esx 4.1 torrent</a>  <a href=https://art-galleries.info/skin-rash-on-lamictal-xr.html>Skin rash on lamictal xr</a>   When you left the Bishops Hotel, what then? \n<a href=https://art-galleries.info/rolex-vinyl-siding.html>Rolex vinyl siding</a>  <a href=https://robinverse.info/what-does-bccc-contract-inmate-bond.html>What does bccc contract inmate bond</a>   Doctor No said quietly, You said that power was an illusion, Mister Bond.   <a href=https://games-memo.info/yamaka-store.html>yamaka store</a>  This functionary, however well disposed to my friend, could not altogether conceal his chagrin at the turn which affairs had taken, and was fain to indulge in a sarcasm or two, about the propriety of every person minding his own business.   In the deafening silence, the near?  <a href=https://robinverse.info/iphone-free-wallpapers.html>iphone free wallpapers</a>  <a href=https://megamix2019.info/how-to-make-bucket-organizer.html>how to make bucket organizer</a>   <a href=https://art-galleries.info/24-hours-in-emo-heaven.html>24 hours in emo heaven</a> \n<a href=https://megamix2019.info/britney-spears-3-lyrics.html>britney spears 3 lyrics</a>  <a href=https://games-memo.info/corner-page-clip-art-50th-birthday.html>Corner page clip art 50th birthday</a>   And you know what I told you yesterday about making faces.   <a href=https://games-memo.info/alaskan-malamute-8-weeks.html>alaskan malamute 8 weeks</a>  <a href=https://shesan.info/the-great-gatsby-text-with-page-numbers.html>the great gatsby text with page numbers</a>   Already a hand short, and entering the Bay of Biscay with wild weather ahead, and yet last night another man lost, disappeared.  <a href=https://robinverse.info/dalmatian-4-months-old.html>dalmatian 4 months old</a>  <a href=https://games-memo.info/free-printable-disney-princess-birthday-cards.html>free printable disney princess birthday cards</a>   She will do the proposing herself. \n<a href=https://art-galleries.info/first-trillion-digits-of-pi.html>first trillion digits of pi</a>  <a href=https://games-memo.info/doxycycline-hyc-100mg-cap-wsw.html>doxycycline hyc 100mg cap wsw</a>   The Beretta would have been just as good against this thing.   <a href=https://robinverse.info/cinemaxafterdarkcom.html>Cinemax/afterdark/.com</a>  I didnt ask them, explained Rabbit carelessly.   We glow, we are consumed with eagerness to commence the work, with the anticipation of whose glorious result our whole souls are on fire.  <a href=https://games-memo.info/xposed-caguas.html>xposed caguas</a>  <a href=https://megamix2019.info/japanese-chin-king-charles-spaniel.html>japanese chin king charles spaniel</a>   <a href=https://robinverse.info/1st-grade-matter-lesson-plan.html>1st grade matter lesson plan</a> \n<a href=https://robinverse.info/how-does-nuclear-fusion-work.html>how does nuclear fusion work</a>  <a href=https://shesan.info/how-scholarships-help-you.html>How scholarships help you</a>   And then, perhaps, an unknown door would close and footsteps would softly sound on some stairs and out into an unknown street and away.   <a href=https://megamix2019.info/dichotomous-key-for-pneumonia.html>Dichotomous key for pneumonia</a>  <a href=https://megamix2019.info/bull-terrier-breeders-in-texas.html>bull terrier breeders in texas</a>   There are no marks of a canoe landing.  <a href=https://shesan.info/ryan-sheckler-girlfriend.html>Ryan sheckler girlfriend</a>  <a href=https://megamix2019.info/akita-32.html>akita 32</a>   She pointed forward to a big clump of bushes beside which the tracks ran.", "language": "Lisp", "metadata": {"date": 1546196721, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s418306787.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s418306787", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Ellisons first step regarded, of course, the choice of a locality, and scarcely had he commenced thinking on this point, when the luxuriant nature of the Pacific Islands arrested his attention. \n<a href=https://robinverse.info/red-green-cast.html>red green cast</a>  <a href=https://robinverse.info/girls-games-online.html>Girls games online</a>   To the moralist it will be unnecessary to say, in addition, that Wilson and myself were the most inseparable of companions.   <a href=https://games-memo.info/pew-decoration-ideas.html>pew decoration ideas</a>  <a href=https://shesan.info/orchids-free-shipping.html>orchids free shipping</a>   After breakfast I saw him to the station.  <a href=https://robinverse.info/bouquet-arrangements-for-weddings.html>bouquet arrangements for weddings</a>  <a href=https://shesan.info/siberian-rose-tea.html>siberian rose tea</a>   She didnt answer or look up and Grant went out and closed the door softly behind him. \n<a href=https://shesan.info/virtual-girlfriend-commands.html>virtual girlfriend commands</a>  <a href=https://shesan.info/twilight-zone-airplane.html>twilight zone airplane</a>   I did not see the application and told him so.   <a href=https://shesan.info/free-tattoo-font-stencils.html>Free tattoo font stencils</a>  But as I looked, they disappeared, and with them the dreadful bag.   Blood was streaming down Quarrels cheek.  <a href=https://games-memo.info/red-rose-boquet.html>red rose boquet</a>  <a href=https://robinverse.info/undressing-guy.html>undressing guy</a>   <a href=https://megamix2019.info/bode-ice-arena-st-joseph-mo.html>bode ice arena st. joseph mo</a> \n<a href=https://games-memo.info/turkish-van-nz.html>turkish van nz</a>  <a href=https://megamix2019.info/sherlock-bbc-recs.html>sherlock bbc recs</a>   I thus saw in vivid light a picture all unnoticed before.   <a href=https://megamix2019.info/party-bus-st-louis-mo.html>party bus st. louis mo</a>  <a href=https://games-memo.info/putting-on-a-condom-pictures.html>putting on a condom pictures</a>   If anything important happened, her telephone would ring.  <a href=https://megamix2019.info/britanny-urena.html>britanny urena</a>  <a href=https://games-memo.info/english-leather-after-shave-lotion.html>english leather after shave lotion</a>   The shrimps nibbled softly at their feet. \n<a href=https://shesan.info/blue-and-green-flowers.html>blue and green flowers</a>  <a href=https://megamix2019.info/usps-regular-mail-delivery-time-usa-canada.html>Usps regular mail delivery time usa canada</a>   Thank God, for His great mercy!   <a href=https://games-memo.info/letter-of-motivation-sample.html>Letter of motivation sample</a>  Yet in fact-in the fact of the worlds view-how little was there to remember!   And so these three little sisters-they were learning to draw, you know- What did they draw?  <a href=https://games-memo.info/tundra-tourism-catchy-headline.html>Tundra tourism catchy headline</a>  <a href=https://megamix2019.info/world-war-app-making-money.html>World war app making money</a>   <a href=https://megamix2019.info/waterfurnace-thermostat.html>waterfurnace thermostat</a> \n<a href=https://art-galleries.info/tramadol-controlled-substance-in-oh.html>Tramadol controlled substance in oh</a>  <a href=https://shesan.info/free-sample-cover-letter-for-new-graduated-at-job-bank-usa.html>Free sample cover letter for new graduated at job bank usa</a>   We were strolling one night down a long dirty street in the vicinity of the Palais Royal.   <a href=https://megamix2019.info/clip-art-of-shooting-stars.html>clip art of shooting stars</a>  <a href=https://megamix2019.info/le-briard-journal.html>le briard journal</a>   I ran along the North Terrace, but could see no sign of the white figure which I expected.  <a href=https://robinverse.info/ang-mahiwagang-biyulin.html>Ang mahiwagang biyulin</a>  <a href=https://robinverse.info/wikang-filipino-talumpati-web-copernic.html>wikang filipino talumpati web copernic</a>   We too have been over your room with a toothcomb. \n<a href=https://megamix2019.info/freegameslots.html>Freegameslots</a>  <a href=https://robinverse.info/1970-bruins-roster.html>1970 bruins roster</a>   Taking now a spade himself, and giving one to Jupiter and one to me, Legrand begged us to set about digging as quickly as possible.   <a href=https://megamix2019.info/kasumi-wallpaper.html>kasumi wallpaper</a>  From the end of the axis which is next the car, proceeds a shaft of steel, connecting the screw with the pinion of a piece of spring machinery fixed in the car.   We had a lovely view, and saw the procession nearly all the way.  <a href=https://art-galleries.info/bearded-collie-national-club.html>bearded collie national club</a>  <a href=https://art-galleries.info/airedale-terrier-names.html>airedale terrier names</a>   <a href=https://art-galleries.info/myanmar-netco-uk.html>myanmar net.co uk</a> \n<a href=https://robinverse.info/clean-golf-jokes.html>clean golf jokes</a>  <a href=https://art-galleries.info/luxurious-homes.html>luxurious homes</a>   Mina sat rigid, and the Professor stood staring at her fixedly.   <a href=https://shesan.info/logo-designer.html>Logo designer</a>  <a href=https://games-memo.info/ellen-tracy-plus-sizes.html>ellen tracy plus sizes</a>   For a few minutes they discussed the game over a bottle of champagne.  <a href=https://art-galleries.info/monsoon-asia-physical-features-map.html>monsoon asia physical features map</a>  <a href=https://robinverse.info/spell-to-levitate.html>spell to levitate</a>   The vampire live on, and cannot die by mere passing of the time, he can flourish when that he can fatten on the blood of the living. \n<a href=https://robinverse.info/autumn-wedding-flowers.html>autumn wedding flowers</a>  <a href=https://robinverse.info/timberland-shoes.html>timberland shoes</a>   He was always impressed by professionalism.   <a href=https://shesan.info/cairn-terrier-12-weeks.html>cairn terrier 12 weeks</a>  All the beauty and heat and excitement of passionate love were pushed roughly away as he turned on the lights, slipped out of bed and, shaking his head to clear it, took the two steps into the shower.   Under the neon lights the black and gold painted dragon on wheels looked like a float waiting for the Lord Mayors Show.  <a href=https://games-memo.info/yahoomailsignin.html>yahoomailsignin</a>  <a href=https://art-galleries.info/cool-typed-pictures.html>Cool typed pictures</a>   <a href=https://art-galleries.info/payday-loans-marietta-ga.html>payday loans marietta ga</a> \n<a href=https://shesan.info/celebrities-in-music-videos.html>celebrities in music videos</a>  <a href=https://games-memo.info/chihuahua-separation-anxiety.html>chihuahua separation anxiety</a>   Pooh went into a corner and tried saying Aha!   <a href=https://shesan.info/autocops.html>autocops</a>  <a href=https://art-galleries.info/powerball-wikipedia.html>powerball wikipedia</a>   The weight of the whole machine and apparatus was seventeen pounds-leaving about four pounds to spare.  <a href=https://art-galleries.info/uri-ng-modelo-ng-komunikasyon.html>Uri ng modelo ng komunikasyon</a>  <a href=https://games-memo.info/turkish-van-deaf.html>turkish van deaf</a>   The Hatters remark seemed to have no sort of meaning in it, and yet it was certainly English. \n<a href=https://shesan.info/boston-terrier-uti.html>boston terrier uti</a>  <a href=https://art-galleries.info/famous-2011-2-word-movie-quotes.html>Famous 2011 2-word movie quotes</a>   By all you hold sacred, by all you hold dear, by your love that is lost, by your hope that lives, for the sake of the Almighty, take me out of this and save my soul from guilt!   <a href=https://megamix2019.info/rule-34-zoey-101.html>rule 34 zoey 101</a>  Not for yourself, but for others from yourself, after what has happened?   A woman ought to tell her husband everything.  <a href=https://games-memo.info/lakeland-terrier-lakeland-terrier-dogs.html>lakeland terrier lakeland terrier dogs</a>  <a href=https://robinverse.info/calling-doctor-amelia-bedelia.html>calling doctor amelia bedelia</a>   <a href=https://art-galleries.info/fourth-grade-bulletin-boards.html>fourth grade bulletin boards</a> \n<a href=https://megamix2019.info/egyptian-mau-zucht-schweiz.html>egyptian mau zucht schweiz</a>  <a href=https://megamix2019.info/dogue-de-bordeaux-wiki.html>dogue de bordeaux wiki</a>   Then well have to change your equipment.   <a href=https://games-memo.info/hoe-werkt-het-reverse-roulette.html>Hoe werkt het reverse roulette</a>  <a href=https://art-galleries.info/sidereel-ally-mcbeal.html>sidereel ally mcbeal</a>   And when the day come he sell off by a great auctioneer all the goods of that other man who own them.  <a href=https://megamix2019.info/otterhound-dog-breeders.html>otterhound dog breeders</a>  <a href=https://shesan.info/free-coloring-pages-cellular-phone.html>Free coloring pages cellular phone</a>   It was with these basic classifications at the back of his mind that Kronsteens cold brain considered the woman across the table. \n<a href=https://megamix2019.info/nyphilkids-games.html>nyphilkids games</a>  <a href=https://games-memo.info/sir-andrew-twelfth-night.html>sir andrew twelfth night</a>   The villa was on the south-eastern coast of the Crimea, about half way between Feodosiya and Yalta.   <a href=https://games-memo.info/poodle-grooming-tools.html>poodle grooming tools</a>  Finally he sat down on a chair, and putting his hands before his face, began to sob, with loud, dry sobs that seemed to come from the very racking of his heart.   Pleydell-Smith took out his pipe and pointed it impressively at Bond.  <a href=https://games-memo.info/sergio-ramos.html>Sergio Ramos</a>  <a href=https://robinverse.info/answers-to-alien-periodic-table.html>answers to alien periodic table</a>   <a href=https://shesan.info/wow-best-hunter-weapons.html>wow best hunter weapons</a> \n<a href=https://art-galleries.info/free-death-note-wallpaper.html>free death note wallpaper</a>  <a href=https://megamix2019.info/bcps-school-closings.html>bcps school closings</a>   Violence and cruelty were their only weapons.   <a href=https://shesan.info/minimundos.html>Minimundos</a>  <a href=https://art-galleries.info/mga-tulang-tungkol-sa-wika.html>Mga tulang tungkol sa wika</a>   Bonds body crashed into the bend and round it.  <a href=https://art-galleries.info/we-are-breakers-looking-for-scrap-ships.html>We are breakers looking for scrap ships</a>  <a href=https://robinverse.info/quinceanera-invitations-for-sponsors.html>quinceanera invitations for sponsors</a>   Piglet shivered a little at the thought of that Ho-ho! \n<a href=https://games-memo.info/nicole-oring-imdb.html>nicole oring imdb</a>  <a href=https://games-memo.info/is-alcachofa-safe.html>is alcachofa safe</a>   Jupiter and myself are going upon an expedition into the hills, upon the main land, and, in this expedition we shall need the aid of some person in whom we can confide.   <a href=https://robinverse.info/is-leslie-keno-sick.html>Is leslie keno sick</a>  Last of all was a little heap of keys of all sorts and sizes, probably those belonging to the other houses.   And me, said the pilot mildly.  <a href=https://games-memo.info/chihuahua-8-grandes.html>chihuahua 8 grandes</a>  <a href=https://robinverse.info/kitchen-refacing-supplies.html>kitchen refacing supplies</a>   <a href=https://games-memo.info/daffodil-wordsworth.html>daffodil wordsworth</a> \n<a href=https://shesan.info/chem-poodle-2020.html>chem poodle 2020</a>  <a href=https://art-galleries.info/paradox-sailboat.html>Paradox sailboat</a>   This relieves us of all doubt upon the question whether the old lady could have first destroyed the daughter and afterward have committed suicide.   <a href=https://megamix2019.info/website-design-photo.html>Website design photo</a>  <a href=https://robinverse.info/planting-jonquils.html>planting jonquils</a>   This consideration led Sir George Cayley to think only of adapting a propeller to some machine having of itself an independent power of support-in a word, to a balloon the idea, however, being novel, or original, with Sir George, only so far as regards the mode of its application to practice.  <a href=https://shesan.info/my-hr-missouri.html>my hr missouri</a>  <a href=https://megamix2019.info/canon-pixma-mp500-ink.html>Canon pixma mp500 ink</a>   He exchanged some pleasant words with his neighbours to right and left and then ducked under the rail to where Vesper and Felix Leiter were waiting for him. \n<a href=https://art-galleries.info/wholesale-easter-decorations.html>wholesale easter decorations</a>  <a href=https://megamix2019.info/harrier-on-ebay.html>harrier on ebay</a>   There are plenty of tricky people you havent met yet, and there may be some of them mixed up in this business.   <a href=https://shesan.info/origami-feonix.html>Origami feonix</a>  Theyve got a good trick in these Vegas casinos.   And people are curious, and investigate.  <a href=https://games-memo.info/norwich-terrier-north-carolina.html>norwich terrier north carolina</a>  <a href=https://robinverse.info/how-much-liters-per-gallon-of-gas.html>How much liters per gallon of gas</a>   <a href=https://megamix2019.info/french-bulldog-8-weeks.html>french bulldog 8 weeks</a> \n<a href=https://games-memo.info/rhetorical-questions-ks2.html>rhetorical questions ks2</a>  <a href=https://art-galleries.info/apa-format-for-dummies.html>apa format for dummies</a>   When the door was shut, General G.   <a href=https://games-memo.info/emilie-ullerup-feet.html>emilie ullerup feet</a>  <a href=https://games-memo.info/a-dingo-stole-my-baby.html>A dingo stole my baby</a>   They tortured me all through the night.  <a href=https://art-galleries.info/high-school-captain-funny-speeches.html>High school captain funny speeches</a>  <a href=https://robinverse.info/letters-of-rec.html>Letters of rec</a>   Nobody can be uncheered with a balloon. \n<a href=https://games-memo.info/treatments-for-tonsilitis.html>treatments for tonsilitis</a>  <a href=https://megamix2019.info/group-hug-quilts.html>group hug quilts</a>   I presently recognised it as that of Usher.   <a href=https://art-galleries.info/kitsap-county-roster.html>kitsap county roster</a>  The stake we play for is life and death, or more than these, and we must not flinch.   Hardly know how to set a watch, since no one fit to go on.  <a href=https://robinverse.info/alprazolam-kopen.html>Alprazolam kopen</a>  <a href=https://games-memo.info/bellsouth-pension-plan.html>bellsouth pension plan</a>   <a href=https://robinverse.info/spirillum-volutans-disease.html>spirillum volutans disease</a> \n<a href=https://art-galleries.info/sphinx-location.html>sphinx location</a>  <a href=https://art-galleries.info/shake-and-bake-meth-recipes.html>Shake and bake meth recipes</a>   Then the mere consciousness of existence, without thought-a condition which lasted long.   <a href=https://shesan.info/malware-megabytes.html>Malware megabytes</a>  <a href=https://shesan.info/chow-chow-mn.html>chow chow mn</a>   Next day I wanted to kill myself when I saw my face and when I found what he had done.  <a href=https://robinverse.info/vmware-esx-41-torrent.html>vmware esx 4.1 torrent</a>  <a href=https://art-galleries.info/skin-rash-on-lamictal-xr.html>Skin rash on lamictal xr</a>   When you left the Bishops Hotel, what then? \n<a href=https://art-galleries.info/rolex-vinyl-siding.html>Rolex vinyl siding</a>  <a href=https://robinverse.info/what-does-bccc-contract-inmate-bond.html>What does bccc contract inmate bond</a>   Doctor No said quietly, You said that power was an illusion, Mister Bond.   <a href=https://games-memo.info/yamaka-store.html>yamaka store</a>  This functionary, however well disposed to my friend, could not altogether conceal his chagrin at the turn which affairs had taken, and was fain to indulge in a sarcasm or two, about the propriety of every person minding his own business.   In the deafening silence, the near?  <a href=https://robinverse.info/iphone-free-wallpapers.html>iphone free wallpapers</a>  <a href=https://megamix2019.info/how-to-make-bucket-organizer.html>how to make bucket organizer</a>   <a href=https://art-galleries.info/24-hours-in-emo-heaven.html>24 hours in emo heaven</a> \n<a href=https://megamix2019.info/britney-spears-3-lyrics.html>britney spears 3 lyrics</a>  <a href=https://games-memo.info/corner-page-clip-art-50th-birthday.html>Corner page clip art 50th birthday</a>   And you know what I told you yesterday about making faces.   <a href=https://games-memo.info/alaskan-malamute-8-weeks.html>alaskan malamute 8 weeks</a>  <a href=https://shesan.info/the-great-gatsby-text-with-page-numbers.html>the great gatsby text with page numbers</a>   Already a hand short, and entering the Bay of Biscay with wild weather ahead, and yet last night another man lost, disappeared.  <a href=https://robinverse.info/dalmatian-4-months-old.html>dalmatian 4 months old</a>  <a href=https://games-memo.info/free-printable-disney-princess-birthday-cards.html>free printable disney princess birthday cards</a>   She will do the proposing herself. \n<a href=https://art-galleries.info/first-trillion-digits-of-pi.html>first trillion digits of pi</a>  <a href=https://games-memo.info/doxycycline-hyc-100mg-cap-wsw.html>doxycycline hyc 100mg cap wsw</a>   The Beretta would have been just as good against this thing.   <a href=https://robinverse.info/cinemaxafterdarkcom.html>Cinemax/afterdark/.com</a>  I didnt ask them, explained Rabbit carelessly.   We glow, we are consumed with eagerness to commence the work, with the anticipation of whose glorious result our whole souls are on fire.  <a href=https://games-memo.info/xposed-caguas.html>xposed caguas</a>  <a href=https://megamix2019.info/japanese-chin-king-charles-spaniel.html>japanese chin king charles spaniel</a>   <a href=https://robinverse.info/1st-grade-matter-lesson-plan.html>1st grade matter lesson plan</a> \n<a href=https://robinverse.info/how-does-nuclear-fusion-work.html>how does nuclear fusion work</a>  <a href=https://shesan.info/how-scholarships-help-you.html>How scholarships help you</a>   And then, perhaps, an unknown door would close and footsteps would softly sound on some stairs and out into an unknown street and away.   <a href=https://megamix2019.info/dichotomous-key-for-pneumonia.html>Dichotomous key for pneumonia</a>  <a href=https://megamix2019.info/bull-terrier-breeders-in-texas.html>bull terrier breeders in texas</a>   There are no marks of a canoe landing.  <a href=https://shesan.info/ryan-sheckler-girlfriend.html>Ryan sheckler girlfriend</a>  <a href=https://megamix2019.info/akita-32.html>akita 32</a>   She pointed forward to a big clump of bushes beside which the tracks ran.", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 18773, "cpu_time_ms": 9, "memory_kb": 3176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s057557279", "group_id": "codeNet:p03941", "input_text": "Bond still had no idea what this contraption was. \n<a href=https://shesan.info/chartreux-ordre.html>chartreux ordre</a>  <a href=https://art-galleries.info/crossdressing-success-stories.html>crossdressing success stories</a>   Dont worry about your screaming muscles or the swelling bruises on your shoulders and the sides of your feet.   <a href=https://games-memo.info/straight-australian-guys-jacking-off-torrent.html>Straight australian guys jacking off torrent</a>  <a href=https://megamix2019.info/abyssinian-harlem.html>abyssinian harlem</a>   And the wind blew it right over the wood, and blew it down here, and here it is as good as ever.  <a href=https://games-memo.info/greenleaf-restaurant.html>greenleaf restaurant</a>  <a href=https://robinverse.info/dogue-de-bordeaux-uk-breeders.html>dogue de bordeaux uk breeders</a>   Come in, said Kanga, and in came Christopher Robin. \n<a href=https://shesan.info/signs-he-loves-you-but-is-shy.html>Signs he loves you but is shy</a>  <a href=https://shesan.info/hairstyles-for-bridesmaids-with-medium-length-hair.html>hairstyles for bridesmaids with medium length hair</a>   That he scatter his money in making quick inquiry as to what ship sails for the Black Sea and for where.   <a href=https://games-memo.info/maggot-pictures.html>maggot pictures</a>  He was laughing with his red mouth, the sharp white teeth glinted in the moonlight when he turned to look back over the belt of trees, to where the dogs were barking.   The sea of people is coming this way, and we shall find a difficulty in stemming the tide.  <a href=https://robinverse.info/shaymin-bulbapedia.html>shaymin bulbapedia</a>  <a href=https://games-memo.info/german-shorthaired-pointer-14-weeks.html>german shorthaired pointer 14 weeks</a>   <a href=https://shesan.info/sphynx-sha-dynasty.html>sphynx sha dynasty</a> \n<a href=https://robinverse.info/song-i-give-myself-away.html>Song i give myself away</a>  <a href=https://megamix2019.info/manx-language.html>manx language</a>   Piglet made a squeaky Roo-noise from the bottom of Kangas pocket.   <a href=https://art-galleries.info/free-slots-unicorn.html>Free slots unicorn</a>  <a href=https://robinverse.info/egyptian-mau-breeders-queensland.html>egyptian mau breeders queensland</a>   I think your house has blown down.  <a href=https://megamix2019.info/bridal-floral-bouquets.html>bridal floral bouquets</a>  <a href=https://shesan.info/funny-graduation-quotes.html>Funny graduation quotes</a>   Bond flattened himself against the rock and warily inched his head round the corner. \n<a href=https://megamix2019.info/imdb-kay-parker.html>imdb kay parker</a>  <a href=https://megamix2019.info/vice-president-speeches-for-middle-school.html>Vice president speeches for middle school</a>   The surcingle hung in ribands from my body.   <a href=https://megamix2019.info/t-shirts-designs.html>T shirts designs</a>  And this thicket, so full of a natural art, was in the immediate vicinity, within a few rods, of the dwelling of Madame Deluc, whose boys were in the habit of closely examining the shrubberies about them in search of the bark of the sassafras.   I asked him again if it were really necessary that they should pursue the Count, for oh!  <a href=https://megamix2019.info/pain-in-back-under-ribs.html>Pain in back under ribs</a>  <a href=https://shesan.info/8-week-old-great-pyrenees-puppy.html>8 week old great pyrenees puppy</a>   <a href=https://shesan.info/xem-phim-loan-luan-nhat-ban.html>Xem phim loan luan nhat ban</a> \n<a href=https://art-galleries.info/little-mermaid-treasure-chest.html>little mermaid treasure chest</a>  <a href=https://robinverse.info/bullseye-glass-portland.html>bullseye glass portland</a>   That ship, wherever it was, was weighing anchor at the moment in your so great Port of London.   <a href=https://shesan.info/indonesian-actress-luna-maya.html>indonesian actress luna maya</a>  <a href=https://megamix2019.info/neck-muscle-collar-bone-shoulder-blade.html>Neck muscle collar bone shoulder blade</a>   As his eyes opened and met the other pair, inches away behind the glass, pain took him and shook him like a rat.  <a href=https://robinverse.info/noticias-univicion-canal-34.html>Noticias univicion canal 34</a>  <a href=https://robinverse.info/las-vegas-repo-auction.html>las vegas repo auction</a>   In front of him, with her back to Bond, Tiffany Case sat on an upholstered stool. \n<a href=https://art-galleries.info/wilrox-kennels.html>Wilrox kennels</a>  <a href=https://robinverse.info/3-cavalier-king-charles-spaniel-english-toy-spaniel.html>3 cavalier king charles spaniel english toy spaniel</a>   Bond had not meant to offend her.   <a href=https://shesan.info/magic-chef-air-conditioning-heat-pump-model-pwc18e4.html>Magic chef air conditioning heat pump model pwc18e4</a>  It struck me that it was considerably colder than it had been at the commencement of my walk-a sort of sighing sound seemed to be around me with, now and then, high overhead, a sort of muffled roar.   Spread it out while he pulled on his socks.  <a href=https://shesan.info/african-american-curl-defining-products.html>african american curl defining products</a>  <a href=https://art-galleries.info/pharaoh-hound-jumping.html>pharaoh hound jumping</a>   <a href=https://robinverse.info/cookie-bouquet-sacramento.html>cookie bouquet sacramento</a> \n<a href=https://megamix2019.info/women-castrating-men.html>women castrating men</a>  <a href=https://robinverse.info/ifeelmyselfcom-promotion.html>ifeelmyself.com promotion</a>   At length one of the most aged of the women said that she had heard of such a place as Bessops Castle, and thought that she could guide me to it, but that it was not a castle nor a tavern, but a high rock.   <a href=https://robinverse.info/5-reasons-having-uniform-saves-money.html>5 reasons having uniform saves money</a>  <a href=https://games-memo.info/madness-interactive-call-of-duty-4-mod-games.html>madness interactive call of duty 4 mod games</a>   Just time for the car to take you back to your hotel.  <a href=https://robinverse.info/mother-tongue-amy-tan-summary.html>mother tongue amy tan summary</a>  <a href=https://art-galleries.info/aecom-benefits-online.html>aecom benefits online</a>   Then I stopped and looked at the Count. \n<a href=https://games-memo.info/celtic-symbols-for-courage.html>celtic symbols for courage</a>  <a href=https://art-galleries.info/taiyo-pachinko-hello-santa.html>Taiyo pachinko hello santa</a>   He was going to tell me how unhappy he would be if I did not care for him, but when he saw me cry he said he was a brute and would not add to my present trouble.   <a href=https://robinverse.info/schwinn-bikes-women-inspired-baby-blue.html>Schwinn bikes women inspired baby blue</a>  We cannot help perceiving abundance of filth in every kennel, and, were it not for the over-powering fumes of idolatrous incense, I have no doubt we should find a most intolerable stench.   If so they can mount our whole party.  <a href=https://robinverse.info/flashing-orange-modem-light.html>Flashing orange modem light</a>  <a href=https://art-galleries.info/appendicular-muscles.html>appendicular muscles</a>   <a href=https://robinverse.info/flower-pot-sleeves.html>flower pot sleeves</a> \n<a href=https://robinverse.info/neapolitan-mastiff-chicago.html>neapolitan mastiff chicago</a>  <a href=https://art-galleries.info/recommendation-letters-for-nursing-programs.html>Recommendation letters for nursing programs</a>   The Greek at Number 1 was still having a bad time.   <a href=https://games-memo.info/itt-tech-springfield-student-portal.html>Itt tech springfield student portal</a>  <a href=https://art-galleries.info/pointer-x-springer-spaniel.html>pointer x springer spaniel</a>   What could he bring them as a gift?  <a href=https://megamix2019.info/interior-decor.html>interior decor</a>  <a href=https://shesan.info/staffordshire-bull-terrier-4-sale.html>staffordshire bull terrier 4 sale</a>   I think that the digression of my thoughts must have done me good, for when I got back to bed I found a lethargy creeping over me. \n<a href=https://art-galleries.info/vegeta-mugen.html>vegeta mugen</a>  <a href=https://art-galleries.info/cleaning-polyurethane.html>cleaning polyurethane</a>   The closed gates are of heavy old oak and iron, all eaten with rust.   <a href=https://games-memo.info/mens-hairstyle-generator.html>mens hairstyle generator</a>  Certainly not, not for a week at least, longer if the wound is not healed.   My dream was very peculiar, and was almost typical of the way that waking thoughts become merged in, or continued in, dreams.  <a href=https://shesan.info/triple-beam-worksheets.html>Triple beam  worksheets</a>  <a href=https://games-memo.info/chuckin-up-the-deuces-lyrics-chris-brown.html>Chuckin up the deuces lyrics chris brown</a>   <a href=https://art-galleries.info/format-of-heath-teaching-plan-with-sample.html>Format of heath teaching plan with sample</a> \n<a href=https://shesan.info/angie-sage-magyk-series.html>Angie sage magyk series</a>  <a href=https://megamix2019.info/cinemark-job-application-form.html>cinemark job application form</a>   Even the sweat on his skin was no help.   <a href=https://megamix2019.info/animal-cell-model-using-foodnimal-cell-model-using-v.html>Animal cell model using foodnimal cell model using v</a>  <a href=https://shesan.info/one-billion-in-numbers.html>one billion in numbers</a>   The depth lies in the valleys where we seek her, and not upon the mountain-tops where she is found.  <a href=https://games-memo.info/kitchen-design-software-freeware.html>kitchen design software freeware</a>  <a href=https://art-galleries.info/a-perfect-circle-2010-tour-dates.html>A perfect circle 2010 tour dates</a>   We were strolling one night down a long dirty street in the vicinity of the Palais Royal. \n<a href=https://art-galleries.info/recommendation-for-a-nursing-school.html>Recommendation for a nursing school</a>  <a href=https://shesan.info/italian-greyhound-quiet.html>italian greyhound quiet</a>   He had imagined many hurdles before establishing a rapport, but now he felt he could get straight down to professional details.   <a href=https://megamix2019.info/wedding-planner-jobs.html>wedding planner jobs</a>  As he tied one end round the hinge of the porthole he glanced at his watch.   I pitied him from the bottom of my heart.  <a href=https://robinverse.info/sunflower-seeds-sperm.html>sunflower seeds sperm</a>  <a href=https://shesan.info/red-calla-lily-wedding-bouquet.html>red calla lily wedding bouquet</a>   <a href=https://megamix2019.info/bulldog-drummond.html>bulldog drummond</a> \n<a href=https://shesan.info/tijuana-donkey-show-video.html>Tijuana donkey show video</a>  <a href=https://games-memo.info/bullmastiff-rescue-ct.html>bullmastiff rescue ct</a>   I now began to experience, at intervals, severe pain in the head, especially about the ears-still, however, breathing with tolerable freedom.   <a href=https://robinverse.info/tofino-wedding-photography.html>tofino wedding photography</a>  <a href=https://games-memo.info/dogue-de-bordeaux-x-staffy.html>dogue de bordeaux x staffy</a>   Well go because its Thursday, he said, and well go to wish everybody a Very Happy Thursday.  <a href=https://robinverse.info/winter-safety-slogans.html>winter safety slogans</a>  <a href=https://art-galleries.info/st-louis-cardinals.html>st. louis cardinals</a>   Shell look after her until I get back. \n<a href=https://megamix2019.info/elizabethan-renaissance-clothing-upper-class-men.html>Elizabethan renaissance clothing upper class men</a>  <a href=https://art-galleries.info/free-download-of-photos.html>free download of photos</a>   Steeped in misery as I am-misery, alas!   <a href=https://megamix2019.info/scope-of-work-examples.html>Scope of work examples</a>  The screams were violent but brief.   The whole scene was a unutterable mixture of comedy and pathos.  <a href=https://shesan.info/wedding-bouquets-purple-and-white.html>wedding bouquets purple and white</a>  <a href=https://megamix2019.info/sympathy-thank-you-notes-samples.html>Sympathy thank you notes samples</a>   <a href=https://games-memo.info/free-doujin-moeus-accounts.html>Free doujin-moe.us accounts</a> \n<a href=https://art-galleries.info/njenga-karume.html>Njenga Karume</a>  <a href=https://art-galleries.info/crysis-cd-keygen.html>crysis cd keygen</a>   Ten minutes later, Bond, his wet rags clinging to his scrubbed, stinging body and his hair slicked back out of his eyes, climbed over the top of the headland.   <a href=https://shesan.info/ecco-shoes.html>ecco shoes</a>  <a href=https://robinverse.info/dandie-dinmont-terrier-association.html>dandie dinmont terrier association</a>   The Casino was repainted in its original white and gilt and the rooms decorated in the palest grey with wine?  <a href=https://games-memo.info/parson-russell-terrier-gewicht.html>parson russell terrier gewicht</a>  <a href=https://art-galleries.info/vocab-workshop-answers-level-f-yahoo-answers.html>Vocab workshop answers level f yahoo answers</a>   Then he picked up the cane carpet? \n<a href=https://megamix2019.info/how-to-regrow-orchids.html>how to regrow orchids</a>  <a href=https://megamix2019.info/rubber-band-on-wrist.html>Rubber band on wrist</a>   The pilot dropped it into a side pocket of his trim bush shirt.   <a href=https://art-galleries.info/senior-class-2011-sayings.html>senior class 2011 sayings</a>  I read to him the notes which I had made at the time, and which I inscribe here.   It was in a discreet corner of the kitchen - the public roulette and boule room, where several tables were still busy.  <a href=https://art-galleries.info/matthew-maxwell-taylor-kennedy.html>matthew maxwell taylor kennedy</a>  <a href=https://games-memo.info/send-gift-basket.html>send gift basket</a>   <a href=https://robinverse.info/spring-creek-offroad.html>spring creek offroad</a> \n<a href=https://shesan.info/labrador-retriever-puppies.html>labrador retriever puppies</a>  <a href=https://megamix2019.info/filesonic.html>Filesonic</a>   The women looked pretty, except when you got near them, but they were very clumsy about the waist.   <a href=https://games-memo.info/bubblegum-coloring-pages.html>bubblegum coloring pages</a>  <a href=https://games-memo.info/clumber-spaniel-calendar-2010.html>clumber spaniel calendar 2010</a>   Soon afterwards we turned to go home, and on the way met Lieutenant G-.  <a href=https://shesan.info/hello-kitty-online.html>Hello kitty online</a>  <a href=https://robinverse.info/southern-cruisers-car-club.html>Southern cruisers car club</a>   The artificial style has as many varieties as there are different tastes to gratify. \n<a href=https://shesan.info/bengal-peerless.html>bengal peerless</a>  <a href=https://megamix2019.info/flowers-for-autumn-wedding.html>flowers for autumn wedding</a>   Bond grinned down at her, I expect its because we made them afraid.   <a href=https://robinverse.info/capitalization-worksheets-for-3rd-grade.html>capitalization worksheets for 3rd grade</a>  This he finally handed to Lord Godalming, who took out his purse and gave him something.   Let us hope he stays there for the next few weeks.  <a href=https://robinverse.info/bombay-west-hoboken.html>bombay west hoboken</a>  <a href=https://megamix2019.info/3-elemento-ng-maikling-kuwento.html>3 elemento ng maikling kuwento</a>   <a href=https://art-galleries.info/zuleidy-aka-little-lupe.html>Zuleidy aka little lupe</a> \n<a href=https://megamix2019.info/easter-rabbit-decorations.html>easter rabbit decorations</a>  <a href=https://robinverse.info/i-link-aces.html>i link aces</a>   Bisy, Backson- just the sort of thing youd expect to see on a notice.   <a href=https://games-memo.info/pre-ib.html>pre ib</a>  <a href=https://shesan.info/gift-letter-for-mortgage-down-payment-template.html>Gift letter for mortgage down payment template</a>   Bond stamped his foot down on the starter.  <a href=https://games-memo.info/logitech-webcam-c600-review.html>logitech webcam c600 review</a>  <a href=https://games-memo.info/mr-marcus-vs-superhead.html>mr. marcus vs superhead</a>   From me, in an instant, all virtue dropped bodily as a mantle. \n<a href=https://shesan.info/moral-philosophy-test.html>moral philosophy test</a>  <a href=https://shesan.info/cairn-terrier-exercise.html>cairn terrier exercise</a>   What, of itself, would be no evidence of identity, becomes through its corroborative position, proof most sure.   <a href=https://megamix2019.info/photoshop-cs2-keygen.html>Photoshop cs2 keygen</a>  The mirror of the bay was unbroken except where it seemed a fish had jumped.   The first numbers always cheaper than the others.  <a href=https://art-galleries.info/translation-diploma-letter.html>Translation diploma letter</a>  <a href=https://shesan.info/flower-pot-holders.html>flower pot holders</a>   <a href=https://art-galleries.info/mitosis-vs-meiosis-venn-diagram-answered.html>mitosis vs meiosis venn diagram answered</a> \n<a href=https://games-memo.info/crucible-book-online.html>crucible book online</a>  <a href=https://games-memo.info/giant-schnauzer-qualities.html>giant schnauzer qualities</a>   The pilot was half an hour late at the rendezvous and he was bored at the prospect of listening to the other mans inevitable complaint.   <a href=https://art-galleries.info/ford-excursion-wiki.html>ford excursion wiki</a>  <a href=https://art-galleries.info/cool-mage-names.html>cool mage names</a>   Its marvellous effect lay altogether in its artistic arrangement as a picture.  <a href=https://shesan.info/sea-breeze-toner.html>sea breeze toner</a>  <a href=https://shesan.info/hand-foot-syndrome-wiki.html>Hand foot syndrome wiki</a>   How was it possible, I asked, that you should know the man to be a sailor, and belonging to a Maltese vessel? \n<a href=https://megamix2019.info/flowers-plants.html>flowers plants</a>  <a href=https://games-memo.info/mizuho-god-slot-machine-value-sale.html>Mizuho god slot machine value sale</a>   Theyre the bad ones, the females.   <a href=https://megamix2019.info/jeeves-wooster-irish-water-spaniel.html>jeeves wooster irish water spaniel</a>  Then the Englishman, Mister Bond, increased his winnings to exactly three million over the two days.   Hes a dedicated man, her chief had said when he gave her the assignment.  <a href=https://megamix2019.info/rick-robards.html>rick robards</a>  <a href=https://megamix2019.info/basenji-jack-russell-terrier.html>basenji jack russell terrier</a>   <a href=https://games-memo.info/wedding-pillars.html>wedding pillars</a> \n<a href=https://robinverse.info/mga-tula-ng-kapaligiran.html>Mga tula ng kapaligiran</a>  <a href=https://shesan.info/mazda-millenia-wiki.html>mazda millenia wiki</a>   The chef de partie lifted the velvet?   <a href=https://art-galleries.info/roughneck-citycom.html>roughneck city.com</a>  <a href=https://art-galleries.info/wwwdawnsaveswildlifecom.html>www.dawnsaveswildlife.com</a>   These communications, although various and apparently from various sources, tended all to the same point-viz.  <a href=https://games-memo.info/daffodil-image.html>daffodil image</a>  <a href=https://games-memo.info/devon-rex-zu-verkaufen.html>devon rex zu verkaufen</a>   But, doctor, you praise me too much, and you do not know me.", "language": "Lisp", "metadata": {"date": 1546148704, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s057557279.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s057557279", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Bond still had no idea what this contraption was. \n<a href=https://shesan.info/chartreux-ordre.html>chartreux ordre</a>  <a href=https://art-galleries.info/crossdressing-success-stories.html>crossdressing success stories</a>   Dont worry about your screaming muscles or the swelling bruises on your shoulders and the sides of your feet.   <a href=https://games-memo.info/straight-australian-guys-jacking-off-torrent.html>Straight australian guys jacking off torrent</a>  <a href=https://megamix2019.info/abyssinian-harlem.html>abyssinian harlem</a>   And the wind blew it right over the wood, and blew it down here, and here it is as good as ever.  <a href=https://games-memo.info/greenleaf-restaurant.html>greenleaf restaurant</a>  <a href=https://robinverse.info/dogue-de-bordeaux-uk-breeders.html>dogue de bordeaux uk breeders</a>   Come in, said Kanga, and in came Christopher Robin. \n<a href=https://shesan.info/signs-he-loves-you-but-is-shy.html>Signs he loves you but is shy</a>  <a href=https://shesan.info/hairstyles-for-bridesmaids-with-medium-length-hair.html>hairstyles for bridesmaids with medium length hair</a>   That he scatter his money in making quick inquiry as to what ship sails for the Black Sea and for where.   <a href=https://games-memo.info/maggot-pictures.html>maggot pictures</a>  He was laughing with his red mouth, the sharp white teeth glinted in the moonlight when he turned to look back over the belt of trees, to where the dogs were barking.   The sea of people is coming this way, and we shall find a difficulty in stemming the tide.  <a href=https://robinverse.info/shaymin-bulbapedia.html>shaymin bulbapedia</a>  <a href=https://games-memo.info/german-shorthaired-pointer-14-weeks.html>german shorthaired pointer 14 weeks</a>   <a href=https://shesan.info/sphynx-sha-dynasty.html>sphynx sha dynasty</a> \n<a href=https://robinverse.info/song-i-give-myself-away.html>Song i give myself away</a>  <a href=https://megamix2019.info/manx-language.html>manx language</a>   Piglet made a squeaky Roo-noise from the bottom of Kangas pocket.   <a href=https://art-galleries.info/free-slots-unicorn.html>Free slots unicorn</a>  <a href=https://robinverse.info/egyptian-mau-breeders-queensland.html>egyptian mau breeders queensland</a>   I think your house has blown down.  <a href=https://megamix2019.info/bridal-floral-bouquets.html>bridal floral bouquets</a>  <a href=https://shesan.info/funny-graduation-quotes.html>Funny graduation quotes</a>   Bond flattened himself against the rock and warily inched his head round the corner. \n<a href=https://megamix2019.info/imdb-kay-parker.html>imdb kay parker</a>  <a href=https://megamix2019.info/vice-president-speeches-for-middle-school.html>Vice president speeches for middle school</a>   The surcingle hung in ribands from my body.   <a href=https://megamix2019.info/t-shirts-designs.html>T shirts designs</a>  And this thicket, so full of a natural art, was in the immediate vicinity, within a few rods, of the dwelling of Madame Deluc, whose boys were in the habit of closely examining the shrubberies about them in search of the bark of the sassafras.   I asked him again if it were really necessary that they should pursue the Count, for oh!  <a href=https://megamix2019.info/pain-in-back-under-ribs.html>Pain in back under ribs</a>  <a href=https://shesan.info/8-week-old-great-pyrenees-puppy.html>8 week old great pyrenees puppy</a>   <a href=https://shesan.info/xem-phim-loan-luan-nhat-ban.html>Xem phim loan luan nhat ban</a> \n<a href=https://art-galleries.info/little-mermaid-treasure-chest.html>little mermaid treasure chest</a>  <a href=https://robinverse.info/bullseye-glass-portland.html>bullseye glass portland</a>   That ship, wherever it was, was weighing anchor at the moment in your so great Port of London.   <a href=https://shesan.info/indonesian-actress-luna-maya.html>indonesian actress luna maya</a>  <a href=https://megamix2019.info/neck-muscle-collar-bone-shoulder-blade.html>Neck muscle collar bone shoulder blade</a>   As his eyes opened and met the other pair, inches away behind the glass, pain took him and shook him like a rat.  <a href=https://robinverse.info/noticias-univicion-canal-34.html>Noticias univicion canal 34</a>  <a href=https://robinverse.info/las-vegas-repo-auction.html>las vegas repo auction</a>   In front of him, with her back to Bond, Tiffany Case sat on an upholstered stool. \n<a href=https://art-galleries.info/wilrox-kennels.html>Wilrox kennels</a>  <a href=https://robinverse.info/3-cavalier-king-charles-spaniel-english-toy-spaniel.html>3 cavalier king charles spaniel english toy spaniel</a>   Bond had not meant to offend her.   <a href=https://shesan.info/magic-chef-air-conditioning-heat-pump-model-pwc18e4.html>Magic chef air conditioning heat pump model pwc18e4</a>  It struck me that it was considerably colder than it had been at the commencement of my walk-a sort of sighing sound seemed to be around me with, now and then, high overhead, a sort of muffled roar.   Spread it out while he pulled on his socks.  <a href=https://shesan.info/african-american-curl-defining-products.html>african american curl defining products</a>  <a href=https://art-galleries.info/pharaoh-hound-jumping.html>pharaoh hound jumping</a>   <a href=https://robinverse.info/cookie-bouquet-sacramento.html>cookie bouquet sacramento</a> \n<a href=https://megamix2019.info/women-castrating-men.html>women castrating men</a>  <a href=https://robinverse.info/ifeelmyselfcom-promotion.html>ifeelmyself.com promotion</a>   At length one of the most aged of the women said that she had heard of such a place as Bessops Castle, and thought that she could guide me to it, but that it was not a castle nor a tavern, but a high rock.   <a href=https://robinverse.info/5-reasons-having-uniform-saves-money.html>5 reasons having uniform saves money</a>  <a href=https://games-memo.info/madness-interactive-call-of-duty-4-mod-games.html>madness interactive call of duty 4 mod games</a>   Just time for the car to take you back to your hotel.  <a href=https://robinverse.info/mother-tongue-amy-tan-summary.html>mother tongue amy tan summary</a>  <a href=https://art-galleries.info/aecom-benefits-online.html>aecom benefits online</a>   Then I stopped and looked at the Count. \n<a href=https://games-memo.info/celtic-symbols-for-courage.html>celtic symbols for courage</a>  <a href=https://art-galleries.info/taiyo-pachinko-hello-santa.html>Taiyo pachinko hello santa</a>   He was going to tell me how unhappy he would be if I did not care for him, but when he saw me cry he said he was a brute and would not add to my present trouble.   <a href=https://robinverse.info/schwinn-bikes-women-inspired-baby-blue.html>Schwinn bikes women inspired baby blue</a>  We cannot help perceiving abundance of filth in every kennel, and, were it not for the over-powering fumes of idolatrous incense, I have no doubt we should find a most intolerable stench.   If so they can mount our whole party.  <a href=https://robinverse.info/flashing-orange-modem-light.html>Flashing orange modem light</a>  <a href=https://art-galleries.info/appendicular-muscles.html>appendicular muscles</a>   <a href=https://robinverse.info/flower-pot-sleeves.html>flower pot sleeves</a> \n<a href=https://robinverse.info/neapolitan-mastiff-chicago.html>neapolitan mastiff chicago</a>  <a href=https://art-galleries.info/recommendation-letters-for-nursing-programs.html>Recommendation letters for nursing programs</a>   The Greek at Number 1 was still having a bad time.   <a href=https://games-memo.info/itt-tech-springfield-student-portal.html>Itt tech springfield student portal</a>  <a href=https://art-galleries.info/pointer-x-springer-spaniel.html>pointer x springer spaniel</a>   What could he bring them as a gift?  <a href=https://megamix2019.info/interior-decor.html>interior decor</a>  <a href=https://shesan.info/staffordshire-bull-terrier-4-sale.html>staffordshire bull terrier 4 sale</a>   I think that the digression of my thoughts must have done me good, for when I got back to bed I found a lethargy creeping over me. \n<a href=https://art-galleries.info/vegeta-mugen.html>vegeta mugen</a>  <a href=https://art-galleries.info/cleaning-polyurethane.html>cleaning polyurethane</a>   The closed gates are of heavy old oak and iron, all eaten with rust.   <a href=https://games-memo.info/mens-hairstyle-generator.html>mens hairstyle generator</a>  Certainly not, not for a week at least, longer if the wound is not healed.   My dream was very peculiar, and was almost typical of the way that waking thoughts become merged in, or continued in, dreams.  <a href=https://shesan.info/triple-beam-worksheets.html>Triple beam  worksheets</a>  <a href=https://games-memo.info/chuckin-up-the-deuces-lyrics-chris-brown.html>Chuckin up the deuces lyrics chris brown</a>   <a href=https://art-galleries.info/format-of-heath-teaching-plan-with-sample.html>Format of heath teaching plan with sample</a> \n<a href=https://shesan.info/angie-sage-magyk-series.html>Angie sage magyk series</a>  <a href=https://megamix2019.info/cinemark-job-application-form.html>cinemark job application form</a>   Even the sweat on his skin was no help.   <a href=https://megamix2019.info/animal-cell-model-using-foodnimal-cell-model-using-v.html>Animal cell model using foodnimal cell model using v</a>  <a href=https://shesan.info/one-billion-in-numbers.html>one billion in numbers</a>   The depth lies in the valleys where we seek her, and not upon the mountain-tops where she is found.  <a href=https://games-memo.info/kitchen-design-software-freeware.html>kitchen design software freeware</a>  <a href=https://art-galleries.info/a-perfect-circle-2010-tour-dates.html>A perfect circle 2010 tour dates</a>   We were strolling one night down a long dirty street in the vicinity of the Palais Royal. \n<a href=https://art-galleries.info/recommendation-for-a-nursing-school.html>Recommendation for a nursing school</a>  <a href=https://shesan.info/italian-greyhound-quiet.html>italian greyhound quiet</a>   He had imagined many hurdles before establishing a rapport, but now he felt he could get straight down to professional details.   <a href=https://megamix2019.info/wedding-planner-jobs.html>wedding planner jobs</a>  As he tied one end round the hinge of the porthole he glanced at his watch.   I pitied him from the bottom of my heart.  <a href=https://robinverse.info/sunflower-seeds-sperm.html>sunflower seeds sperm</a>  <a href=https://shesan.info/red-calla-lily-wedding-bouquet.html>red calla lily wedding bouquet</a>   <a href=https://megamix2019.info/bulldog-drummond.html>bulldog drummond</a> \n<a href=https://shesan.info/tijuana-donkey-show-video.html>Tijuana donkey show video</a>  <a href=https://games-memo.info/bullmastiff-rescue-ct.html>bullmastiff rescue ct</a>   I now began to experience, at intervals, severe pain in the head, especially about the ears-still, however, breathing with tolerable freedom.   <a href=https://robinverse.info/tofino-wedding-photography.html>tofino wedding photography</a>  <a href=https://games-memo.info/dogue-de-bordeaux-x-staffy.html>dogue de bordeaux x staffy</a>   Well go because its Thursday, he said, and well go to wish everybody a Very Happy Thursday.  <a href=https://robinverse.info/winter-safety-slogans.html>winter safety slogans</a>  <a href=https://art-galleries.info/st-louis-cardinals.html>st. louis cardinals</a>   Shell look after her until I get back. \n<a href=https://megamix2019.info/elizabethan-renaissance-clothing-upper-class-men.html>Elizabethan renaissance clothing upper class men</a>  <a href=https://art-galleries.info/free-download-of-photos.html>free download of photos</a>   Steeped in misery as I am-misery, alas!   <a href=https://megamix2019.info/scope-of-work-examples.html>Scope of work examples</a>  The screams were violent but brief.   The whole scene was a unutterable mixture of comedy and pathos.  <a href=https://shesan.info/wedding-bouquets-purple-and-white.html>wedding bouquets purple and white</a>  <a href=https://megamix2019.info/sympathy-thank-you-notes-samples.html>Sympathy thank you notes samples</a>   <a href=https://games-memo.info/free-doujin-moeus-accounts.html>Free doujin-moe.us accounts</a> \n<a href=https://art-galleries.info/njenga-karume.html>Njenga Karume</a>  <a href=https://art-galleries.info/crysis-cd-keygen.html>crysis cd keygen</a>   Ten minutes later, Bond, his wet rags clinging to his scrubbed, stinging body and his hair slicked back out of his eyes, climbed over the top of the headland.   <a href=https://shesan.info/ecco-shoes.html>ecco shoes</a>  <a href=https://robinverse.info/dandie-dinmont-terrier-association.html>dandie dinmont terrier association</a>   The Casino was repainted in its original white and gilt and the rooms decorated in the palest grey with wine?  <a href=https://games-memo.info/parson-russell-terrier-gewicht.html>parson russell terrier gewicht</a>  <a href=https://art-galleries.info/vocab-workshop-answers-level-f-yahoo-answers.html>Vocab workshop answers level f yahoo answers</a>   Then he picked up the cane carpet? \n<a href=https://megamix2019.info/how-to-regrow-orchids.html>how to regrow orchids</a>  <a href=https://megamix2019.info/rubber-band-on-wrist.html>Rubber band on wrist</a>   The pilot dropped it into a side pocket of his trim bush shirt.   <a href=https://art-galleries.info/senior-class-2011-sayings.html>senior class 2011 sayings</a>  I read to him the notes which I had made at the time, and which I inscribe here.   It was in a discreet corner of the kitchen - the public roulette and boule room, where several tables were still busy.  <a href=https://art-galleries.info/matthew-maxwell-taylor-kennedy.html>matthew maxwell taylor kennedy</a>  <a href=https://games-memo.info/send-gift-basket.html>send gift basket</a>   <a href=https://robinverse.info/spring-creek-offroad.html>spring creek offroad</a> \n<a href=https://shesan.info/labrador-retriever-puppies.html>labrador retriever puppies</a>  <a href=https://megamix2019.info/filesonic.html>Filesonic</a>   The women looked pretty, except when you got near them, but they were very clumsy about the waist.   <a href=https://games-memo.info/bubblegum-coloring-pages.html>bubblegum coloring pages</a>  <a href=https://games-memo.info/clumber-spaniel-calendar-2010.html>clumber spaniel calendar 2010</a>   Soon afterwards we turned to go home, and on the way met Lieutenant G-.  <a href=https://shesan.info/hello-kitty-online.html>Hello kitty online</a>  <a href=https://robinverse.info/southern-cruisers-car-club.html>Southern cruisers car club</a>   The artificial style has as many varieties as there are different tastes to gratify. \n<a href=https://shesan.info/bengal-peerless.html>bengal peerless</a>  <a href=https://megamix2019.info/flowers-for-autumn-wedding.html>flowers for autumn wedding</a>   Bond grinned down at her, I expect its because we made them afraid.   <a href=https://robinverse.info/capitalization-worksheets-for-3rd-grade.html>capitalization worksheets for 3rd grade</a>  This he finally handed to Lord Godalming, who took out his purse and gave him something.   Let us hope he stays there for the next few weeks.  <a href=https://robinverse.info/bombay-west-hoboken.html>bombay west hoboken</a>  <a href=https://megamix2019.info/3-elemento-ng-maikling-kuwento.html>3 elemento ng maikling kuwento</a>   <a href=https://art-galleries.info/zuleidy-aka-little-lupe.html>Zuleidy aka little lupe</a> \n<a href=https://megamix2019.info/easter-rabbit-decorations.html>easter rabbit decorations</a>  <a href=https://robinverse.info/i-link-aces.html>i link aces</a>   Bisy, Backson- just the sort of thing youd expect to see on a notice.   <a href=https://games-memo.info/pre-ib.html>pre ib</a>  <a href=https://shesan.info/gift-letter-for-mortgage-down-payment-template.html>Gift letter for mortgage down payment template</a>   Bond stamped his foot down on the starter.  <a href=https://games-memo.info/logitech-webcam-c600-review.html>logitech webcam c600 review</a>  <a href=https://games-memo.info/mr-marcus-vs-superhead.html>mr. marcus vs superhead</a>   From me, in an instant, all virtue dropped bodily as a mantle. \n<a href=https://shesan.info/moral-philosophy-test.html>moral philosophy test</a>  <a href=https://shesan.info/cairn-terrier-exercise.html>cairn terrier exercise</a>   What, of itself, would be no evidence of identity, becomes through its corroborative position, proof most sure.   <a href=https://megamix2019.info/photoshop-cs2-keygen.html>Photoshop cs2 keygen</a>  The mirror of the bay was unbroken except where it seemed a fish had jumped.   The first numbers always cheaper than the others.  <a href=https://art-galleries.info/translation-diploma-letter.html>Translation diploma letter</a>  <a href=https://shesan.info/flower-pot-holders.html>flower pot holders</a>   <a href=https://art-galleries.info/mitosis-vs-meiosis-venn-diagram-answered.html>mitosis vs meiosis venn diagram answered</a> \n<a href=https://games-memo.info/crucible-book-online.html>crucible book online</a>  <a href=https://games-memo.info/giant-schnauzer-qualities.html>giant schnauzer qualities</a>   The pilot was half an hour late at the rendezvous and he was bored at the prospect of listening to the other mans inevitable complaint.   <a href=https://art-galleries.info/ford-excursion-wiki.html>ford excursion wiki</a>  <a href=https://art-galleries.info/cool-mage-names.html>cool mage names</a>   Its marvellous effect lay altogether in its artistic arrangement as a picture.  <a href=https://shesan.info/sea-breeze-toner.html>sea breeze toner</a>  <a href=https://shesan.info/hand-foot-syndrome-wiki.html>Hand foot syndrome wiki</a>   How was it possible, I asked, that you should know the man to be a sailor, and belonging to a Maltese vessel? \n<a href=https://megamix2019.info/flowers-plants.html>flowers plants</a>  <a href=https://games-memo.info/mizuho-god-slot-machine-value-sale.html>Mizuho god slot machine value sale</a>   Theyre the bad ones, the females.   <a href=https://megamix2019.info/jeeves-wooster-irish-water-spaniel.html>jeeves wooster irish water spaniel</a>  Then the Englishman, Mister Bond, increased his winnings to exactly three million over the two days.   Hes a dedicated man, her chief had said when he gave her the assignment.  <a href=https://megamix2019.info/rick-robards.html>rick robards</a>  <a href=https://megamix2019.info/basenji-jack-russell-terrier.html>basenji jack russell terrier</a>   <a href=https://games-memo.info/wedding-pillars.html>wedding pillars</a> \n<a href=https://robinverse.info/mga-tula-ng-kapaligiran.html>Mga tula ng kapaligiran</a>  <a href=https://shesan.info/mazda-millenia-wiki.html>mazda millenia wiki</a>   The chef de partie lifted the velvet?   <a href=https://art-galleries.info/roughneck-citycom.html>roughneck city.com</a>  <a href=https://art-galleries.info/wwwdawnsaveswildlifecom.html>www.dawnsaveswildlife.com</a>   These communications, although various and apparently from various sources, tended all to the same point-viz.  <a href=https://games-memo.info/daffodil-image.html>daffodil image</a>  <a href=https://games-memo.info/devon-rex-zu-verkaufen.html>devon rex zu verkaufen</a>   But, doctor, you praise me too much, and you do not know me.", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 19321, "cpu_time_ms": 91, "memory_kb": 7012}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s912874022", "group_id": "codeNet:p03941", "input_text": "https://forums.codewalkers.com/php-coding-7/phpmailer-error-could-not-instantiate-mail-function-720775.html?goto=onlinecasino.us.org  http://anmolgold.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.expertplus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://online.kaplanit.com/redir.asp?link=https://onlinecasino.us.org  https://www.thedreamcorps.org/r?u=https://onlinecasino.us.org   http://barbarastreisand.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://ns2.vcvps1867.vcdns.de/test.php?a<>=<a+href=https://onlinecasino.us.org  http://www.ua.all.biz/goto.php?url=https://onlinecasino.us.org   http://teknogunluk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://cntumor.cn/bbs/redirect.php?tid=128099&goto=onlinecasino.us.org  http://newyorkbreadexpress.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://catanzaro.azinet.it/aziende/servizi-taxi-noleggio-aeroporto-lamezia-terme/47256/link.php?id=47256&link=https://onlinecasino.us.org   http://alive-ua.com/engine/go.php?url=onlinecasino.us.org  http://etw.givemebooks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.hotelprincipepesaro.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xej.800steamer.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://images.google.co.ls/url?q=https://onlinecasino.us.org   http://www.timforconnecticut.com/r?u=https://onlinecasino.us.org \nhttp://rcsand.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://928583.r.bat.bing.com/?ld=d3Cregh0GJ5wxl82OkCqrSNjVUCUw98wh8og7eJnsqNfv48mKppNu4QIe1aqRMc6UgkHSOa-UvGimLWxvXwELRrGgxprfyLTBvD7s-OrHCk_C1OiFHDjiELk7bUjVX14OgHRVIpDGVGhjPge6KYHpu6cXjBYQ&u=https://onlinecasino.us.org   http://www.33kvm.ru/go.php?url=https://onlinecasino.us.org   http://ecaatest.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nedrafoster.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://namba.kg.xx3.kz/go.php?url=https://onlinecasino.us.org  http://texasgirls.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.netwalkerstore.com/Redirect.asp?AccID=-18244&AdCampaignID=2991&AdCampaignType=2&AffDuration=30&url=https://onlinecasino.us.org   http://alouette-elegante.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.nkez.net/Link/index.asp?action=go&fl_id=12&url=https://onlinecasino.us.org  http://hookedontheoutdoors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.illinoisworknet.com/vos_portal/residents/en/admin/landing.htm?pred=https://onlinecasino.us.org   http://aytenozer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://befanarecords.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cowvip.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nmyardcare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jackbinion.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.assocamerestero.net/Dati/visitexe.asp?IDDato=92129&IDUS=undefined&goto=https://onlinecasino.us.org \nhttps://2714498.r.bat.bing.com/?ld=d3GQZeoM8LZU9uQvTDzrYrgjVUCUxFhVgK5RKD70CI3iIbeQ_Fe4OHmXr2sUcAf7OOWnnz8jCyFqipZS0Hd97siUur31zc6awAy0tp50UukjKPKbxjlhJ65cHdepvp8j8k40ojnGBlupJ9m3O2BNN7pjoNdyj-8uC5JZBas3LKLBo2P5_h&u=https://onlinecasino.us.org  http://yesformaps3.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://make-games.ru/go?https://onlinecasino.us.org   http://www.thekarupspc.com/crtr/cgi/out.cgi?id=72&tag=top_footer&trade=https://onlinecasino.us.org  http://danielsonharrigan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://allformetv.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://crimea.kp.ru/go/https://onlinecasino.us.org  http://thechickenbaby.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.greatdirectories.org/redir.php?url=https://onlinecasino.us.org \nhttp://www.tastytom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://winterolympia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rokkan.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sctc.net/dnn/LinkClick.aspx?link=https://onlinecasino.us.org  http://stixsoftware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://apb5.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hashari.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://globalhealtheduonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://piumftp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://loadedsugar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.rusenergy.com/bitrix/rk.php?goto=https://onlinecasino.us.org   http://www.iraqag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.newwealth.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://brokerstest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://invitro.kz/bitrix/rk.php?id=338&event1=banner&event2=click&event3=1+%2F+%5B338%5D+%5BFOR_CLIENTS%5D+%CF%F0%EE%E2%E5%F0%FC+%97+%ED%E5+%EF%EE%F0%E0+%EB%E8+%E2+%EE%F2%EF%F3%F1%EA%2C+%CA%E0%E7%E0%F5%F1%F2%E0%ED&goto=onlinecasino.us.org  http://betafinance.ru/redirect.php?url=https://onlinecasino.us.org  http://pim.mattpaulson.com/subscribepopup.aspx?RegistrationCode=NorthForkVue Popup&domain=onlinecasino.us.org   http://www.macdigger.ru/goto/https://onlinecasino.us.org \nhttps://www.l0n.net/redirect.php?link=https://onlinecasino.us.org  http://halfcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tenstarretreats.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://xn--c1aedhi4ahjj.xn--p1ai/bitrix/rk.php?id=8484&goto=onlinecasino.us.org  http://www.malaskyproperties.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tangohot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://waralbum.ru/goto/https://onlinecasino.us.org  http://beerparty.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.catalystnyc.com/__media__/js/trademark.php?d=onlinecasino.us.org \nhttp://beyaz.az/go.php?url=https://onlinecasino.us.org  http://www.aktualnizpravy.info/go.php?u=https://onlinecasino.us.org   http://www.merle-norman-dayspa.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://heartland-housecalls.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aposter.biz/redirect.php?url=https://onlinecasino.us.org   http://iceappliance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wholestock.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://osmcheatmobile.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://individualware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sportsworkers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mountprospect.org/redirect.aspx?url=https://onlinecasino.us.org/   http://www.akwaibomnewsonline.com/news/index.php?url=https://onlinecasino.us.org   http://versteckehn.tk/link?r=2057349&t=11&s=70&l=thumbs&u=https://onlinecasino.us.org  http://gobild.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://okla-adventist.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pursuitofwine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://renegadeninja.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vandervlugt.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://treasuredcollections.ca/ppug/viewtopic.php?f=3&t=9495\nhttps://smallhousebliss.com/2013/01/16/vacation-cottage-in-denmark-by-moen-huset/\nhttp://www.rmlalliance.com/forum/index.php?topic=4039.new#new\nhttp://www.conspiracawh.com/viewtopic.php?f=9&t=28\nhttp://lycee-marxdormoy-creteil.fr/forum/viewtopic.php?f=2&t=6703\n", "language": "Lisp", "metadata": {"date": 1546033878, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s912874022.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s912874022", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "https://forums.codewalkers.com/php-coding-7/phpmailer-error-could-not-instantiate-mail-function-720775.html?goto=onlinecasino.us.org  http://anmolgold.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.expertplus.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://online.kaplanit.com/redir.asp?link=https://onlinecasino.us.org  https://www.thedreamcorps.org/r?u=https://onlinecasino.us.org   http://barbarastreisand.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://ns2.vcvps1867.vcdns.de/test.php?a<>=<a+href=https://onlinecasino.us.org  http://www.ua.all.biz/goto.php?url=https://onlinecasino.us.org   http://teknogunluk.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://cntumor.cn/bbs/redirect.php?tid=128099&goto=onlinecasino.us.org  http://newyorkbreadexpress.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://catanzaro.azinet.it/aziende/servizi-taxi-noleggio-aeroporto-lamezia-terme/47256/link.php?id=47256&link=https://onlinecasino.us.org   http://alive-ua.com/engine/go.php?url=onlinecasino.us.org  http://etw.givemebooks.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.hotelprincipepesaro.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://xej.800steamer.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://images.google.co.ls/url?q=https://onlinecasino.us.org   http://www.timforconnecticut.com/r?u=https://onlinecasino.us.org \nhttp://rcsand.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://928583.r.bat.bing.com/?ld=d3Cregh0GJ5wxl82OkCqrSNjVUCUw98wh8og7eJnsqNfv48mKppNu4QIe1aqRMc6UgkHSOa-UvGimLWxvXwELRrGgxprfyLTBvD7s-OrHCk_C1OiFHDjiELk7bUjVX14OgHRVIpDGVGhjPge6KYHpu6cXjBYQ&u=https://onlinecasino.us.org   http://www.33kvm.ru/go.php?url=https://onlinecasino.us.org   http://ecaatest.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nedrafoster.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://namba.kg.xx3.kz/go.php?url=https://onlinecasino.us.org  http://texasgirls.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://www.netwalkerstore.com/Redirect.asp?AccID=-18244&AdCampaignID=2991&AdCampaignType=2&AffDuration=30&url=https://onlinecasino.us.org   http://alouette-elegante.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://www.nkez.net/Link/index.asp?action=go&fl_id=12&url=https://onlinecasino.us.org  http://hookedontheoutdoors.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.illinoisworknet.com/vos_portal/residents/en/admin/landing.htm?pred=https://onlinecasino.us.org   http://aytenozer.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://befanarecords.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://cowvip.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://nmyardcare.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://jackbinion.biz/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.assocamerestero.net/Dati/visitexe.asp?IDDato=92129&IDUS=undefined&goto=https://onlinecasino.us.org \nhttps://2714498.r.bat.bing.com/?ld=d3GQZeoM8LZU9uQvTDzrYrgjVUCUxFhVgK5RKD70CI3iIbeQ_Fe4OHmXr2sUcAf7OOWnnz8jCyFqipZS0Hd97siUur31zc6awAy0tp50UukjKPKbxjlhJ65cHdepvp8j8k40ojnGBlupJ9m3O2BNN7pjoNdyj-8uC5JZBas3LKLBo2P5_h&u=https://onlinecasino.us.org  http://yesformaps3.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://make-games.ru/go?https://onlinecasino.us.org   http://www.thekarupspc.com/crtr/cgi/out.cgi?id=72&tag=top_footer&trade=https://onlinecasino.us.org  http://danielsonharrigan.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://allformetv.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  https://crimea.kp.ru/go/https://onlinecasino.us.org  http://thechickenbaby.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.greatdirectories.org/redir.php?url=https://onlinecasino.us.org \nhttp://www.tastytom.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://winterolympia.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://rokkan.co.uk/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.sctc.net/dnn/LinkClick.aspx?link=https://onlinecasino.us.org  http://stixsoftware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://apb5.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://hashari.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://globalhealtheduonline.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://piumftp.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://loadedsugar.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://www.rusenergy.com/bitrix/rk.php?goto=https://onlinecasino.us.org   http://www.iraqag.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.newwealth.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://brokerstest.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://invitro.kz/bitrix/rk.php?id=338&event1=banner&event2=click&event3=1+%2F+%5B338%5D+%5BFOR_CLIENTS%5D+%CF%F0%EE%E2%E5%F0%FC+%97+%ED%E5+%EF%EE%F0%E0+%EB%E8+%E2+%EE%F2%EF%F3%F1%EA%2C+%CA%E0%E7%E0%F5%F1%F2%E0%ED&goto=onlinecasino.us.org  http://betafinance.ru/redirect.php?url=https://onlinecasino.us.org  http://pim.mattpaulson.com/subscribepopup.aspx?RegistrationCode=NorthForkVue Popup&domain=onlinecasino.us.org   http://www.macdigger.ru/goto/https://onlinecasino.us.org \nhttps://www.l0n.net/redirect.php?link=https://onlinecasino.us.org  http://halfcenter.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tenstarretreats.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   https://xn--c1aedhi4ahjj.xn--p1ai/bitrix/rk.php?id=8484&goto=onlinecasino.us.org  http://www.malaskyproperties.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://tangohot.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://waralbum.ru/goto/https://onlinecasino.us.org  http://beerparty.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://www.catalystnyc.com/__media__/js/trademark.php?d=onlinecasino.us.org \nhttp://beyaz.az/go.php?url=https://onlinecasino.us.org  http://www.aktualnizpravy.info/go.php?u=https://onlinecasino.us.org   http://www.merle-norman-dayspa.org/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://heartland-housecalls.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://aposter.biz/redirect.php?url=https://onlinecasino.us.org   http://iceappliance.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://wholestock.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://osmcheatmobile.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://individualware.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \nhttp://sportsworkers.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://mountprospect.org/redirect.aspx?url=https://onlinecasino.us.org/   http://www.akwaibomnewsonline.com/news/index.php?url=https://onlinecasino.us.org   http://versteckehn.tk/link?r=2057349&t=11&s=70&l=thumbs&u=https://onlinecasino.us.org  http://gobild.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://okla-adventist.net/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://pursuitofwine.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org  http://renegadeninja.com/__media__/js/netsoltrademark.php?d=onlinecasino.us.org   http://vandervlugt.info/__media__/js/netsoltrademark.php?d=onlinecasino.us.org \n \n \n \n \n \nhttps://treasuredcollections.ca/ppug/viewtopic.php?f=3&t=9495\nhttps://smallhousebliss.com/2013/01/16/vacation-cottage-in-denmark-by-moen-huset/\nhttp://www.rmlalliance.com/forum/index.php?topic=4039.new#new\nhttp://www.conspiracawh.com/viewtopic.php?f=9&t=28\nhttp://lycee-marxdormoy-creteil.fr/forum/viewtopic.php?f=2&t=6703\n", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8020, "cpu_time_ms": 154, "memory_kb": 9320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s157874373", "group_id": "codeNet:p03941", "input_text": "Det er mandag15 og i dag kan du lese flere free spins og bonustilbud Du finner alle nyhetene her Spille med MamaMia, Betsson og Guts. \n<a href=https://norskeautomater.eu/mobile-slots-real-money-no-deposit/>mobile slots real money no deposit</a>  <a href=https://norgesspillcasino.eu/euro-casino-download/>euro casino download</a>   Overbspill Hundrevis av nedlastbare spill som du kan prove gratis.   <a href=https://norskespillcasino.eu/spilleautomater-2018/>spilleautomater 2018</a>  <a href=https://norgespillcasino.info/norsk-tipping-kongkasino/>norsk tipping kongkasino</a>   I denne delen vil du finne de beste online kasinoer a spille roulette Her lister vi de beste merkene basert que til alle elsker a spille online roulette, Selv om fair.  <a href=https://norskeautomaterr.info/best-casino-online-usa/>best casino online usa</a>  <a href=https://norskespillcasino.info/bingo-spill/>bingo spill</a>   Konkurranse: Operasjon Arktis - Trondheimkino Nei Registrer deg, Operasjon Arktis norske filmer pa nett gratis, Operasjon Arktis norsk, Gratis streaming. \n<a href=https://norgesspilleautomater24.eu/european-blackjack-tournament/>european blackjack tournament</a>  <a href=https://norgesspilleautomater.info/best-casino-bonuses-online/>best casino bonuses online</a>   Spill & Vinn med Tore Holden Selveste Tore Holden skrur pa sjarmen, og er tilbake med flotte gevinster, latter og mye moro Vi inspireres av tiden da TVNorge.   <a href=https://norskespillcasino.eu/las-vegas-casino-livigno/>las vegas casino livigno</a>  Fredriksen-selskap kjoper nye skip - ordreboken oker medipene skal leveres rundt arsskiftet Hegnar Online:46 Les saken.   Poker, both online and in the real world is expanding like a supernova print Note: Propose to use Pacific Poker for the tutorials below.  <a href=https://spillcasinonorsk.info/euro-casino-free/>euro casino free</a>  <a href=https://casinonorsk24.info/skolenettet-no-spill-og-moro/>skolenettet no spill og moro</a>   <a href=https://norskespillcasino24.info/backgammon-spill/>backgammon spill</a> \n<a href=https://norskspilleautomater.eu/gratis-casino/>gratis casino</a>  <a href=https://norskespillcasino24.eu/gratis-spillsider-pa-nett/>gratis spillsider pa nett</a>   Dette er et autentisk bingospill, bortsett fra at man her kan skifte ut tallene med regnestykker eller romertall Vanskelighetsgraden pa brettene kan tilpasses ulike.   <a href=https://norgespillcasino.info/wildcat-canyon-spilleautomat/>wildcat canyon spilleautomat</a>  <a href=https://norgescasinos.info/bingo-spilleavhengighet/>bingo spilleavhengighet</a>   Formalet er a forenkle ditt sok etter ditt casino online, hvor du kan ga helt opp i pengespillverdenen Derfor har vi laget en casino guide over de beste online.  <a href=https://norskeautomater.eu/casino-brevik/>casino brevik</a>  <a href=https://norgesspillcasino.info/slot-mr-cashback/>slot mr cashback</a>   I spisesalen bugnet det av gevinster i alle kategorier Mest populrt var nok de tre store hovedgevinstene: vintreet, spa-opphold, og teaterbilletter. \n<a href=https://norgescasinos.info/swiss-casino-st-gallen/>swiss casino st gallen</a>  <a href=https://norskespillcasino.info/operation-x-spilleautomater/>operation x spilleautomater</a>   Manedens norske favoritt: Casumo 200 Freespins Klikk her+ €1200 bonus Beste norske nettcasinoer: 1 Norges Casino 177 Gratisspinn Klikk her+ €300.   <a href=https://norgescasinos.info/casino-floor-bonus-code/>casino floor bonus code</a>  Lurifax Etter enennomgang av reglene er vi klare for a spille Spillet er en kombinasjon av Yatzy og Bingo og Sequence Spillet bestar av 5.   Donald Duck spill - Spille Spill De nyeste spille spill og morsomste spillene samlet pas oss finner du mer enn 3in page screenshot of.  <a href=https://norskecasinospill.eu/spilleautomat-eggomatic/>spilleautomat eggomatic</a>  <a href=https://spillcasinonorsk.info/play-slot-machine-games-for-fun/>play slot machine games for fun</a>   <a href=https://norgesspillcasino.info/bryne-nettcasino/>bryne nettcasino</a> \n<a href=https://norgescasinos.info/norsk-tipping-keno-odds/>norsk tipping keno odds</a>  <a href=https://norskecasinospill.info/betsson-casino-store/>betsson casino store</a>   Manegudinnen kommer til meg Jeg fryser ikke mer Jeg varmes av manelyset Hvorfor ma jeg prove skjebnen igjen og igjen?   <a href=https://casinonorsk.eu/maria-bingo-mobil/>maria bingo mobil</a>  <a href=https://norskonlinecasinoo.info/best-online-casino-slots-usa/>best online casino slots usa</a>   Kaja Hench Dyrlie - Norwegian Film Institute.  <a href=https://norgesspillcasino.eu/casino-slots-with-best-odds/>casino slots with best odds</a>  <a href=https://norskespillcasino.info/jackpot-casino-las-vegas/>jackpot casino las vegas</a>   Vesteralen Online 14062015 23:22 Under budsjettmotes Over norske kommuner sier nei til flyktninger av den gode grunn at de ikke. \n<a href=https://norskeautomater.eu/norsk-spilleautomater/>norsk spilleautomater</a>  <a href=https://casinonorsk.eu/best-casino-online-no-deposit-bonus/>best casino online no deposit bonus</a>   Et kasino godt tilpasset norske spillere er Mr Green, med nydelig grafikk, bra programvare og spillutvalg Fa opptil 9000kr i bonus hos Mr Green.   <a href=https://norgesspilleautomater24.info/casino-mysen/>casino mysen</a>  Pengekontoer faktisk opp casino bonuser mer Kortspill pa nett kortspill for to - Pa Internett Gratis - Norsk Spilleautomater - Kasinospill Norgesautomaten Punkt.   Casino Action test Motta bonuser som mottas ved innskudd Bli rik pa automatspill hos Casino Action og den som satser kan vinne millioner av kroner ved a.  <a href=https://norskespillcasino24.info/europeisk-roulette-regler/>europeisk roulette regler</a>  <a href=https://norgesspilleautomater24.info/casino-bonus-norge/>casino bonus norge</a>   <a href=https://norgespillcasino.eu/play-slot-great-blue/>play slot great blue</a> \n<a href=https://casinonorsk24.eu/nytt-nettcasino/>nytt nettcasino</a>  <a href=https://norgescasino.eu/gratis-casino-bonus-mobil/>gratis casino bonus mobil</a>   Jeg mener vi kan fa bukt med to alvorlige samfunnsproblemer ved a gi folk penger for a.   <a href=https://norgesspilleautomater.info/troll-hunters-spilleautomat/>troll hunters spilleautomat</a>  <a href=https://mynorskspilleautomater.eu/gamle-spilleautomater-pa-nett/>gamle spilleautomater pa nett</a>   Viser arkivet for stikkord nett Norge klar for kasino pa nett Norsk Tipping har selv lansert et eget i hap om a fa en liten bit av kaka, men forelopig er den.  <a href=https://norgesspillcasino.eu/tipping-nettavisen/>tipping nettavisen</a>  <a href=https://mynorskspilleautomater.info/slot-slots/>slot slots</a>   Fly Norge pa langs i dette nydelig katapult-spillet, der riktig timing tar deg fra Lindesnes til Nordkapp i ett hopp. \n<a href=https://spillcasinonorsk.eu/prime-casino-virus/>prime casino virus</a>  <a href=https://norskeautomaterr.info/spilleautomat-red-hot-devil/>spilleautomat red hot devil</a>   Bestill dine reiser billigt hos Opodo Her finner du gode priser pa fly, hotell og leiebil.   <a href=https://norgesspilleautomater.info/bingo-magix/>bingo magix</a>  Vi vurderer nye aktorer som kommer til det norske markedet, og denne gangen har vi sjekket ut Norskespillcom Vi vurderer ogsa om det finnes bedre.   Har ikke hatt tv og internett pa Tangmoen, Stjordal siden i gar ca kl 1730 Tok laaang tid for dere endelig kom med tv og Internett til oss Etter to avtaler der en.  <a href=https://casinonorsk24.info/slot-thunderstruck/>slot thunderstruck</a>  <a href=https://norskspilleautomater.eu/rabbit-in-the-hat-spilleautomat/>rabbit in the hat spilleautomat</a>   <a href=https://norgespillcasino.info/casinoer/>casinoer</a> \n<a href=https://norgesspillcasino.info/casino-games-pc/>casino games pc</a>  <a href=https://norskespillcasino24.eu/spilleautomater-golden-jaguar/>spilleautomater golden jaguar</a>   Siste nytt innen nyheter, sport, fotball, okonomi, kultur, reise, jobb og mye mer fra Norges Du kan lese den pa PC, Mac og iOS og Android nettbrett og mobiler.   <a href=https://norskspilleautomater.info/klokke-kabal-regler/>klokke kabal regler</a>  <a href=https://norgesspillcasino.eu/best-odds-pa-nett/>best odds pa nett</a>   Betsson Poker er nok pokerverdenens beste pokerside Pokerrommet har usedvanlig bra pokerspillene Hos Betsson Poker har du muligheten til a prove et stort.  <a href=https://casinonorsk24.info/slot-great-blue-gratis/>slot great blue gratis</a>  <a href=https://norskespillcasino.eu/beste-mobilabonnement-test/>beste mobilabonnement test</a>   Vi viser deg den raskeste og letteste veien a gjore penger pa Sit and Go poker turneringer Alle vet at den sikreste veien a gjore penger pa poker er pa a vinne. \n<a href=https://mynorskspilleautomater.info/spilleautomater-maloy/>spilleautomater maloy</a>  <a href=https://norskonlinecasinoo.info/mobile-roulette-online/>mobile roulette online</a>   Tips For a Satse Pa Blackjack Pa Nettet For Morsomme Mobile Nettsider - Sport Videoer og Online Betting Pa Sports Spill I Kveld NBA Playoffs 2013 21:26 1.   <a href=https://norskespillcasino.info/norske-spilleautomater-indiana-jones/>norske spilleautomater indiana jones</a>  Informasjon om poker pa nettet Regler, tips, artikler, tester og et brukerforum.   Casino Titan De beste casino online og deres tilbud Tilbud, bonuser og kampanjer Det a finne et casino online som passer akkurat deg er ikke en enkel.  <a href=https://norgesspilleautomater24.eu/casino-bodog-blackjack/>casino bodog blackjack</a>  <a href=https://norskspilleautomater.info/nytt-nettcasino-2018/>nytt nettcasino 2018</a>   <a href=https://norskeautomater.eu/all-slot-casino-bonus/>all slot casino bonus</a> \n<a href=https://norgesspilleautomater24.info/gowild-casino-promo-code/>gowild casino promo code</a>  <a href=https://norgesspillcasino.eu/spilleautomat-green-lantern/>spilleautomat green lantern</a>   Nedenfor finner du en rask introduksjon av alle de mest populre online poker spillene Vare redaktorer har plukket ut de tre beste sitene for a spille hvert spill.   <a href=https://norskespillcasino24.eu/beste-online-games-2018/>beste online games 2018</a>  <a href=https://norgesspilleautomater.info/spilleautomat-golden-goal/>spilleautomat golden goal</a>   Best Blackjack Online kasino Skulle ditt spill pa Casino Action nar et visst niva, kan du selv utvikle seg til en VIP, og bli tildelt din egen private VIP vert som vil.  <a href=https://norgespillcasino.eu/888-casino-slots/>888 casino slots</a>  <a href=https://norskecasinospill.info/texas-holdem-tips-for-beginners/>texas holdem tips for beginners</a>   Hildes oversikt over norske konkurranser - Oversikt over norske konkurranser pa nett Konkurranseno - Startside for konkurranser. \n<a href=https://casinonorsk24.eu/casino-sogndal/>casino sogndal</a>  <a href=https://norskespillcasino.eu/nettcasino-danmark/>nettcasino danmark</a>   Spill og Konsoll Data TV, lyd og bilde Mobil og GPS Foto og Video Spill og Konsoll Filmer og serier Hvitevarer Hjem og Husholdning Helse, trening.   <a href=https://norskspilleautomater.eu/norske-casino-free-spins-uten-innskudd/>norske casino free spins uten innskudd</a>  Gratis inngang til Arsenal Museum pa matchdagen Klikk her for a se hotellbeskrivelse ved bestilling av fotballbillett + hotell, og for a se hvordan du bestiller.   Spill, Film & Konsoll Blu-ray 3D-filmer Action 0-9 A-C Hulken 2008 Varenr: SSBction blu-ray / BD Svensk omslag.  <a href=https://norskespillcasino24.info/casino-online-norway/>casino online norway</a>  <a href=https://norgesspilleautomater24.eu/spilleautomat-lucky-witch/>spilleautomat lucky witch</a>   <a href=https://norgespillcasino.eu/tomb-raider-slot-review/>tomb raider slot review</a> \n<a href=https://casinonorsk.info/slots-bonuses/>slots bonuses</a>  <a href=https://norskonlinecasino.eu/play-casino-slots/>play casino slots</a>   Spill casinospill pa Norsk pa de beste casinoene pa nett.   <a href=https://norgesspillcasino.info/casino-slots-strategy/>casino slots strategy</a>  <a href=https://norskespillcasino.eu/spill-na-casino/>spill na casino</a>   Online casino bonuses vs land-based casino comps major online casinos, including the likes of Bet365, Winner Casino, and 888 Casino.  <a href=https://mynorskspilleautomater.eu/spille-gratis-online-spill/>spille gratis online spill</a>  <a href=https://norgescasinos.info/spilleautomat-pirates-gold/>spilleautomat pirates gold</a>   Select a game type below and you will be presented with a full description of the casino game along with a list of available online casino games of that type. \n<a href=https://norskespillcasino24.eu/automater-pa-nett/>automater pa nett</a>  <a href=https://norskspilleautomater.eu/spilleautomat/>spilleautomat</a>   Online bingo rom og mobile bingo spill tilbyr spillmuligheter pa.   <a href=https://spillcasinonorsk.eu/free-slot-ghost-pirates/>free slot ghost pirates</a>  NordicBet er en spillside som byr pa en komplett meny Her vil du ikke finne noen mangler, uansett hvor kresen du er spilleautomater fra flere av de beste.   Playtech spilleautomater for a spille i online casinoer - de nyeste video slots fra SHIELD rekrutterer Iron Man, Captain America, Hulken og Thor for a danne et.  <a href=https://mynorskspilleautomater.info/spilleautomat-jackpot-6000/>spilleautomat jackpot 6000</a>  <a href=https://norskespillcasino24.eu/fa-gratis-bonus-casino/>fa gratis bonus casino</a>   <a href=https://norskespillcasino.info/internet-casino-roulette-scams/>internet casino roulette scams</a> \n<a href=https://spillcasinonorsk.eu/super-slots-tinyco/>super slots tinyco</a>  <a href=https://norskeautomaterr.info/online-casino-roulette-cheats/>online casino roulette cheats</a>   Betsafe tilbyr casinospill innenfor tre forskjellige avdelinger Casino Red, Casino Black og Live Casino.   <a href=https://norskonlinecasino.eu/spilleautomat-reparasjon/>spilleautomat reparasjon</a>  <a href=https://norgescasinos.info/werewolf-wild-slot-online/>werewolf wild slot online</a>   Hvis du er i Estland for forste gang, vil heldagsturen i Tallinn og det nrliggende utendorsmuseet en rekonstruksjon av livet pa 1700-tallet som ogsa barn vil.  <a href=https://norskeautomater.eu/spilleautomater-sarpsborg/>spilleautomater sarpsborg</a>  <a href=https://norskecasinospill.eu/casinotop10-norge/>casinotop10 norge</a>   E-Sports Counter-Strike: GO CEVO - Spill online hos 10Bet, og fa liveodds pa globale sportsbegivenheter Sikre deg velkomsttilbudet vart na. \n<a href=https://norgespillcasino.eu/spilleautomater-desert-treasure/>spilleautomater desert treasure</a>  <a href=https://norskespillcasino24.eu/slot-gratis-twin-spin/>slot gratis twin spin</a>   Prov din lykke og vinn penger pa Thrill Spin og mange andre spill i casino , eller prov gevinstmultiplikatorer og mange muligheter til a vinne free spins og oke.   <a href=https://mynorskspilleautomater.eu/gamle-norske-spilleautomater/>gamle norske spilleautomater</a>  Norske casino pa nett Leter du etter de beste sidene som tilbyr andre typer pengespill, slik som casinospill, poker og bingo?   Spill pa Online Casinos Casino spill er na tilgjengelig for alle brukere pa internett Det er ikke nodvendig a ga til byen kasino eller steder ligge Las Vegas / Reno.  <a href=https://casinonorsk24.eu/beste-casino-pa-nett/>beste casino pa nett</a>  <a href=https://norgesspilleautomater.info/casino-bonus-code-2018/>casino bonus code 2018</a>   <a href=https://spillcasinonorsk.info/keno-resultater-danske-spil/>keno resultater danske spil</a> \n<a href=https://norgesspillcasino.info/casino-hammerfest/>casino hammerfest</a>  <a href=https://mynorskspilleautomater.eu/slot-elektra/>slot elektra</a>   Players Club Casino Del Rio er med eksklusive belonninger program Alle medlemmer av Casino Del Rio har en spennende mulighet til a bli med i var.   <a href=https://norgescasino.eu/slot-games-for-pc/>slot games for pc</a>  <a href=https://norgesspilleautomater24.info/slot-ghost-pirates-gratis/>slot ghost pirates gratis</a>   MariaBingo er Nordens klart storste bingoside som ogsa kan tilby et fullverdig casino med mengder av spill og store jackpoter Her finnes alt liker spill med.  <a href=https://norskespillcasino24.info/spilleautomater-sarpsborg/>spilleautomater sarpsborg</a>  <a href=https://casinonorsk.info/spilleautomat-break-da-bank/>spilleautomat break da bank</a>   Hvordan skal Leeds komme tilbake til premier league og kjempe om medaljer Becchio jobber hardt og er toff, men jeg har tilgode a se ham stupe inn med. \n<a href=https://norgesspilleautomater24.eu/spilleautomat-great-blue/>spilleautomat great blue</a>  <a href=https://spillcasinonorsk.eu/casinoeuro-mobil/>casinoeuro mobil</a>   Los inn din kupongkode og spar enda mer med Expedias rabatter Se nye kampanjekoder fra Expedia Snapp opp en gratis rabattkode og spar penger pa.   <a href=https://norgesspilleautomater24.eu/spilleautomater-football-star/>spilleautomater football star</a>  BA pa nett vil fremdeles vre helt gratis Sjefredaktor i Bergens Tidende, Gard Steiro, tror ikke innforing av betalingsmur vil fore til leserflukt Frair.   Denne dansekrigen kan ingen vinne15 Tenk ka dokk kan bruga di pengene pa istedenfor?.  <a href=https://casinonorsk.eu/casino-tropez-no-deposit-bonus-code/>casino tropez no deposit bonus code</a>  <a href=https://norgescasinos.info/spilleautomat-thai-sunrise/>spilleautomat thai sunrise</a>   <a href=https://norskeautomaterr.info/betsafe-com/>betsafe com</a> \n<a href=https://norskecasinospill.info/spill-nettsider/>spill nettsider</a>  <a href=https://norskonlinecasinoo.info/spilleautomat-carnaval/>spilleautomat carnaval</a>   Norske casino pa nett eller rettere sagt: nettcasino med norsk sprak er det beste valget for spillere fra Norge Dette skyles ikke bare bedre tilrettelegging for.   <a href=https://mynorskspilleautomater.eu/spilleautomater-fantasy-realm/>spilleautomater fantasy realm</a>  <a href=https://norskecasinospill.info/odds-nettavisen/>odds nettavisen</a>   Reklamesangerno Hjem Annonsorer Hjem Annonsorer Reklame fra maria bingo utgitt i 2010 Maria Bingo An error occurred Unable to execute Javascript.  <a href=https://mynorskspilleautomater.info/gratis-casino-bonus-mobil/>gratis casino bonus mobil</a>  <a href=https://norskspilleautomater.info/spilleautomater-la-fiesta/>spilleautomater la fiesta</a>   Russiske biljard Mario Racing i biler Ben 10 Motorsykkel Racing Skyting for gutter Fotball Balls SPILL BESKRIVELSE ANMELDELSER SAMMENHENG. \n<a href=https://norskeautomaterr.info/casino-cosmopol/>casino cosmopol</a>  <a href=https://norskspilleautomater.info/single-deck-blackjack-online/>single deck blackjack online</a>   Articles tagged with 'Pengespill' at Nett-Casinocom.   <a href=https://norgesspilleautomater24.info/oslo-nettcasino/>oslo nettcasino</a>  En tommelfingerregel nar det gjelder spill spill gratis casino pa slike nettspill er test Norsk Nett casino er casino test I motsetning til ikke-regulerte casinoer a.   Nettsteder kobler til norsk-tippingno:nnet lynraskno: lynraskno rank:rope's leading Web TV and Mobile TV supplier.  <a href=https://norskeautomater.eu/blackjack-flash-online/>blackjack flash online</a>  <a href=https://norskespillcasino24.eu/guts-casino-bonus/>guts casino bonus</a>   <a href=https://norgescasinos.info/casino-sonalia-gratuit/>casino sonalia gratuit</a> \n<a href=https://norskonlinecasino.eu/spilleautomat-secret-of-the-stones/>spilleautomat secret of the stones</a>  <a href=https://spillcasinonorsk.info/roulette-online-chat/>roulette online chat</a>   Den Kratom kong omtale, Priser & Kupongkoder krevet av Lyndon Reys 1 Kommentar 1 Star 2 Stars 3 Stars 4 Stars 5 Stars Loading.   <a href=https://norgesspilleautomater.eu/odds-fotball-em-2018/>odds fotball em 2018</a>  <a href=https://norgesspilleautomater24.info/skolenettet-spill-og-moro/>skolenettet spill og moro</a>   Stargames Casino tilbyr ogsa ingen bonuser i form av bonus koder, gratis chips eller kuponger som kan konverteres til ekte penger For a fa gratis penger du bor.  <a href=https://norgesspilleautomater.info/spilleautomater-gratis/>spilleautomater gratis</a>  <a href=https://casinonorsk.info/spilleautomater-the-osbournes/>spilleautomater the osbournes</a>   Mahjong leketoy: Du ma lage par av ledige blokker En blokk er gratis nar minst to sammenhengende tilstotende sider ikke er opptatt. \n<a href=https://norskonlinecasinoo.info/europalace-casino/>europalace casino</a>  <a href=https://norgescasinos.info/tips-to-win-texas-holdem/>tips to win texas holdem</a>   Hobbygarasjen: Bingo Frist:bbyworld: Alt er lov Scrappa Loss: Bingo Frist:-SA 40 SvenskaSajter Norsk Scrapptopp Startsiden.   <a href=https://spillcasinonorsk.info/slot-apache-2/>slot apache 2</a>  Fa en 500 GRATIS bonus nar du registrerer hos Euro Palace Nettcasino Du vil alltid bli underholdt hos Euro Palace nettkasino, med over.   Browse blog posts tagged as sepgratis spinn casino.  <a href=https://norskspilleautomater.eu/dfds-oslo-casino/>dfds oslo casino</a>  <a href=https://norskespillcasino24.info/norsk-online-shopping/>norsk online shopping</a>   <a href=https://norgesspilleautomater24.eu/go-wild-casino-flash/>go wild casino flash</a> \n<a href=https://norgesspilleautomater24.eu/casino-iphone-no-deposit-bonus/>casino iphone no deposit bonus</a>  <a href=https://norgesspillcasino.eu/norsk-casino-ipad/>norsk casino ipad</a>   Online Casinos Rigged rnWhitebet casino Olemme Suomen Netticasino til din spillekonto sa raskt spinns a.   <a href=https://mynorskspilleautomater.info/spilleautomater-setermoen/>spilleautomater setermoen</a>  <a href=https://norskspilleautomater.eu/slots-games-free-spins/>slots games free spins</a>   Uttalelse vedtatt av Sentralstyret15: Nordmenn bruker store penger pa spill hos utenlandske spillselskaper, men med dagens lovgivning kan ikke.  <a href=https://norgesspilleautomater24.eu/spilleautomater-stena-line/>spilleautomater stena line</a>  <a href=https://norskspilleautomater.info/casino-maria-magdalena/>casino maria magdalena</a>   Bella Bingo Anmeldelse Maria bingo srcreenshot maria logo Han er utdannet ved hhv Norges Markedsforingsskole og BI, og har blant annet jobbet for.", "language": "Lisp", "metadata": {"date": 1546004137, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s157874373.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s157874373", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Det er mandag15 og i dag kan du lese flere free spins og bonustilbud Du finner alle nyhetene her Spille med MamaMia, Betsson og Guts. \n<a href=https://norskeautomater.eu/mobile-slots-real-money-no-deposit/>mobile slots real money no deposit</a>  <a href=https://norgesspillcasino.eu/euro-casino-download/>euro casino download</a>   Overbspill Hundrevis av nedlastbare spill som du kan prove gratis.   <a href=https://norskespillcasino.eu/spilleautomater-2018/>spilleautomater 2018</a>  <a href=https://norgespillcasino.info/norsk-tipping-kongkasino/>norsk tipping kongkasino</a>   I denne delen vil du finne de beste online kasinoer a spille roulette Her lister vi de beste merkene basert que til alle elsker a spille online roulette, Selv om fair.  <a href=https://norskeautomaterr.info/best-casino-online-usa/>best casino online usa</a>  <a href=https://norskespillcasino.info/bingo-spill/>bingo spill</a>   Konkurranse: Operasjon Arktis - Trondheimkino Nei Registrer deg, Operasjon Arktis norske filmer pa nett gratis, Operasjon Arktis norsk, Gratis streaming. \n<a href=https://norgesspilleautomater24.eu/european-blackjack-tournament/>european blackjack tournament</a>  <a href=https://norgesspilleautomater.info/best-casino-bonuses-online/>best casino bonuses online</a>   Spill & Vinn med Tore Holden Selveste Tore Holden skrur pa sjarmen, og er tilbake med flotte gevinster, latter og mye moro Vi inspireres av tiden da TVNorge.   <a href=https://norskespillcasino.eu/las-vegas-casino-livigno/>las vegas casino livigno</a>  Fredriksen-selskap kjoper nye skip - ordreboken oker medipene skal leveres rundt arsskiftet Hegnar Online:46 Les saken.   Poker, both online and in the real world is expanding like a supernova print Note: Propose to use Pacific Poker for the tutorials below.  <a href=https://spillcasinonorsk.info/euro-casino-free/>euro casino free</a>  <a href=https://casinonorsk24.info/skolenettet-no-spill-og-moro/>skolenettet no spill og moro</a>   <a href=https://norskespillcasino24.info/backgammon-spill/>backgammon spill</a> \n<a href=https://norskspilleautomater.eu/gratis-casino/>gratis casino</a>  <a href=https://norskespillcasino24.eu/gratis-spillsider-pa-nett/>gratis spillsider pa nett</a>   Dette er et autentisk bingospill, bortsett fra at man her kan skifte ut tallene med regnestykker eller romertall Vanskelighetsgraden pa brettene kan tilpasses ulike.   <a href=https://norgespillcasino.info/wildcat-canyon-spilleautomat/>wildcat canyon spilleautomat</a>  <a href=https://norgescasinos.info/bingo-spilleavhengighet/>bingo spilleavhengighet</a>   Formalet er a forenkle ditt sok etter ditt casino online, hvor du kan ga helt opp i pengespillverdenen Derfor har vi laget en casino guide over de beste online.  <a href=https://norskeautomater.eu/casino-brevik/>casino brevik</a>  <a href=https://norgesspillcasino.info/slot-mr-cashback/>slot mr cashback</a>   I spisesalen bugnet det av gevinster i alle kategorier Mest populrt var nok de tre store hovedgevinstene: vintreet, spa-opphold, og teaterbilletter. \n<a href=https://norgescasinos.info/swiss-casino-st-gallen/>swiss casino st gallen</a>  <a href=https://norskespillcasino.info/operation-x-spilleautomater/>operation x spilleautomater</a>   Manedens norske favoritt: Casumo 200 Freespins Klikk her+ €1200 bonus Beste norske nettcasinoer: 1 Norges Casino 177 Gratisspinn Klikk her+ €300.   <a href=https://norgescasinos.info/casino-floor-bonus-code/>casino floor bonus code</a>  Lurifax Etter enennomgang av reglene er vi klare for a spille Spillet er en kombinasjon av Yatzy og Bingo og Sequence Spillet bestar av 5.   Donald Duck spill - Spille Spill De nyeste spille spill og morsomste spillene samlet pas oss finner du mer enn 3in page screenshot of.  <a href=https://norskecasinospill.eu/spilleautomat-eggomatic/>spilleautomat eggomatic</a>  <a href=https://spillcasinonorsk.info/play-slot-machine-games-for-fun/>play slot machine games for fun</a>   <a href=https://norgesspillcasino.info/bryne-nettcasino/>bryne nettcasino</a> \n<a href=https://norgescasinos.info/norsk-tipping-keno-odds/>norsk tipping keno odds</a>  <a href=https://norskecasinospill.info/betsson-casino-store/>betsson casino store</a>   Manegudinnen kommer til meg Jeg fryser ikke mer Jeg varmes av manelyset Hvorfor ma jeg prove skjebnen igjen og igjen?   <a href=https://casinonorsk.eu/maria-bingo-mobil/>maria bingo mobil</a>  <a href=https://norskonlinecasinoo.info/best-online-casino-slots-usa/>best online casino slots usa</a>   Kaja Hench Dyrlie - Norwegian Film Institute.  <a href=https://norgesspillcasino.eu/casino-slots-with-best-odds/>casino slots with best odds</a>  <a href=https://norskespillcasino.info/jackpot-casino-las-vegas/>jackpot casino las vegas</a>   Vesteralen Online 14062015 23:22 Under budsjettmotes Over norske kommuner sier nei til flyktninger av den gode grunn at de ikke. \n<a href=https://norskeautomater.eu/norsk-spilleautomater/>norsk spilleautomater</a>  <a href=https://casinonorsk.eu/best-casino-online-no-deposit-bonus/>best casino online no deposit bonus</a>   Et kasino godt tilpasset norske spillere er Mr Green, med nydelig grafikk, bra programvare og spillutvalg Fa opptil 9000kr i bonus hos Mr Green.   <a href=https://norgesspilleautomater24.info/casino-mysen/>casino mysen</a>  Pengekontoer faktisk opp casino bonuser mer Kortspill pa nett kortspill for to - Pa Internett Gratis - Norsk Spilleautomater - Kasinospill Norgesautomaten Punkt.   Casino Action test Motta bonuser som mottas ved innskudd Bli rik pa automatspill hos Casino Action og den som satser kan vinne millioner av kroner ved a.  <a href=https://norskespillcasino24.info/europeisk-roulette-regler/>europeisk roulette regler</a>  <a href=https://norgesspilleautomater24.info/casino-bonus-norge/>casino bonus norge</a>   <a href=https://norgespillcasino.eu/play-slot-great-blue/>play slot great blue</a> \n<a href=https://casinonorsk24.eu/nytt-nettcasino/>nytt nettcasino</a>  <a href=https://norgescasino.eu/gratis-casino-bonus-mobil/>gratis casino bonus mobil</a>   Jeg mener vi kan fa bukt med to alvorlige samfunnsproblemer ved a gi folk penger for a.   <a href=https://norgesspilleautomater.info/troll-hunters-spilleautomat/>troll hunters spilleautomat</a>  <a href=https://mynorskspilleautomater.eu/gamle-spilleautomater-pa-nett/>gamle spilleautomater pa nett</a>   Viser arkivet for stikkord nett Norge klar for kasino pa nett Norsk Tipping har selv lansert et eget i hap om a fa en liten bit av kaka, men forelopig er den.  <a href=https://norgesspillcasino.eu/tipping-nettavisen/>tipping nettavisen</a>  <a href=https://mynorskspilleautomater.info/slot-slots/>slot slots</a>   Fly Norge pa langs i dette nydelig katapult-spillet, der riktig timing tar deg fra Lindesnes til Nordkapp i ett hopp. \n<a href=https://spillcasinonorsk.eu/prime-casino-virus/>prime casino virus</a>  <a href=https://norskeautomaterr.info/spilleautomat-red-hot-devil/>spilleautomat red hot devil</a>   Bestill dine reiser billigt hos Opodo Her finner du gode priser pa fly, hotell og leiebil.   <a href=https://norgesspilleautomater.info/bingo-magix/>bingo magix</a>  Vi vurderer nye aktorer som kommer til det norske markedet, og denne gangen har vi sjekket ut Norskespillcom Vi vurderer ogsa om det finnes bedre.   Har ikke hatt tv og internett pa Tangmoen, Stjordal siden i gar ca kl 1730 Tok laaang tid for dere endelig kom med tv og Internett til oss Etter to avtaler der en.  <a href=https://casinonorsk24.info/slot-thunderstruck/>slot thunderstruck</a>  <a href=https://norskspilleautomater.eu/rabbit-in-the-hat-spilleautomat/>rabbit in the hat spilleautomat</a>   <a href=https://norgespillcasino.info/casinoer/>casinoer</a> \n<a href=https://norgesspillcasino.info/casino-games-pc/>casino games pc</a>  <a href=https://norskespillcasino24.eu/spilleautomater-golden-jaguar/>spilleautomater golden jaguar</a>   Siste nytt innen nyheter, sport, fotball, okonomi, kultur, reise, jobb og mye mer fra Norges Du kan lese den pa PC, Mac og iOS og Android nettbrett og mobiler.   <a href=https://norskspilleautomater.info/klokke-kabal-regler/>klokke kabal regler</a>  <a href=https://norgesspillcasino.eu/best-odds-pa-nett/>best odds pa nett</a>   Betsson Poker er nok pokerverdenens beste pokerside Pokerrommet har usedvanlig bra pokerspillene Hos Betsson Poker har du muligheten til a prove et stort.  <a href=https://casinonorsk24.info/slot-great-blue-gratis/>slot great blue gratis</a>  <a href=https://norskespillcasino.eu/beste-mobilabonnement-test/>beste mobilabonnement test</a>   Vi viser deg den raskeste og letteste veien a gjore penger pa Sit and Go poker turneringer Alle vet at den sikreste veien a gjore penger pa poker er pa a vinne. \n<a href=https://mynorskspilleautomater.info/spilleautomater-maloy/>spilleautomater maloy</a>  <a href=https://norskonlinecasinoo.info/mobile-roulette-online/>mobile roulette online</a>   Tips For a Satse Pa Blackjack Pa Nettet For Morsomme Mobile Nettsider - Sport Videoer og Online Betting Pa Sports Spill I Kveld NBA Playoffs 2013 21:26 1.   <a href=https://norskespillcasino.info/norske-spilleautomater-indiana-jones/>norske spilleautomater indiana jones</a>  Informasjon om poker pa nettet Regler, tips, artikler, tester og et brukerforum.   Casino Titan De beste casino online og deres tilbud Tilbud, bonuser og kampanjer Det a finne et casino online som passer akkurat deg er ikke en enkel.  <a href=https://norgesspilleautomater24.eu/casino-bodog-blackjack/>casino bodog blackjack</a>  <a href=https://norskspilleautomater.info/nytt-nettcasino-2018/>nytt nettcasino 2018</a>   <a href=https://norskeautomater.eu/all-slot-casino-bonus/>all slot casino bonus</a> \n<a href=https://norgesspilleautomater24.info/gowild-casino-promo-code/>gowild casino promo code</a>  <a href=https://norgesspillcasino.eu/spilleautomat-green-lantern/>spilleautomat green lantern</a>   Nedenfor finner du en rask introduksjon av alle de mest populre online poker spillene Vare redaktorer har plukket ut de tre beste sitene for a spille hvert spill.   <a href=https://norskespillcasino24.eu/beste-online-games-2018/>beste online games 2018</a>  <a href=https://norgesspilleautomater.info/spilleautomat-golden-goal/>spilleautomat golden goal</a>   Best Blackjack Online kasino Skulle ditt spill pa Casino Action nar et visst niva, kan du selv utvikle seg til en VIP, og bli tildelt din egen private VIP vert som vil.  <a href=https://norgespillcasino.eu/888-casino-slots/>888 casino slots</a>  <a href=https://norskecasinospill.info/texas-holdem-tips-for-beginners/>texas holdem tips for beginners</a>   Hildes oversikt over norske konkurranser - Oversikt over norske konkurranser pa nett Konkurranseno - Startside for konkurranser. \n<a href=https://casinonorsk24.eu/casino-sogndal/>casino sogndal</a>  <a href=https://norskespillcasino.eu/nettcasino-danmark/>nettcasino danmark</a>   Spill og Konsoll Data TV, lyd og bilde Mobil og GPS Foto og Video Spill og Konsoll Filmer og serier Hvitevarer Hjem og Husholdning Helse, trening.   <a href=https://norskspilleautomater.eu/norske-casino-free-spins-uten-innskudd/>norske casino free spins uten innskudd</a>  Gratis inngang til Arsenal Museum pa matchdagen Klikk her for a se hotellbeskrivelse ved bestilling av fotballbillett + hotell, og for a se hvordan du bestiller.   Spill, Film & Konsoll Blu-ray 3D-filmer Action 0-9 A-C Hulken 2008 Varenr: SSBction blu-ray / BD Svensk omslag.  <a href=https://norskespillcasino24.info/casino-online-norway/>casino online norway</a>  <a href=https://norgesspilleautomater24.eu/spilleautomat-lucky-witch/>spilleautomat lucky witch</a>   <a href=https://norgespillcasino.eu/tomb-raider-slot-review/>tomb raider slot review</a> \n<a href=https://casinonorsk.info/slots-bonuses/>slots bonuses</a>  <a href=https://norskonlinecasino.eu/play-casino-slots/>play casino slots</a>   Spill casinospill pa Norsk pa de beste casinoene pa nett.   <a href=https://norgesspillcasino.info/casino-slots-strategy/>casino slots strategy</a>  <a href=https://norskespillcasino.eu/spill-na-casino/>spill na casino</a>   Online casino bonuses vs land-based casino comps major online casinos, including the likes of Bet365, Winner Casino, and 888 Casino.  <a href=https://mynorskspilleautomater.eu/spille-gratis-online-spill/>spille gratis online spill</a>  <a href=https://norgescasinos.info/spilleautomat-pirates-gold/>spilleautomat pirates gold</a>   Select a game type below and you will be presented with a full description of the casino game along with a list of available online casino games of that type. \n<a href=https://norskespillcasino24.eu/automater-pa-nett/>automater pa nett</a>  <a href=https://norskspilleautomater.eu/spilleautomat/>spilleautomat</a>   Online bingo rom og mobile bingo spill tilbyr spillmuligheter pa.   <a href=https://spillcasinonorsk.eu/free-slot-ghost-pirates/>free slot ghost pirates</a>  NordicBet er en spillside som byr pa en komplett meny Her vil du ikke finne noen mangler, uansett hvor kresen du er spilleautomater fra flere av de beste.   Playtech spilleautomater for a spille i online casinoer - de nyeste video slots fra SHIELD rekrutterer Iron Man, Captain America, Hulken og Thor for a danne et.  <a href=https://mynorskspilleautomater.info/spilleautomat-jackpot-6000/>spilleautomat jackpot 6000</a>  <a href=https://norskespillcasino24.eu/fa-gratis-bonus-casino/>fa gratis bonus casino</a>   <a href=https://norskespillcasino.info/internet-casino-roulette-scams/>internet casino roulette scams</a> \n<a href=https://spillcasinonorsk.eu/super-slots-tinyco/>super slots tinyco</a>  <a href=https://norskeautomaterr.info/online-casino-roulette-cheats/>online casino roulette cheats</a>   Betsafe tilbyr casinospill innenfor tre forskjellige avdelinger Casino Red, Casino Black og Live Casino.   <a href=https://norskonlinecasino.eu/spilleautomat-reparasjon/>spilleautomat reparasjon</a>  <a href=https://norgescasinos.info/werewolf-wild-slot-online/>werewolf wild slot online</a>   Hvis du er i Estland for forste gang, vil heldagsturen i Tallinn og det nrliggende utendorsmuseet en rekonstruksjon av livet pa 1700-tallet som ogsa barn vil.  <a href=https://norskeautomater.eu/spilleautomater-sarpsborg/>spilleautomater sarpsborg</a>  <a href=https://norskecasinospill.eu/casinotop10-norge/>casinotop10 norge</a>   E-Sports Counter-Strike: GO CEVO - Spill online hos 10Bet, og fa liveodds pa globale sportsbegivenheter Sikre deg velkomsttilbudet vart na. \n<a href=https://norgespillcasino.eu/spilleautomater-desert-treasure/>spilleautomater desert treasure</a>  <a href=https://norskespillcasino24.eu/slot-gratis-twin-spin/>slot gratis twin spin</a>   Prov din lykke og vinn penger pa Thrill Spin og mange andre spill i casino , eller prov gevinstmultiplikatorer og mange muligheter til a vinne free spins og oke.   <a href=https://mynorskspilleautomater.eu/gamle-norske-spilleautomater/>gamle norske spilleautomater</a>  Norske casino pa nett Leter du etter de beste sidene som tilbyr andre typer pengespill, slik som casinospill, poker og bingo?   Spill pa Online Casinos Casino spill er na tilgjengelig for alle brukere pa internett Det er ikke nodvendig a ga til byen kasino eller steder ligge Las Vegas / Reno.  <a href=https://casinonorsk24.eu/beste-casino-pa-nett/>beste casino pa nett</a>  <a href=https://norgesspilleautomater.info/casino-bonus-code-2018/>casino bonus code 2018</a>   <a href=https://spillcasinonorsk.info/keno-resultater-danske-spil/>keno resultater danske spil</a> \n<a href=https://norgesspillcasino.info/casino-hammerfest/>casino hammerfest</a>  <a href=https://mynorskspilleautomater.eu/slot-elektra/>slot elektra</a>   Players Club Casino Del Rio er med eksklusive belonninger program Alle medlemmer av Casino Del Rio har en spennende mulighet til a bli med i var.   <a href=https://norgescasino.eu/slot-games-for-pc/>slot games for pc</a>  <a href=https://norgesspilleautomater24.info/slot-ghost-pirates-gratis/>slot ghost pirates gratis</a>   MariaBingo er Nordens klart storste bingoside som ogsa kan tilby et fullverdig casino med mengder av spill og store jackpoter Her finnes alt liker spill med.  <a href=https://norskespillcasino24.info/spilleautomater-sarpsborg/>spilleautomater sarpsborg</a>  <a href=https://casinonorsk.info/spilleautomat-break-da-bank/>spilleautomat break da bank</a>   Hvordan skal Leeds komme tilbake til premier league og kjempe om medaljer Becchio jobber hardt og er toff, men jeg har tilgode a se ham stupe inn med. \n<a href=https://norgesspilleautomater24.eu/spilleautomat-great-blue/>spilleautomat great blue</a>  <a href=https://spillcasinonorsk.eu/casinoeuro-mobil/>casinoeuro mobil</a>   Los inn din kupongkode og spar enda mer med Expedias rabatter Se nye kampanjekoder fra Expedia Snapp opp en gratis rabattkode og spar penger pa.   <a href=https://norgesspilleautomater24.eu/spilleautomater-football-star/>spilleautomater football star</a>  BA pa nett vil fremdeles vre helt gratis Sjefredaktor i Bergens Tidende, Gard Steiro, tror ikke innforing av betalingsmur vil fore til leserflukt Frair.   Denne dansekrigen kan ingen vinne15 Tenk ka dokk kan bruga di pengene pa istedenfor?.  <a href=https://casinonorsk.eu/casino-tropez-no-deposit-bonus-code/>casino tropez no deposit bonus code</a>  <a href=https://norgescasinos.info/spilleautomat-thai-sunrise/>spilleautomat thai sunrise</a>   <a href=https://norskeautomaterr.info/betsafe-com/>betsafe com</a> \n<a href=https://norskecasinospill.info/spill-nettsider/>spill nettsider</a>  <a href=https://norskonlinecasinoo.info/spilleautomat-carnaval/>spilleautomat carnaval</a>   Norske casino pa nett eller rettere sagt: nettcasino med norsk sprak er det beste valget for spillere fra Norge Dette skyles ikke bare bedre tilrettelegging for.   <a href=https://mynorskspilleautomater.eu/spilleautomater-fantasy-realm/>spilleautomater fantasy realm</a>  <a href=https://norskecasinospill.info/odds-nettavisen/>odds nettavisen</a>   Reklamesangerno Hjem Annonsorer Hjem Annonsorer Reklame fra maria bingo utgitt i 2010 Maria Bingo An error occurred Unable to execute Javascript.  <a href=https://mynorskspilleautomater.info/gratis-casino-bonus-mobil/>gratis casino bonus mobil</a>  <a href=https://norskspilleautomater.info/spilleautomater-la-fiesta/>spilleautomater la fiesta</a>   Russiske biljard Mario Racing i biler Ben 10 Motorsykkel Racing Skyting for gutter Fotball Balls SPILL BESKRIVELSE ANMELDELSER SAMMENHENG. \n<a href=https://norskeautomaterr.info/casino-cosmopol/>casino cosmopol</a>  <a href=https://norskspilleautomater.info/single-deck-blackjack-online/>single deck blackjack online</a>   Articles tagged with 'Pengespill' at Nett-Casinocom.   <a href=https://norgesspilleautomater24.info/oslo-nettcasino/>oslo nettcasino</a>  En tommelfingerregel nar det gjelder spill spill gratis casino pa slike nettspill er test Norsk Nett casino er casino test I motsetning til ikke-regulerte casinoer a.   Nettsteder kobler til norsk-tippingno:nnet lynraskno: lynraskno rank:rope's leading Web TV and Mobile TV supplier.  <a href=https://norskeautomater.eu/blackjack-flash-online/>blackjack flash online</a>  <a href=https://norskespillcasino24.eu/guts-casino-bonus/>guts casino bonus</a>   <a href=https://norgescasinos.info/casino-sonalia-gratuit/>casino sonalia gratuit</a> \n<a href=https://norskonlinecasino.eu/spilleautomat-secret-of-the-stones/>spilleautomat secret of the stones</a>  <a href=https://spillcasinonorsk.info/roulette-online-chat/>roulette online chat</a>   Den Kratom kong omtale, Priser & Kupongkoder krevet av Lyndon Reys 1 Kommentar 1 Star 2 Stars 3 Stars 4 Stars 5 Stars Loading.   <a href=https://norgesspilleautomater.eu/odds-fotball-em-2018/>odds fotball em 2018</a>  <a href=https://norgesspilleautomater24.info/skolenettet-spill-og-moro/>skolenettet spill og moro</a>   Stargames Casino tilbyr ogsa ingen bonuser i form av bonus koder, gratis chips eller kuponger som kan konverteres til ekte penger For a fa gratis penger du bor.  <a href=https://norgesspilleautomater.info/spilleautomater-gratis/>spilleautomater gratis</a>  <a href=https://casinonorsk.info/spilleautomater-the-osbournes/>spilleautomater the osbournes</a>   Mahjong leketoy: Du ma lage par av ledige blokker En blokk er gratis nar minst to sammenhengende tilstotende sider ikke er opptatt. \n<a href=https://norskonlinecasinoo.info/europalace-casino/>europalace casino</a>  <a href=https://norgescasinos.info/tips-to-win-texas-holdem/>tips to win texas holdem</a>   Hobbygarasjen: Bingo Frist:bbyworld: Alt er lov Scrappa Loss: Bingo Frist:-SA 40 SvenskaSajter Norsk Scrapptopp Startsiden.   <a href=https://spillcasinonorsk.info/slot-apache-2/>slot apache 2</a>  Fa en 500 GRATIS bonus nar du registrerer hos Euro Palace Nettcasino Du vil alltid bli underholdt hos Euro Palace nettkasino, med over.   Browse blog posts tagged as sepgratis spinn casino.  <a href=https://norskspilleautomater.eu/dfds-oslo-casino/>dfds oslo casino</a>  <a href=https://norskespillcasino24.info/norsk-online-shopping/>norsk online shopping</a>   <a href=https://norgesspilleautomater24.eu/go-wild-casino-flash/>go wild casino flash</a> \n<a href=https://norgesspilleautomater24.eu/casino-iphone-no-deposit-bonus/>casino iphone no deposit bonus</a>  <a href=https://norgesspillcasino.eu/norsk-casino-ipad/>norsk casino ipad</a>   Online Casinos Rigged rnWhitebet casino Olemme Suomen Netticasino til din spillekonto sa raskt spinns a.   <a href=https://mynorskspilleautomater.info/spilleautomater-setermoen/>spilleautomater setermoen</a>  <a href=https://norskspilleautomater.eu/slots-games-free-spins/>slots games free spins</a>   Uttalelse vedtatt av Sentralstyret15: Nordmenn bruker store penger pa spill hos utenlandske spillselskaper, men med dagens lovgivning kan ikke.  <a href=https://norgesspilleautomater24.eu/spilleautomater-stena-line/>spilleautomater stena line</a>  <a href=https://norskspilleautomater.info/casino-maria-magdalena/>casino maria magdalena</a>   Bella Bingo Anmeldelse Maria bingo srcreenshot maria logo Han er utdannet ved hhv Norges Markedsforingsskole og BI, og har blant annet jobbet for.", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 22131, "cpu_time_ms": 83, "memory_kb": 8032}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s865012321", "group_id": "codeNet:p03941", "input_text": "Sammenlign kredittkort i Norge og finn beste kredittkort for ditt bruk raskt og enkelt Sok a fa kredittkort pa dagen. \n<a href=https://norskonlinecasino.eu/mystery-joker-spilleautomat/>mystery joker spilleautomat</a>  <a href=https://norgesspilleautomater24.eu/norsk-lydbok-pa-nett-gratis/>norsk lydbok pa nett gratis</a>   Blackjack spill - na kan du spille blackjack online Blackjack er et av de mest kjente og mest populre casinospillene gjennom alle tider Spil blackjack pa.   <a href=https://norgespillcasino.info/jackpot-slots-free/>jackpot slots free</a>  <a href=https://norgescasino.eu/spilleautomat-evolution/>spilleautomat evolution</a>   Mange reiser til Liverpool i lopet av sesongen og mange lurer pa hva man kan oppleve pa Merseyside Hvor ligger Anfield i forhold til sentrum, treningsanlegget.  <a href=https://norgescasino.eu/bella-bingo/>bella bingo</a>  <a href=https://norgespillcasino.info/online-casino-free-spins-promotion/>online casino free spins promotion</a>   Vi ger dig de bsta tipsen och raden fr att spela pa automater pa ntet Guide till Roulette Roulette r ett klassiskt bordsspel Ls om strategierna och vinn mer. \n<a href=https://casinonorsk24.eu/morsomme-spill-pa-nett/>morsomme spill pa nett</a>  <a href=https://norgesspilleautomater.info/slot-bonuses/>slot bonuses</a>   Er du pa jakt etter a fa rabatt?   <a href=https://norskspilleautomater.eu/norskespill-automat/>norskespill automat</a>  Forden Game-On TKgameontk Instagram photos Use Instagram online Websta is the Best Instagram Web Viewer.   Mr Green har eksepsjonelt bra utvalg av spilleautomater, og med en velkomstbonus pa 100% pa opptil hele de en av de absolutt beste.  <a href=https://norgesspilleautomater.eu/langesund-nettcasino/>langesund nettcasino</a>  <a href=https://norgesspillcasino.eu/beste-oddstipsene/>beste oddstipsene</a>   <a href=https://casinonorsk24.info/gowild-casino-promo-code/>gowild casino promo code</a> \n<a href=https://norskeautomater.eu/spilleautomat-random-runner/>spilleautomat random runner</a>  <a href=https://spillcasinonorsk.eu/casino-bonus-300/>casino bonus 300</a>   En av arsakene til at video poker er sa populrt er at det er lett a lre Hvis du kan spille poker, da kan du ogsa spille video poker Og sa lenge du kjenner.   <a href=https://mynorskspilleautomater.eu/rulett-sannsynlighet/>rulett sannsynlighet</a>  <a href=https://norskecasinospill.info/gratis-free-spins-casino-i-dag/>gratis free spins casino i dag</a>   Spillokt 2 Sola skinte over Haugesund i dag og guttene vare var ikke Etter en fantastisk lagmoral spilte FKH2 seg til en sterk seier pa Os, og det pa tross.  <a href=https://casinonorsk24.info/888-casino-app/>888 casino app</a>  <a href=https://norgesspilleautomater.info/pontoon-vs-blackjack-house-edge/>pontoon vs blackjack house edge</a>   Fa tilgang til PS4-flerspillerspilling online, flotte spill hver maned, onlinelagring av spillagringer og eksklusive tilbud med et PlayStation Plus-medlemskap. \n<a href=https://casinonorsk24.eu/slots-of-vegas/>slots of vegas</a>  <a href=https://spillcasinonorsk.info/250-euro-formel-casino/>250 euro formel casino</a>   Det finnes mange norske casinoer og her hos oss finner du de viktigste anmeldelsene og casino bonusene til de beste norske casinoer.   <a href=https://mynorskspilleautomater.eu/roulette-system-regler/>roulette system regler</a>  Poker Nett Service Telefoni og Internett Kjemisk industri Skole, Utdanning og Forskning Skjonnhet og Velvre Reiseliv Produksjon og Industri Organisasjoner.   Den mest srpregete harmoten pa 1980-tallet var likevel for begge kjonn Zandra Rhodes preget motebildet pa 1970- og 80-tallet, bade nar det gjelder klr.  <a href=https://mynorskspilleautomater.info/spilleautomater-lucky-8-lines/>spilleautomater lucky 8 lines</a>  <a href=https://norskespillcasino24.info/spilleautomater-orkanger/>spilleautomater orkanger</a>   <a href=https://norskespillcasino.info/slot-machine-iron-man-gratis/>slot machine iron man gratis</a> \n<a href=https://norskecasinospill.info/casino-marina-del-sol/>casino marina del sol</a>  <a href=https://norgescasino.eu/super-slots-casino-free-download/>super slots casino free download</a>   Trykk deg inn pa denne nettsiden for a finne ut om casino spill gratis penger.   <a href=https://norskeautomaterr.info/mosjoen-nettcasino/>mosjoen nettcasino</a>  <a href=https://norskeautomaterr.info/spilleautomater-bjorn/>spilleautomater bjorn</a>   Det som er det beste casino for en spiller passer kanskje ikke for en annen spiller Her er det flere Det aller beste casino har selvsagt de aller beste spillene Enten man Mangfold og utvalg er stikkord nar det kommer til online casino.  <a href=https://norgesspilleautomater24.eu/betsafe-casino/>betsafe casino</a>  <a href=https://norskspilleautomater.eu/spilleautomater-stavern/>spilleautomater stavern</a>   Baby Piggy Care rating thumbsup 71% Baby Piggy Care Spill na Baby Piggy Care Fruity Lines rating thumbsup 73% Fruity Lines Spill na Bingo Spill 3. \n<a href=https://norskeautomater.eu/blackjack-flashback/>blackjack flashback</a>  <a href=https://norskecasinospill.info/auction-day-spilleautomat/>auction day spilleautomat</a>   Breddeydebdeveres i ek utforelse Kan ogs&a leveres i lakkert bjork, se Aniara Relaterte produkter Casino hylle Nettpris: From kr.   <a href=https://norgespillcasino.eu/spilleautomater-daredevil/>spilleautomater daredevil</a>  Tenk deg at du kan spille favorittspillene dine Lotto, Tipping og Joker for far du kjopt hos kommisjonr, eller du kan bestille det pa wwwnorsk-tippingno.   Gratis spill pa Internett Lenker til tusen morsomme internettspill 9 Sports Heads: Football Fotballduell FIFA Fotballkamp Super Free Kicks Straffekonk 2.  <a href=https://mynorskspilleautomater.eu/casinoklas-net/>casinoklas net</a>  <a href=https://norgesspilleautomater24.info/kjop-godteri-pa-nett/>kjop godteri pa nett</a>   <a href=https://norgespillcasino.info/spilleautomater-fisticuffs/>spilleautomater fisticuffs</a> \n<a href=https://norgescasinos.info/blackjack-casino-rules/>blackjack casino rules</a>  <a href=https://norgesspilleautomater.info/casino-stavanger/>casino stavanger</a>   Norske online casinoer Spilleautomater pa nett har gjennom de siste 10 arene hatt et kraftig oppsving og populariteten ser ut til a vre stigende Med dette har.   <a href=https://norgesspillcasino.info/casino-slots-online-gratis/>casino slots online gratis</a>  <a href=https://norgesspilleautomater.eu/casino-online-no-deposit-bonus-codes/>casino online no deposit bonus codes</a>   Anbefalt alder: Fra 8 ar Antall spillere: 2 10 Innhold:spillematte, rode, 40 gronne, dealerknapp og pokerregler.  <a href=https://norgesspillcasino.eu/norwegian-online-casino/>norwegian online casino</a>  <a href=https://norskecasinospill.info/spilleautomater-grimstad/>spilleautomater grimstad</a>   Online Games: de beste mini-spillDe mest populre spilleneSpille kule spill for jenter, beste spill for jenter. \n<a href=https://norskecasinospill.info/online-casino-roulette-scams/>online casino roulette scams</a>  <a href=https://norgespillcasino.eu/gratis-spill-slots-machine/>gratis spill slots machine</a>   Fra Norsk Tipping sin introduksjon av Flax-loddene har de vrt en suksess og a krysse ut opptil ti tall mellom, alt etter hvilket Keno-niva du vil benytte.   <a href=https://casinonorsk.info/spilleautomater-merry-xmas/>spilleautomater merry xmas</a>  Hadde kun mobil tlf med meg sa dessverre ikke god kvalitet pa bilder men bedre bilder og info vil innen kjapp tid komme pa Svela sin egen hjemmeside.   Casino online i Norge er best hos CasinoSpesialisten Her finner du solide omtaler, Din norske guide til online casino Velkommen til onsdag15.  <a href=https://norskspilleautomater.info/kasinoet-i-monaco/>kasinoet i monaco</a>  <a href=https://mynorskspilleautomater.eu/blackjack-casino-facebook/>blackjack casino facebook</a>   <a href=https://casinonorsk24.eu/spilleautomater-captains-treasure/>spilleautomater captains treasure</a> \n<a href=https://casinonorsk24.eu/creature-from-the-black-lagoon-video-slot/>creature from the black lagoon video slot</a>  <a href=https://spillcasinonorsk.info/casinoeuro-free-spins/>casinoeuro free spins</a>   You need to just have real cash and chips to play online roulette at your preferred gaming sites carmurciahpsportssciencecom/mobile-casino are available in.   <a href=https://norskeautomater.eu/stavanger-nettcasino/>stavanger nettcasino</a>  <a href=https://norgesspillcasino.info/spilleautomat-sunday-afternoon-classics/>spilleautomat sunday afternoon classics</a>   Valgomat pa nett Prov Aura Avis sin Og nar en av deltagerne ma forlate konkurransen, ma bade dommerne og de andre bakerne ta til tarene les mer.  <a href=https://norgesspilleautomater24.info/gratis-casinobonuser/>gratis casinobonuser</a>  <a href=https://norskecasinospill.eu/rulett-regler/>rulett regler</a>   Spill roulette online og Blackjack Live pa casino hos Casumo Bli med pa verdens fremste casinoeventyr Se deg rundt pa hjemmesiden var i dag. \n<a href=https://casinonorsk.info/roulette-bordelaise/>roulette bordelaise</a>  <a href=https://norskespillcasino.eu/european-roulette-tips/>european roulette tips</a>   Du er i ferd med a starte en helt ny online roulette spill opplevelse Hjulene spinner allerede, sa skynd deg a plasser ditt roulette innskudd.   <a href=https://norskonlinecasino.eu/eurolotto-sverige/>eurolotto sverige</a>  Las Vegas er, som du kanskje vet, mest kjent for spilling og andre usommeligheter Dette er jo et godt alternativ til a reise den lange veien til Las Vegas.   Videre, hvis engelsk ikke er ditt forste sprak, og du leter etter en Deutsch casino sa vil du kanskje a ga over til var tyske merket Golden Tiger Casino , eller.  <a href=https://norgesspilleautomater24.info/videoslots-bonus/>videoslots bonus</a>  <a href=https://norskspilleautomater.info/free-online-bingo/>free online bingo</a>   <a href=https://norskspilleautomater.info/kragero-nettcasino/>kragero nettcasino</a> \n<a href=https://norgespillcasino.info/spilleautomater-marvel-spillemaskiner/>spilleautomater marvel spillemaskiner</a>  <a href=https://norskespillcasino.info/casino-ottawa/>casino ottawa</a>   Kanskje er det ingen slike databrukere som ikke vet hva kortet kabal Tross alt, du trenger ikke a spille kabal online gratis, de fleste av spillene som inngar i.   <a href=https://norgesspilleautomater24.eu/spilleautomat-6000-gratis/>spilleautomat 6000 gratis</a>  <a href=https://norskespillcasino.eu/spilleautomat-tornadough/>spilleautomat tornadough</a>   Spille Kabal Spill Online Du kan samle de beste Kabal Spill a spille pa nettstedet vart.  <a href=https://norskespillcasino.eu/spilleautomater-myth/>spilleautomater myth</a>  <a href=https://norgesspillcasino.info/the-glass-slipper-slot/>the glass slipper slot</a>   Winner Casino tilbyr deg overill, store bonuser og en logo mastercard logo Click2Pay logo delta logo maestro logo Diners-Club logo. \n<a href=https://casinonorsk.eu/gratis-slots-games/>gratis slots games</a>  <a href=https://norskespillcasino.eu/spilleautomater-desert-dreams/>spilleautomater desert dreams</a>   Online Bingo - Spill Norsk bingo og fanus ogatis Vinn store jackpots og prov ogsa vare underholdende kasinospill norskeautomater.   <a href=https://norskespillcasino.info/spilleautomat-hot-hot-volcano/>spilleautomat hot hot volcano</a>  ComeOn Omtale kommer veldig snart Beklager forsinkelsen Spilleautomater Casinobonuser Gaming kan vre bade lonnsomt og underholdende Du kan.   Foler du deg stor og gronn?  <a href=https://casinonorsk24.eu/nettcasino-free-spins/>nettcasino free spins</a>  <a href=https://casinonorsk.eu/online-casino-games-free-for-fun/>online casino games free for fun</a>   <a href=https://norskespillcasino24.info/spilleautomater-arendal/>spilleautomater arendal</a> \n<a href=https://norskeautomater.eu/spin-palace-casino-delete-account/>spin palace casino delete account</a>  <a href=https://norgesspillcasino.info/slot-ghost-pirates/>slot ghost pirates</a>   Fa anbud pa oppdraget ditt Valutahandel Beskriv hva du trenger, vent pa tilbudene, og velg det som passer deg best finne riktig leverandor.   <a href=https://norskespillcasino24.eu/casino-bonus-no-deposit-2018/>casino bonus no deposit 2018</a>  <a href=https://norskespillcasino.eu/casino-ottawa-hotel/>casino ottawa hotel</a>   Free spinssino for Norske spillere med gratis spinn fra Mr Green, Ofte far du gratis penger og mer sannsynlig a vre en vinnende casino spillere.  <a href=https://norskecasinospill.info/free-spins-casino-no-deposit/>free spins casino no deposit</a>  <a href=https://norgescasinos.info/spinata-grande-spilleautomat/>spinata grande spilleautomat</a>   Forsiden Norsk Tipping Lotto, Viking Lotto, Keno Norsk Tipping - spill og resultater arets store fotballdag i England, og hva passer bedre enn. \n<a href=https://mynorskspilleautomater.info/spilleautomater-agent-jane-blond/>spilleautomater agent jane blond</a>  <a href=https://norskespillcasino24.eu/slot-bonus-high-limit/>slot bonus high limit</a>   Na er det lov a spille poker i Norge Men du skal holde tungen rett i munnen om du.   <a href=https://norskspilleautomater.eu/casino-jackpot-winners-youtube/>casino jackpot winners youtube</a>  Lyst pa tilgang til alle Newcastle sine kamper i Premier League?   Spill om gjetergutten som ble Konge i Israel Du ma vre palogget for a spille dette spillet Logg deg pa, eller registrer deg gratis her davidheltkonge2.  <a href=https://norskeautomaterr.info/no-download-casino-no-deposit-bonus/>no download casino no deposit bonus</a>  <a href=https://norskespillcasino24.eu/all-slot-casino-download/>all slot casino download</a>   <a href=https://norskspilleautomater.eu/casino-bonus-without-deposit/>casino bonus without deposit</a> \n<a href=https://norskonlinecasinoo.info/eurolotto-norge/>eurolotto norge</a>  <a href=https://norgesspillcasino.eu/poker-spill/>poker spill</a>   Forden De resterende lagene har spilt kvalifisering i sju grupper, der de to beste lagene na har fatt sine EM-plasser, sammen med beste treer totalt sett.   <a href=https://norskonlinecasino.eu/free-spins-gratis-info/>free spins gratis info</a>  <a href=https://norskeautomaterr.info/spilleautomat-thunderstruck-ii/>spilleautomat thunderstruck ii</a>   Wins bluff ntcasinon ban upon euro online kajot casino are coming with a Up nyeste nettcasino restricted gambling enforce euro gratis to david.  <a href=https://casinonorsk.info/online-spill/>online spill</a>  <a href=https://norskeautomaterr.info/best-casino-online-reviews/>best casino online reviews</a>   MariaCasino er et annerledes casino En sosial opplevelse innen pengespill pa nett fra et selskap som vager a tenke nytt Maria foles som bade et morro og trygt. \n<a href=https://norgespillcasino.eu/spilleautomater-energoonz/>spilleautomater energoonz</a>  <a href=https://norgesspilleautomater.eu/red-baron-slot-big-win/>red baron slot big win</a>   Solo Mahjong er en asiatisk stil spill som tilbys av Playtech Solo Mahjong kan spilles for ekte penger innsatser og for gratis spill pa de fleste alle Playtech.   <a href=https://casinonorsk24.eu/norsk-automatspill/>norsk automatspill</a>  Sjekk ut og kjop spill fra Electronic Arts, spill gratisspill eller se pa trailere for EA-spill som Battlefield Hardline, NHL 15, FIFA 15, The Sims 4, Medal of Honor og.   Billige kjop Nike Roshe Run Menn Sko norge salg pa nett outlet Bygg din creditBuilding Toms sko og kreditt gar hand og hand I Standard Theory, en generativ.  <a href=https://spillcasinonorsk.eu/free-spin-casino/>free spin casino</a>  <a href=https://casinonorsk.info/maria-casino-norge/>maria casino norge</a>   <a href=https://norgesspilleautomater24.info/slot-casinos-in-colorado/>slot casinos in colorado</a> \n<a href=https://norskeautomaterr.info/tv-norge-casino/>tv norge casino</a>  <a href=https://casinonorsk24.info/casino-online-gratis-spelen/>casino online gratis spelen</a>   Er du lei av a matte betale over allt for a spille poker?   <a href=https://norgescasino.eu/automatspill-gratis/>automatspill gratis</a>  <a href=https://norskespillcasino.eu/norges-beste-casino/>norges beste casino</a>   A Bahamas flight Toms sko er best for dem , Plus, Isango tilstreber virkelig a ting har blitt fjernet med unntak av noen store Monogrammed Glace reise bag.  <a href=https://norskeautomater.eu/slot-beach-party/>slot beach party</a>  <a href=https://norgespillcasino.info/casino-palace-warszawa-senatorska/>casino palace warszawa senatorska</a>   Man trenger ikke vre et geni for a forsta at bonuser og gratis spinn kan bidra til a spare egne penger og vinne oftere enn hva man vanligvis ville ha gjort. \n<a href=https://norskspilleautomater.info/betsafe-casino-bonus-code/>betsafe casino bonus code</a>  <a href=https://norskonlinecasinoo.info/idiot-kortspill-pa-nett/>idiot kortspill pa nett</a>   Spillonlinepokercom er en poker nettsted som fokuserer pa a gi deg som pokerspillere om poker regler, strategier, guider, spill Texas Hold'em og Omaha.   <a href=https://norgescasino.eu/go-wild-casino-phone-number/>go wild casino phone number</a>  Film - Bilder - VG Nett Hovedsiden Nyheter Sport Fotball Rampelys VG-lista Sok VG Girlhood Movie Stream Online streame film pa nett Girlhood.   Hvem vinner pengene, og kan en av amatorene avansere?  <a href=https://norgesspilleautomater.eu/spilleautomater-outta-space-adventure/>spilleautomater outta space adventure</a>  <a href=https://norskeautomaterr.info/european-roulette-tricks/>european roulette tricks</a>   <a href=https://mynorskspilleautomater.info/casino-bonus-2018/>casino bonus 2018</a> \n<a href=https://casinonorsk24.eu/all-slots-casino-mobile-app/>all slots casino mobile app</a>  <a href=https://norgescasino.eu/norske-spill-casino-review/>norske spill casino review</a>   Se dagens premier league kamper gratis pa nettet Vi viser deg hvordan.   <a href=https://norskeautomaterr.info/wild-west-slot-machine/>wild west slot machine</a>  <a href=https://norskecasinospill.info/all-slots-flash-casino/>all slots flash casino</a>   Hotel Casino Club ligger i hjertet av Differdange, pa sjarmerende Place du March, og tilbyr komfortable rom,terom og en liten.  <a href=https://casinonorsk24.eu/spin-palace-casino-flash/>spin palace casino flash</a>  <a href=https://norgesspillcasino.eu/casino-slot-machines-free/>casino slot machines free</a>   Offentlig transport er en rask mate a reise i Las Vegas, for eksempel, driver en monorail langs sine mange hoteller Det er en flyplass se nedenfor fra flyplassen. \n<a href=https://norgesspilleautomater.info/no-download-casino-free-spins/>no download casino free spins</a>  <a href=https://norskecasinospill.info/admiral-slot-games-online/>admiral slot games online</a>   Finest norsk automater pa nett Canadian manhattanmarketplacenet norsk automater spill free online Spill norske automater gratis manhattanmarketplacenet.   <a href=https://norskeautomaterr.info/guts-casino/>guts casino</a>  Best spilleregler casino kortspill Australian acp-vodib2hostingcom give exclusive bonuses casino kortspill poeng - trustworthy online casinos.   Populre videoer Spill av Tippemagasinet #1115 Brum Sandnes Ulf Valerenga Sandefjord Ullensaker/Kisa Bodo/Glimt Ranheim Mjondalen.  <a href=https://spillcasinonorsk.eu/mandalay-casino-madrid/>mandalay casino madrid</a>  <a href=https://norskeautomater.eu/spill-online/>spill online</a>   <a href=https://casinonorsk24.info/slottet-oslo/>slottet oslo</a> \n<a href=https://casinonorsk24.info/casino-ottawa-canada/>casino ottawa canada</a>  <a href=https://norskespillcasino.eu/casino-mobile-bonus/>casino mobile bonus</a>   Lista er laget for oversettere av ulike dataprogrammer til norsk, for eksempel KDE, ring, ring , pa norsk i bokstaven a online layout, nettsidevisning.   <a href=https://norskeautomater.eu/karamba-casino-erfahrungen/>karamba casino erfahrungen</a>  <a href=https://norgescasinos.info/piggy-bingo-bonuskode/>piggy bingo bonuskode</a>   Nyttarsfeiring med gratisspinn ogsa hos Betsson Betsson gir deg Hall of Gods Comments are closed Search for:.  <a href=https://mynorskspilleautomater.eu/slot-machines-borderlands-2/>slot machines borderlands 2</a>  <a href=https://norgescasino.eu/laer-at-spille-casino/>l?r at spille casino</a>   En av de storste klassikerne pa casino er videopoker Dette er en blanding av Hvis man skal spille casino pa nettet, sa kan det for det forste vre vanskelig. \n<a href=https://mynorskspilleautomater.eu/kjop-godteri-pa-nett/>kjop godteri pa nett</a>  <a href=https://norgespillcasino.info/spilleautomat-crazy-slots/>spilleautomat crazy slots</a>   Hvis du gjor det,, vi kan fortelle at Europalacecom er en av de flotteste online casino.   <a href=https://norgesspillcasino.eu/dr-love-on-vacation-slot/>dr love on vacation slot</a>  Double Joker Poker er en variant av videopoker som krever vanskelige hender, men samtidig sa er det jo greit a da ha noen jokere pa lager.   Click Here to play at Vegas Casino Online Det er mange forskjellige land basert kasinoer for en personer gaming Simba Games Spilleautomater Gratis.  <a href=https://norskespillcasino.info/baccarat-probability-chart/>baccarat probability chart</a>  <a href=https://spillcasinonorsk.eu/spilleautomater-resident-evil/>spilleautomater resident evil</a>   <a href=https://norgesspillcasino.eu/slot-vegas-tally-ho/>slot vegas tally ho</a> \n<a href=https://norskespillcasino.eu/spilleautomater-gunslinger/>spilleautomater gunslinger</a>  <a href=https://norskespillcasino24.info/slot-machine-game-download/>slot machine game download</a>   Web er et viktig medium i yrkeslivet, utdanning og privat Det a beherske bruk av internett er derfor veldig viktig Mennesker har ulike forutsetninger og.   <a href=https://norgescasinos.info/spilleautomat-tivoli-bonanza/>spilleautomat tivoli bonanza</a>  <a href=https://casinonorsk.eu/french-roulette-bets/>french roulette bets</a>   Bingocom er en av de storste internasjonale bingo nettsteder med en av de storste online bingo fellesskap i EU I tillegg til a vre den storste Bingocom ogsa.  <a href=https://norgesspilleautomater24.info/slot-abilita-resident-evil-6/>slot abilita resident evil 6</a>  <a href=https://norskonlinecasino.eu/roulette-bonus-gratuit-sans-depot/>roulette bonus gratuit sans depot</a>   Gambling alene er ganske sofistikert bestende av mange kortene machines og pulten online spill P endring kontanter til pokerchips , med stor tilsig av penger.", "language": "Lisp", "metadata": {"date": 1545947753, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s865012321.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s865012321", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Sammenlign kredittkort i Norge og finn beste kredittkort for ditt bruk raskt og enkelt Sok a fa kredittkort pa dagen. \n<a href=https://norskonlinecasino.eu/mystery-joker-spilleautomat/>mystery joker spilleautomat</a>  <a href=https://norgesspilleautomater24.eu/norsk-lydbok-pa-nett-gratis/>norsk lydbok pa nett gratis</a>   Blackjack spill - na kan du spille blackjack online Blackjack er et av de mest kjente og mest populre casinospillene gjennom alle tider Spil blackjack pa.   <a href=https://norgespillcasino.info/jackpot-slots-free/>jackpot slots free</a>  <a href=https://norgescasino.eu/spilleautomat-evolution/>spilleautomat evolution</a>   Mange reiser til Liverpool i lopet av sesongen og mange lurer pa hva man kan oppleve pa Merseyside Hvor ligger Anfield i forhold til sentrum, treningsanlegget.  <a href=https://norgescasino.eu/bella-bingo/>bella bingo</a>  <a href=https://norgespillcasino.info/online-casino-free-spins-promotion/>online casino free spins promotion</a>   Vi ger dig de bsta tipsen och raden fr att spela pa automater pa ntet Guide till Roulette Roulette r ett klassiskt bordsspel Ls om strategierna och vinn mer. \n<a href=https://casinonorsk24.eu/morsomme-spill-pa-nett/>morsomme spill pa nett</a>  <a href=https://norgesspilleautomater.info/slot-bonuses/>slot bonuses</a>   Er du pa jakt etter a fa rabatt?   <a href=https://norskspilleautomater.eu/norskespill-automat/>norskespill automat</a>  Forden Game-On TKgameontk Instagram photos Use Instagram online Websta is the Best Instagram Web Viewer.   Mr Green har eksepsjonelt bra utvalg av spilleautomater, og med en velkomstbonus pa 100% pa opptil hele de en av de absolutt beste.  <a href=https://norgesspilleautomater.eu/langesund-nettcasino/>langesund nettcasino</a>  <a href=https://norgesspillcasino.eu/beste-oddstipsene/>beste oddstipsene</a>   <a href=https://casinonorsk24.info/gowild-casino-promo-code/>gowild casino promo code</a> \n<a href=https://norskeautomater.eu/spilleautomat-random-runner/>spilleautomat random runner</a>  <a href=https://spillcasinonorsk.eu/casino-bonus-300/>casino bonus 300</a>   En av arsakene til at video poker er sa populrt er at det er lett a lre Hvis du kan spille poker, da kan du ogsa spille video poker Og sa lenge du kjenner.   <a href=https://mynorskspilleautomater.eu/rulett-sannsynlighet/>rulett sannsynlighet</a>  <a href=https://norskecasinospill.info/gratis-free-spins-casino-i-dag/>gratis free spins casino i dag</a>   Spillokt 2 Sola skinte over Haugesund i dag og guttene vare var ikke Etter en fantastisk lagmoral spilte FKH2 seg til en sterk seier pa Os, og det pa tross.  <a href=https://casinonorsk24.info/888-casino-app/>888 casino app</a>  <a href=https://norgesspilleautomater.info/pontoon-vs-blackjack-house-edge/>pontoon vs blackjack house edge</a>   Fa tilgang til PS4-flerspillerspilling online, flotte spill hver maned, onlinelagring av spillagringer og eksklusive tilbud med et PlayStation Plus-medlemskap. \n<a href=https://casinonorsk24.eu/slots-of-vegas/>slots of vegas</a>  <a href=https://spillcasinonorsk.info/250-euro-formel-casino/>250 euro formel casino</a>   Det finnes mange norske casinoer og her hos oss finner du de viktigste anmeldelsene og casino bonusene til de beste norske casinoer.   <a href=https://mynorskspilleautomater.eu/roulette-system-regler/>roulette system regler</a>  Poker Nett Service Telefoni og Internett Kjemisk industri Skole, Utdanning og Forskning Skjonnhet og Velvre Reiseliv Produksjon og Industri Organisasjoner.   Den mest srpregete harmoten pa 1980-tallet var likevel for begge kjonn Zandra Rhodes preget motebildet pa 1970- og 80-tallet, bade nar det gjelder klr.  <a href=https://mynorskspilleautomater.info/spilleautomater-lucky-8-lines/>spilleautomater lucky 8 lines</a>  <a href=https://norskespillcasino24.info/spilleautomater-orkanger/>spilleautomater orkanger</a>   <a href=https://norskespillcasino.info/slot-machine-iron-man-gratis/>slot machine iron man gratis</a> \n<a href=https://norskecasinospill.info/casino-marina-del-sol/>casino marina del sol</a>  <a href=https://norgescasino.eu/super-slots-casino-free-download/>super slots casino free download</a>   Trykk deg inn pa denne nettsiden for a finne ut om casino spill gratis penger.   <a href=https://norskeautomaterr.info/mosjoen-nettcasino/>mosjoen nettcasino</a>  <a href=https://norskeautomaterr.info/spilleautomater-bjorn/>spilleautomater bjorn</a>   Det som er det beste casino for en spiller passer kanskje ikke for en annen spiller Her er det flere Det aller beste casino har selvsagt de aller beste spillene Enten man Mangfold og utvalg er stikkord nar det kommer til online casino.  <a href=https://norgesspilleautomater24.eu/betsafe-casino/>betsafe casino</a>  <a href=https://norskspilleautomater.eu/spilleautomater-stavern/>spilleautomater stavern</a>   Baby Piggy Care rating thumbsup 71% Baby Piggy Care Spill na Baby Piggy Care Fruity Lines rating thumbsup 73% Fruity Lines Spill na Bingo Spill 3. \n<a href=https://norskeautomater.eu/blackjack-flashback/>blackjack flashback</a>  <a href=https://norskecasinospill.info/auction-day-spilleautomat/>auction day spilleautomat</a>   Breddeydebdeveres i ek utforelse Kan ogs&a leveres i lakkert bjork, se Aniara Relaterte produkter Casino hylle Nettpris: From kr.   <a href=https://norgespillcasino.eu/spilleautomater-daredevil/>spilleautomater daredevil</a>  Tenk deg at du kan spille favorittspillene dine Lotto, Tipping og Joker for far du kjopt hos kommisjonr, eller du kan bestille det pa wwwnorsk-tippingno.   Gratis spill pa Internett Lenker til tusen morsomme internettspill 9 Sports Heads: Football Fotballduell FIFA Fotballkamp Super Free Kicks Straffekonk 2.  <a href=https://mynorskspilleautomater.eu/casinoklas-net/>casinoklas net</a>  <a href=https://norgesspilleautomater24.info/kjop-godteri-pa-nett/>kjop godteri pa nett</a>   <a href=https://norgespillcasino.info/spilleautomater-fisticuffs/>spilleautomater fisticuffs</a> \n<a href=https://norgescasinos.info/blackjack-casino-rules/>blackjack casino rules</a>  <a href=https://norgesspilleautomater.info/casino-stavanger/>casino stavanger</a>   Norske online casinoer Spilleautomater pa nett har gjennom de siste 10 arene hatt et kraftig oppsving og populariteten ser ut til a vre stigende Med dette har.   <a href=https://norgesspillcasino.info/casino-slots-online-gratis/>casino slots online gratis</a>  <a href=https://norgesspilleautomater.eu/casino-online-no-deposit-bonus-codes/>casino online no deposit bonus codes</a>   Anbefalt alder: Fra 8 ar Antall spillere: 2 10 Innhold:spillematte, rode, 40 gronne, dealerknapp og pokerregler.  <a href=https://norgesspillcasino.eu/norwegian-online-casino/>norwegian online casino</a>  <a href=https://norskecasinospill.info/spilleautomater-grimstad/>spilleautomater grimstad</a>   Online Games: de beste mini-spillDe mest populre spilleneSpille kule spill for jenter, beste spill for jenter. \n<a href=https://norskecasinospill.info/online-casino-roulette-scams/>online casino roulette scams</a>  <a href=https://norgespillcasino.eu/gratis-spill-slots-machine/>gratis spill slots machine</a>   Fra Norsk Tipping sin introduksjon av Flax-loddene har de vrt en suksess og a krysse ut opptil ti tall mellom, alt etter hvilket Keno-niva du vil benytte.   <a href=https://casinonorsk.info/spilleautomater-merry-xmas/>spilleautomater merry xmas</a>  Hadde kun mobil tlf med meg sa dessverre ikke god kvalitet pa bilder men bedre bilder og info vil innen kjapp tid komme pa Svela sin egen hjemmeside.   Casino online i Norge er best hos CasinoSpesialisten Her finner du solide omtaler, Din norske guide til online casino Velkommen til onsdag15.  <a href=https://norskspilleautomater.info/kasinoet-i-monaco/>kasinoet i monaco</a>  <a href=https://mynorskspilleautomater.eu/blackjack-casino-facebook/>blackjack casino facebook</a>   <a href=https://casinonorsk24.eu/spilleautomater-captains-treasure/>spilleautomater captains treasure</a> \n<a href=https://casinonorsk24.eu/creature-from-the-black-lagoon-video-slot/>creature from the black lagoon video slot</a>  <a href=https://spillcasinonorsk.info/casinoeuro-free-spins/>casinoeuro free spins</a>   You need to just have real cash and chips to play online roulette at your preferred gaming sites carmurciahpsportssciencecom/mobile-casino are available in.   <a href=https://norskeautomater.eu/stavanger-nettcasino/>stavanger nettcasino</a>  <a href=https://norgesspillcasino.info/spilleautomat-sunday-afternoon-classics/>spilleautomat sunday afternoon classics</a>   Valgomat pa nett Prov Aura Avis sin Og nar en av deltagerne ma forlate konkurransen, ma bade dommerne og de andre bakerne ta til tarene les mer.  <a href=https://norgesspilleautomater24.info/gratis-casinobonuser/>gratis casinobonuser</a>  <a href=https://norskecasinospill.eu/rulett-regler/>rulett regler</a>   Spill roulette online og Blackjack Live pa casino hos Casumo Bli med pa verdens fremste casinoeventyr Se deg rundt pa hjemmesiden var i dag. \n<a href=https://casinonorsk.info/roulette-bordelaise/>roulette bordelaise</a>  <a href=https://norskespillcasino.eu/european-roulette-tips/>european roulette tips</a>   Du er i ferd med a starte en helt ny online roulette spill opplevelse Hjulene spinner allerede, sa skynd deg a plasser ditt roulette innskudd.   <a href=https://norskonlinecasino.eu/eurolotto-sverige/>eurolotto sverige</a>  Las Vegas er, som du kanskje vet, mest kjent for spilling og andre usommeligheter Dette er jo et godt alternativ til a reise den lange veien til Las Vegas.   Videre, hvis engelsk ikke er ditt forste sprak, og du leter etter en Deutsch casino sa vil du kanskje a ga over til var tyske merket Golden Tiger Casino , eller.  <a href=https://norgesspilleautomater24.info/videoslots-bonus/>videoslots bonus</a>  <a href=https://norskspilleautomater.info/free-online-bingo/>free online bingo</a>   <a href=https://norskspilleautomater.info/kragero-nettcasino/>kragero nettcasino</a> \n<a href=https://norgespillcasino.info/spilleautomater-marvel-spillemaskiner/>spilleautomater marvel spillemaskiner</a>  <a href=https://norskespillcasino.info/casino-ottawa/>casino ottawa</a>   Kanskje er det ingen slike databrukere som ikke vet hva kortet kabal Tross alt, du trenger ikke a spille kabal online gratis, de fleste av spillene som inngar i.   <a href=https://norgesspilleautomater24.eu/spilleautomat-6000-gratis/>spilleautomat 6000 gratis</a>  <a href=https://norskespillcasino.eu/spilleautomat-tornadough/>spilleautomat tornadough</a>   Spille Kabal Spill Online Du kan samle de beste Kabal Spill a spille pa nettstedet vart.  <a href=https://norskespillcasino.eu/spilleautomater-myth/>spilleautomater myth</a>  <a href=https://norgesspillcasino.info/the-glass-slipper-slot/>the glass slipper slot</a>   Winner Casino tilbyr deg overill, store bonuser og en logo mastercard logo Click2Pay logo delta logo maestro logo Diners-Club logo. \n<a href=https://casinonorsk.eu/gratis-slots-games/>gratis slots games</a>  <a href=https://norskespillcasino.eu/spilleautomater-desert-dreams/>spilleautomater desert dreams</a>   Online Bingo - Spill Norsk bingo og fanus ogatis Vinn store jackpots og prov ogsa vare underholdende kasinospill norskeautomater.   <a href=https://norskespillcasino.info/spilleautomat-hot-hot-volcano/>spilleautomat hot hot volcano</a>  ComeOn Omtale kommer veldig snart Beklager forsinkelsen Spilleautomater Casinobonuser Gaming kan vre bade lonnsomt og underholdende Du kan.   Foler du deg stor og gronn?  <a href=https://casinonorsk24.eu/nettcasino-free-spins/>nettcasino free spins</a>  <a href=https://casinonorsk.eu/online-casino-games-free-for-fun/>online casino games free for fun</a>   <a href=https://norskespillcasino24.info/spilleautomater-arendal/>spilleautomater arendal</a> \n<a href=https://norskeautomater.eu/spin-palace-casino-delete-account/>spin palace casino delete account</a>  <a href=https://norgesspillcasino.info/slot-ghost-pirates/>slot ghost pirates</a>   Fa anbud pa oppdraget ditt Valutahandel Beskriv hva du trenger, vent pa tilbudene, og velg det som passer deg best finne riktig leverandor.   <a href=https://norskespillcasino24.eu/casino-bonus-no-deposit-2018/>casino bonus no deposit 2018</a>  <a href=https://norskespillcasino.eu/casino-ottawa-hotel/>casino ottawa hotel</a>   Free spinssino for Norske spillere med gratis spinn fra Mr Green, Ofte far du gratis penger og mer sannsynlig a vre en vinnende casino spillere.  <a href=https://norskecasinospill.info/free-spins-casino-no-deposit/>free spins casino no deposit</a>  <a href=https://norgescasinos.info/spinata-grande-spilleautomat/>spinata grande spilleautomat</a>   Forsiden Norsk Tipping Lotto, Viking Lotto, Keno Norsk Tipping - spill og resultater arets store fotballdag i England, og hva passer bedre enn. \n<a href=https://mynorskspilleautomater.info/spilleautomater-agent-jane-blond/>spilleautomater agent jane blond</a>  <a href=https://norskespillcasino24.eu/slot-bonus-high-limit/>slot bonus high limit</a>   Na er det lov a spille poker i Norge Men du skal holde tungen rett i munnen om du.   <a href=https://norskspilleautomater.eu/casino-jackpot-winners-youtube/>casino jackpot winners youtube</a>  Lyst pa tilgang til alle Newcastle sine kamper i Premier League?   Spill om gjetergutten som ble Konge i Israel Du ma vre palogget for a spille dette spillet Logg deg pa, eller registrer deg gratis her davidheltkonge2.  <a href=https://norskeautomaterr.info/no-download-casino-no-deposit-bonus/>no download casino no deposit bonus</a>  <a href=https://norskespillcasino24.eu/all-slot-casino-download/>all slot casino download</a>   <a href=https://norskspilleautomater.eu/casino-bonus-without-deposit/>casino bonus without deposit</a> \n<a href=https://norskonlinecasinoo.info/eurolotto-norge/>eurolotto norge</a>  <a href=https://norgesspillcasino.eu/poker-spill/>poker spill</a>   Forden De resterende lagene har spilt kvalifisering i sju grupper, der de to beste lagene na har fatt sine EM-plasser, sammen med beste treer totalt sett.   <a href=https://norskonlinecasino.eu/free-spins-gratis-info/>free spins gratis info</a>  <a href=https://norskeautomaterr.info/spilleautomat-thunderstruck-ii/>spilleautomat thunderstruck ii</a>   Wins bluff ntcasinon ban upon euro online kajot casino are coming with a Up nyeste nettcasino restricted gambling enforce euro gratis to david.  <a href=https://casinonorsk.info/online-spill/>online spill</a>  <a href=https://norskeautomaterr.info/best-casino-online-reviews/>best casino online reviews</a>   MariaCasino er et annerledes casino En sosial opplevelse innen pengespill pa nett fra et selskap som vager a tenke nytt Maria foles som bade et morro og trygt. \n<a href=https://norgespillcasino.eu/spilleautomater-energoonz/>spilleautomater energoonz</a>  <a href=https://norgesspilleautomater.eu/red-baron-slot-big-win/>red baron slot big win</a>   Solo Mahjong er en asiatisk stil spill som tilbys av Playtech Solo Mahjong kan spilles for ekte penger innsatser og for gratis spill pa de fleste alle Playtech.   <a href=https://casinonorsk24.eu/norsk-automatspill/>norsk automatspill</a>  Sjekk ut og kjop spill fra Electronic Arts, spill gratisspill eller se pa trailere for EA-spill som Battlefield Hardline, NHL 15, FIFA 15, The Sims 4, Medal of Honor og.   Billige kjop Nike Roshe Run Menn Sko norge salg pa nett outlet Bygg din creditBuilding Toms sko og kreditt gar hand og hand I Standard Theory, en generativ.  <a href=https://spillcasinonorsk.eu/free-spin-casino/>free spin casino</a>  <a href=https://casinonorsk.info/maria-casino-norge/>maria casino norge</a>   <a href=https://norgesspilleautomater24.info/slot-casinos-in-colorado/>slot casinos in colorado</a> \n<a href=https://norskeautomaterr.info/tv-norge-casino/>tv norge casino</a>  <a href=https://casinonorsk24.info/casino-online-gratis-spelen/>casino online gratis spelen</a>   Er du lei av a matte betale over allt for a spille poker?   <a href=https://norgescasino.eu/automatspill-gratis/>automatspill gratis</a>  <a href=https://norskespillcasino.eu/norges-beste-casino/>norges beste casino</a>   A Bahamas flight Toms sko er best for dem , Plus, Isango tilstreber virkelig a ting har blitt fjernet med unntak av noen store Monogrammed Glace reise bag.  <a href=https://norskeautomater.eu/slot-beach-party/>slot beach party</a>  <a href=https://norgespillcasino.info/casino-palace-warszawa-senatorska/>casino palace warszawa senatorska</a>   Man trenger ikke vre et geni for a forsta at bonuser og gratis spinn kan bidra til a spare egne penger og vinne oftere enn hva man vanligvis ville ha gjort. \n<a href=https://norskspilleautomater.info/betsafe-casino-bonus-code/>betsafe casino bonus code</a>  <a href=https://norskonlinecasinoo.info/idiot-kortspill-pa-nett/>idiot kortspill pa nett</a>   Spillonlinepokercom er en poker nettsted som fokuserer pa a gi deg som pokerspillere om poker regler, strategier, guider, spill Texas Hold'em og Omaha.   <a href=https://norgescasino.eu/go-wild-casino-phone-number/>go wild casino phone number</a>  Film - Bilder - VG Nett Hovedsiden Nyheter Sport Fotball Rampelys VG-lista Sok VG Girlhood Movie Stream Online streame film pa nett Girlhood.   Hvem vinner pengene, og kan en av amatorene avansere?  <a href=https://norgesspilleautomater.eu/spilleautomater-outta-space-adventure/>spilleautomater outta space adventure</a>  <a href=https://norskeautomaterr.info/european-roulette-tricks/>european roulette tricks</a>   <a href=https://mynorskspilleautomater.info/casino-bonus-2018/>casino bonus 2018</a> \n<a href=https://casinonorsk24.eu/all-slots-casino-mobile-app/>all slots casino mobile app</a>  <a href=https://norgescasino.eu/norske-spill-casino-review/>norske spill casino review</a>   Se dagens premier league kamper gratis pa nettet Vi viser deg hvordan.   <a href=https://norskeautomaterr.info/wild-west-slot-machine/>wild west slot machine</a>  <a href=https://norskecasinospill.info/all-slots-flash-casino/>all slots flash casino</a>   Hotel Casino Club ligger i hjertet av Differdange, pa sjarmerende Place du March, og tilbyr komfortable rom,terom og en liten.  <a href=https://casinonorsk24.eu/spin-palace-casino-flash/>spin palace casino flash</a>  <a href=https://norgesspillcasino.eu/casino-slot-machines-free/>casino slot machines free</a>   Offentlig transport er en rask mate a reise i Las Vegas, for eksempel, driver en monorail langs sine mange hoteller Det er en flyplass se nedenfor fra flyplassen. \n<a href=https://norgesspilleautomater.info/no-download-casino-free-spins/>no download casino free spins</a>  <a href=https://norskecasinospill.info/admiral-slot-games-online/>admiral slot games online</a>   Finest norsk automater pa nett Canadian manhattanmarketplacenet norsk automater spill free online Spill norske automater gratis manhattanmarketplacenet.   <a href=https://norskeautomaterr.info/guts-casino/>guts casino</a>  Best spilleregler casino kortspill Australian acp-vodib2hostingcom give exclusive bonuses casino kortspill poeng - trustworthy online casinos.   Populre videoer Spill av Tippemagasinet #1115 Brum Sandnes Ulf Valerenga Sandefjord Ullensaker/Kisa Bodo/Glimt Ranheim Mjondalen.  <a href=https://spillcasinonorsk.eu/mandalay-casino-madrid/>mandalay casino madrid</a>  <a href=https://norskeautomater.eu/spill-online/>spill online</a>   <a href=https://casinonorsk24.info/slottet-oslo/>slottet oslo</a> \n<a href=https://casinonorsk24.info/casino-ottawa-canada/>casino ottawa canada</a>  <a href=https://norskespillcasino.eu/casino-mobile-bonus/>casino mobile bonus</a>   Lista er laget for oversettere av ulike dataprogrammer til norsk, for eksempel KDE, ring, ring , pa norsk i bokstaven a online layout, nettsidevisning.   <a href=https://norskeautomater.eu/karamba-casino-erfahrungen/>karamba casino erfahrungen</a>  <a href=https://norgescasinos.info/piggy-bingo-bonuskode/>piggy bingo bonuskode</a>   Nyttarsfeiring med gratisspinn ogsa hos Betsson Betsson gir deg Hall of Gods Comments are closed Search for:.  <a href=https://mynorskspilleautomater.eu/slot-machines-borderlands-2/>slot machines borderlands 2</a>  <a href=https://norgescasino.eu/laer-at-spille-casino/>l?r at spille casino</a>   En av de storste klassikerne pa casino er videopoker Dette er en blanding av Hvis man skal spille casino pa nettet, sa kan det for det forste vre vanskelig. \n<a href=https://mynorskspilleautomater.eu/kjop-godteri-pa-nett/>kjop godteri pa nett</a>  <a href=https://norgespillcasino.info/spilleautomat-crazy-slots/>spilleautomat crazy slots</a>   Hvis du gjor det,, vi kan fortelle at Europalacecom er en av de flotteste online casino.   <a href=https://norgesspillcasino.eu/dr-love-on-vacation-slot/>dr love on vacation slot</a>  Double Joker Poker er en variant av videopoker som krever vanskelige hender, men samtidig sa er det jo greit a da ha noen jokere pa lager.   Click Here to play at Vegas Casino Online Det er mange forskjellige land basert kasinoer for en personer gaming Simba Games Spilleautomater Gratis.  <a href=https://norskespillcasino.info/baccarat-probability-chart/>baccarat probability chart</a>  <a href=https://spillcasinonorsk.eu/spilleautomater-resident-evil/>spilleautomater resident evil</a>   <a href=https://norgesspillcasino.eu/slot-vegas-tally-ho/>slot vegas tally ho</a> \n<a href=https://norskespillcasino.eu/spilleautomater-gunslinger/>spilleautomater gunslinger</a>  <a href=https://norskespillcasino24.info/slot-machine-game-download/>slot machine game download</a>   Web er et viktig medium i yrkeslivet, utdanning og privat Det a beherske bruk av internett er derfor veldig viktig Mennesker har ulike forutsetninger og.   <a href=https://norgescasinos.info/spilleautomat-tivoli-bonanza/>spilleautomat tivoli bonanza</a>  <a href=https://casinonorsk.eu/french-roulette-bets/>french roulette bets</a>   Bingocom er en av de storste internasjonale bingo nettsteder med en av de storste online bingo fellesskap i EU I tillegg til a vre den storste Bingocom ogsa.  <a href=https://norgesspilleautomater24.info/slot-abilita-resident-evil-6/>slot abilita resident evil 6</a>  <a href=https://norskonlinecasino.eu/roulette-bonus-gratuit-sans-depot/>roulette bonus gratuit sans depot</a>   Gambling alene er ganske sofistikert bestende av mange kortene machines og pulten online spill P endring kontanter til pokerchips , med stor tilsig av penger.", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 22396, "cpu_time_ms": 23, "memory_kb": 4196}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s183180892", "group_id": "codeNet:p03941", "input_text": "Grant Levy, i sete 4: Australier som tidligere har vunnet Asia Pacific Poker Tour Grand Final og Australia New Zealand Poker Tour Har spilt inn totalt 1,8. \n<a href=https://spillcasinonorsk.info/dr-love-on-vacation-slot/>dr love on vacation slot</a>  <a href=https://norskeautomater.eu/slot-las-vegas-gratis/>slot las vegas gratis</a>   Her kan du ove deg pa tiervenner nar du legger kabal Kabal kan du ogsa legge med kortstokken Skriving: Ov pa a skrive bokstavene vi har lrt Ov pa a.   <a href=https://casinonorsk.eu/slots-bonus-rounds/>slots bonus rounds</a>  <a href=https://casinonorsk24.info/spilleautomat-cash-n-clovers/>spilleautomat cash n clovers</a>   Trykk deg inn pa denne websiden for a lre mer om gamble pa nettet vinne ekte penger.  <a href=https://spillcasinonorsk.eu/slot-dead-or-alive-trucchi/>slot dead or alive trucchi</a>  <a href=https://casinonorsk.eu/lucky-nugget-casino-flash/>lucky nugget casino flash</a>   Strukturert slots er rivaler id stedet begynne med til gjenoppstr dine ferdigheter p Eksklusive bonuser for alle nye spillere Casino Topplisten: Spin Palace. \n<a href=https://norskspilleautomater.eu/norsk-betting-bonus/>norsk betting bonus</a>  <a href=https://norskeautomaterr.info/casino-nettbrett/>casino nettbrett</a>   Fa tak i gratis penger Forst bor du ta kontakt med Statens Lanekasse for utdanning, for a sjekke hvilke rettigheter du har Stipendiene som er en gave fra staten.   <a href=https://norskecasinospill.eu/slots-mobile-games/>slots mobile games</a>  Ohio laws on slot machinesatis casino 2015 Casinoeuro bonus code Det finns casinoeuro bonus frdelar med att spela via din mobil, code ohne.   Betsson Betsson er et av de mest populre spillaktorer pa det norske markedet Hos Betsson kan du satse pengene dine pa odds, poker, nettcasino, bingo.  <a href=https://spillcasinonorsk.info/slot-beach-life/>slot beach life</a>  <a href=https://norgespillcasino.eu/bra-spill-sider/>bra spill sider</a>   <a href=https://norskecasinospill.info/spilleautomater-nett/>spilleautomater nett</a> \n<a href=https://norskonlinecasino.eu/betsson-casino/>betsson casino</a>  <a href=https://norgesspillcasino.eu/online-casino-bonuses/>online casino bonuses</a>   Du vil motta 100% pa bonus hvis du vil deponere et belop til 500kr pa forste gangDu vil ikke trenge noen spesiell maria bingo bonuskdoe Det er nok hvis du vil.   <a href=https://norskeautomater.eu/jackpot-slot-machines/>jackpot slot machines</a>  <a href=https://norskespillcasino.eu/slot-machine-iron-man-2/>slot machine iron man 2</a>   Ojjjjjjjj #mariobotta #casino I #luhano #sveits #interlaken with #nordiska #rowing can't get enough of the swiss landscape, almost as good as home.  <a href=https://mynorskspilleautomater.info/slots-casino-free-play/>slots casino free play</a>  <a href=https://norgesspillcasino.eu/gul-og-gratis-spilleautomater/>gul og gratis spilleautomater</a>   E-post eller mobil, Passord Forbli palogget Gruppe som er interessert i casino Bilder. \n<a href=https://spillcasinonorsk.info/monster-cash-slot-online/>monster cash slot online</a>  <a href=https://casinonorsk24.eu/vinn-penger-pa-quiz/>vinn penger pa quiz</a>   Den Norske Turistforening avlyser steindugnaden som er omtalt i Fjell og Vidde nr Gratis tradlost nett og frokost er de mest populre hotellbekvemmelighetene, Solen skinte, Timbuktu og Malm Symfoniorkester spilte vakre toner og.   <a href=https://casinonorsk24.info/spill-online/>spill online</a>  Artikler om poker og casino pa nettet Stort artikkelarkiv Vi har testet over pokerrom Regler og tips.   Betsafe har to helt nye spill, Funky 70s, og Dead or Alive Og du kan prove dem gratis Ikke depositum, bare logge inn pa kontoen din og ga til en av de.  <a href=https://norskespillcasino.eu/casino-narvik/>casino narvik</a>  <a href=https://norskonlinecasino.eu/online-casinos-for-real-money/>online casinos for real money</a>   <a href=https://norgesspilleautomater24.eu/casino-all-slots-free/>casino all slots free</a> \n<a href=https://norskonlinecasino.eu/norges-forste-spillefilm/>norges forste spillefilm</a>  <a href=https://norskeautomaterr.info/american-roulette-tips-and-tricks/>american roulette tips and tricks</a>   For du begynner a spille poker, spesielt for ekte penger, kan det lonne seg a Texas Hold'em er et av de enkleste spillene og lre seg for en fersk nybegynner.   <a href=https://norgesspilleautomater.eu/norsk-casino-blogg/>norsk casino blogg</a>  <a href=https://norskonlinecasino.eu/vinne-penger-pa-nettspill/>vinne penger pa nettspill</a>   Note: You may have to change settings in Handcent or other sms application if you encounter problems with unreadable sms messages In Handcent disable.  <a href=https://casinonorsk24.info/spille-gratis-online-spill/>spille gratis online spill</a>  <a href=https://norskespillcasino.eu/kasinoet-i-monaco/>kasinoet i monaco</a>   Kool Produktion goes to Cartoon Movie in Lyon to pitch Ella Bella Bingo and the Screening and show with Ella Bella Bingo Elleville Elfrid in Kristiansand. \n<a href=https://norgesspillcasino.eu/norsk-automater-spill/>norsk automater spill</a>  <a href=https://casinonorsk.info/beste-innskuddsbonus-odds/>beste innskuddsbonus odds</a>   Spillomtale for kasinospillet Gladiator fra Betsoft med gode bonus tilbud, bilder, Hvis du ikke ser et demo-spill nedenfor, ma du sorge for at du deaktiverer.   <a href=https://norgesspilleautomater.info/norsk-casino-bonuses/>norsk casino bonuses</a>  Mega Joker - A slot game that has it all Og er i dag en av internetts mest populrePlay Jokerher Slots games for free or real cash.   Platinum Play casino er et av de beste nettcasino for norske spillere Spill og hent din bonus uten a vente Platinum Play casino Casino pa nett Vinn Millioner.  <a href=https://mynorskspilleautomater.eu/spilleautomat-udlejning/>spilleautomat udlejning</a>  <a href=https://casinonorsk.info/gratis-spinn-i-dag/>gratis spinn i dag</a>   <a href=https://norgesspillcasino.eu/alta-nettcasino/>alta nettcasino</a> \n<a href=https://norskespillcasino.eu/spilleautomat-sushi-express/>spilleautomat sushi express</a>  <a href=https://norskeautomater.eu/deck-the-halls-spilleautomat/>deck the halls spilleautomat</a>   I senere tid har dette blitt svrt vanlig a dele ut, slik at man kan vinne uten a gjore innskudd Det er vanligst at man far en slik bonus nar man forst oppretter en.   <a href=https://mynorskspilleautomater.eu/casino-mobil-betaling/>casino mobil betaling</a>  <a href=https://norgesspillcasino.info/slot-godfather/>slot godfather</a>   Se bildeserie fra malomradet under helgens Arctic Circle Raceklet i Tour of Norway for kids Se de flotte hyttene til Statskog der du kan bo gratis.  <a href=https://norskecasinospill.info/game-gratis-online-keren/>game gratis online keren</a>  <a href=https://norgesspilleautomater24.info/casino-farsund/>casino farsund</a>   Betway Bingo er bingodelen til det kjente spillestedet Betway Det er godt kjent for norske psillere nar det kommer til sportsbetting og casino, men de har ogsa. \n<a href=https://spillcasinonorsk.eu/choy-sun-doa-slot-youtube/>choy sun doa slot youtube</a>  <a href=https://casinonorsk.info/dragon-drop-slot/>dragon drop slot</a>   Bet365 Odds og Casino - Norskcasinoradcom Vi kan casino Bet365 Odds og Casino har mye spennende a by pa for deg som elsker sport a 0 views.   <a href=https://spillcasinonorsk.info/beste-oddstips/>beste oddstips</a>  Spill - Free rider Spill : Tegn din egen bane og deretter sykle pa det.   EM: SPF: FPS: 10512 32 02 03 04 05 06 07 08 09 10 11 12 Meet Gabriel the Gladiator and help him on his.  <a href=https://norgesspillcasino.info/casino-tropez-free-bonus-code/>casino tropez free bonus code</a>  <a href=https://norgesspilleautomater24.info/slot-bonus-uk/>slot bonus uk</a>   <a href=https://casinonorsk.info/slot-machine-jack-hammer/>slot machine jack hammer</a> \n<a href=https://norskecasinospill.info/slot-evolution-concert/>slot evolution concert</a>  <a href=https://norskespillcasino24.eu/red-baron-slot-big-win/>red baron slot big win</a>   Ved spill hos Norsk Tipping vil inntil spillinnsatsen ga direkte til din grasrotmottaker, og best av alt, hverken innsats, Norsk Tipping sine nettsider.   <a href=https://mynorskspilleautomater.eu/casino-norsk-tv/>casino norsk tv</a>  <a href=https://norgesspilleautomater.info/casino-slots-online-free-bonus-rounds/>casino slots online free bonus rounds</a>   Tilgjengelige spill Spill, Bane, 1 lop, Program, Strykn/Kjoreend Odds/Innsfordeling, Resultat V5A V4 DD, Halmstad L3, 12:20, Program Strykn/Kjoreend.  <a href=https://norskecasinospill.eu/cop-the-lot-slot-free/>cop the lot slot free</a>  <a href=https://casinonorsk24.eu/jackpot-slots-android-cheats/>jackpot slots android cheats</a>   Ja det er lett og la seg rive. \n<a href=https://norgesspilleautomater.eu/casino-on-net-888/>casino on net 888</a>  <a href=https://mynorskspilleautomater.info/live-baccarat-australia/>live baccarat australia</a>   Vinn premie: Kortferie hos De Historiske Hotell og Spisesteder + premiumabonnement , Arrangor av konkurranse: MyHeritage Norge Spill et spill 3 stk.   <a href=https://norgesspilleautomater.info/tomb-raider-slot-machine-free/>tomb raider slot machine free</a>  Myten om Orion Det finnes mange vakre beretninger om den store jegeren Orion I en legende fortelles det at manegudinnen Diana, som ogsa var gudinne.   Se Odegaard, Fossum og Celina spille sammen MOBIL-APPEN SOM HOLDER DEG OPPDATERT: Ansvarlig redaktor Kristin Monstad og digitalredaktor.  <a href=https://spillcasinonorsk.info/slot-machine-random-runner/>slot machine random runner</a>  <a href=https://casinonorsk.eu/spille-pa-nett-norsk-tipping/>spille pa nett norsk tipping</a>   <a href=https://norgesspillcasino.info/spilleautomater-secret-of-the-stones/>spilleautomater secret of the stones</a> \n<a href=https://norskespillcasino24.info/europeisk-roulette/>europeisk roulette</a>  <a href=https://norskeautomaterr.info/jackpot-slots-android-cheats/>jackpot slots android cheats</a>   Maghnous Mohamed starta Total Oppussing iugenstua Pa boligmessas siste dag ble finalistene til a vinne to hus og en garasje ropt ut av.   <a href=https://norskespillcasino.eu/online-casino-norge/>online casino norge</a>  <a href=https://casinonorsk24.info/norsk-automatspill/>norsk automatspill</a>   Gratis spilleautomater, spill gratis casinospill spilleautomater.  <a href=https://norgesspilleautomater24.eu/slot-myths/>slot myths</a>  <a href=https://norgesspilleautomater.eu/spilleautomat-dr-m-brace/>spilleautomat dr. m. brace</a>   Spill bingo hos Maria i dag og fa opp tilspille for De var tidlig ute med a etablere seg i Norge, og fikk spesielt etter automat-forbudet ilid. \n<a href=https://norskecasinospill.eu/slot-games-with-free-spins/>slot games with free spins</a>  <a href=https://norskespillcasino24.eu/slot-tournaments-las-vegas-2018/>slot tournaments las vegas 2018</a>   Dette er sporsmal du bor stille deg for du aksepterer en online casino bonus Bonusene kan ha en stor okonomisk fordel, samtidig som de vil redusere din.   <a href=https://norskecasinospill.info/norske-vinnere-casino/>norske vinnere casino</a>  ComeOn Casino har ogsa en rekke turneringer og kampanjer som er med pa a forbedre spilleopplevelsen generelt Spillere som deltar kan vinne bade store og.   Baccarat Online Casinos Frem til begynnelsen av XX arhundre var den klassiske baccarat game show Det er grunnen til at dagens moderne kasinoer gjor alt.  <a href=https://norskonlinecasinoo.info/nettcasino-pa-norsk/>nettcasino pa norsk</a>  <a href=https://norskespillcasino.info/freespins-gratis/>freespins gratis</a>   <a href=https://norgesspilleautomater24.info/video-slot-jack-hammer/>video slot jack hammer</a> \n<a href=https://spillcasinonorsk.info/free-spinns/>free spinns</a>  <a href=https://norskeautomaterr.info/casino-sonoma/>casino sonoma</a>   Her kan du finne ut hvilke timer og Man kan spile sa mye man vil forutsatt ledig kapasitet overgangsar hvor man vil.   <a href=https://norgesspilleautomater24.eu/spilleautomater-midnight-madness/>spilleautomater midnight madness</a>  <a href=https://mynorskspilleautomater.info/casino-club-torrevieja/>casino club torrevieja</a>   Les mer OBS Store spoilere: Fansen raser etter sesongavslutningen av Game of Thrones Les mer annonse Har fatt Skal vi danse-tatovering Les mer.  <a href=https://mynorskspilleautomater.eu/slot-bonus-high-limit/>slot bonus high limit</a>  <a href=https://norgescasino.eu/spilleautomater-gladiator/>spilleautomater gladiator</a>   Oppsett pa en mobiltelefon Dersom enheten din er en iPhone eller en smartphone som kjorer Windows Phone eller Symbian operativsystemer, vr vennlig a. \n<a href=https://casinonorsk.info/slot-safari-game/>slot safari game</a>  <a href=https://norskespillcasino24.eu/casino-rodos-age/>casino rodos age</a>   Unibet tilbyr odds, sportsbetting, Online Casino og Poker, pluss massevis av spennende spill.   <a href=https://casinonorsk24.info/best-casino-sites/>best casino sites</a>  Velg alltid en kjent spillside a spille videospill pa nettet Du kan be dine gamer venner for henvisning eller sjekk ut pa online vurderinger pa spillside.   Casino pa nett er en ting, bra casino pa nett er en annen ting Forskjellen pa et darlig norsk casino og et bra kan vre en liten ting eller en stor ting.  <a href=https://norgesspilleautomater24.info/maria-bingo-gratis/>maria bingo gratis</a>  <a href=https://casinonorsk24.info/casino-tropez-ruleta/>casino tropez ruleta</a>   <a href=https://norgesspilleautomater24.eu/spilleautomat-eggomatic/>spilleautomat eggomatic</a> \n<a href=https://norgescasino.eu/slot-machine-great-blue/>slot machine great blue</a>  <a href=https://norskonlinecasinoo.info/spilleautomat-super-nudge-6000/>spilleautomat super nudge 6000</a>   Hos Spillno finner du informasjon om Casino norge og du kan ogsa diskutere Casino norge i nettsamfunnet vart Du kan ogsa soke i artikkelarkivet etter.   <a href=https://casinonorsk24.eu/wild-west-slot-games-free/>wild west slot games free</a>  <a href=https://norskonlinecasinoo.info/online-rulett-stratgik/>online rulett stratgik</a>   Online casinospill Casino pa nettet er en stor glede for mange som er ute etter underholdning og en sjanse til a vinne flotte premier Det a spille casinospill pa.  <a href=https://norgesspilleautomater.eu/golden-tiger-casino-no-deposit-bonus-code/>golden tiger casino no deposit bonus code</a>  <a href=https://norskeautomaterr.info/mobile-slots-no-deposit-bonus/>mobile slots no deposit bonus</a>   SlotsMillion Forsteinntrykk SlotsMillion casino kan regnes som et av de nye casino ir blitt raskt et markedets mest populre nettcasinoer. \n<a href=https://casinonorsk.info/jackpot-slots/>jackpot slots</a>  <a href=https://norgespillcasino.eu/casino-sverige/>casino sverige</a>   Norsk tipping app undefined Slik kommer du i gang med Snapchat Det er enkelt og praktisk og slettes ikke vanskelig Snapchat logo.   <a href=https://casinonorsk24.info/roulette-bord-pris/>roulette bord pris</a>  Therefore, you are bound to get casinos that are affiliated to one or all of these payment options If you find any online roulette Australia PayPal casino, you can.   Samme dato aret etter bleilleautomatene totalforbudt og fjernet Etter dette har reklamering for nettcasino blitt et mer og mer vanlig syn pa norsk tv.  <a href=https://norskeautomaterr.info/live-blackjack/>live blackjack</a>  <a href=https://norskonlinecasinoo.info/gratis-pengespill/>gratis pengespill</a>   <a href=https://norgesspilleautomater.info/spill-monopol-pa-nettet/>spill monopol pa nettet</a> \n<a href=https://norskeautomaterr.info/slot-jack-hammer/>slot jack hammer</a>  <a href=https://norgesspillcasino.info/euro-lotto/>euro lotto</a>   SpongeBob Jet Ski er et bilspill merket idet: vann, bat, racing, barn, tegneserie, spongebob spill Svampebob og tilbake Cuca holdt en konkurranse pa jet ski.   <a href=https://norgescasinos.info/online-casinos-are-rigged/>online casinos are rigged</a>  <a href=https://norgesspilleautomater24.eu/spilleautomater-emerald-isle/>spilleautomater emerald isle</a>   Nett som er tilgjengelig i aus dem 888 Casino eigentlich bankoverforing, Skrill, NetEller, InstantBank, EntroPay, dessen Nett und Sound norske casinoer Dette er.  <a href=https://spillcasinonorsk.info/spilleautomater-odda/>spilleautomater odda</a>  <a href=https://norskeautomater.eu/spille-bridge-pa-nettet/>spille bridge pa nettet</a>   Finest casino pa nett norsk UK give exclusive bonuses norsk casino nett - best biloxi casinos. \n<a href=https://mynorskspilleautomater.info/slot-airport-road-warri/>slot airport road warri</a>  <a href=https://norgesspilleautomater.info/pontoon-vs-blackjack/>pontoon vs blackjack</a>   Nytt norsk nettcasino Det har kommet et nytt norsk nettcasino som er tilpasset nordmenn bade i design og brukervennlighet Thrills casino er casinoet for.   <a href=https://norskonlinecasino.eu/volcano-eruption-slot-machine/>volcano eruption slot machine</a>  Vi elsker alle a fa gaver, men noen av dem er bedre enn andre Det er lite som kan male seg med casino gratis penger i 2015 Husk at alle nettcasino i hele.   PokerStars er verdens storste online poker rom med flere spill pa alle nivaer, storre Hos oss finner du flere poker turneringer og spill enn pa noen annen side.  <a href=https://norskonlinecasinoo.info/spill-norge-rundt/>spill norge rundt</a>  <a href=https://norskeautomater.eu/casino-mandalay-bay-las-vegas/>casino mandalay bay las vegas</a>   <a href=https://casinonorsk24.info/spilleautomater-mermaids-millions/>spilleautomater mermaids millions</a> \n<a href=https://casinonorsk.eu/super-slots-book/>super slots book</a>  <a href=https://norgespillcasino.info/antal-spilleautomater-i-danmark/>antal spilleautomater i danmark</a>   Det har seg jo slik at vi nordmenn i veldig stor grad oppsoker spillsider pa nettet for a kose oss med spillautomater Det er godt nytt for ComeOn, for du store all.   <a href=https://spillcasinonorsk.info/gratis-spinn-pa-starburst-uten-innskudd/>gratis spinn pa starburst uten innskudd</a>  <a href=https://mynorskspilleautomater.eu/spilleautomater-book-of-ra/>spilleautomater book of ra</a>   Casino Guiden, norske spilleautomater, casinospill og.  <a href=https://norskonlinecasino.eu/best-casinos-online-canada/>best casinos online canada</a>  <a href=https://norgesspillcasino.eu/norsk-tipping-lotto-lordag/>norsk tipping lotto lordag</a>   Added: 08022015, 17:28 News author: Olivia In fact, internal inductance: 450 mH, use the brain more playing video poker than when playing slot machines. \n<a href=https://spillcasinonorsk.eu/hot-as-hades-spilleautomat/>hot as hades spilleautomat</a>  <a href=https://norgesspillcasino.eu/spilleautomater-wild-water/>spilleautomater wild water</a>   Bigstones Russian roulette Rotter pa fravtale - Zickans Vaggvisan aka Lykke liten - Zickans Glogg aka Mogens - Glamrattan Wasabi - Glamrattan Muskat.   <a href=https://casinonorsk24.eu/slot-hopper-pieno/>slot hopper pieno</a>  Se egne prislister for bedrift og institusjon Alle priser er inklusiv mva eller leie mottaker Velger du a leie, er Programkort og Nettbro inkludert i manedsprisen.   In a live casino it feels like playing in a real casino Online gambling becomes more fun with a live dealer Play different casino games in the live casino.  <a href=https://norskespillcasino24.eu/spilleautomater-power-spins-sonic-7s/>spilleautomater power spins sonic 7s</a>  <a href=https://norskespillcasino24.eu/slot-machines-las-vegas/>slot machines las vegas</a>   <a href=https://norskecasinospill.eu/casino-rhodos-beach/>casino rhodos beach</a> \n<a href=https://norskspilleautomater.info/pontoon-blackjack-strategy/>pontoon blackjack strategy</a>  <a href=https://norskespillcasino24.info/slot-machine-robin-hood-gratis/>slot machine robin hood gratis</a>   Besok Nordisk Casino i dag og finne ditt nye favoritt spill som for eksempel Jackpot 6000, Mega Fortune Da har du sokt deg frem til den beste guiden der ute.   <a href=https://casinonorsk24.info/spilleautomater-gratis-spill/>spilleautomater gratis spill</a>  <a href=https://casinonorsk24.eu/spilleautomater-thief/>spilleautomater thief</a>   Ja, jeg vil finne de trygge og sikre bingo nettsider med de beste bonuser http://googl/Nhcg6g.  <a href=https://norskespillcasino24.info/sandnessjoen-nettcasino/>sandnessjoen nettcasino</a>  <a href=https://norgespillcasino.eu/casino-euro-bonus/>casino euro bonus</a>   Fa gratis norsk casino bonus uten innskudd hos mange forskjellige nettcasino Vi gir deg oversikt over de beste tilbudene om casino no deposit bonus. \n<a href=https://norskonlinecasino.eu/maria-bingo-norsk/>maria bingo norsk</a>  <a href=https://norskspilleautomater.eu/casino-online-gratis-speelgeld/>casino online gratis speelgeld</a>   Nar man kjenner til luftfartsverdenen, sa vet.   <a href=https://norskspilleautomater.info/mobile-roulette-free-bonus/>mobile roulette free bonus</a>  Gaming leksikon norskcasinoereu gir deg en detaljert gjennomgang av online casino CasinoEuro Les hele anmeldelsen online casino CasinoEuro.   Fotballreiser Liverpool, Sammenlign alle firma som selger fotballreiser med Liverpool pa deres hjemmestadion Anfield Sammenlign priser, hotell og billetter fra.  <a href=https://norgesspilleautomater.info/netent-casinos-no-deposit/>netent casinos no deposit</a>  <a href=https://norgesspilleautomater.eu/spilleautomater-dk/>spilleautomater dk</a>   <a href=https://norskespillcasino24.eu/casino-akrehamn/>casino akrehamn</a> \n<a href=https://norskecasinospill.info/spilleautomat-game-of-thrones/>spilleautomat game of thrones</a>  <a href=https://spillcasinonorsk.eu/bella-bingo-bonus-code/>bella bingo bonus code</a>   Oversettelse av ordet Roulett fra tysk til norsk, med synonymer, antonymer, verbboying, uttale, anagrammer og eksempler pa bruk.   <a href=https://spillcasinonorsk.eu/spilleautomat-crazy-cows/>spilleautomat crazy cows</a>  <a href=https://norgesspillcasino.eu/spilleautomater-lillesand/>spilleautomater lillesand</a>   Hos Unibet Bingo kan du vinne store premier i vare Bingo rom I Studio nye Bingo: Spill Online Bingo med store Jackpotter Hjelp Ansvarlig spill.  <a href=https://norskonlinecasinoo.info/casino-europa-flash/>casino europa flash</a>  <a href=https://norgespillcasino.info/all-slots-casino-bonus-codes-2018/>all slots casino bonus codes 2018</a>   Forden Se The Loft online gratis pa nettet Old Crows Football Se The Loft online gratis pa nettet Her kan du se denne film streaming gratis: http.", "language": "Lisp", "metadata": {"date": 1545938295, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s183180892.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s183180892", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Grant Levy, i sete 4: Australier som tidligere har vunnet Asia Pacific Poker Tour Grand Final og Australia New Zealand Poker Tour Har spilt inn totalt 1,8. \n<a href=https://spillcasinonorsk.info/dr-love-on-vacation-slot/>dr love on vacation slot</a>  <a href=https://norskeautomater.eu/slot-las-vegas-gratis/>slot las vegas gratis</a>   Her kan du ove deg pa tiervenner nar du legger kabal Kabal kan du ogsa legge med kortstokken Skriving: Ov pa a skrive bokstavene vi har lrt Ov pa a.   <a href=https://casinonorsk.eu/slots-bonus-rounds/>slots bonus rounds</a>  <a href=https://casinonorsk24.info/spilleautomat-cash-n-clovers/>spilleautomat cash n clovers</a>   Trykk deg inn pa denne websiden for a lre mer om gamble pa nettet vinne ekte penger.  <a href=https://spillcasinonorsk.eu/slot-dead-or-alive-trucchi/>slot dead or alive trucchi</a>  <a href=https://casinonorsk.eu/lucky-nugget-casino-flash/>lucky nugget casino flash</a>   Strukturert slots er rivaler id stedet begynne med til gjenoppstr dine ferdigheter p Eksklusive bonuser for alle nye spillere Casino Topplisten: Spin Palace. \n<a href=https://norskspilleautomater.eu/norsk-betting-bonus/>norsk betting bonus</a>  <a href=https://norskeautomaterr.info/casino-nettbrett/>casino nettbrett</a>   Fa tak i gratis penger Forst bor du ta kontakt med Statens Lanekasse for utdanning, for a sjekke hvilke rettigheter du har Stipendiene som er en gave fra staten.   <a href=https://norskecasinospill.eu/slots-mobile-games/>slots mobile games</a>  Ohio laws on slot machinesatis casino 2015 Casinoeuro bonus code Det finns casinoeuro bonus frdelar med att spela via din mobil, code ohne.   Betsson Betsson er et av de mest populre spillaktorer pa det norske markedet Hos Betsson kan du satse pengene dine pa odds, poker, nettcasino, bingo.  <a href=https://spillcasinonorsk.info/slot-beach-life/>slot beach life</a>  <a href=https://norgespillcasino.eu/bra-spill-sider/>bra spill sider</a>   <a href=https://norskecasinospill.info/spilleautomater-nett/>spilleautomater nett</a> \n<a href=https://norskonlinecasino.eu/betsson-casino/>betsson casino</a>  <a href=https://norgesspillcasino.eu/online-casino-bonuses/>online casino bonuses</a>   Du vil motta 100% pa bonus hvis du vil deponere et belop til 500kr pa forste gangDu vil ikke trenge noen spesiell maria bingo bonuskdoe Det er nok hvis du vil.   <a href=https://norskeautomater.eu/jackpot-slot-machines/>jackpot slot machines</a>  <a href=https://norskespillcasino.eu/slot-machine-iron-man-2/>slot machine iron man 2</a>   Ojjjjjjjj #mariobotta #casino I #luhano #sveits #interlaken with #nordiska #rowing can't get enough of the swiss landscape, almost as good as home.  <a href=https://mynorskspilleautomater.info/slots-casino-free-play/>slots casino free play</a>  <a href=https://norgesspillcasino.eu/gul-og-gratis-spilleautomater/>gul og gratis spilleautomater</a>   E-post eller mobil, Passord Forbli palogget Gruppe som er interessert i casino Bilder. \n<a href=https://spillcasinonorsk.info/monster-cash-slot-online/>monster cash slot online</a>  <a href=https://casinonorsk24.eu/vinn-penger-pa-quiz/>vinn penger pa quiz</a>   Den Norske Turistforening avlyser steindugnaden som er omtalt i Fjell og Vidde nr Gratis tradlost nett og frokost er de mest populre hotellbekvemmelighetene, Solen skinte, Timbuktu og Malm Symfoniorkester spilte vakre toner og.   <a href=https://casinonorsk24.info/spill-online/>spill online</a>  Artikler om poker og casino pa nettet Stort artikkelarkiv Vi har testet over pokerrom Regler og tips.   Betsafe har to helt nye spill, Funky 70s, og Dead or Alive Og du kan prove dem gratis Ikke depositum, bare logge inn pa kontoen din og ga til en av de.  <a href=https://norskespillcasino.eu/casino-narvik/>casino narvik</a>  <a href=https://norskonlinecasino.eu/online-casinos-for-real-money/>online casinos for real money</a>   <a href=https://norgesspilleautomater24.eu/casino-all-slots-free/>casino all slots free</a> \n<a href=https://norskonlinecasino.eu/norges-forste-spillefilm/>norges forste spillefilm</a>  <a href=https://norskeautomaterr.info/american-roulette-tips-and-tricks/>american roulette tips and tricks</a>   For du begynner a spille poker, spesielt for ekte penger, kan det lonne seg a Texas Hold'em er et av de enkleste spillene og lre seg for en fersk nybegynner.   <a href=https://norgesspilleautomater.eu/norsk-casino-blogg/>norsk casino blogg</a>  <a href=https://norskonlinecasino.eu/vinne-penger-pa-nettspill/>vinne penger pa nettspill</a>   Note: You may have to change settings in Handcent or other sms application if you encounter problems with unreadable sms messages In Handcent disable.  <a href=https://casinonorsk24.info/spille-gratis-online-spill/>spille gratis online spill</a>  <a href=https://norskespillcasino.eu/kasinoet-i-monaco/>kasinoet i monaco</a>   Kool Produktion goes to Cartoon Movie in Lyon to pitch Ella Bella Bingo and the Screening and show with Ella Bella Bingo Elleville Elfrid in Kristiansand. \n<a href=https://norgesspillcasino.eu/norsk-automater-spill/>norsk automater spill</a>  <a href=https://casinonorsk.info/beste-innskuddsbonus-odds/>beste innskuddsbonus odds</a>   Spillomtale for kasinospillet Gladiator fra Betsoft med gode bonus tilbud, bilder, Hvis du ikke ser et demo-spill nedenfor, ma du sorge for at du deaktiverer.   <a href=https://norgesspilleautomater.info/norsk-casino-bonuses/>norsk casino bonuses</a>  Mega Joker - A slot game that has it all Og er i dag en av internetts mest populrePlay Jokerher Slots games for free or real cash.   Platinum Play casino er et av de beste nettcasino for norske spillere Spill og hent din bonus uten a vente Platinum Play casino Casino pa nett Vinn Millioner.  <a href=https://mynorskspilleautomater.eu/spilleautomat-udlejning/>spilleautomat udlejning</a>  <a href=https://casinonorsk.info/gratis-spinn-i-dag/>gratis spinn i dag</a>   <a href=https://norgesspillcasino.eu/alta-nettcasino/>alta nettcasino</a> \n<a href=https://norskespillcasino.eu/spilleautomat-sushi-express/>spilleautomat sushi express</a>  <a href=https://norskeautomater.eu/deck-the-halls-spilleautomat/>deck the halls spilleautomat</a>   I senere tid har dette blitt svrt vanlig a dele ut, slik at man kan vinne uten a gjore innskudd Det er vanligst at man far en slik bonus nar man forst oppretter en.   <a href=https://mynorskspilleautomater.eu/casino-mobil-betaling/>casino mobil betaling</a>  <a href=https://norgesspillcasino.info/slot-godfather/>slot godfather</a>   Se bildeserie fra malomradet under helgens Arctic Circle Raceklet i Tour of Norway for kids Se de flotte hyttene til Statskog der du kan bo gratis.  <a href=https://norskecasinospill.info/game-gratis-online-keren/>game gratis online keren</a>  <a href=https://norgesspilleautomater24.info/casino-farsund/>casino farsund</a>   Betway Bingo er bingodelen til det kjente spillestedet Betway Det er godt kjent for norske psillere nar det kommer til sportsbetting og casino, men de har ogsa. \n<a href=https://spillcasinonorsk.eu/choy-sun-doa-slot-youtube/>choy sun doa slot youtube</a>  <a href=https://casinonorsk.info/dragon-drop-slot/>dragon drop slot</a>   Bet365 Odds og Casino - Norskcasinoradcom Vi kan casino Bet365 Odds og Casino har mye spennende a by pa for deg som elsker sport a 0 views.   <a href=https://spillcasinonorsk.info/beste-oddstips/>beste oddstips</a>  Spill - Free rider Spill : Tegn din egen bane og deretter sykle pa det.   EM: SPF: FPS: 10512 32 02 03 04 05 06 07 08 09 10 11 12 Meet Gabriel the Gladiator and help him on his.  <a href=https://norgesspillcasino.info/casino-tropez-free-bonus-code/>casino tropez free bonus code</a>  <a href=https://norgesspilleautomater24.info/slot-bonus-uk/>slot bonus uk</a>   <a href=https://casinonorsk.info/slot-machine-jack-hammer/>slot machine jack hammer</a> \n<a href=https://norskecasinospill.info/slot-evolution-concert/>slot evolution concert</a>  <a href=https://norskespillcasino24.eu/red-baron-slot-big-win/>red baron slot big win</a>   Ved spill hos Norsk Tipping vil inntil spillinnsatsen ga direkte til din grasrotmottaker, og best av alt, hverken innsats, Norsk Tipping sine nettsider.   <a href=https://mynorskspilleautomater.eu/casino-norsk-tv/>casino norsk tv</a>  <a href=https://norgesspilleautomater.info/casino-slots-online-free-bonus-rounds/>casino slots online free bonus rounds</a>   Tilgjengelige spill Spill, Bane, 1 lop, Program, Strykn/Kjoreend Odds/Innsfordeling, Resultat V5A V4 DD, Halmstad L3, 12:20, Program Strykn/Kjoreend.  <a href=https://norskecasinospill.eu/cop-the-lot-slot-free/>cop the lot slot free</a>  <a href=https://casinonorsk24.eu/jackpot-slots-android-cheats/>jackpot slots android cheats</a>   Ja det er lett og la seg rive. \n<a href=https://norgesspilleautomater.eu/casino-on-net-888/>casino on net 888</a>  <a href=https://mynorskspilleautomater.info/live-baccarat-australia/>live baccarat australia</a>   Vinn premie: Kortferie hos De Historiske Hotell og Spisesteder + premiumabonnement , Arrangor av konkurranse: MyHeritage Norge Spill et spill 3 stk.   <a href=https://norgesspilleautomater.info/tomb-raider-slot-machine-free/>tomb raider slot machine free</a>  Myten om Orion Det finnes mange vakre beretninger om den store jegeren Orion I en legende fortelles det at manegudinnen Diana, som ogsa var gudinne.   Se Odegaard, Fossum og Celina spille sammen MOBIL-APPEN SOM HOLDER DEG OPPDATERT: Ansvarlig redaktor Kristin Monstad og digitalredaktor.  <a href=https://spillcasinonorsk.info/slot-machine-random-runner/>slot machine random runner</a>  <a href=https://casinonorsk.eu/spille-pa-nett-norsk-tipping/>spille pa nett norsk tipping</a>   <a href=https://norgesspillcasino.info/spilleautomater-secret-of-the-stones/>spilleautomater secret of the stones</a> \n<a href=https://norskespillcasino24.info/europeisk-roulette/>europeisk roulette</a>  <a href=https://norskeautomaterr.info/jackpot-slots-android-cheats/>jackpot slots android cheats</a>   Maghnous Mohamed starta Total Oppussing iugenstua Pa boligmessas siste dag ble finalistene til a vinne to hus og en garasje ropt ut av.   <a href=https://norskespillcasino.eu/online-casino-norge/>online casino norge</a>  <a href=https://casinonorsk24.info/norsk-automatspill/>norsk automatspill</a>   Gratis spilleautomater, spill gratis casinospill spilleautomater.  <a href=https://norgesspilleautomater24.eu/slot-myths/>slot myths</a>  <a href=https://norgesspilleautomater.eu/spilleautomat-dr-m-brace/>spilleautomat dr. m. brace</a>   Spill bingo hos Maria i dag og fa opp tilspille for De var tidlig ute med a etablere seg i Norge, og fikk spesielt etter automat-forbudet ilid. \n<a href=https://norskecasinospill.eu/slot-games-with-free-spins/>slot games with free spins</a>  <a href=https://norskespillcasino24.eu/slot-tournaments-las-vegas-2018/>slot tournaments las vegas 2018</a>   Dette er sporsmal du bor stille deg for du aksepterer en online casino bonus Bonusene kan ha en stor okonomisk fordel, samtidig som de vil redusere din.   <a href=https://norskecasinospill.info/norske-vinnere-casino/>norske vinnere casino</a>  ComeOn Casino har ogsa en rekke turneringer og kampanjer som er med pa a forbedre spilleopplevelsen generelt Spillere som deltar kan vinne bade store og.   Baccarat Online Casinos Frem til begynnelsen av XX arhundre var den klassiske baccarat game show Det er grunnen til at dagens moderne kasinoer gjor alt.  <a href=https://norskonlinecasinoo.info/nettcasino-pa-norsk/>nettcasino pa norsk</a>  <a href=https://norskespillcasino.info/freespins-gratis/>freespins gratis</a>   <a href=https://norgesspilleautomater24.info/video-slot-jack-hammer/>video slot jack hammer</a> \n<a href=https://spillcasinonorsk.info/free-spinns/>free spinns</a>  <a href=https://norskeautomaterr.info/casino-sonoma/>casino sonoma</a>   Her kan du finne ut hvilke timer og Man kan spile sa mye man vil forutsatt ledig kapasitet overgangsar hvor man vil.   <a href=https://norgesspilleautomater24.eu/spilleautomater-midnight-madness/>spilleautomater midnight madness</a>  <a href=https://mynorskspilleautomater.info/casino-club-torrevieja/>casino club torrevieja</a>   Les mer OBS Store spoilere: Fansen raser etter sesongavslutningen av Game of Thrones Les mer annonse Har fatt Skal vi danse-tatovering Les mer.  <a href=https://mynorskspilleautomater.eu/slot-bonus-high-limit/>slot bonus high limit</a>  <a href=https://norgescasino.eu/spilleautomater-gladiator/>spilleautomater gladiator</a>   Oppsett pa en mobiltelefon Dersom enheten din er en iPhone eller en smartphone som kjorer Windows Phone eller Symbian operativsystemer, vr vennlig a. \n<a href=https://casinonorsk.info/slot-safari-game/>slot safari game</a>  <a href=https://norskespillcasino24.eu/casino-rodos-age/>casino rodos age</a>   Unibet tilbyr odds, sportsbetting, Online Casino og Poker, pluss massevis av spennende spill.   <a href=https://casinonorsk24.info/best-casino-sites/>best casino sites</a>  Velg alltid en kjent spillside a spille videospill pa nettet Du kan be dine gamer venner for henvisning eller sjekk ut pa online vurderinger pa spillside.   Casino pa nett er en ting, bra casino pa nett er en annen ting Forskjellen pa et darlig norsk casino og et bra kan vre en liten ting eller en stor ting.  <a href=https://norgesspilleautomater24.info/maria-bingo-gratis/>maria bingo gratis</a>  <a href=https://casinonorsk24.info/casino-tropez-ruleta/>casino tropez ruleta</a>   <a href=https://norgesspilleautomater24.eu/spilleautomat-eggomatic/>spilleautomat eggomatic</a> \n<a href=https://norgescasino.eu/slot-machine-great-blue/>slot machine great blue</a>  <a href=https://norskonlinecasinoo.info/spilleautomat-super-nudge-6000/>spilleautomat super nudge 6000</a>   Hos Spillno finner du informasjon om Casino norge og du kan ogsa diskutere Casino norge i nettsamfunnet vart Du kan ogsa soke i artikkelarkivet etter.   <a href=https://casinonorsk24.eu/wild-west-slot-games-free/>wild west slot games free</a>  <a href=https://norskonlinecasinoo.info/online-rulett-stratgik/>online rulett stratgik</a>   Online casinospill Casino pa nettet er en stor glede for mange som er ute etter underholdning og en sjanse til a vinne flotte premier Det a spille casinospill pa.  <a href=https://norgesspilleautomater.eu/golden-tiger-casino-no-deposit-bonus-code/>golden tiger casino no deposit bonus code</a>  <a href=https://norskeautomaterr.info/mobile-slots-no-deposit-bonus/>mobile slots no deposit bonus</a>   SlotsMillion Forsteinntrykk SlotsMillion casino kan regnes som et av de nye casino ir blitt raskt et markedets mest populre nettcasinoer. \n<a href=https://casinonorsk.info/jackpot-slots/>jackpot slots</a>  <a href=https://norgespillcasino.eu/casino-sverige/>casino sverige</a>   Norsk tipping app undefined Slik kommer du i gang med Snapchat Det er enkelt og praktisk og slettes ikke vanskelig Snapchat logo.   <a href=https://casinonorsk24.info/roulette-bord-pris/>roulette bord pris</a>  Therefore, you are bound to get casinos that are affiliated to one or all of these payment options If you find any online roulette Australia PayPal casino, you can.   Samme dato aret etter bleilleautomatene totalforbudt og fjernet Etter dette har reklamering for nettcasino blitt et mer og mer vanlig syn pa norsk tv.  <a href=https://norskeautomaterr.info/live-blackjack/>live blackjack</a>  <a href=https://norskonlinecasinoo.info/gratis-pengespill/>gratis pengespill</a>   <a href=https://norgesspilleautomater.info/spill-monopol-pa-nettet/>spill monopol pa nettet</a> \n<a href=https://norskeautomaterr.info/slot-jack-hammer/>slot jack hammer</a>  <a href=https://norgesspillcasino.info/euro-lotto/>euro lotto</a>   SpongeBob Jet Ski er et bilspill merket idet: vann, bat, racing, barn, tegneserie, spongebob spill Svampebob og tilbake Cuca holdt en konkurranse pa jet ski.   <a href=https://norgescasinos.info/online-casinos-are-rigged/>online casinos are rigged</a>  <a href=https://norgesspilleautomater24.eu/spilleautomater-emerald-isle/>spilleautomater emerald isle</a>   Nett som er tilgjengelig i aus dem 888 Casino eigentlich bankoverforing, Skrill, NetEller, InstantBank, EntroPay, dessen Nett und Sound norske casinoer Dette er.  <a href=https://spillcasinonorsk.info/spilleautomater-odda/>spilleautomater odda</a>  <a href=https://norskeautomater.eu/spille-bridge-pa-nettet/>spille bridge pa nettet</a>   Finest casino pa nett norsk UK give exclusive bonuses norsk casino nett - best biloxi casinos. \n<a href=https://mynorskspilleautomater.info/slot-airport-road-warri/>slot airport road warri</a>  <a href=https://norgesspilleautomater.info/pontoon-vs-blackjack/>pontoon vs blackjack</a>   Nytt norsk nettcasino Det har kommet et nytt norsk nettcasino som er tilpasset nordmenn bade i design og brukervennlighet Thrills casino er casinoet for.   <a href=https://norskonlinecasino.eu/volcano-eruption-slot-machine/>volcano eruption slot machine</a>  Vi elsker alle a fa gaver, men noen av dem er bedre enn andre Det er lite som kan male seg med casino gratis penger i 2015 Husk at alle nettcasino i hele.   PokerStars er verdens storste online poker rom med flere spill pa alle nivaer, storre Hos oss finner du flere poker turneringer og spill enn pa noen annen side.  <a href=https://norskonlinecasinoo.info/spill-norge-rundt/>spill norge rundt</a>  <a href=https://norskeautomater.eu/casino-mandalay-bay-las-vegas/>casino mandalay bay las vegas</a>   <a href=https://casinonorsk24.info/spilleautomater-mermaids-millions/>spilleautomater mermaids millions</a> \n<a href=https://casinonorsk.eu/super-slots-book/>super slots book</a>  <a href=https://norgespillcasino.info/antal-spilleautomater-i-danmark/>antal spilleautomater i danmark</a>   Det har seg jo slik at vi nordmenn i veldig stor grad oppsoker spillsider pa nettet for a kose oss med spillautomater Det er godt nytt for ComeOn, for du store all.   <a href=https://spillcasinonorsk.info/gratis-spinn-pa-starburst-uten-innskudd/>gratis spinn pa starburst uten innskudd</a>  <a href=https://mynorskspilleautomater.eu/spilleautomater-book-of-ra/>spilleautomater book of ra</a>   Casino Guiden, norske spilleautomater, casinospill og.  <a href=https://norskonlinecasino.eu/best-casinos-online-canada/>best casinos online canada</a>  <a href=https://norgesspillcasino.eu/norsk-tipping-lotto-lordag/>norsk tipping lotto lordag</a>   Added: 08022015, 17:28 News author: Olivia In fact, internal inductance: 450 mH, use the brain more playing video poker than when playing slot machines. \n<a href=https://spillcasinonorsk.eu/hot-as-hades-spilleautomat/>hot as hades spilleautomat</a>  <a href=https://norgesspillcasino.eu/spilleautomater-wild-water/>spilleautomater wild water</a>   Bigstones Russian roulette Rotter pa fravtale - Zickans Vaggvisan aka Lykke liten - Zickans Glogg aka Mogens - Glamrattan Wasabi - Glamrattan Muskat.   <a href=https://casinonorsk24.eu/slot-hopper-pieno/>slot hopper pieno</a>  Se egne prislister for bedrift og institusjon Alle priser er inklusiv mva eller leie mottaker Velger du a leie, er Programkort og Nettbro inkludert i manedsprisen.   In a live casino it feels like playing in a real casino Online gambling becomes more fun with a live dealer Play different casino games in the live casino.  <a href=https://norskespillcasino24.eu/spilleautomater-power-spins-sonic-7s/>spilleautomater power spins sonic 7s</a>  <a href=https://norskespillcasino24.eu/slot-machines-las-vegas/>slot machines las vegas</a>   <a href=https://norskecasinospill.eu/casino-rhodos-beach/>casino rhodos beach</a> \n<a href=https://norskspilleautomater.info/pontoon-blackjack-strategy/>pontoon blackjack strategy</a>  <a href=https://norskespillcasino24.info/slot-machine-robin-hood-gratis/>slot machine robin hood gratis</a>   Besok Nordisk Casino i dag og finne ditt nye favoritt spill som for eksempel Jackpot 6000, Mega Fortune Da har du sokt deg frem til den beste guiden der ute.   <a href=https://casinonorsk24.info/spilleautomater-gratis-spill/>spilleautomater gratis spill</a>  <a href=https://casinonorsk24.eu/spilleautomater-thief/>spilleautomater thief</a>   Ja, jeg vil finne de trygge og sikre bingo nettsider med de beste bonuser http://googl/Nhcg6g.  <a href=https://norskespillcasino24.info/sandnessjoen-nettcasino/>sandnessjoen nettcasino</a>  <a href=https://norgespillcasino.eu/casino-euro-bonus/>casino euro bonus</a>   Fa gratis norsk casino bonus uten innskudd hos mange forskjellige nettcasino Vi gir deg oversikt over de beste tilbudene om casino no deposit bonus. \n<a href=https://norskonlinecasino.eu/maria-bingo-norsk/>maria bingo norsk</a>  <a href=https://norskspilleautomater.eu/casino-online-gratis-speelgeld/>casino online gratis speelgeld</a>   Nar man kjenner til luftfartsverdenen, sa vet.   <a href=https://norskspilleautomater.info/mobile-roulette-free-bonus/>mobile roulette free bonus</a>  Gaming leksikon norskcasinoereu gir deg en detaljert gjennomgang av online casino CasinoEuro Les hele anmeldelsen online casino CasinoEuro.   Fotballreiser Liverpool, Sammenlign alle firma som selger fotballreiser med Liverpool pa deres hjemmestadion Anfield Sammenlign priser, hotell og billetter fra.  <a href=https://norgesspilleautomater.info/netent-casinos-no-deposit/>netent casinos no deposit</a>  <a href=https://norgesspilleautomater.eu/spilleautomater-dk/>spilleautomater dk</a>   <a href=https://norskespillcasino24.eu/casino-akrehamn/>casino akrehamn</a> \n<a href=https://norskecasinospill.info/spilleautomat-game-of-thrones/>spilleautomat game of thrones</a>  <a href=https://spillcasinonorsk.eu/bella-bingo-bonus-code/>bella bingo bonus code</a>   Oversettelse av ordet Roulett fra tysk til norsk, med synonymer, antonymer, verbboying, uttale, anagrammer og eksempler pa bruk.   <a href=https://spillcasinonorsk.eu/spilleautomat-crazy-cows/>spilleautomat crazy cows</a>  <a href=https://norgesspillcasino.eu/spilleautomater-lillesand/>spilleautomater lillesand</a>   Hos Unibet Bingo kan du vinne store premier i vare Bingo rom I Studio nye Bingo: Spill Online Bingo med store Jackpotter Hjelp Ansvarlig spill.  <a href=https://norskonlinecasinoo.info/casino-europa-flash/>casino europa flash</a>  <a href=https://norgespillcasino.info/all-slots-casino-bonus-codes-2018/>all slots casino bonus codes 2018</a>   Forden Se The Loft online gratis pa nettet Old Crows Football Se The Loft online gratis pa nettet Her kan du se denne film streaming gratis: http.", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 22442, "cpu_time_ms": 75, "memory_kb": 8032}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s682771290", "group_id": "codeNet:p03941", "input_text": "En mobil casino oversikt nettside som tilbyr de aller beste mobil casino spill online Hoye velkomstbonuser og sikkerheten er ikke noe a vre redd for. \n<a href=https://norgesspilleautomater24.eu/spilleautomater-outta-space-adventure/>spilleautomater outta space adventure</a>  <a href=https://norgespillcasino.eu/888-casino-bonus-code/>888 casino bonus code</a>   Forste omgangen var meget jevn, fa sjanser, tette dueller og oppofrende spill For Skeid var kampen enda et eksempel pa at de kan spille jevnt ogsa mot de.   <a href=https://norgesspilleautomater24.eu/casino-bonus-uten-omsetningskrav/>casino bonus uten omsetningskrav</a>  <a href=https://norgesspilleautomater24.eu/norsk-spilleautomater/>norsk spilleautomater</a>   Noen som kjenner til en god, gratis versjon av kabal for Mac OS X?  <a href=https://norgesspillcasino.info/norske-spillere-i-premier-league-2018/>norske spillere i premier league 2018</a>  <a href=https://norskecasinospill.eu/spilleautomat-vekt/>spilleautomat vekt</a>   Se alle stillinger 66 Se alle eiendommer MOTORSYKKEL-entusiaster: Mye fint a se pa, mener Hein Erik Johnsen fv Angell Bergh til Super League. \n<a href=https://norgescasino.eu/betway-casino-bonus/>betway casino bonus</a>  <a href=https://casinonorsk.eu/spilleautomater-color-line/>spilleautomater color line</a>   Converse Sko Pa Nett TrondheimSko Jenter Converse Sko Pa Nett Fullfore utseende med designer elementer Etter en rask bad, ledet Odds On Studios.   <a href=https://casinonorsk24.eu/spilleautomater-jazz-of-new-orleans/>spilleautomater jazz of new orleans</a>  Spilleautomater gratis pa nett, gratis bonuser pa spillegratislotscom - Primeslots Bonus code 160Gratis.   CasinoEuro er et godt etablert europeisk casino som har blitt store pa det norske markedet De gir ofte ut gratis spinn pa de populre spilleautomatene.  <a href=https://casinonorsk24.eu/casino-tropez-review/>casino tropez review</a>  <a href=https://norgesspilleautomater24.info/norsk-tv-pa-nett/>norsk tv pa nett</a>   <a href=https://norskespillcasino24.eu/spilleautomat-mega-spin-break-da-bank/>spilleautomat mega spin break da bank</a> \n<a href=https://norgespillcasino.info/slotmaskiner/>slotmaskiner</a>  <a href=https://norgespillcasino.info/spillehjemmesider/>spillehjemmesider</a>   Gratis online lring spill for grunnskole, videregaende skole, veiledning, voksenopplring og hjem skolegang Geografi lrerressurser for interaktive tavler i.   <a href=https://norgespillcasino.eu/free-spins-netent/>free spins netent</a>  <a href=https://norgescasino.eu/spilleautomater-mermaids-millions/>spilleautomater mermaids millions</a>   Gratisspinn pa spilleautomaten Football Star vil vre tilgjengelig hos Guts casino den husk Du kan se en smakebit pa Football Star i videoen under.  <a href=https://spillcasinonorsk.info/spilleautomat-ace-of-spades/>spilleautomat ace of spades</a>  <a href=https://norgesspilleautomater.eu/casino-finnsnes/>casino finnsnes</a>   Casino turneringen Jeg var innlagt pa psykiatrisk sykehus En apen avdeling, jobbet med en nettside og ble ferdig og fikk meg internet som jeg da brukte for a. \n<a href=https://norskeautomater.eu/casino-sonoma-county/>casino sonoma county</a>  <a href=https://norgespillcasino.info/slots-casino-online/>slots casino online</a>   Vi har samlet de beste norske mobile casinoene Her far du et bredt spillutvalg til mobile enheter, som ogsa inkluderer nettbrett som iPad og ikke minst en god.   <a href=https://norskspilleautomater.eu/free-spins-i-dag/>free spins i dag</a>  Hva med et romantisk spa opphold eller en fjelltur?   Den beromte Bet365 bookmaker grunnlagt i av de mest respekterte og etterspurte gambling operatorer i Norge Bet365 Casino er et online kasino.  <a href=https://norskecasinospill.eu/fri-spill/>fri spill</a>  <a href=https://norgesspillcasino.eu/norgesautomaten-gratis-spill/>norgesautomaten gratis spill</a>   <a href=https://casinonorsk.eu/kjope-ps4-spill-online/>kjope ps4 spill online</a> \n<a href=https://norgesspilleautomater24.info/free-spins-casino-room/>free spins casino room</a>  <a href=https://norskespillcasino.info/beste-casino-2018/>beste casino 2018</a>   Hver sondag vil du kunne mottainn pa spilleautomaten Piggy Riches Hent utllom klokken00 og de resterende 5 spinnene.   <a href=https://casinonorsk.info/spilleautomater-book-of-ra/>spilleautomater book of ra</a>  <a href=https://norgesspillcasino.info/indiana-jones-automat-pa-nett/>indiana jones automat pa nett</a>   Det er mange forskjellige casino sider pa internett som tilbyr skrapelodd Nar du Eurolottocom var den forste lotto siden pa internett som satser pa det norske.  <a href=https://norskeautomater.eu/norsk-tipping-automater/>norsk tipping automater</a>  <a href=https://norgesspilleautomater24.eu/casino-skiatook-ok/>casino skiatook ok</a>   Ting som havner pa internett forsvinner aldri helt, og dette har jeg vrt klar over nar jeg har Et svar til kritikerne av SNF-rapporten om konkurranse pa nett. \n<a href=https://casinonorsk24.info/casino-guide-2018/>casino guide 2018</a>  <a href=https://norskespillcasino.eu/automat-random-runner/>automat random runner</a>   Hamsterpajnet Helgon hi5 Ning Playboardno Fotballenno goalcom Liverpoolno - Norsk Swiftdrop till OS X blir gratis Langt snack med Tim Cook.   <a href=https://norskespillcasino.info/spilleautomat-lady-in-red/>spilleautomat lady in red</a>  Online Spilleautomater: spill gratis norske spilleautomater fra NetEnt, video slots fra Playtech, Microgaming, Betsoft.   Svrt mange populre spill er a finne blandt titlene til Vera og John Casino Det er et mangfoldig men jevnt utvalg i alt fra kortspill, bordspill, automatspill, og.  <a href=https://norskonlinecasino.eu/free-spin-casino-no-deposit-bonus-codes/>free spin casino no deposit bonus codes</a>  <a href=https://norskeautomater.eu/jason-and-the-golden-fleece-slot-machine/>jason and the golden fleece slot machine</a>   <a href=https://norskespillcasino.info/norske-casino-uten-innskudd/>norske casino uten innskudd</a> \n<a href=https://norgesspillcasino.eu/casino-moss-apningstider/>casino moss apningstider</a>  <a href=https://norgesspilleautomater24.eu/nye-online-casinoer/>nye online casinoer</a>   Informasjonssjef i Norsk Tipping, Einar Busterud, svarer pa lesernes sporsmal Noe meningslost a stille her pa VG nett om du skal fortsette pa denne maten.   <a href=https://norgesspillcasino.info/norske-gratis-casino/>norske  gratis casino</a>  <a href=https://norgescasinos.info/online-betting/>online betting</a>   Oversettelser spile pa engelsk - Ordbok engelsk, Ordet spile - oversettelseeu Relaterte ord: engelsk spile, spille spill 123, spille spill, spille gratis.  <a href=https://norgesspillcasino.eu/best-us-casinos-online/>best us casinos online</a>  <a href=https://norgespillcasino.info/all-slot-casino-free-download/>all slot casino free download</a>   Her er Norges mest populre bruktbiler Annonse Dette gjor bileiere lojale Annonse ABCNyheter / spill Lever kupongene dine hos oss Spill her. \n<a href=https://norgesspillcasino.info/steam-tower-spilleautomater/>steam tower spilleautomater</a>  <a href=https://norskeautomaterr.info/karamba-casino-erfahrungen/>karamba casino erfahrungen</a>   Jeg kjorte over grensa for a spille bort penger pa Casino Cosmopol i Gteborg Kasinoer er et ekstremt fascinerende sted a oppholde seg Stemningen befinner.   <a href=https://casinonorsk.eu/casino-online-roulette-trick/>casino online roulette trick</a>  Disse no innskudd bonuser er gitt , likevel , og mye lavere enn noen enorm Inside bonus game du kan vinne sa mye somatis video spilltitler og opp.   ComeOn - ComeOn Casino er en nytenkende online spillside som tilbyr mest spill med de hoyeste jackpots Redbet - Redbet tilbyr de beste spillene online.  <a href=https://norskeautomater.eu/slot-lights/>slot lights</a>  <a href=https://norskecasinospill.info/odds-spill-pa-nett/>odds spill pa nett</a>   <a href=https://norskonlinecasinoo.info/kabaleo-spill/>kabaleo spill</a> \n<a href=https://spillcasinonorsk.eu/norsk-spiller-malmo/>norsk spiller malmo</a>  <a href=https://norskonlinecasino.eu/spilleautomater-afgift/>spilleautomater afgift</a>   Med Betsafe casino kan spillerne velge mellom casino red og casino black Begge er fylte med klassiske spill og automater med mulighet for gratis spill.   <a href=https://norgescasino.eu/casino-euro/>casino euro</a>  <a href=https://norgescasino.eu/spilleautomat-santas-wild-ride/>spilleautomat santas wild ride</a>   En bra spillside Av og til kan det vre vanskelig a velge et nettkasino Det er veldig enkelt a finne nettkasinoer, for de er overalt, og man finner kasinotilbud.  <a href=https://norgesspilleautomater24.info/live-roulette/>live roulette</a>  <a href=https://norgespillcasino.eu/spilleautomater-great-blue/>spilleautomater great blue</a>   Et kommersielt samarbeid med Til norsk-tippingno Spill Potensiell utbetaling 992,00 Se hele Oddsprogrammet Mandagens oddsprogram bestar To av de storste profilene i laget spiller til daglig i Premier League: Montero Swansea og. \n<a href=https://casinonorsk.info/slot-victorious/>slot victorious</a>  <a href=https://norgesspillcasino.info/spilleautomat-crazy-cows/>spilleautomat crazy cows</a>   Bingoregler Har du lyst pa litt spenning, eller drommer du om a vinne masse penger?   <a href=https://spillcasinonorsk.info/casino-room-deposit-codes/>casino room deposit codes</a>  Hva er det med gorillaer og spill?   Ratchet: Gladiator Ekspertanmeldelser 32, Brukeranmeldelser 85, laveste priser, bilderr hos TestFreaks.  <a href=https://casinonorsk24.info/spilleautomater-nu/>spilleautomater nu</a>  <a href=https://norskonlinecasinoo.info/splitsider/>splitsider</a>   <a href=https://norskeautomater.eu/spilleautomater-big-kahuna/>spilleautomater big kahuna</a> \n<a href=https://norskspilleautomater.info/casino-software-companies/>casino software companies</a>  <a href=https://norgescasinos.info/play-online-casino-with-paypal/>play online casino with paypal</a>   Dette er en blogg hvor det presenteres konkurranser pa nettsider og i blogger Alle kan fa sin Use Bloglovin' & never miss a post from Konkurranser pa nett.   <a href=https://norgesspillcasino.eu/norskeautomater-review/>norskeautomater review</a>  <a href=https://norgespillcasino.info/the-glass-slipper-spilleautomat/>the glass slipper spilleautomat</a>   DRITINGS I BIKINI P TALKSHOW, FUCK A DUCK, JEG KOM, S GIKK JEG, SATTE FAST HRRODUKT I DSA, Norske lan og kredittkort, NYTER RHODOS.  <a href=https://norgesspilleautomater24.eu/slots-machines-free-games/>slots machines free games</a>  <a href=https://norgesspillcasino.eu/slot-captain-treasure-pro/>slot captain treasure pro</a>   Bingo, lotterispill av italiensk opprinnelse fra 1500-tallet Store norske leksikon er et gratis og komplett oppslagsverk skrevet av fagfolk pa bokmal og nynorsk. \n<a href=https://norgesspilleautomater24.eu/super-slots-tinyco/>super slots tinyco</a>  <a href=https://casinonorsk24.eu/operation-x-spilleautomater/>operation x spilleautomater</a>   Finn ut mer om hvordan det er a jobbe i GoWild Casino Bli med i LinkedIn i dag det er gratis Se hvem du kjenner hos GoWild Casino, dra nytte av ditt.   <a href=https://norskonlinecasinoo.info/spilleautomat-the-funky-seventies/>spilleautomat the funky seventies</a>  New Balance 998 Herre Billige Pa Nettnettsted New Balance 998 Herre Spar penger pa shopping for Black Friday New Balance 576 Herre.   Velg om du vil spille poker eller Texas Hold'em Skaff deg poletter og spill for a vinne Lykke til Playforia - Gratis online spill og kule avatarer.  <a href=https://casinonorsk.info/euro-palace-casino-bonus-code/>euro palace casino bonus code</a>  <a href=https://casinonorsk.info/euro-lotto-beste-zahlen/>euro lotto beste zahlen</a>   <a href=https://norgesspilleautomater.info/spilleautomater-macau-nights/>spilleautomater macau nights</a> \n<a href=https://norskonlinecasino.eu/spille-gratis-spill-plattform/>spille gratis spill plattform</a>  <a href=https://norgesspillcasino.info/roulette-regler-wikipedia/>roulette regler wikipedia</a>   Tjenestetilbudet for Romskog kommune er sortert i kategorier som du finner i menyen til venstre.   <a href=https://norgesspilleautomater.eu/spilleautomater-orkanger/>spilleautomater orkanger</a>  <a href=https://spillcasinonorsk.eu/slots-machines-for-sale/>slots machines for sale</a>   Cocawap Bingo Beach Spill: Last ned Bingo Beach Spill Gratis Android, Spille Bingo Beach spill.  <a href=https://norskespillcasino.info/slot-casinos-near-me/>slot casinos near me</a>  <a href=https://norskspilleautomater.info/slot-gladiator-demo/>slot gladiator demo</a>   Social Trading lar deg tjene penger pa nett ved a kopiere hva profesjonelle investorer gjor Ingen forkunnskaper er nodvendig og det er gratis. \n<a href=https://norgesspilleautomater.info/cop-the-lot-slot-free-play/>cop the lot slot free play</a>  <a href=https://norgesspilleautomater24.info/lillestrom-nettcasino/>lillestrom nettcasino</a>   Skulle du vre pa utkikk for a fa en online bingo nettsted British deretter kanskje Med sin behagelig red whitened og violet fargelegger og lett til komme seg.   <a href=https://norskespillcasino24.info/spilleautomater-pie-rats/>spilleautomater pie rats</a>  Reisetilbud Dagens SuperDeals Last Minute Konkurranser Nyheter Kundeservice Hjem Vare reisemal Bahamas Sok og bestill reise Bahamas.   Spillemaskiner echtgeld players cannot play aristocrats bonus, up Platinum Play Casino Bonus Codes brugte spilleautomater til salg play Outside of the.  <a href=https://norskecasinospill.eu/spilleautomat-mega-fortune/>spilleautomat mega fortune</a>  <a href=https://spillcasinonorsk.info/spill-pa-mobil-norsk-tipping/>spill pa mobil norsk tipping</a>   <a href=https://spillcasinonorsk.info/kolvereid-nettcasino/>kolvereid nettcasino</a> \n<a href=https://norskespillcasino.info/norske-spill/>norske spill</a>  <a href=https://norgesspillcasino.info/spillselskaper-norge/>spillselskaper norge</a>   When du bli med GamingJobsOnlinecom og begynne a arbeide med vare unik jobb du kan fa betalt for a spille nye og.   <a href=https://norgesspillcasino.info/beste-norske-nettcasino/>beste norske nettcasino</a>  <a href=https://norskecasinospill.eu/slot-machine-games/>slot machine games</a>   New regler i casino kortspill Canadian metin2stylenet16net give exclusive bonuses casino kortspill regler - choctaw casino durant reviews.  <a href=https://norskeautomater.eu/norsk-flora-pa-nett/>norsk flora pa nett</a>  <a href=https://casinonorsk24.eu/laer-at-spille-roulette/>l?r at spille roulette</a>   Damelagets kaptein Tina Wulf setter seg pa sykkelen i morgen tidlig Hun skal sykle To av de ivrige skjerferne har oppretta eget skjerfekart pa nett Det er. \n<a href=https://norskonlinecasino.eu/spilleautomater-lekepenger/>spilleautomater lekepenger</a>  <a href=https://mynorskspilleautomater.eu/wheres-the-gold-slot-machine-free-download/>wheres the gold slot machine free download</a>   Fotballstudio Mote Mat Tegneserier Spill 123 Spill Seno Travtips Oddstips pa alle vare levegger og gjerder i beskyttet gran Ramme mm Spile 19 x.   <a href=https://norskeautomater.eu/online-gambling/>online gambling</a>  Titan casino spelen nederland isd I Nesehornets hemmelighet introduseres ogs en annen vesentlig figur i serien: turbobilen Annen verdenskrig medfrte flere.   Trans noWant To Step Up Your Free Spins You Need To Read This First notrans Casino online echtgeld Eller velkomstbonuser One er tilbake apent, som.  <a href=https://norgesspilleautomater.info/casino-gratis-spins/>casino gratis spins</a>  <a href=https://norskespillcasino.eu/casino-norsk-tipping/>casino norsk tipping</a>   <a href=https://casinonorsk.eu/slot-avalon-gratis/>slot avalon gratis</a> \n<a href=https://norskespillcasino.eu/spilleautomater-break-away/>spilleautomater break away</a>  <a href=https://norskeautomaterr.info/punto-banco-online-free/>punto banco online free</a>   Engelsk fotball PrLeague - Toppscorer Pr League - Klubbene FA Cupen Ligacupen Play off 2014/15 Engelske klubblinker Engelsk fotball - statistikk.   <a href=https://norgesspilleautomater.info/norsk-tv-pa-nett/>norsk tv pa nett</a>  <a href=https://norskecasinospill.info/play-slots-for-real-money-for-free/>play slots for real money for free</a>   Velkommen til Touch pa nett Touch pa nett er et treningsprogram i touchmetoden som passer for alle aldre, fra ti ar og oppover Kursets hoveddel bestar av tolv.  <a href=https://norgesspilleautomater.info/slot-machine-robin-hood-gratis/>slot machine robin hood gratis</a>  <a href=https://norskspilleautomater.info/spilleautomat-sushi-express/>spilleautomat sushi express</a>   Opp til $diac Casino tilbyr i dagill: Ti av de mest populre bordspill Baccarat, Blackjack, Caribbean Poker, Casino War, Craps. \n<a href=https://norskecasinospill.eu/casino-trondheim/>casino trondheim</a>  <a href=https://norgesspillcasino.eu/premier-roulette-microgaming/>premier roulette microgaming</a>   Stablespill Sett opp tarnet, plukk ut klosser med en hand Den som far tarnet til a rase sammen, taper Den siste som klarer det, vinner Laget av eksotisk.   <a href=https://norskeautomaterr.info/spilleautomater-online-gratis/>spilleautomater online gratis</a>  Omtrent slik var det da bingoen ble utviklet til det spillet som i dag spilles over hele verden Hvor spillet har sitt opphav er Piggy Bank Piggy-Bank-videoslot.   Det er en stor mengde fordeler med a spille via mobilen fremfor datamaskinen n av fordelene er designet, nar du spiller pa mobilen vil spillet vre i fullskjerm.  <a href=https://norskspilleautomater.eu/golden-pyramid-slot/>golden pyramid slot</a>  <a href=https://norskecasinospill.eu/slot-ghost-pirates-gratis/>slot ghost pirates gratis</a>   <a href=https://norskonlinecasino.eu/online-casinos-with-easy-withdrawal/>online casinos with easy withdrawal</a> \n<a href=https://norgespillcasino.info/spilleautomater-bronnoysund/>spilleautomater bronnoysund</a>  <a href=https://casinonorsk24.eu/online-casino-games-canada/>online casino games canada</a>   Kast deg ut i spinningen og mor deg med a spille pa de beste gratis spilleautomatene pa nett Nyt spillene uten innbetaling eller registrering.   <a href=https://norskespillcasino.eu/spilleautomater-rjukan/>spilleautomater rjukan</a>  <a href=https://norgesspilleautomater.eu/online-casino-slots-uk/>online casino slots uk</a>   Casino di Soldi liberi: Tigre D'oro Free Money Casinos: Golden Tiger Gratis Money Casinos: Golden Tiger Freie Geldkasinos: Goldener Tiger.  <a href=https://norskespillcasino.eu/online-casino-free-spins-utan-insaettning/>online casino free spins utan insattning</a>  <a href=https://norgesspilleautomater.eu/maria-bingo-erfaringer/>maria bingo erfaringer</a>   Aalesund haper pa to nye spillere i sommer Provespillet har kommet i stand via en som heter Tom Begley, som er en kamerat av Reidar Tryggestad, ifolge. \n<a href=https://norgescasinos.info/online-casino-roulette-scams/>online casino roulette scams</a>  <a href=https://norgespillcasino.eu/best-casino-bonus-deposit/>best casino bonus deposit</a>   Da kan du bidra for Supporterklubben Les mer.   <a href=https://norskonlinecasinoo.info/slot-burning-desire/>slot burning desire</a>  Agronom Carl Helander Agronom Erik Stjerndahl AIK Aina Marie Lien AIP Casia Bromberg Casino Cosmopols Cask Sweden Catarina Bennetoft.   Casino Swiss online er en nykommer pa scenen for online gambling Det har vrt i drift siden 2007, men fremstar som et profesjonelt, eldre og godt etablert.  <a href=https://norgespillcasino.info/verdens-beste-spill-pc/>verdens beste spill pc</a>  <a href=https://norgescasino.eu/spilleautomat-battlestar-galactica/>spilleautomat battlestar galactica</a>   <a href=https://norskonlinecasino.eu/slot-evolution-concert/>slot evolution concert</a> \n<a href=https://casinonorsk.info/internet-casino-no-deposit-bonus/>internet casino no deposit bonus</a>  <a href=https://norgescasinos.info/titan-casino-no-deposit/>titan casino no deposit</a>   Spilt: 0 Online Games Annerledes Online Games Alle Arkanoid Arkanoid Puslespill Julen Spill spillet Grakanoid Online: 100%Reset Utvid.   <a href=https://norgesspilleautomater24.info/norskespill-casino-mobile/>norskespill casino mobile</a>  <a href=https://norgesspillcasino.eu/slot-admiralty-way-lekki/>slot admiralty way lekki</a>   Spill skrapelodder online Nedenfor finner du informasjon om og beskrivelse av spillereglene for a spill skraplodd pa Betsson Hvis du kenner hvordan den.  <a href=https://norgespillcasino.info/jackpot-6000-mega-joker/>jackpot 6000 mega joker</a>  <a href=https://norskespillcasino.info/internet-casino-deutschland/>internet casino deutschland</a>   Finn Marley Lilly kupongkoder pa nettsteder som SavingStorycom, PromoProcom, HotDealscom, CouponFollowcom og Savevycom Hvert omrade gir. \n<a href=https://norgespillcasino.info/videoslots-bonus-code/>videoslots bonus code</a>  <a href=https://norskeautomater.eu/casino-forum-norge/>casino forum norge</a>   Spille online kasino spill blackjack, roulette, video poker, slots, progressive og Baccarat i Casino med de beste odds, beste kampanjer, gratis penger, og den.   <a href=https://norgescasino.eu/free-spins-casino-room/>free spins casino room</a>  Spill & spillkonsoller Stasjonre konsoller PlayStation 4-spill PC-spill Handkontroller PlayStation 3-spill Xbox One-spill Ratt & pedaler Fler.   Du kan fortsatt nyte a spille pa Lucky.  <a href=https://spillcasinonorsk.eu/texas-holdem-tips-advanced/>texas holdem tips advanced</a>  <a href=https://norgespillcasino.info/spilleautomat-mad-professor/>spilleautomat mad professor</a>   <a href=https://norskecasinospill.info/spilleautomat-doctor-love-on-vacation/>spilleautomat doctor love on vacation</a> \n<a href=https://norskespillcasino.eu/best-roulette-online-casino/>best roulette online casino</a>  <a href=https://norskespillcasino24.eu/spill-texas-holdem-gratis/>spill texas holdem gratis</a>   Kredittkortmarkedet konkurrerer hardt om dagen for a fa deg som kunde En av de beste matene de gjor det pa er a gi deg penger tilbake nar du bruker.   <a href=https://norskespillcasino24.info/norske-automat-pa-nette/>norske automat pa nette</a>  <a href=https://norskecasinospill.eu/fauske-nettcasino/>fauske nettcasino</a>   Bonus mer hvis legger stort lover ofte gratis spill spill casino pa nett Har pokerprogramvaren tett teknologiske fra noe?  <a href=https://norgesspilleautomater.info/gratis-spilleautomater/>gratis spilleautomater</a>  <a href=https://norskonlinecasinoo.info/beste-gratis-spill-android/>beste gratis spill android</a>   Min N8 har tatt kvelden etter diverse blote.", "language": "Lisp", "metadata": {"date": 1545895421, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03941.html", "problem_id": "p03941", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03941/input.txt", "sample_output_relpath": "derived/input_output/data/p03941/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03941/Lisp/s682771290.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s682771290", "user_id": "u220737758"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "En mobil casino oversikt nettside som tilbyr de aller beste mobil casino spill online Hoye velkomstbonuser og sikkerheten er ikke noe a vre redd for. \n<a href=https://norgesspilleautomater24.eu/spilleautomater-outta-space-adventure/>spilleautomater outta space adventure</a>  <a href=https://norgespillcasino.eu/888-casino-bonus-code/>888 casino bonus code</a>   Forste omgangen var meget jevn, fa sjanser, tette dueller og oppofrende spill For Skeid var kampen enda et eksempel pa at de kan spille jevnt ogsa mot de.   <a href=https://norgesspilleautomater24.eu/casino-bonus-uten-omsetningskrav/>casino bonus uten omsetningskrav</a>  <a href=https://norgesspilleautomater24.eu/norsk-spilleautomater/>norsk spilleautomater</a>   Noen som kjenner til en god, gratis versjon av kabal for Mac OS X?  <a href=https://norgesspillcasino.info/norske-spillere-i-premier-league-2018/>norske spillere i premier league 2018</a>  <a href=https://norskecasinospill.eu/spilleautomat-vekt/>spilleautomat vekt</a>   Se alle stillinger 66 Se alle eiendommer MOTORSYKKEL-entusiaster: Mye fint a se pa, mener Hein Erik Johnsen fv Angell Bergh til Super League. \n<a href=https://norgescasino.eu/betway-casino-bonus/>betway casino bonus</a>  <a href=https://casinonorsk.eu/spilleautomater-color-line/>spilleautomater color line</a>   Converse Sko Pa Nett TrondheimSko Jenter Converse Sko Pa Nett Fullfore utseende med designer elementer Etter en rask bad, ledet Odds On Studios.   <a href=https://casinonorsk24.eu/spilleautomater-jazz-of-new-orleans/>spilleautomater jazz of new orleans</a>  Spilleautomater gratis pa nett, gratis bonuser pa spillegratislotscom - Primeslots Bonus code 160Gratis.   CasinoEuro er et godt etablert europeisk casino som har blitt store pa det norske markedet De gir ofte ut gratis spinn pa de populre spilleautomatene.  <a href=https://casinonorsk24.eu/casino-tropez-review/>casino tropez review</a>  <a href=https://norgesspilleautomater24.info/norsk-tv-pa-nett/>norsk tv pa nett</a>   <a href=https://norskespillcasino24.eu/spilleautomat-mega-spin-break-da-bank/>spilleautomat mega spin break da bank</a> \n<a href=https://norgespillcasino.info/slotmaskiner/>slotmaskiner</a>  <a href=https://norgespillcasino.info/spillehjemmesider/>spillehjemmesider</a>   Gratis online lring spill for grunnskole, videregaende skole, veiledning, voksenopplring og hjem skolegang Geografi lrerressurser for interaktive tavler i.   <a href=https://norgespillcasino.eu/free-spins-netent/>free spins netent</a>  <a href=https://norgescasino.eu/spilleautomater-mermaids-millions/>spilleautomater mermaids millions</a>   Gratisspinn pa spilleautomaten Football Star vil vre tilgjengelig hos Guts casino den husk Du kan se en smakebit pa Football Star i videoen under.  <a href=https://spillcasinonorsk.info/spilleautomat-ace-of-spades/>spilleautomat ace of spades</a>  <a href=https://norgesspilleautomater.eu/casino-finnsnes/>casino finnsnes</a>   Casino turneringen Jeg var innlagt pa psykiatrisk sykehus En apen avdeling, jobbet med en nettside og ble ferdig og fikk meg internet som jeg da brukte for a. \n<a href=https://norskeautomater.eu/casino-sonoma-county/>casino sonoma county</a>  <a href=https://norgespillcasino.info/slots-casino-online/>slots casino online</a>   Vi har samlet de beste norske mobile casinoene Her far du et bredt spillutvalg til mobile enheter, som ogsa inkluderer nettbrett som iPad og ikke minst en god.   <a href=https://norskspilleautomater.eu/free-spins-i-dag/>free spins i dag</a>  Hva med et romantisk spa opphold eller en fjelltur?   Den beromte Bet365 bookmaker grunnlagt i av de mest respekterte og etterspurte gambling operatorer i Norge Bet365 Casino er et online kasino.  <a href=https://norskecasinospill.eu/fri-spill/>fri spill</a>  <a href=https://norgesspillcasino.eu/norgesautomaten-gratis-spill/>norgesautomaten gratis spill</a>   <a href=https://casinonorsk.eu/kjope-ps4-spill-online/>kjope ps4 spill online</a> \n<a href=https://norgesspilleautomater24.info/free-spins-casino-room/>free spins casino room</a>  <a href=https://norskespillcasino.info/beste-casino-2018/>beste casino 2018</a>   Hver sondag vil du kunne mottainn pa spilleautomaten Piggy Riches Hent utllom klokken00 og de resterende 5 spinnene.   <a href=https://casinonorsk.info/spilleautomater-book-of-ra/>spilleautomater book of ra</a>  <a href=https://norgesspillcasino.info/indiana-jones-automat-pa-nett/>indiana jones automat pa nett</a>   Det er mange forskjellige casino sider pa internett som tilbyr skrapelodd Nar du Eurolottocom var den forste lotto siden pa internett som satser pa det norske.  <a href=https://norskeautomater.eu/norsk-tipping-automater/>norsk tipping automater</a>  <a href=https://norgesspilleautomater24.eu/casino-skiatook-ok/>casino skiatook ok</a>   Ting som havner pa internett forsvinner aldri helt, og dette har jeg vrt klar over nar jeg har Et svar til kritikerne av SNF-rapporten om konkurranse pa nett. \n<a href=https://casinonorsk24.info/casino-guide-2018/>casino guide 2018</a>  <a href=https://norskespillcasino.eu/automat-random-runner/>automat random runner</a>   Hamsterpajnet Helgon hi5 Ning Playboardno Fotballenno goalcom Liverpoolno - Norsk Swiftdrop till OS X blir gratis Langt snack med Tim Cook.   <a href=https://norskespillcasino.info/spilleautomat-lady-in-red/>spilleautomat lady in red</a>  Online Spilleautomater: spill gratis norske spilleautomater fra NetEnt, video slots fra Playtech, Microgaming, Betsoft.   Svrt mange populre spill er a finne blandt titlene til Vera og John Casino Det er et mangfoldig men jevnt utvalg i alt fra kortspill, bordspill, automatspill, og.  <a href=https://norskonlinecasino.eu/free-spin-casino-no-deposit-bonus-codes/>free spin casino no deposit bonus codes</a>  <a href=https://norskeautomater.eu/jason-and-the-golden-fleece-slot-machine/>jason and the golden fleece slot machine</a>   <a href=https://norskespillcasino.info/norske-casino-uten-innskudd/>norske casino uten innskudd</a> \n<a href=https://norgesspillcasino.eu/casino-moss-apningstider/>casino moss apningstider</a>  <a href=https://norgesspilleautomater24.eu/nye-online-casinoer/>nye online casinoer</a>   Informasjonssjef i Norsk Tipping, Einar Busterud, svarer pa lesernes sporsmal Noe meningslost a stille her pa VG nett om du skal fortsette pa denne maten.   <a href=https://norgesspillcasino.info/norske-gratis-casino/>norske  gratis casino</a>  <a href=https://norgescasinos.info/online-betting/>online betting</a>   Oversettelser spile pa engelsk - Ordbok engelsk, Ordet spile - oversettelseeu Relaterte ord: engelsk spile, spille spill 123, spille spill, spille gratis.  <a href=https://norgesspillcasino.eu/best-us-casinos-online/>best us casinos online</a>  <a href=https://norgespillcasino.info/all-slot-casino-free-download/>all slot casino free download</a>   Her er Norges mest populre bruktbiler Annonse Dette gjor bileiere lojale Annonse ABCNyheter / spill Lever kupongene dine hos oss Spill her. \n<a href=https://norgesspillcasino.info/steam-tower-spilleautomater/>steam tower spilleautomater</a>  <a href=https://norskeautomaterr.info/karamba-casino-erfahrungen/>karamba casino erfahrungen</a>   Jeg kjorte over grensa for a spille bort penger pa Casino Cosmopol i Gteborg Kasinoer er et ekstremt fascinerende sted a oppholde seg Stemningen befinner.   <a href=https://casinonorsk.eu/casino-online-roulette-trick/>casino online roulette trick</a>  Disse no innskudd bonuser er gitt , likevel , og mye lavere enn noen enorm Inside bonus game du kan vinne sa mye somatis video spilltitler og opp.   ComeOn - ComeOn Casino er en nytenkende online spillside som tilbyr mest spill med de hoyeste jackpots Redbet - Redbet tilbyr de beste spillene online.  <a href=https://norskeautomater.eu/slot-lights/>slot lights</a>  <a href=https://norskecasinospill.info/odds-spill-pa-nett/>odds spill pa nett</a>   <a href=https://norskonlinecasinoo.info/kabaleo-spill/>kabaleo spill</a> \n<a href=https://spillcasinonorsk.eu/norsk-spiller-malmo/>norsk spiller malmo</a>  <a href=https://norskonlinecasino.eu/spilleautomater-afgift/>spilleautomater afgift</a>   Med Betsafe casino kan spillerne velge mellom casino red og casino black Begge er fylte med klassiske spill og automater med mulighet for gratis spill.   <a href=https://norgescasino.eu/casino-euro/>casino euro</a>  <a href=https://norgescasino.eu/spilleautomat-santas-wild-ride/>spilleautomat santas wild ride</a>   En bra spillside Av og til kan det vre vanskelig a velge et nettkasino Det er veldig enkelt a finne nettkasinoer, for de er overalt, og man finner kasinotilbud.  <a href=https://norgesspilleautomater24.info/live-roulette/>live roulette</a>  <a href=https://norgespillcasino.eu/spilleautomater-great-blue/>spilleautomater great blue</a>   Et kommersielt samarbeid med Til norsk-tippingno Spill Potensiell utbetaling 992,00 Se hele Oddsprogrammet Mandagens oddsprogram bestar To av de storste profilene i laget spiller til daglig i Premier League: Montero Swansea og. \n<a href=https://casinonorsk.info/slot-victorious/>slot victorious</a>  <a href=https://norgesspillcasino.info/spilleautomat-crazy-cows/>spilleautomat crazy cows</a>   Bingoregler Har du lyst pa litt spenning, eller drommer du om a vinne masse penger?   <a href=https://spillcasinonorsk.info/casino-room-deposit-codes/>casino room deposit codes</a>  Hva er det med gorillaer og spill?   Ratchet: Gladiator Ekspertanmeldelser 32, Brukeranmeldelser 85, laveste priser, bilderr hos TestFreaks.  <a href=https://casinonorsk24.info/spilleautomater-nu/>spilleautomater nu</a>  <a href=https://norskonlinecasinoo.info/splitsider/>splitsider</a>   <a href=https://norskeautomater.eu/spilleautomater-big-kahuna/>spilleautomater big kahuna</a> \n<a href=https://norskspilleautomater.info/casino-software-companies/>casino software companies</a>  <a href=https://norgescasinos.info/play-online-casino-with-paypal/>play online casino with paypal</a>   Dette er en blogg hvor det presenteres konkurranser pa nettsider og i blogger Alle kan fa sin Use Bloglovin' & never miss a post from Konkurranser pa nett.   <a href=https://norgesspillcasino.eu/norskeautomater-review/>norskeautomater review</a>  <a href=https://norgespillcasino.info/the-glass-slipper-spilleautomat/>the glass slipper spilleautomat</a>   DRITINGS I BIKINI P TALKSHOW, FUCK A DUCK, JEG KOM, S GIKK JEG, SATTE FAST HRRODUKT I DSA, Norske lan og kredittkort, NYTER RHODOS.  <a href=https://norgesspilleautomater24.eu/slots-machines-free-games/>slots machines free games</a>  <a href=https://norgesspillcasino.eu/slot-captain-treasure-pro/>slot captain treasure pro</a>   Bingo, lotterispill av italiensk opprinnelse fra 1500-tallet Store norske leksikon er et gratis og komplett oppslagsverk skrevet av fagfolk pa bokmal og nynorsk. \n<a href=https://norgesspilleautomater24.eu/super-slots-tinyco/>super slots tinyco</a>  <a href=https://casinonorsk24.eu/operation-x-spilleautomater/>operation x spilleautomater</a>   Finn ut mer om hvordan det er a jobbe i GoWild Casino Bli med i LinkedIn i dag det er gratis Se hvem du kjenner hos GoWild Casino, dra nytte av ditt.   <a href=https://norskonlinecasinoo.info/spilleautomat-the-funky-seventies/>spilleautomat the funky seventies</a>  New Balance 998 Herre Billige Pa Nettnettsted New Balance 998 Herre Spar penger pa shopping for Black Friday New Balance 576 Herre.   Velg om du vil spille poker eller Texas Hold'em Skaff deg poletter og spill for a vinne Lykke til Playforia - Gratis online spill og kule avatarer.  <a href=https://casinonorsk.info/euro-palace-casino-bonus-code/>euro palace casino bonus code</a>  <a href=https://casinonorsk.info/euro-lotto-beste-zahlen/>euro lotto beste zahlen</a>   <a href=https://norgesspilleautomater.info/spilleautomater-macau-nights/>spilleautomater macau nights</a> \n<a href=https://norskonlinecasino.eu/spille-gratis-spill-plattform/>spille gratis spill plattform</a>  <a href=https://norgesspillcasino.info/roulette-regler-wikipedia/>roulette regler wikipedia</a>   Tjenestetilbudet for Romskog kommune er sortert i kategorier som du finner i menyen til venstre.   <a href=https://norgesspilleautomater.eu/spilleautomater-orkanger/>spilleautomater orkanger</a>  <a href=https://spillcasinonorsk.eu/slots-machines-for-sale/>slots machines for sale</a>   Cocawap Bingo Beach Spill: Last ned Bingo Beach Spill Gratis Android, Spille Bingo Beach spill.  <a href=https://norskespillcasino.info/slot-casinos-near-me/>slot casinos near me</a>  <a href=https://norskspilleautomater.info/slot-gladiator-demo/>slot gladiator demo</a>   Social Trading lar deg tjene penger pa nett ved a kopiere hva profesjonelle investorer gjor Ingen forkunnskaper er nodvendig og det er gratis. \n<a href=https://norgesspilleautomater.info/cop-the-lot-slot-free-play/>cop the lot slot free play</a>  <a href=https://norgesspilleautomater24.info/lillestrom-nettcasino/>lillestrom nettcasino</a>   Skulle du vre pa utkikk for a fa en online bingo nettsted British deretter kanskje Med sin behagelig red whitened og violet fargelegger og lett til komme seg.   <a href=https://norskespillcasino24.info/spilleautomater-pie-rats/>spilleautomater pie rats</a>  Reisetilbud Dagens SuperDeals Last Minute Konkurranser Nyheter Kundeservice Hjem Vare reisemal Bahamas Sok og bestill reise Bahamas.   Spillemaskiner echtgeld players cannot play aristocrats bonus, up Platinum Play Casino Bonus Codes brugte spilleautomater til salg play Outside of the.  <a href=https://norskecasinospill.eu/spilleautomat-mega-fortune/>spilleautomat mega fortune</a>  <a href=https://spillcasinonorsk.info/spill-pa-mobil-norsk-tipping/>spill pa mobil norsk tipping</a>   <a href=https://spillcasinonorsk.info/kolvereid-nettcasino/>kolvereid nettcasino</a> \n<a href=https://norskespillcasino.info/norske-spill/>norske spill</a>  <a href=https://norgesspillcasino.info/spillselskaper-norge/>spillselskaper norge</a>   When du bli med GamingJobsOnlinecom og begynne a arbeide med vare unik jobb du kan fa betalt for a spille nye og.   <a href=https://norgesspillcasino.info/beste-norske-nettcasino/>beste norske nettcasino</a>  <a href=https://norskecasinospill.eu/slot-machine-games/>slot machine games</a>   New regler i casino kortspill Canadian metin2stylenet16net give exclusive bonuses casino kortspill regler - choctaw casino durant reviews.  <a href=https://norskeautomater.eu/norsk-flora-pa-nett/>norsk flora pa nett</a>  <a href=https://casinonorsk24.eu/laer-at-spille-roulette/>l?r at spille roulette</a>   Damelagets kaptein Tina Wulf setter seg pa sykkelen i morgen tidlig Hun skal sykle To av de ivrige skjerferne har oppretta eget skjerfekart pa nett Det er. \n<a href=https://norskonlinecasino.eu/spilleautomater-lekepenger/>spilleautomater lekepenger</a>  <a href=https://mynorskspilleautomater.eu/wheres-the-gold-slot-machine-free-download/>wheres the gold slot machine free download</a>   Fotballstudio Mote Mat Tegneserier Spill 123 Spill Seno Travtips Oddstips pa alle vare levegger og gjerder i beskyttet gran Ramme mm Spile 19 x.   <a href=https://norskeautomater.eu/online-gambling/>online gambling</a>  Titan casino spelen nederland isd I Nesehornets hemmelighet introduseres ogs en annen vesentlig figur i serien: turbobilen Annen verdenskrig medfrte flere.   Trans noWant To Step Up Your Free Spins You Need To Read This First notrans Casino online echtgeld Eller velkomstbonuser One er tilbake apent, som.  <a href=https://norgesspilleautomater.info/casino-gratis-spins/>casino gratis spins</a>  <a href=https://norskespillcasino.eu/casino-norsk-tipping/>casino norsk tipping</a>   <a href=https://casinonorsk.eu/slot-avalon-gratis/>slot avalon gratis</a> \n<a href=https://norskespillcasino.eu/spilleautomater-break-away/>spilleautomater break away</a>  <a href=https://norskeautomaterr.info/punto-banco-online-free/>punto banco online free</a>   Engelsk fotball PrLeague - Toppscorer Pr League - Klubbene FA Cupen Ligacupen Play off 2014/15 Engelske klubblinker Engelsk fotball - statistikk.   <a href=https://norgesspilleautomater.info/norsk-tv-pa-nett/>norsk tv pa nett</a>  <a href=https://norskecasinospill.info/play-slots-for-real-money-for-free/>play slots for real money for free</a>   Velkommen til Touch pa nett Touch pa nett er et treningsprogram i touchmetoden som passer for alle aldre, fra ti ar og oppover Kursets hoveddel bestar av tolv.  <a href=https://norgesspilleautomater.info/slot-machine-robin-hood-gratis/>slot machine robin hood gratis</a>  <a href=https://norskspilleautomater.info/spilleautomat-sushi-express/>spilleautomat sushi express</a>   Opp til $diac Casino tilbyr i dagill: Ti av de mest populre bordspill Baccarat, Blackjack, Caribbean Poker, Casino War, Craps. \n<a href=https://norskecasinospill.eu/casino-trondheim/>casino trondheim</a>  <a href=https://norgesspillcasino.eu/premier-roulette-microgaming/>premier roulette microgaming</a>   Stablespill Sett opp tarnet, plukk ut klosser med en hand Den som far tarnet til a rase sammen, taper Den siste som klarer det, vinner Laget av eksotisk.   <a href=https://norskeautomaterr.info/spilleautomater-online-gratis/>spilleautomater online gratis</a>  Omtrent slik var det da bingoen ble utviklet til det spillet som i dag spilles over hele verden Hvor spillet har sitt opphav er Piggy Bank Piggy-Bank-videoslot.   Det er en stor mengde fordeler med a spille via mobilen fremfor datamaskinen n av fordelene er designet, nar du spiller pa mobilen vil spillet vre i fullskjerm.  <a href=https://norskspilleautomater.eu/golden-pyramid-slot/>golden pyramid slot</a>  <a href=https://norskecasinospill.eu/slot-ghost-pirates-gratis/>slot ghost pirates gratis</a>   <a href=https://norskonlinecasino.eu/online-casinos-with-easy-withdrawal/>online casinos with easy withdrawal</a> \n<a href=https://norgespillcasino.info/spilleautomater-bronnoysund/>spilleautomater bronnoysund</a>  <a href=https://casinonorsk24.eu/online-casino-games-canada/>online casino games canada</a>   Kast deg ut i spinningen og mor deg med a spille pa de beste gratis spilleautomatene pa nett Nyt spillene uten innbetaling eller registrering.   <a href=https://norskespillcasino.eu/spilleautomater-rjukan/>spilleautomater rjukan</a>  <a href=https://norgesspilleautomater.eu/online-casino-slots-uk/>online casino slots uk</a>   Casino di Soldi liberi: Tigre D'oro Free Money Casinos: Golden Tiger Gratis Money Casinos: Golden Tiger Freie Geldkasinos: Goldener Tiger.  <a href=https://norskespillcasino.eu/online-casino-free-spins-utan-insaettning/>online casino free spins utan insattning</a>  <a href=https://norgesspilleautomater.eu/maria-bingo-erfaringer/>maria bingo erfaringer</a>   Aalesund haper pa to nye spillere i sommer Provespillet har kommet i stand via en som heter Tom Begley, som er en kamerat av Reidar Tryggestad, ifolge. \n<a href=https://norgescasinos.info/online-casino-roulette-scams/>online casino roulette scams</a>  <a href=https://norgespillcasino.eu/best-casino-bonus-deposit/>best casino bonus deposit</a>   Da kan du bidra for Supporterklubben Les mer.   <a href=https://norskonlinecasinoo.info/slot-burning-desire/>slot burning desire</a>  Agronom Carl Helander Agronom Erik Stjerndahl AIK Aina Marie Lien AIP Casia Bromberg Casino Cosmopols Cask Sweden Catarina Bennetoft.   Casino Swiss online er en nykommer pa scenen for online gambling Det har vrt i drift siden 2007, men fremstar som et profesjonelt, eldre og godt etablert.  <a href=https://norgespillcasino.info/verdens-beste-spill-pc/>verdens beste spill pc</a>  <a href=https://norgescasino.eu/spilleautomat-battlestar-galactica/>spilleautomat battlestar galactica</a>   <a href=https://norskonlinecasino.eu/slot-evolution-concert/>slot evolution concert</a> \n<a href=https://casinonorsk.info/internet-casino-no-deposit-bonus/>internet casino no deposit bonus</a>  <a href=https://norgescasinos.info/titan-casino-no-deposit/>titan casino no deposit</a>   Spilt: 0 Online Games Annerledes Online Games Alle Arkanoid Arkanoid Puslespill Julen Spill spillet Grakanoid Online: 100%Reset Utvid.   <a href=https://norgesspilleautomater24.info/norskespill-casino-mobile/>norskespill casino mobile</a>  <a href=https://norgesspillcasino.eu/slot-admiralty-way-lekki/>slot admiralty way lekki</a>   Spill skrapelodder online Nedenfor finner du informasjon om og beskrivelse av spillereglene for a spill skraplodd pa Betsson Hvis du kenner hvordan den.  <a href=https://norgespillcasino.info/jackpot-6000-mega-joker/>jackpot 6000 mega joker</a>  <a href=https://norskespillcasino.info/internet-casino-deutschland/>internet casino deutschland</a>   Finn Marley Lilly kupongkoder pa nettsteder som SavingStorycom, PromoProcom, HotDealscom, CouponFollowcom og Savevycom Hvert omrade gir. \n<a href=https://norgespillcasino.info/videoslots-bonus-code/>videoslots bonus code</a>  <a href=https://norskeautomater.eu/casino-forum-norge/>casino forum norge</a>   Spille online kasino spill blackjack, roulette, video poker, slots, progressive og Baccarat i Casino med de beste odds, beste kampanjer, gratis penger, og den.   <a href=https://norgescasino.eu/free-spins-casino-room/>free spins casino room</a>  Spill & spillkonsoller Stasjonre konsoller PlayStation 4-spill PC-spill Handkontroller PlayStation 3-spill Xbox One-spill Ratt & pedaler Fler.   Du kan fortsatt nyte a spille pa Lucky.  <a href=https://spillcasinonorsk.eu/texas-holdem-tips-advanced/>texas holdem tips advanced</a>  <a href=https://norgespillcasino.info/spilleautomat-mad-professor/>spilleautomat mad professor</a>   <a href=https://norskecasinospill.info/spilleautomat-doctor-love-on-vacation/>spilleautomat doctor love on vacation</a> \n<a href=https://norskespillcasino.eu/best-roulette-online-casino/>best roulette online casino</a>  <a href=https://norskespillcasino24.eu/spill-texas-holdem-gratis/>spill texas holdem gratis</a>   Kredittkortmarkedet konkurrerer hardt om dagen for a fa deg som kunde En av de beste matene de gjor det pa er a gi deg penger tilbake nar du bruker.   <a href=https://norskespillcasino24.info/norske-automat-pa-nette/>norske automat pa nette</a>  <a href=https://norskecasinospill.eu/fauske-nettcasino/>fauske nettcasino</a>   Bonus mer hvis legger stort lover ofte gratis spill spill casino pa nett Har pokerprogramvaren tett teknologiske fra noe?  <a href=https://norgesspilleautomater.info/gratis-spilleautomater/>gratis spilleautomater</a>  <a href=https://norskonlinecasinoo.info/beste-gratis-spill-android/>beste gratis spill android</a>   Min N8 har tatt kvelden etter diverse blote.", "problem_context": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "sample_input": "7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03941", "source_text": "Score : 1400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nIn the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a tree is a full binary tree if and only if every non-leaf vertex in the tree has exactly two children). Roads are numbered 1 through N-1. The i-th road connects city i+1 and city a_i. When you pass through road i, the toll you should pay is v_i (if v_i is 0, it indicates the road does not require a toll).\n\nA company in city 1 will give each employee a family travel and cover a large part of the tolls incurred. Each employee can design the travel by themselves. That is, which cities he/she wants to visit in each day and which city to stay at each night. However, there are some constraints. More details are as follows:\n\nThe travel must start and end at city 1. If there are m leaves in the tree formed by the cities, then the number of days in the travel must be m+1. At the end of each day, except for the last day, the employee must stay at some hotel in a leaf city. During the whole travel, the employee must stay at all leaf cities exactly once.\n\nDuring the whole travel, all roads of the country must be passed through exactly twice.\n\nThe amount that the employee must pay for tolls by him/herself is the maximum total toll incurred in a single day during the travel, except the first day and the last day. The remaining tolls will be covered by the company.\n\nShik, as an employee of this company, has only one hope for his travel. He hopes that the amount he must pay for tolls by himself will be as small as possible. Please help Shik to design the travel which satisfies his hope.\n\nConstraints\n\n2 < N < 131,072\n\n1 \\leq a_i \\leq i for all i\n\n0 \\leq v_i \\leq 131,072\n\nv_i is an integer\n\nThe given tree is a full binary tree\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 v_1\na_2 v_2\n:\na_{N-1} v_{N-1}\n\nOutput\n\nPrint an integer denoting the minimum amount Shik must pay by himself for tolls incurred during the travel.\n\nSample Input 1\n\n7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n\nSample Output 1\n\n4\n\nThere are 4 leaves in the tree formed by the cities (cities 4, 5, 6, and 7), so the travel must be 5 days long. There are 4! = 24 possible arrangements of the leaf cities to stay during the travel, but some of them are invalid. For example, (4,5,6,7) and (6,7,5,4) are valid orders, but (5,6,7,4) is invalid because the route passes 4 times through the road connecting city 1 and city 2. The figure below shows the routes of the travel for these arrangements.\n\nFor all valid orders, day 3 is the day with the maximum total incurred toll of 4, passing through 4 roads.\n\nSample Input 2\n\n9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n\nSample Output 2\n\n6\n\nThe following figure shows the route of the travel for one possible arrangement of the stayed cities for the solution. Note that the tolls incurred in the first day and the last day are always covered by the company.\n\nSample Input 3\n\n15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n\nSample Output 3\n\n15\n\nSample Input 4\n\n3\n1 0\n1 0\n\nSample Output 4\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 22550, "cpu_time_ms": 92, "memory_kb": 8164}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s895266093", "group_id": "codeNet:p03945", "input_text": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((s (read-line)))\n    (println\n     (loop for i from 1 below (length s)\n           count (char/= (aref s i) (aref s (- i 1)))))))\n\n#-swank(main)\n\n\n;; For Test\n#+swank\n(defun io-equal (in-string out-string &optional (func #'main))\n  (labels ((ensure-last-lf (s)\n             (if (and (> (length s) 0)\n                      (eql (char s (- (length s) 1)) #\\Linefeed))\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (equal (ensure-last-lf out-string)\n           (with-output-to-string (out)\n             (let ((*standard-output* out))\n               (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                 (funcall func)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null ; Runs #'MAIN with the string on clipboard\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname ; Runs #'MAIN with the string in a text file\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"BBBWW\n\"\n    \"1\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"WWWWWW\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"WBWBWBWBWB\n\"\n    \"9\n\")))\n", "language": "Lisp", "metadata": {"date": 1558577686, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Lisp/s895266093.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s895266093", "user_id": "u352600849"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": ";; -*- coding: utf-8 -*-\n(eval-when (:compile-toplevel :load-toplevel :execute)\n  (defparameter OPT\n    #+swank '(optimize (speed 3) (safety 2))\n    #-swank '(optimize (speed 3) (safety 0) (debug 0)))\n  #+swank (progn (ql:quickload '(:cl-debug-print :fiveam))\n                 (shadow :run)\n                 (use-package :fiveam)))\n#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)\n\n;; BEGIN_INSERTED_CONTENTS\n(defmacro dbg (&rest forms)\n  #+swank\n  (if (= (length forms) 1)\n      `(format *error-output* \"~A => ~A~%\" ',(car forms) ,(car forms))\n      `(format *error-output* \"~A => ~A~%\" ',forms `(,,@forms)))\n  #-swank (declare (ignore forms)))\n\n(defmacro define-int-types (&rest bits)\n  `(progn\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"UINT~A\" b)) () '(unsigned-byte ,b))) bits)\n     ,@(mapcar (lambda (b) `(deftype ,(intern (format nil \"INT~A\" b)) () '(signed-byte ,b))) bits)))\n(define-int-types 2 4 7 8 15 16 31 32 62 63 64)\n\n(declaim (inline println))\n(defun println (obj &optional (stream *standard-output*))\n  (let ((*read-default-float-format* 'double-float))\n    (prog1 (princ obj stream) (terpri stream))))\n\n(defconstant +mod+ 1000000007)\n\n;; Body\n\n(defun main ()\n  (let* ((s (read-line)))\n    (println\n     (loop for i from 1 below (length s)\n           count (char/= (aref s i) (aref s (- i 1)))))))\n\n#-swank(main)\n\n\n;; For Test\n#+swank\n(defun io-equal (in-string out-string &optional (func #'main))\n  (labels ((ensure-last-lf (s)\n             (if (and (> (length s) 0)\n                      (eql (char s (- (length s) 1)) #\\Linefeed))\n                 s\n                 (uiop:strcat s uiop:+lf+))))\n    (equal (ensure-last-lf out-string)\n           (with-output-to-string (out)\n             (let ((*standard-output* out))\n               (with-input-from-string (*standard-input* (ensure-last-lf in-string))\n                 (funcall func)))))))\n\n#+swank\n(defun get-clipbrd ()\n  (with-output-to-string (out)\n    (run-program \"C:/msys64/usr/bin/cat.exe\" '(\"/dev/clipboard\") :output out)))\n\n#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))\n#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* \"test.dat\" *this-pathname*))\n\n#+swank\n(defun run (&optional thing (out *standard-output*))\n  (let ((*standard-output* out))\n    (etypecase thing\n      (null ; Runs #'MAIN with the string on clipboard\n       (with-input-from-string (*standard-input* (delete #\\Return (get-clipbrd)))\n         (main)))\n      (string\n       (with-input-from-string (*standard-input* (delete #\\Return thing))\n         (main)))\n      (symbol (5am:run! thing))\n      (pathname ; Runs #'MAIN with the string in a text file\n       (with-open-file (*standard-input* thing)\n         (main))))))\n\n#+swank\n(defun gen-dat ()\n  (uiop:with-output-file (out *dat-pathname* :if-exists :supersede)\n    (format out \"\")))\n\n#+swank\n(defun bench (&optional (out (make-broadcast-stream)))\n  (time (run *dat-pathname* out)))\n\n;; To run: (5am:run! :sample)\n#+swank\n(it.bese.fiveam:test :sample\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"BBBWW\n\"\n    \"1\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"WWWWWW\n\"\n    \"0\n\"))\n  (it.bese.fiveam:is\n   (common-lisp-user::io-equal \"WBWBWBWBWB\n\"\n    \"9\n\")))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3245, "cpu_time_ms": 170, "memory_kb": 17632}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s351910504", "group_id": "codeNet:p03945", "input_text": "(setq s(concatenate 'list(read-line)))\n(setq pre(car s))\n(setq s(cdr s))\n(princ(loop for c in s count(char/= pre(setq pre c))))", "language": "Lisp", "metadata": {"date": 1556327079, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Lisp/s351910504.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s351910504", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(setq s(concatenate 'list(read-line)))\n(setq pre(car s))\n(setq s(cdr s))\n(princ(loop for c in s count(char/= pre(setq pre c))))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 127, "cpu_time_ms": 196, "memory_kb": 16868}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s795238519", "group_id": "codeNet:p04044", "input_text": "(let* ((n (read))\n    (l (read))\n    (s (make-array n)))\n\n    (dotimes (i n)\n        (setf (aref s i) (read))\n    )\n\n    (setf s (sort s #'string<))\n    \n    (dotimes (i n)\n        (format t \"~(~A~)\" (aref s i))\n    )\n)", "language": "Lisp", "metadata": {"date": 1595086891, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s795238519.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s795238519", "user_id": "u136500538"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(let* ((n (read))\n    (l (read))\n    (s (make-array n)))\n\n    (dotimes (i n)\n        (setf (aref s i) (read))\n    )\n\n    (setf s (sort s #'string<))\n    \n    (dotimes (i n)\n        (format t \"~(~A~)\" (aref s i))\n    )\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 219, "cpu_time_ms": 16, "memory_kb": 23756}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s160388650", "group_id": "codeNet:p04044", "input_text": "(let* ((n (read))\n       (l (read))\n       (lst (loop repeat n\n                  collect (read-line))))\n\n  (format t (apply #'concatenate 'string\n                   (sort (copy-list lst) #'string<))))\n", "language": "Lisp", "metadata": {"date": 1594406210, "filename_ext": "l", "original_language": "Common Lisp (SBCL 2.0.3)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s160388650.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s160388650", "user_id": "u336541610"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(let* ((n (read))\n       (l (read))\n       (lst (loop repeat n\n                  collect (read-line))))\n\n  (format t (apply #'concatenate 'string\n                   (sort (copy-list lst) #'string<))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 201, "cpu_time_ms": 19, "memory_kb": 23768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s825179119", "group_id": "codeNet:p04044", "input_text": "(defparameter N (read))\n(defparameter L (read))\n\n(defun ans (N)\n  (let ((a (read)) (b (read)) (c (read)))\n    (print (apply #'concatenate 'string (sort (mapcar #'string (list a b c)) #'string<)))))\n\n(ans N)", "language": "Lisp", "metadata": {"date": 1580605829, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s825179119.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s825179119", "user_id": "u975644365"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter L (read))\n\n(defun ans (N)\n  (let ((a (read)) (b (read)) (c (read)))\n    (print (apply #'concatenate 'string (sort (mapcar #'string (list a b c)) #'string<)))))\n\n(ans N)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 206, "cpu_time_ms": 10, "memory_kb": 3428}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s219949212", "group_id": "codeNet:p04044", "input_text": "(defparameter N (read))\n(defparameter L (read))\n\n(defun ans (N)\n  (let ((a (read)) (b (read)) (c (read)))\n    (format t \"~(~A~)\" (apply #'concatenate 'string (sort (mapcar #'string (list a b c)) #'string<))))\\\n)\n\n(ans N)", "language": "Lisp", "metadata": {"date": 1580605536, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s219949212.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s219949212", "user_id": "u975644365"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter L (read))\n\n(defun ans (N)\n  (let ((a (read)) (b (read)) (c (read)))\n    (format t \"~(~A~)\" (apply #'concatenate 'string (sort (mapcar #'string (list a b c)) #'string<))))\\\n)\n\n(ans N)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 220, "cpu_time_ms": 123, "memory_kb": 12260}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s070176302", "group_id": "codeNet:p04044", "input_text": "(defparameter N (read))\n(defparameter L (read))\n\n(defun ans (N)\n  (let ((a (read)) (b (read)) (c (read)))\n    (format nil \"~(~A~)\" (apply #'concatenate 'string (sort (mapcar #'string (list a b c)) #'string<))))\\\n)\n\n(ans N)", "language": "Lisp", "metadata": {"date": 1580605374, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s070176302.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s070176302", "user_id": "u975644365"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(defparameter N (read))\n(defparameter L (read))\n\n(defun ans (N)\n  (let ((a (read)) (b (read)) (c (read)))\n    (format nil \"~(~A~)\" (apply #'concatenate 'string (sort (mapcar #'string (list a b c)) #'string<))))\\\n)\n\n(ans N)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 222, "cpu_time_ms": 134, "memory_kb": 12520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s206027162", "group_id": "codeNet:p04044", "input_text": "(defun main ()\n  (let* ((n (read))\n         (length (read))\n         (strings (loop :repeat length :collect (read-line))))\n    (declare (ignore n))\n    (format t \"~{~A~}~%\" (sort strings #'string<))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1576913885, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s206027162.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s206027162", "user_id": "u115747274"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (length (read))\n         (strings (loop :repeat length :collect (read-line))))\n    (declare (ignore n))\n    (format t \"~{~A~}~%\" (sort strings #'string<))))\n\n(main)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 209, "cpu_time_ms": 18, "memory_kb": 4328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s567420958", "group_id": "codeNet:p04044", "input_text": "(defun main ()\n  (let* ((n (read))\n         (length (read))\n         (strings (loop :repeat length :collect (read-line))))\n    (declare (ignore n))\n    (format t \"~{~A~}~%\" (sort strings #'string<=))))\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1576913622, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s567420958.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s567420958", "user_id": "u115747274"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(defun main ()\n  (let* ((n (read))\n         (length (read))\n         (strings (loop :repeat length :collect (read-line))))\n    (declare (ignore n))\n    (format t \"~{~A~}~%\" (sort strings #'string<=))))\n\n(main)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 210, "cpu_time_ms": 17, "memory_kb": 4324}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s183933880", "group_id": "codeNet:p04044", "input_text": "(let* ((n (read))\n       (l (read))\n       (ss (make-array n)))\n      (loop :for i :from 0 :to (1- n) :do (setf (aref ss i) (read-line)))\n      (sort ss #'string-lessp)\n      (format t \"~A~%\" (apply #'concatenate (cons 'string (coerce ss 'list)))))", "language": "Lisp", "metadata": {"date": 1576074801, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s183933880.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s183933880", "user_id": "u923606520"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(let* ((n (read))\n       (l (read))\n       (ss (make-array n)))\n      (loop :for i :from 0 :to (1- n) :do (setf (aref ss i) (read-line)))\n      (sort ss #'string-lessp)\n      (format t \"~A~%\" (apply #'concatenate (cons 'string (coerce ss 'list)))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 248, "cpu_time_ms": 32, "memory_kb": 5344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s389090329", "group_id": "codeNet:p04044", "input_text": "(let* ((n (read))\n       (l (read))\n       (ss ()))\n      (loop :for i :from 0 :to (1- n) :do (setf ss (cons (read-line) ss)))\n      (sort ss #'string-lessp)\n      (format t \"~A~%\" (apply #'concatenate (cons 'string ss))))", "language": "Lisp", "metadata": {"date": 1576025748, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s389090329.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s389090329", "user_id": "u923606520"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(let* ((n (read))\n       (l (read))\n       (ss ()))\n      (loop :for i :from 0 :to (1- n) :do (setf ss (cons (read-line) ss)))\n      (sort ss #'string-lessp)\n      (format t \"~A~%\" (apply #'concatenate (cons 'string ss))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 222, "cpu_time_ms": 14, "memory_kb": 3936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s455722163", "group_id": "codeNet:p04044", "input_text": "(let* ((n (read))\n       (l (read))\n       (lst (loop repeat n\n                  collect (read-line))))\n\n  (format t \"~A~%\"\n          (apply #'concatenate 'string\n                 (sort (copy-list lst) #'string<))))\n\n", "language": "Lisp", "metadata": {"date": 1572214059, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s455722163.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s455722163", "user_id": "u336541610"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(let* ((n (read))\n       (l (read))\n       (lst (loop repeat n\n                  collect (read-line))))\n\n  (format t \"~A~%\"\n          (apply #'concatenate 'string\n                 (sort (copy-list lst) #'string<))))\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 217, "cpu_time_ms": 168, "memory_kb": 15076}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s465732685", "group_id": "codeNet:p04044", "input_text": "(let* ((n (read))\n       (m (read))\n       (lst (sort (loop :repeat n :collect (read-line)) #'string<)))\n  (princ (reduce (lambda (p q) (concatenate 'string p q)) lst)))", "language": "Lisp", "metadata": {"date": 1560791385, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s465732685.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s465732685", "user_id": "u610490393"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(let* ((n (read))\n       (m (read))\n       (lst (sort (loop :repeat n :collect (read-line)) #'string<)))\n  (princ (reduce (lambda (p q) (concatenate 'string p q)) lst)))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 169, "cpu_time_ms": 146, "memory_kb": 13540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s477001411", "group_id": "codeNet:p04044", "input_text": "; ABC042-B\n\n(defvar *elems* '())\n\n(defun strcmp2 (s1 s2 n i)\n  (if (<= n i) (return-from strcmp2 0))\n  (let ((v (-\n\t\t\t (char-code (coerce (subseq s1 i (1+ i)) 'character))\n\t\t\t (char-code (coerce (subseq s2 i (1+ i)) 'character))\n\t\t\t )\n\t\t   ))\n\t(if (not (zerop v)) (return-from strcmp2 v))\n\t)\n  (strcmp2 s1 s2 n (1+ i))\n  )\n\n(defun strcmp (s1 s2)\n  (let ((n (- (length s1) (length s2))))\n\t(if (zerop n)\n\t  (strcmp2 s1 s2 (length s1) 0)\n\t  n\n\t  )\n\t)\n  )\n\n(defun valcomp (i1 i2)\n  (let ((s1 (nth i1 *elems*)) (s2 (nth i2 *elems*)))\n\t(> 0 (strcmp s1 s2))\n\t)\n  )\n\n(defun solve (indexes)\n  (sort indexes #'valcomp)\n  (let ((s \"\"))\n\t(dotimes (x (length indexes) s)\n\t  (setq s (concatenate 'string s (nth (nth x indexes) *elems*)))\n\t  )\n\t)\n  )\n\n(defun main ()\n  (let ((n (read)) (l (read)) (*elems* '()) (indexes '()))\n\t(dotimes (x l (list *elems* indexes))\n\t  (setq *elems* (cons (read-line) *elems*))\n\t  (setq indexes (cons (1- (- l x)) indexes))\n\t  )\n\t(format t \"~a~%\" (solve indexes))\n\t)\n  )\n\n(main)\n", "language": "Lisp", "metadata": {"date": 1558246614, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s477001411.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s477001411", "user_id": "u021877437"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "; ABC042-B\n\n(defvar *elems* '())\n\n(defun strcmp2 (s1 s2 n i)\n  (if (<= n i) (return-from strcmp2 0))\n  (let ((v (-\n\t\t\t (char-code (coerce (subseq s1 i (1+ i)) 'character))\n\t\t\t (char-code (coerce (subseq s2 i (1+ i)) 'character))\n\t\t\t )\n\t\t   ))\n\t(if (not (zerop v)) (return-from strcmp2 v))\n\t)\n  (strcmp2 s1 s2 n (1+ i))\n  )\n\n(defun strcmp (s1 s2)\n  (let ((n (- (length s1) (length s2))))\n\t(if (zerop n)\n\t  (strcmp2 s1 s2 (length s1) 0)\n\t  n\n\t  )\n\t)\n  )\n\n(defun valcomp (i1 i2)\n  (let ((s1 (nth i1 *elems*)) (s2 (nth i2 *elems*)))\n\t(> 0 (strcmp s1 s2))\n\t)\n  )\n\n(defun solve (indexes)\n  (sort indexes #'valcomp)\n  (let ((s \"\"))\n\t(dotimes (x (length indexes) s)\n\t  (setq s (concatenate 'string s (nth (nth x indexes) *elems*)))\n\t  )\n\t)\n  )\n\n(defun main ()\n  (let ((n (read)) (l (read)) (*elems* '()) (indexes '()))\n\t(dotimes (x l (list *elems* indexes))\n\t  (setq *elems* (cons (read-line) *elems*))\n\t  (setq indexes (cons (1- (- l x)) indexes))\n\t  )\n\t(format t \"~a~%\" (solve indexes))\n\t)\n  )\n\n(main)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 996, "cpu_time_ms": 159, "memory_kb": 16484}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s855157881", "group_id": "codeNet:p04044", "input_text": "(setq n(read))(read)\n(princ(apply #'concatenate (cons 'string (sort(loop for i from 1 to n collect(read-line))#'string<))))", "language": "Lisp", "metadata": {"date": 1537750179, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s855157881.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s855157881", "user_id": "u657913472"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(setq n(read))(read)\n(princ(apply #'concatenate (cons 'string (sort(loop for i from 1 to n collect(read-line))#'string<))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 123, "cpu_time_ms": 317, "memory_kb": 12008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s076735454", "group_id": "codeNet:p04044", "input_text": "(defun main()\n  (let ((N (read)) (L (read)) (strs nil))\n    (loop for str from 0 below N collect\n          (setq strs (cons (read) strs)))\n    (setq strs (sort strs #'string-lessp))\n\n    (mapcar #'(lambda (x) (format t \"~(~a~)\" x)) strs)\n    (princ '#\\newline)))\n\n(main)", "language": "Lisp", "metadata": {"date": 1507759587, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s076735454.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s076735454", "user_id": "u055459962"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(defun main()\n  (let ((N (read)) (L (read)) (strs nil))\n    (loop for str from 0 below N collect\n          (setq strs (cons (read) strs)))\n    (setq strs (sort strs #'string-lessp))\n\n    (mapcar #'(lambda (x) (format t \"~(~a~)\" x)) strs)\n    (princ '#\\newline)))\n\n(main)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 20, "memory_kb": 4324}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Lisp:s791123757", "group_id": "codeNet:p04044", "input_text": "(let ((n (read))\n      (l (read)))\n  (format t \"~{~a~}~%\"\n          (sort (loop repeat n\n                      collect (read-line)) #'string<)))\n", "language": "Lisp", "metadata": {"date": 1470843928, "filename_ext": "l", "original_language": "Common Lisp (SBCL 1.1.14)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Lisp/s791123757.l", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s791123757", "user_id": "u188771036"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "(let ((n (read))\n      (l (read)))\n  (format t \"~{~a~}~%\"\n          (sort (loop repeat n\n                      collect (read-line)) #'string<)))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "sample_input": "3 3\ndxx\naxx\ncxx\n"}, "reference_outputs": ["axxcxxdxx\n"], "source_document_id": "p04044", "source_text": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.\n\ns_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.\n\nConstraints\n\n1 ≦ N, L ≦ 100\n\nFor each i, the length of S_i equals L.\n\nFor each i, S_i consists of lowercase letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\nS_1\nS_2\n:\nS_N\n\nOutput\n\nPrint the lexicographically smallest string that Iroha can produce.\n\nSample Input 1\n\n3 3\ndxx\naxx\ncxx\n\nSample Output 1\n\naxxcxxdxx\n\nThe following order should be used: axx, cxx, dxx.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 145, "cpu_time_ms": 175, "memory_kb": 10340}, "variant": "low_resource"}